VLSI architecture of a K-best detector for MIMO--OFDM wireless communication systems | |
Jian Haifang![]() | |
刊名 | 半导体学报
![]() |
2009 | |
卷号 | 30期号:7页码:94-97 |
中文摘要 | the k-best detector is considered as a promising technique in the mimo-ofdm detection because of its good performance and low complexity. in this paper, a new k-best vlsi architecture is presented. in the proposed architecture, the metric computation units (mcus) expand each surviving path only to its partial branches, based on the novel expansion scheme, which can predetermine the branches' ascending order by their local distances. then a distributed sorter sorts out the new k surviving paths from the expanded branches in pipelines. compared to the conventional k-best scheme, the proposed architecture can approximately reduce fundamental operations by 50% and 75% for the 16-qam and the 64-qam cases, respectively, and, consequently, lower the demand on the hardware resource significantly. simulation results prove that the proposed architecture can achieve a performance very similar to conventional k-best detectors. hence, it is an efficient solution to the k-best detector's vlsi implementation for high-throughput mimo-ofdm systems. |
英文摘要 | the k-best detector is considered as a promising technique in the mimo-ofdm detection because of its good performance and low complexity. in this paper, a new k-best vlsi architecture is presented. in the proposed architecture, the metric computation units (mcus) expand each surviving path only to its partial branches, based on the novel expansion scheme, which can predetermine the branches' ascending order by their local distances. then a distributed sorter sorts out the new k surviving paths from the expanded branches in pipelines. compared to the conventional k-best scheme, the proposed architecture can approximately reduce fundamental operations by 50% and 75% for the 16-qam and the 64-qam cases, respectively, and, consequently, lower the demand on the hardware resource significantly. simulation results prove that the proposed architecture can achieve a performance very similar to conventional k-best detectors. hence, it is an efficient solution to the k-best detector's vlsi implementation for high-throughput mimo-ofdm systems.; 于2010-11-23批量导入; zhangdi于2010-11-23 12:59:58导入数据到semi-ir的ir; made available in dspace on 2010-11-23t04:59:58z (gmt). no. of bitstreams: 1 3678.pdf: 1228456 bytes, checksum: b2ab7a5d2df47605b077c81e0673b801 (md5) previous issue date: 2009; institute of semiconductors, chinese academy of sciences |
学科主题 | 人工智能 |
收录类别 | CSCD |
语种 | 英语 |
公开日期 | 2010-11-23 ; 2011-04-28 |
内容类型 | 期刊论文 |
源URL | [http://ir.semi.ac.cn/handle/172111/15737] ![]() |
专题 | 半导体研究所_中国科学院半导体研究所(2009年前) |
推荐引用方式 GB/T 7714 | Jian Haifang. VLSI architecture of a K-best detector for MIMO--OFDM wireless communication systems[J]. 半导体学报,2009,30(7):94-97. |
APA | Jian Haifang.(2009).VLSI architecture of a K-best detector for MIMO--OFDM wireless communication systems.半导体学报,30(7),94-97. |
MLA | Jian Haifang."VLSI architecture of a K-best detector for MIMO--OFDM wireless communication systems".半导体学报 30.7(2009):94-97. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论