循环前缀编码线性系统迭代LMMSE-APP检测的演化分析

2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI:10.1109/ISIT.2007.4557206

Xiaojun Yuan, Qinghua Guo, L. Ping

{"title":"循环前缀编码线性系统迭代LMMSE-APP检测的演化分析","authors":"Xiaojun Yuan, Qinghua Guo, L. Ping","doi":"10.1109/ISIT.2007.4557206","DOIUrl":null,"url":null,"abstract":"This paper is concerned with the iterative detection principles for coded linear systems with cyclic prefixes. We derive a matrix-form low-cost fast Fourier transform (FFT) based iterative LMMSE-APP detector and propose an evolution technique for the performance evaluation of the proposed detector. Numerical results show a good match between simulation and evolution prediction.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Evolution Analysis of Iterative LMMSE-APP Detection for Coded Linear System with Cyclic Prefixes\",\"authors\":\"Xiaojun Yuan, Qinghua Guo, L. Ping\",\"doi\":\"10.1109/ISIT.2007.4557206\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper is concerned with the iterative detection principles for coded linear systems with cyclic prefixes. We derive a matrix-form low-cost fast Fourier transform (FFT) based iterative LMMSE-APP detector and propose an evolution technique for the performance evaluation of the proposed detector. Numerical results show a good match between simulation and evolution prediction.\",\"PeriodicalId\":193467,\"journal\":{\"name\":\"2007 IEEE International Symposium on Information Theory\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2007.4557206\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2007.4557206","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

本文研究了具有循环前缀的编码线性系统的迭代检测原理。我们推导了一种基于矩阵型低成本快速傅立叶变换(FFT)的迭代LMMSE-APP检测器，并提出了一种用于该检测器性能评估的进化技术。数值结果表明，模拟结果与演化预测结果吻合较好。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Evolution Analysis of Iterative LMMSE-APP Detection for Coded Linear System with Cyclic Prefixes

This paper is concerned with the iterative detection principles for coded linear systems with cyclic prefixes. We derive a matrix-form low-cost fast Fourier transform (FFT) based iterative LMMSE-APP detector and propose an evolution technique for the performance evaluation of the proposed detector. Numerical results show a good match between simulation and evolution prediction.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2007 IEEE International Symposium on Information Theory

自引率

0.00%

发文量