A blind adaptive channel shortening algorithm using any lag auto correlation minimization (ALAM)

M. Yamin, R. Nawaz
{"title":"A blind adaptive channel shortening algorithm using any lag auto correlation minimization (ALAM)","authors":"M. Yamin, R. Nawaz","doi":"10.1109/ICET.2011.6048442","DOIUrl":null,"url":null,"abstract":"The purpose of channel shortening is to condense the channel in a shorter span to make the Multi Carrier Communication Systems bandwidth and power efficient. The autocorrelation minimization based channel shortening algorithms are investigated in this paper. If a white signal is input to a filter having a short span, the autocorrelation introduced in the output signal is small. The SAM algorithm expects that the reverse might also be true. Therefore, it performs channel shortening by minimizing the sum-squared autocorrelation of the output of the channel for a range of lags. It is shown that minimizing the autocorrelation of the channel output as in SAM is not equivalent to condensing the channel in a contagious window. As long as the ADSL channels are concerned, identical channel shortening can be achieved by using a single autocorrelation in the cost function. Using a range of autocorrelations is unintelligent and overkill. Furthermore, this single autocorrelation is not specific to any particular value of lag. This finding not only reduces the computational complexity of SAM as in SLAM but also serves as an insight into the dynamics of the autocorrelation based channel shortening algorithms. The algorithm is named Any Lag Autocorrelation Minimization (ALAM). The simulations support the ideas presented in the paper. The reasons behind the diverging behavior of autocorrelation based algorithms to shorten the ADSL channels are also elaborated. The paper also serves to identify lags which can be minimized in the true sense of channel shortening. It is found that these lag values are not driven by the nature of the impulse response of the underlying channel. They always try to shorten a channel around its mid point. Therefore, it is conjectured that if the channel has its mass of energy around its mid point, ALAM is flexible and will successfully shorten it to different desired window lengths without any diverging behavior. On the other hand, SAM, which blindly minimizes all of the channel taps in its cost function, is expected to fail in such situations. The failure will come in the form of no shortening at all OR divergence from the optimal point.","PeriodicalId":167049,"journal":{"name":"2011 7th International Conference on Emerging Technologies","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 7th International Conference on Emerging Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICET.2011.6048442","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The purpose of channel shortening is to condense the channel in a shorter span to make the Multi Carrier Communication Systems bandwidth and power efficient. The autocorrelation minimization based channel shortening algorithms are investigated in this paper. If a white signal is input to a filter having a short span, the autocorrelation introduced in the output signal is small. The SAM algorithm expects that the reverse might also be true. Therefore, it performs channel shortening by minimizing the sum-squared autocorrelation of the output of the channel for a range of lags. It is shown that minimizing the autocorrelation of the channel output as in SAM is not equivalent to condensing the channel in a contagious window. As long as the ADSL channels are concerned, identical channel shortening can be achieved by using a single autocorrelation in the cost function. Using a range of autocorrelations is unintelligent and overkill. Furthermore, this single autocorrelation is not specific to any particular value of lag. This finding not only reduces the computational complexity of SAM as in SLAM but also serves as an insight into the dynamics of the autocorrelation based channel shortening algorithms. The algorithm is named Any Lag Autocorrelation Minimization (ALAM). The simulations support the ideas presented in the paper. The reasons behind the diverging behavior of autocorrelation based algorithms to shorten the ADSL channels are also elaborated. The paper also serves to identify lags which can be minimized in the true sense of channel shortening. It is found that these lag values are not driven by the nature of the impulse response of the underlying channel. They always try to shorten a channel around its mid point. Therefore, it is conjectured that if the channel has its mass of energy around its mid point, ALAM is flexible and will successfully shorten it to different desired window lengths without any diverging behavior. On the other hand, SAM, which blindly minimizes all of the channel taps in its cost function, is expected to fail in such situations. The failure will come in the form of no shortening at all OR divergence from the optimal point.
基于任意滞后自相关最小化(ALAM)的盲自适应信道缩短算法
信道缩短的目的是将信道压缩在更短的跨度内,以提高多载波通信系统的带宽和功耗效率。研究了基于自相关最小化的信道缩短算法。如果一个白色信号被输入到一个具有短跨度的滤波器中,则在输出信号中引入的自相关很小。SAM算法预计反过来也可能成立。因此,它通过在一定滞后范围内最小化通道输出的和平方自相关来执行通道缩短。结果表明,最小化通道输出的自相关并不等同于将通道压缩在一个传染窗口中。只要关注ADSL信道,就可以通过在代价函数中使用单个自相关来实现相同的信道缩短。使用一系列的自相关性是不明智的,也是矫枉过正的。此外,这种单一的自相关并不特定于任何特定的滞后值。这一发现不仅降低了SLAM中SAM的计算复杂度,而且有助于深入了解基于自相关的信道缩短算法的动态特性。该算法被命名为任意滞后自相关最小化(ALAM)。仿真结果支持了本文提出的观点。并阐述了基于自相关的ADSL信道缩短算法产生发散行为的原因。本文还用于识别在真正意义上的信道缩短中可以最小化的滞后。发现这些滞后值不是由底层信道的脉冲响应性质驱动的。他们总是试图缩短通道的中点。因此,我们推测,如果通道的能量质量在其中点附近,则ALAM是灵活的,可以成功地将其缩短到所需的不同窗口长度,而不会产生发散行为。另一方面,SAM在其成本函数中盲目地最小化所有通道,预计在这种情况下会失败。失败的形式是根本不缩短或偏离最优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信