Signaling Over Arbitrarily Permuted Parallel Channels

The problem of transmission of information over arbitrarily permuted parallel channels is studied here. The transmitter does not know over which channel a certain codesequence will actually be transmitted, however the receiver knows how the sequences are permuted. The permutation is arbitrary but constant during the (simultaneous) transmission of the codesequences via the parallel channels. It is shown first that the sum of the capacities of each channel is achievable for such a communication system in the special case where the capacity achieving input distributions of all channels are identical. More important is that this sum-capacity can also be achieved using a single channel code for all channels combined with a sequential decoding method. The construction of a rate-matching code based on Maximum Distance Separable (MDS) codes turns out to be crucial. Finally the case where the parallel channels have different capacity-achieving input distributions is investigated. Also for this ...

• Type: Journal
• Year: 2008
• Where: TIT
• Authors: Frans M. J. Willems, Alexei Gorokhov
• Keywords: Input Distributions, Parallel Channels, Sequential Decoding, TIT 2008