首页 | 本学科首页   官方微博 | 高级检索  
     

可快速迭代解码的非相干空时编码
引用本文:郭永亮,朱世华.可快速迭代解码的非相干空时编码[J].电子学报,2006,34(12):2259-2262.
作者姓名:郭永亮  朱世华
作者单位:西安交通大学信息与通信工程系,陕西,西安,710049;西安交通大学信息与通信工程系,陕西,西安,710049
基金项目:国家自然科学基金,高等学校博士学科点专项科研项目
摘    要:提出了一种基于满分集准正交空时分组码构造非酉非相干空时码的方法,该编码能够最大限度地利用信道的相关时间来提高码率.根据代数分集的定义,证明了所构造的编码可获得满代数分集.为了能够充分利用编码的准正交结构简化解码,选用了基于期望最大化的迭代算法对所构造的编码进行解码,该算法能够极大地减小最优解码器的复杂度.仿真结果表明,迭代解码算法可快速收敛且其能够很好地对解码复杂度和误码性能进行折衷.

关 键 词:期望最大算法  准正交空时分组码  满代数分集  非酉非相干空时码
文章编号:0372-2112(2006)12-2259-04
收稿时间:2006-03-27
修稿时间:2006-03-272006-09-21

A Non-Coherent Space-Time Code with Fast Iterative Decoding
GUO Yong-liang,ZHU Shi-hua.A Non-Coherent Space-Time Code with Fast Iterative Decoding[J].Acta Electronica Sinica,2006,34(12):2259-2262.
Authors:GUO Yong-liang  ZHU Shi-hua
Affiliation:Department of Information and Communications Engineering,Xian Jiaotong University,Xi’an,Shaanxi 710049,China
Abstract:A non-unitary non-coherent space-time code is proposed based on full diversity quasi-orthogonal space-time block code. This code can make use of the coherent time of the wireless channel as possible as it can. The conclusion that the proposed code can achieve full algebraic diversity is proved in terms of the definition of algebraic diversity. To exploit the quasi-orthogonal structure for simple decoding an iterative decoding algorithm based on EM algorithm is employed to the proposed non-coherent code. Simulation results demonstrate the iterative decoding algorithm can converge fast and it enjoys a favorable performance-complexity tradeoff.
Keywords:expectation maximization(EM) algorithm  quasi-orthogonal space-time block code  full algebraic diversity  non-unitary non-coherent space-time code
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号