Error correction coding schemes with local-global decoding are motivated by practical data storage applications where a balance must be achieved between low latency read access and high data reliability. As an example, consider a 4KB codeword, consisting of four 1KB subblocks, that supports a local-global decoding architecture. Local decoding can provide reliable, low-latency access to individual 1KB subblocks under good channel conditions, while global decoding can provide a “safety-net” for recovery of the entire 4KB block when local decoding fails under bad channel conditions. Recently, Ram and Cassuto have proposed such local-global decoding architectures for LDPC codes and spatially coupled LDPC codes. In this paper, we investigate a coupled polar code architecture that supports both local and global decoding. The coupling scheme incorporates a systematic outer polar code and a partitioned mapping of the outer codeword to semipolarized bit-channels of the inner polar codes. Error rate simulation results are presented for 2 and 4 subblocks.
more »
« less
This content will become publicly available on June 9, 2025
Effect of Feedback Delay on Adaptive LDPC Coding in a Fading Free-Space Optical Channel
Free-space optical (FSO) links are sensitive to channel fading caused by atmospheric turbulence, varying weather conditions, and changes in the distance between the transmitter and receiver. To mitigate FSO fading, this paper applies linear and quadratic prediction to estimate fading channel conditions and dynamically select the appropriate low-density parity check (LDPC) code rate. This adaptivity achieves reliable communication while efficiently utilizing the available channel mutual information. Protograph-based Raptor-like (PBRL) LDPC codes supporting a wide range of rates are designed, facilitating convenient rate switching. When channel state information (CSI) is known without delay, dynamically selecting LDPC code rate appropriately maximizes throughput. This work explores how such prediction behaves as the feedback delay is increased from no delay to a delay of 4 ms for a channel with a coherence time of 10 ms.
more »
« less
- Award ID(s):
- 1955660
- PAR ID:
- 10540382
- Publisher / Repository:
- IEEE
- Date Published:
- ISSN:
- 1938-1883
- ISBN:
- 978-1-7281-9054-9
- Page Range / eLocation ID:
- 2420 to 2426
- Subject(s) / Keyword(s):
- Free-space optical communication Fading Channel Low Density Parity Check Codes PBRL Protograph-Based Raptor-Like Rate-Compatible Feedback Channel State Information Atmospheric Turbulence
- Format(s):
- Medium: X
- Location:
- Denver, CO, USA
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Wireless telemetry communication systems may be vulnerable to eavesdroppers due to their broad- casting nature, which is a risk to confidential information transmission. This paper explores the feasibility of low-density parity-check (LDPC) codes for wiretap coding over a Gaussian channel for standard telemetry links. By introducing a wiretap LDPC coding method, we aim to mitigate the risk of eavesdropping. We further explore the notion of fine-tuning the trade-off in these codes between secrecy and reliability through artificial noise injection. Simulation results demonstrate the effectiveness of employing an LDPC-based wiretap code over telemetry links to provide se- crecy. The analysis of the code shows that a neural network-based mutual information estimator can be utilized to calculate information leakage over telemetry links.more » « less
-
We investigate the performance of discrete (coded) modulations in the full-duplex compress-forward relay channel using multilevel coding. We numerically analyze the rates assigned to component binary codes of all levels. LDPC codes are used as the component binary codes to provide error protection. The compression at the relay is done via a nested scalar quantizer whose output is mapped to a codeword through LDPC codes. A compound Tanner graphical model and information-exchange algorithm are described for joint decoding of both messages sent from the source and relay. Simulation results show that the performance of the proposed system based on multilevel coding is better than that based on BICM, and is separated from the SNR threshold of the known CF achievable rate by two factors consisting approximately of the sum of the shaping gain (due to scalar quantization) and the separation of the LDPC code implementation from AWGN capacity.more » « less
-
null (Ed.)The fading broadcast channel (BC) with additive white Gaussian noise (AWGN) channel, channel output feedback (COF) and channel state information (CSI) is considered. Perfect CSI is available at the receivers, and unit delayed CSI along with COF at the transmitter. Under the assumption of memoryless fading, a posterior matching scheme that incorporates the additional CSI feedback into the coding scheme is presented. With COF, the achievable rates depend on the joint distribution of the fading process. Numerical examples show that the capacity region of two-user fading AWGN-BC is enlarged by COF. The coding scheme is however suboptimal since some parts of the achievable rate region are outperformed by superposition coding without COF.more » « less
-
This paper presents a turbo-detection system consisting of a convolutional neural network (CNN) based equalizer, a Bahl-Cocke-Jelinek-Raviv (BCJR) trellis detector, a CNN-based media noise predictor (MNP), and a low-density parity-check (LDPC) channel decoder for two-dimensional magnetic recording (TDMR). The BCJR detector, CNN MNP, and LDPC decoder iteratively exchange soft information to maximize the areal density (AD) subject to a bit error rate (BER) constraint. Simulation results employing a realistic grain switching probabilistic (GSP) media model show that the proposed system is quite robust to track-misregistration (TMR). Compared to a I-D pattern-dependent noise prediction (PDNP) baseline with soft intertrack interference (ITI) subtraction, the system achieves 0.34% AD gain with read-TMR alone and 0.69% with write- and read-TMR together.more » « less