Computer Science – Information Theory
Scientific paper
2006-10-26
Computer Science
Information Theory
12 pages, 6 figures, submitted to IT Transactions
Scientific paper
It is well known that orthogonal coding can be used to approach the Shannon capacity of the power-constrained AWGN channel without a bandwidth constraint. This correspondence describes a semi-orthogonal variation of pulse position modulation that is sequential in nature -- bits can be ``streamed across'' without having to buffer up blocks of bits at the transmitter. ML decoding results in an exponentially small probability of error as a function of tolerated receiver delay and thus eventually a zero probability of error on every transmitted bit. In the high-rate regime, a matching upper bound is given on the delay error exponent. We close with some comments on the case with feedback and the connections to the capacity per unit cost problem.
No associations
LandOfFree
Anytime coding on the infinite bandwidth AWGN channel: A sequential semi-orthogonal optimal code does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Anytime coding on the infinite bandwidth AWGN channel: A sequential semi-orthogonal optimal code, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Anytime coding on the infinite bandwidth AWGN channel: A sequential semi-orthogonal optimal code will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-114197