Bandwidth-Efficient Modulation Codes Based on Nonbinary Irregular Repeat–Accumulate Codes

Chiu, Mao-Ching

doi:10.1109/tit.2009.2034798

Cited by 16 publications

(3 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recent work on Irregular Repeat-Accumulate (IRA) codes over high-order finite fields has shown that they come extremely close to capacity on the Additive White Gaussian Noise (AWGN) channel for short packet sizes [6]. Motivated by this positive result on one-dimensional noisy channels, we base PRC's code on an IRA code designed for the two-dimensional Quadrature Amplitude Modulation (QAM) channel that wireless networks use.…”

Section: Graph-based Codementioning

confidence: 99%

“…It can be shown that the correct function to use to combine these messages is the hyperbolic tangent [3], but intuitively, the up message from the check node tends to be low confidence (close to zero) if any of its constituent down messages are zero. These con- cepts generalize to higher-order finite fields; for brevity we omit details, but refer the reader to the literature [6], et al Some strategies for early termination in a belief propagation decoder have been proposed, primarily focusing on binary LDPC decoders [14], as well as Raptor [12] and GF(2 q ) [5] codes. These works focus on either the sum of symbol variances or the change in the number of incorrect bits from iteration to iteration.…”

Section: Rateless Graph-based Codesmentioning

confidence: 99%

See 1 more Smart Citation

Power-aware rateless codes in mobile wireless communication

Harrison

Jamieson

2012

Proceedings of the 11th ACM Workshop on Hot Topics in Networks

View full text Add to dashboard Cite

Rateless error correction codes hold great potential for increasing the capacity of practical wireless networks by obviating the need for transmitters to estimate the highest reliable rate of an unpredictable wireless channel and send information at that rate. But the accumulation and intensive processing of noisy bits works against rateless codes' adoption in mobile devices, where energy is at a premium due to limited battery capacity. In this work, we identify a new tradeoff between energy efficiency and wireless capacity that rateless codes can make in low signal-to-noise ratio or highly variable "grey zone" conditions. We propose Power-Aware Rateless Codes (PRC), a design that integrates with the medium access control portion of a rateless wireless system, giving the system a way of selectively sacrificing small amounts of wireless capacity for large savings in decoder computation effort, thus reducing radio power consumption in challenging radio environments.

show abstract

Section: Graph-based Codementioning

confidence: 99%

Section: Rateless Graph-based Codesmentioning

confidence: 99%

Power-aware rateless codes in mobile wireless communication

Harrison

Jamieson

2012

Proceedings of the 11th ACM Workshop on Hot Topics in Networks

View full text Add to dashboard Cite

show abstract

“…Furthermore, serial update schedules [23]- [28] have been proposed for performing URC decoding within the factor graph using a FR and a BR. This approach has been shown to reduce the required number of decoding iterations by up to 50% [26, Figure 6], compared to the parallel update schedule that is conventionally adopted for message passing.…”

Section: Introductionmentioning

confidence: 99%

Bit-by-Bit Iterative Decoding Expedites the Convergence of Repeat Accumulate Decoders

Chen

Zhang

Maunder

et al. 2015

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-In this paper, we propose bit-by-bit iterative decoding for expediting the convergence of Repeat Accumulate (RA) decoders. In a conventional RA decoder, the repeat and accumulate component decoders are operated iteratively, in order to facilitate near-capacity communication. However, whenever one decoder is activated, the other is kept idle. The outputs of the active component decoder are stored until its operation is completed, whereupon the outputs are forwarded to the other decoder all at once and the activation of the decoders is swapped. The proposed bit-by-bit RA decoder expedites this process by allowing both component decoders to operate simultaneously, continuously exchanging outputs without buffering. We present both EXtrinsic Information Transfer (EXIT) charts and Bit Error Ratio (BER) results, which demonstrate that the proposed bit-by-bit RA decoder requires fewer decoding iterations to converge, at the cost of a slightly increased complexity per decoding iteration. Overall, we demonstrate that in a range of practical scenarios, the proposed bit-by-bit RA offers gains of up to 0.86 dB, without imposing any additional decoding complexity and without requiring any additional transmissionenergy, -bandwidth or -duration.

show abstract

Design of multi-edge-type LDPC codes for high-order coded modulation

Zhang

Kschischang

2011

2011 12th Canadian Workshop on Information Theory

View full text Add to dashboard Cite

Bandwidth-Efficient Modulation Codes Based on Nonbinary Irregular Repeat–Accumulate Codes

Cited by 16 publications

References 31 publications

Power-aware rateless codes in mobile wireless communication

Power-aware rateless codes in mobile wireless communication

Bit-by-Bit Iterative Decoding Expedites the Convergence of Repeat Accumulate Decoders

Design of multi-edge-type LDPC codes for high-order coded modulation

Contact Info

Product

Resources

About