首页> 外文期刊>IEEE Transactions on Information Theory >Signaling Over Arbitrarily Permuted Parallel Channels
【24h】

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 code-sequence 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 code-sequences 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 case the capacity is determined. Again, this capacity is achievable with a sequential decoding procedure.
机译:在此研究在任意排列的并行信道上传输信息的问题。发射机不知道某个码序列将实际在哪个信道上传输,但是接收机知道如何对序列进行排列。排列是任意的,但在通过并行通道(同时)传输代码序列期间是恒定的。首先显示出,在这样的通信系统中,在实现所有信道的输入分配的容量相同的特殊情况下,每个信道的容量的总和是可实现的。更重要的是,对于所有通道,也可以使用单个通道代码结合顺序解码方法来实现此和容量。事实证明,基于最大距离可分离(MDS)码构建速率匹配码至关重要。最后,研究了并行通道具有不同容量实现输入分布的情况。同样对于这种情况,确定容量。同样,该容量可以通过顺序解码过程来实现。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号