• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Journal on Selected Areas in Communications >Reduced-complexity equalization techniques for ISI and MIMO wireless channels in iterative decoding
【24h】

Reduced-complexity equalization techniques for ISI and MIMO wireless channels in iterative decoding

机译：迭代解码中用于ISI和MIMO无线信道的降低复杂度的均衡技术

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Two reduced-complexity soft-input soft-output trellis decoding techniques are presented in this paper for equalizing single-input single-output intersymbol interference (ISI) channels and multiple-input multiple-output (MIMO) frequency selective fading channels. Given a trellis representing an ISI channel, the soft-output M-algorithm (SOMA) reduces the complexity of equalization by retaining only the best M survivors at each trellis interval. The remaining survivors are discarded. The novelty of the SOMA is the use of discarded paths to obtain soft-information. Through a simple update-and-discard procedure, the SOMA extracts reliable soft-information from discarded paths which enables a large trellis to be successfully decoded with a relatively small value of M. To decode a trellis representing a MIMO frequency selective fading channel, two challenges are faced. Not only that the trellis has a large number of states, the number of branches per trellis interval is also enormous. The soft-output trellis/tree M-algorithm (SOTTMA) expands each trellis interval into a tree-like structure and performs the M-algorithm twice: once at each trellis interval to reduce the number of states and the other at each tree sub-level to remove unwanted branches. With the proposed technique, high-order trellises with million of branches per interval can be decoded with modest complexity.
机译：本文提出了两种降低复杂度的软输入软输出网格解码技术，用于均衡单输入单输出符号间干扰（ISI）信道和多输入多输出（MIMO）频率选择性衰落信道。给定一个表示ISI通道的网格，软输出M算法（SOMA）通过在每个网格间隔中仅保留最佳M个生存者来降低均衡的复杂性。其余幸存者被丢弃。 SOMA的新颖之处在于使用了丢弃的路径来获取软信息。通过简单的更新和丢弃过程，SOMA从丢弃的路径中提取了可靠的软信息，从而可以用较小的M值成功解码出大网格。要解码表示MIMO频率选择性衰落信道的网格，需要两个面临挑战。不仅网格具有大量状态，而且每个网格间隔的分支数量也很大。软输出网格/树M算法将每个网格间隔扩展为树状结构，并执行两次M算法：每个网格间隔一次以减少状态数，另一个在每个子树上级别删除不需要的分支。利用所提出的技术，可以以适度的复杂度来解码每个间隔具有一百万个分支的高阶网格。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号