Memory-Based List Updating for List Sphere Decoders

P. Salmela, J. Antikainen, O. Silvén, J. Takala
{"title":"Memory-Based List Updating for List Sphere Decoders","authors":"P. Salmela, J. Antikainen, O. Silvén, J. Takala","doi":"10.1109/SIPS.2007.4387623","DOIUrl":null,"url":null,"abstract":"Symbol detection with list sphere decoder (LSD) is an emerging technology targeted on multiple-input multiple-output (MIMO) telecommunication systems. The LSD algorithm requires maintaining a list of candidate symbols with shortest Euclidean distances to the received symbol. For energy efficiency, memory-based list is preferred over registers with long list lengths. In this paper, two hardware units for alleviating processing of such lists are presented. The list is stored as a heap in the memory and the proposed list updating units are incorporated with application specific processors. With presented principles, the number of clock cycles per list insertion gets very close to the theoretical lower bound with heap data structure.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"32 5 1","pages":"633-638"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIPS.2007.4387623","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Symbol detection with list sphere decoder (LSD) is an emerging technology targeted on multiple-input multiple-output (MIMO) telecommunication systems. The LSD algorithm requires maintaining a list of candidate symbols with shortest Euclidean distances to the received symbol. For energy efficiency, memory-based list is preferred over registers with long list lengths. In this paper, two hardware units for alleviating processing of such lists are presented. The list is stored as a heap in the memory and the proposed list updating units are incorporated with application specific processors. With presented principles, the number of clock cycles per list insertion gets very close to the theoretical lower bound with heap data structure.
基于内存的列表更新列表球体解码器
基于表球解码器的符号检测是一项针对多输入多输出通信系统的新兴技术。LSD算法需要维护一个候选符号列表,该候选符号与接收到的符号具有最短的欧几里得距离。为了能源效率,基于内存的列表优于具有长列表长度的寄存器。在本文中,提出了两个硬件单元来减轻这类列表的处理。列表以堆的形式存储在内存中,建议的列表更新单元与特定于应用程序的处理器结合在一起。根据所提出的原理,每次列表插入的时钟周期数非常接近堆数据结构的理论下界。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信