arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0704.2505cs.ITcs.DMmath.IT
收藏

低ML译码复杂度的代数分布式空时码

Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity

G. Susinder Rajan, B. Sundar Rajan

摘要:

引入"扩展Clifford代数"作为获得低ML译码复杂度空时分组码的一种手段。利用两类扩展Clifford代数的左正则矩阵表示,给出了两种系统的全分集分布式空时码的代数构造.左正则矩阵表示已被证明自然导致满足DSTC所需的附加约束的空时码。这样构造的DSTC具有降低最大似然(ML)解码复杂度的显著特征。特别地,这些代码的ML解码可以通过在比通常所需的维度小四倍的维度的晶格上应用晶格解码器算法来执行。此外,这些码在中继器之间和在时间上具有均匀的功率分布,从而导致中继器处的低峰均功率比。

英文摘要:

"Extended Clifford algebras" are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two specific classes of extended Clifford algebras, two systematic algebraic constructions of full diversity Distributed Space-Time Codes (DSTCs) are provided for any power of two number of relays. The left regular matrix representation has been shown to naturally result in space-time codes meeting the additional constraints required for DSTCs. The DSTCs so constructed have the salient feature of reduced Maximum Likelihood (ML) decoding complexity. In particular, the ML decoding of these codes can be performed by applying the lattice decoder algorithm on a lattice of four times lesser dimension than what is required in general. Moreover these codes have a uniform distribution of power among the relays and in time, thus leading to a low Peak to Average Power Ratio at the relays.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