Industrial IoT in 5G environment towards smart manufacturing

Recently proposed orthogonal time frequency space (OTFS) modulation has been considered as a promising candidate for accommodating various emerging communication and sensing applications in high-mobility environments. In this paper, we propose a novel cross domain iterative detection algorithm to enhance the error performance of OTFS modulation. Different from conventional OTFS detection methods, the proposed algorithm applies basic estimation/detection approaches to both the time domain and delay-Doppler (DD) domain and iteratively updates the extrinsic information from two domains with the unitary transformation. In doing so, the proposed algorithm exploits the time domain channel sparsity and the DD domain symbol constellation constraints. We evaluate the estimation/detection error variance in each domain for each iteration and derive the state evolution to investigate the detection error performance. We show that the performance gain due to iterations comes from the non-Gaussian constellation constraint in the DD domain. More importantly, we prove that the proposed algorithm can indeed converge and, in the convergence, the proposed algorithm can achieve almost the same error performance as the maximum-likelihood sequence detection even in the presence of fractional Doppler shifts. Furthermore, the computational complexity associated with the domain transformation is low, thanks to the structure of the discrete Fourier transform (DFT) kernel. Simulation results are consistent with our analysis and demonstrate a significant performance improvement compared to conventional OTFS detection methods.

Cross Domain Iterative Detection for Orthogonal Time Frequency Space Modulation

Since their inception in 2008, polar codes have been shown to offer near-capacity error correction performance across a wide range of block lengths and coding rates. Owing to this, polar codes have been selected to provide channel coding in the control channels of Third Generation Partnership Project (3GPP) New Radio (NR). The operation of the 3GPP NR polar codes is specified in the 3GPP standard TS 38.212, together with schemes for code block segmentation, Cyclic Redundancy Check (CRC) attachment, CRC scrambling, CRC interleaving, frozen and parity check bit insertion, sub-block interleaving, bit selection, channel interleaving and code block concatenation. The configuration of these components is different for the uplink, broadcast and downlink control channels. However, the lack of visualisations and diagrammatic explanations in TS 38.212 limits the accessibility of the standard to new readers. This motivates the aims of the paper, which provides detailed tutorials on the operation and motivation of the components of the 3GPP NR polar codes, as well as surveys of the 3GPP discussions that led to their specification. Furthermore, we comprehensively characterize the error correction and error detection performance of the 3GPP NR polar codes in the uplink, broadcast and downlink control channels.

/pdf/the-development-operation-and-performance-of-the-5g-polar-4ywte2wyof.pdf

The Development, Operation and Performance of the 5G Polar Codes

Although 4G (fourth generation) i.e. LTE (long term evolution) systems are now in use world-wide. But today’s 4G systems have some challenges left such as spectrum scarcity and energy efficiency. The prime objectives of near-by-future 5G (fifth generation) wireless communications are reliability, higher data rate, higher bandwidth, high spectrum efficiency, higher energy efficient and that too at lower latency. Channel coding tend to increase the reliability of the wireless communications system by adding extra bits in a controlled fashion and is considered to be most persuasive element of communication system. 4G LTE Turbo Codes have already been replaced by LDPC (low density parity check) Codes in many of the standards including mMTC (massive machine type communication), D2D (device to device communication) and URLLC (ultra-reliable low latency reliable communications). LDPC Codes and Polar Codes are securing much more observation because of their inherent advantages of excellent bit-error-rate performance, fast encoding and decoding procedures; which make them the strong contenders for 5G Channel Codes too. This paper provides the broad survey and comparison of the LDPC and Polar Codes along with their advantages and drawbacks which will aid in further improvement of the next generation wireless networks. In order to enlighten future research possibilities in this direction, issues addressed by distinct researchers have been explored too.

A survey on channel coding techniques for 5G wireless networks

The fifty-year progress of faster-than-Nyquist (FTN) signaling is surveyed. FTN signaling exploits non-orthogonal dense symbol packing in the time domain for the sake of increasing the data rate attained. After reviewing the system models of both the conventional Nyquist-based and FTN signaling transceivers, we survey the evolution of FTN techniques, including their low-complexity detection and channel estimation. Furthermore, in addition to the classic FTN signaling philosophy, we introduce the recent frequency-domain filtering and precoding aided schemes. When relying on precoding, the information rate of FTN signaling becomes related to the eigenvalues of an FTN-specific intersymbol interference matrix, which provides a unified framework for the associated information-theoretic analysis and simplifies the associated power allocation specifically designed for increasing the information rate attained. We show that the FTN signaling scheme combined with bespoke power allocation employing a realistic raised-cosine shaping filter achieves the Shannon capacity associated with ideal rectangular shaping filters.

/pdf/the-evolution-of-faster-than-nyquist-signaling-1kqh14j094.pdf

