Channel combining and splitting for cutoff rate improvement
- 23 January 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 52 (2) , 628-639
- https://doi.org/10.1109/tit.2005.862081
Abstract
The cutoff rate R0(W) of a discrete memoryless channel (DMC) W is often used as a figure of merit alongside the channel capacity C(W). If a channel W is split into two possibly correlated subchannels W1, W2, the capacity function always satisfies C(W1)+C(W2)lesC(W), while there are examples for which R0(W1)+R0(W2 )>R0(W). The fact that cutoff rate can be "created" by channel splitting was noticed by Massey in his study of an optical modulation system. This paper gives a general framework for achieving similar gains in the cutoff rate of arbitrary DMCs by methods of channel combining and splitting. The emphasis is on simple schemes that can be implemented in practice. We give several examples that achieve significant gains in cutoff rate at little extra system complexity. Theoretically, as the complexity grows without bound, the proposed framework is capable of boosting the cutoff rate of a channel to arbitrarily close to its capacity in a sense made precise in the paper. Apart from Massey's work, the methods studied here have elements in common with Forney's concatenated coding idea, a method by Pinsker for cutoff rate improvement, and certain coded-modulation techniques, namely, Ungerboeck's set-partitioning idea and Imai-Hirakawa multilevel coding; these connections are discussed in the paperKeywords
This publication has 15 references indexed in Scilit:
- Trellis-coded modulation with redundant signal sets Part II: State of the artIEEE Communications Magazine, 1987
- Trellis-coded modulation with redundant signal sets Part I: IntroductionIEEE Communications Magazine, 1987
- A perspective on multiaccess channelsIEEE Transactions on Information Theory, 1985
- Capacity, Cutoff Rate, and Coding for a Direct-Detection Optical ChannelIEEE Transactions on Communications, 1981
- A new multilevel coding method using error-correcting codesIEEE Transactions on Information Theory, 1977
- The random coding bound is tight for the average code (Corresp.)IEEE Transactions on Information Theory, 1973
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithmIEEE Transactions on Information Theory, 1967
- Modulation and demodulation for probabilistic codingIEEE Transactions on Information Theory, 1966
- A heuristic discussion of probabilistic decodingIEEE Transactions on Information Theory, 1963
- Error-free CodingTransactions of the IRE Professional Group on Information Theory, 1954