Challenges and Some New Directions in Channel Coding

Three areas of ongoing research in channel coding are surveyed, and recent developments are presented in each area: spatially coupled Low-Density Parity-Check (LDPC) codes, nonbinary LDPC codes, and polar coding.This is the author accepted manuscript. The final version is available from IEEE via http://dx.doi.org/10.1109/JCN.2015.00006

Challenges and some new directions in channel coding

Three areas of ongoing research in channel coding are surveyed, and recent developments are presented in each area: Spatially coupled low-density parity-check (LDPC) codes, nonbinary LDPC codes, and polar coding. © 2015 KICS

Constellation Shaping for WDM systems using 256QAM/1024QAM with Probabilistic Optimization

In this paper, probabilistic shaping is numerically and experimentally investigated for increasing the transmission reach of wavelength division multiplexed (WDM) optical communication system employing quadrature amplitude modulation (QAM). An optimized probability mass function (PMF) of the QAM symbols is first found from a modified Blahut-Arimoto algorithm for the optical channel. A turbo coded bit interleaved coded modulation system is then applied, which relies on many-to-one labeling to achieve the desired PMF, thereby achieving shaping gain. Pilot symbols at rate at most 2% are used for synchronization and equalization, making it possible to receive input constellations as large as 1024QAM. The system is evaluated experimentally on a 10 GBaud, 5 channels WDM setup. The maximum system reach is increased w.r.t. standard 1024QAM by 20% at input data rate of 4.65 bits/symbol and up to 75% at 5.46 bits/symbol. It is shown that rate adaptation does not require changing of the modulation format. The performance of the proposed 1024QAM shaped system is validated on all 5 channels of the WDM signal for selected distances and rates. Finally, it was shown via EXIT charts and BER analysis that iterative demapping, while generally beneficial to the system, is not a requirement for achieving the shaping gain.Comment: 10 pages, 12 figures, Journal of Lightwave Technology, 201

Novel Hybrid Model Investing in 5G Network Optimization Under Suzuki Fading Channel

Nowadays, the advancement and increased use of fifth-generation (5G) and sixth-generation (6G) systems have created a demand for more efficient and rapid transmission of information over wireless communication media. However, developing wireless communication systems that can meet these modern-day criteria for fast, reliable, and secure information exchange is a challenging task. To address this issue, this paper proposes a novel model for enhancing the 5G system. The proposed model utilizes polar code with rate matching and constitutional interleaving over the Suzuki fading channel. The combination of polar codes with rate matching and interleaving enables the communication system to achieve a lower error rate and better reliability over a Suzuki fading channel. Specifically, the polar code can correct a larger number of errors, while rate matching and interleaving can mitigate the effects of channel variations and reduce the probability of error bursts. These enhancements can lead to more robust and reliable communication in wireless networks

Novel Hybrid Model Investing in 5G Network Optimization Under Suzuki Fading Channel

Nowadays, the advancement and increased use of fifth-generation (5G) and sixth-generation (6G) systems have created a demand for more efficient and rapid transmission of information over wireless communication media. However, developing wireless communication systems that can meet these modern-day criteria for fast, reliable, and secure information exchange is a challenging task. To address this issue, this paper proposes a novel model for enhancing the 5G system. The proposed model utilizes polar code with rate matching and constitutional interleaving over the Suzuki fading channel. The combination of polar codes with rate matching and interleaving enables the communication system to achieve a lower error rate and better reliability over a Suzuki fading channel. Specifically, the polar code can correct a larger number of errors, while rate matching and interleaving can mitigate the effects of channel variations and reduce the probability of error bursts. These enhancements can lead to more robust and reliable communication in wireless networks

Beyond 5G URLLC Evolution: New Service Modes and Practical Considerations

Ultra-reliable low latency communications (URLLC) arose to serve industrial IoT (IIoT) use cases within the 5G. Currently, it has inherent limitations to support future services. Based on state-of-the-art research and practical deployment experience, in this article, we introduce and advocate for three variants: broadband, scalable and extreme URLLC. We discuss use cases and key performance indicators and identify technology enablers for the new service modes. We bring practical considerations from the IIoT testbed and provide an outlook toward some new research directions.Comment: Submitted to IEEE Wireless Commun. Ma

Fast Polarization for Processes with Memory

Fast polarization is crucial for the performance guarantees of polar codes. In the memoryless setting, the rate of polarization is known to be exponential in the square root of the block length. A complete characterization of the rate of polarization for models with memory has been missing. Namely, previous works have not addressed fast polarization of the high entropy set under memory. We consider polar codes for processes with memory that are characterized by an underlying ergodic finite-state Markov chain. We show that the rate of polarization for these processes is the same as in the memoryless setting, both for the high and for the low entropy sets.Comment: 17 pages, 3 figures. Submitted to IEEE Transactions on Information Theor

Special Issue on Advances in Channel Coding

[No abstract available

Analysis and Design of Partially Information- and Partially Parity-Coupled Turbo Codes

In this paper, we study a class of spatially coupled turbo codes, namely partially information- and partially parity-coupled turbo codes. This class of codes enjoy several advantages such as flexible code rate adjustment by varying the coupling ratio and the encoding and decoding architectures of the underlying component codes can remain unchanged. For this work, we first provide the construction methods for partially coupled turbo codes with coupling memory $m$ and study the corresponding graph models. We then derive the density evolution equations for the corresponding ensembles on the binary erasure channel to precisely compute their iterative decoding thresholds. Rate-compatible designs and their decoding thresholds are also provided, where the coupling and puncturing ratios are jointly optimized to achieve the largest decoding threshold for a given target code rate. Our results show that for a wide range of code rates, the proposed codes attain close-to-capacity performance and the decoding performance improves with increasing the coupling memory. In particular, the proposed partially parity-coupled turbo codes have thresholds within 0.0002 of the BEC capacity for rates ranging from $1/3$ to $9/10$, yielding an attractive way for constructing rate-compatible capacity-approaching channel codes.Comment: 15 pages, 13 figures. Accepted for publication in IEEE Transactions on Communication