The Evolution of Faster-Than-Nyquist Signaling

In this paper, we consider the detection of faster-than-Nyquist (FTN) signaling. By noticing that the whitening filter for FTN signaling cannot be directly derived when the symbol rate exceeds the signal bandwidth, we propose a new reduced-complexity M-algorithm BCJR (M-BCJR) algorithm based on the Ungerboeck observation model. By taking some “future” symbols into account, the proposed algorithm is able to select the $M$ best states in the maximum a posteriori sense. We further simplify the above algorithm by choosing the key path from each possible state, which successfully reduces the complexity while maintaining a good bit error rate performance. Simulation results show that, with the use of the proposed methods, great gains can be obtained in terms of spectral efficiency (up to 186%) or signal-to-noise ratio (up to 4.5 dB) compared with the Nyquist signaling.

Reduced-Complexity Equalization for Faster-Than-Nyquist Signaling: New Methods Based on Ungerboeck Observation Model

This paper presents a kind of concatenated polar codes called hash-polar codes with flexible outer code lengths, in which a hash function-based encoder is used as an outer encoder. A partial hash-polar code is also proposed to enhance the error-correcting performance at high signal-to-noise ratios. Since polar codes have been recommended by 3GPP as the channel coding scheme for the 5G enhanced mobile broadband control channel, the design of hash-polar codes for 5G is considered, where both good error-correcting performance and low false alarm rate (FAR) are required. The simulation results show that, under the 5G FAR requirement, the proposed hash-polar codes have similar frame error rate performance to cyclic redundancy check (CRC)-polar codes and perform better than parity check polar codes. In order to support early termination (ET) for 5G coding, we then propose segmented hash-polar codes, which exhibit the advantages of the ET gain compared with both CRC-polar codes and distributed CRC-polar codes.

Hash-Polar Codes With Application to 5G

With the development of high-speed trains (HST), efficient and reliable communication services in high mobility scenarios have become an urgent demand. As one of the strong candidates in 5G wireless system, polar codes along with its optimized design should also be investigated under high mobility scenarios. In this paper, a scheme of hash-concatenated polar codes is proposed to reduce the false alarm rate, which is a key performance in 5G enhanced mobile broadband control channel. Then, for data channels, hash-based cyclic redundancy check (CRC)-aided polar codes with a joint successive cancellation list decoding method is introduced to improve the error-correcting performance. Simulation results show that the hash-concatenated polar codes can achieve both the lower false alarm rate and better error-correcting performance than conventional CRC-aided polar codes in both the AWGN and high mobility channels. Furthermore, with the joint decoding approach, hash-based CRC-aided polar codes perform better than LTE turbo codes for high-order modulations in terms of the frame error rate over the HST channel.

Design and Performance of Polar Codes for 5G Communication under High Mobility Scenarios

With the development of the high-speed trains (HST), high spectral efficiency and low latency in high mobility scenarios have become an urgent demand. In this paper, we consider bandwidth-efficient multilevel coding (MLC) based on polar codes under high mobility scenarios. Since the use of a lot of binary coding levels and large list sizes will lead to a high latency for polar decoding, we first introduce a new kind of nonbinary polar codes based on multiplicative repetition method. Then, we employ the proposed codes as component codes for MLC scheme, and optimize the design for high mobility scenarios with low latency. Simulation results show that nonbinary polar coded MLC scheme (with less coding levels) outperform LTE turbo codes with high-order modulations, and can exhibit similar performance of binary polar coded bit-interleaved coded modulation scheme but with a smaller list size (reflecting low latency) over HST channels.

Design and Performance of the Polar Coded Modulation for High Mobility Communications

Spinal codes, a new class of rateless codes, have received considerable attention for their capacity-approaching performance over noisy channels. Hash function is the core of a spinal encoder to generate infinite coded symbols, which has higher hardware complexity. In this study, the authors propose a multiplicative repetition-based method instead of the hash function to generate innumerable symbols with low encoding complexity. Furthermore, both frozen-aided and cyclic redundancy check-aided decoding methods are proposed to improve the spectral efficiency. Simulation results show that the proposed spinal codes have lower computational complexity and can achieve higher spectral efficiency in the high signal-to-noise ratio region compared with the conventional ones over both additive white Gaussian noise and Rayleigh fading channels.

https://ietresearch.onlinelibrary.wiley.com/doi/pdf/10.1049/iet-com.2016.1401

Multiplicative repetition-based spinal codes with low computational complexity

Popular Tasks used by Researchers

How can I help with your research?

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

We encountered an error while loading the panel. Please try refreshing the page.

Something went wrong

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

Anyone with the link can view this chat. You can switch it back to private anytime.

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Chen Peiyao

Author Tools

Chat about Author