{"title":"基于内存的列表更新列表球体解码器","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":"{\"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}","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}
Memory-Based List Updating for List Sphere Decoders
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.