高数据速率多径信道的频域均衡

2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233) Pub Date : 2001-08-26 DOI:10.1109/PACRIM.2001.953688

P. Dmochowski, P. McLane

{"title":"高数据速率多径信道的频域均衡","authors":"P. Dmochowski, P. McLane","doi":"10.1109/PACRIM.2001.953688","DOIUrl":null,"url":null,"abstract":"High data rate transmission over multipath channels requires equalizers of long impulse response. In such cases, frequency domain implementation of the block least mean square (BLMS) algorithm offers low complexity growth relative to time domain techniques. The work presented herein is devoted to a study of the fast BLMS (FBLMS) algorithm implemented in the frequency domain using overlap-save sectioning and the fast Fourier transform (FFT). We examine the bit error rate (BER) performance for high data rate quadrature phase shift keying (QPSK) transmission over a multipath channel as well as the computational complexity of the FBLMS equalizer in comparison to the time domain implementation. Finally, we show how normalizing the step size of the FBLMS algorithm according to the power distribution of the input process results in a significant improvement in the equalizer convergence relative to the time domain methods.","PeriodicalId":261724,"journal":{"name":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Frequency domain equalization for high data rate multipath channels\",\"authors\":\"P. Dmochowski, P. McLane\",\"doi\":\"10.1109/PACRIM.2001.953688\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"High data rate transmission over multipath channels requires equalizers of long impulse response. In such cases, frequency domain implementation of the block least mean square (BLMS) algorithm offers low complexity growth relative to time domain techniques. The work presented herein is devoted to a study of the fast BLMS (FBLMS) algorithm implemented in the frequency domain using overlap-save sectioning and the fast Fourier transform (FFT). We examine the bit error rate (BER) performance for high data rate quadrature phase shift keying (QPSK) transmission over a multipath channel as well as the computational complexity of the FBLMS equalizer in comparison to the time domain implementation. Finally, we show how normalizing the step size of the FBLMS algorithm according to the power distribution of the input process results in a significant improvement in the equalizer convergence relative to the time domain methods.\",\"PeriodicalId\":261724,\"journal\":{\"name\":\"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACRIM.2001.953688\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM.2001.953688","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 16

摘要

多径信道上的高数据速率传输需要长脉冲响应均衡器。在这种情况下，块最小均方(BLMS)算法的频域实现相对于时域技术提供了较低的复杂性增长。本文的工作是研究快速BLMS (FBLMS)算法在频域使用重叠保存切片和快速傅立叶变换(FFT)实现。我们研究了多径信道上高数据速率正交相移键控(QPSK)传输的误码率(BER)性能，以及与时域实现相比，FBLMS均衡器的计算复杂性。最后，我们展示了如何根据输入过程的功率分布对FBLMS算法的步长进行归一化，从而显著改善了相对于时域方法的均衡器收敛性。

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

查看原文本刊更多论文

Frequency domain equalization for high data rate multipath channels

High data rate transmission over multipath channels requires equalizers of long impulse response. In such cases, frequency domain implementation of the block least mean square (BLMS) algorithm offers low complexity growth relative to time domain techniques. The work presented herein is devoted to a study of the fast BLMS (FBLMS) algorithm implemented in the frequency domain using overlap-save sectioning and the fast Fourier transform (FFT). We examine the bit error rate (BER) performance for high data rate quadrature phase shift keying (QPSK) transmission over a multipath channel as well as the computational complexity of the FBLMS equalizer in comparison to the time domain implementation. Finally, we show how normalizing the step size of the FBLMS algorithm according to the power distribution of the input process results in a significant improvement in the equalizer convergence relative to the time domain methods.

求助全文

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

来源期刊

2001 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (IEEE Cat. No.01CH37233)

自引率

0.00%

发文量