pith. the verified trust layer for science. sign in

arxiv: 0909.0105 · v5 · pith:GI5R4FYSnew · submitted 2009-09-01 · 💻 cs.IT · math.IT

Concatenated Coding for the AWGN Channel with Noisy Feedback

classification 💻 cs.IT math.IT
keywords codefeedbackchannelconcatenatedinnerschemelinearawgn
0
0 comments X p. Extension
Add this Pith Number to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{GI5R4FYS}

Prints a linked pith:GI5R4FYS badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

The use of open-loop coding can be easily extended to a closed-loop concatenated code if the channel has access to feedback. This can be done by introducing a feedback transmission scheme as an inner code. In this paper, this process is investigated for the case when a linear feedback scheme is implemented as an inner code and, in particular, over an additive white Gaussian noise (AWGN) channel with noisy feedback. To begin, we look to derive an optimal linear feedback scheme by optimizing over the received signal-to-noise ratio. From this optimization, an asymptotically optimal linear feedback scheme is produced and compared to other well-known schemes. Then, the linear feedback scheme is implemented as an inner code to a concatenated code over the AWGN channel with noisy feedback. This code shows improvements not only in error exponent bounds, but also in bit-error-rate and frame-error-rate. It is also shown that the if the concatenated code has total blocklength L and the inner code has blocklength, N, the inner code blocklength should scale as N = O(C/R), where C is the capacity of the channel and R is the rate of the concatenated code. Simulations with low density parity check (LDPC) and turbo codes are provided to display practical applications and their error rate benefits.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.