Low Complexity Adaptive Blind Equalization Using the Frequency Domain Block Constant Modulus Algorithm
Summary :
In this paper, fast algorithms for the CMA (constant modulus algorithm), which is one of the widely used algorithms for blind equalizationi are presented. We propose the FBCMA (frequency domain block CMA) which takes advantage of fast linear convolution in the DFT domain by using the overlap save method. For the FBCMA, a nonlinear error function in the frequency domain is derived using Parseval's relation. Also, an adaptive algorithm in the DFT domain is introduced to adjust the frequency domain filter coefficients. For a block size and filter length of N, the multiplications required for the conventional CMA and proposed FBCMA are on the order of O(N2) and O(N log N), respectively.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E82-B No.10 pp.1694-1698
- Publication Date
- 1999/10/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Radio Communication
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yoon Gi YANG, Sang Uk LEE, "Low Complexity Adaptive Blind Equalization Using the Frequency Domain Block Constant Modulus Algorithm" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 10, pp. 1694-1698, October 1999, doi: .
Abstract: In this paper, fast algorithms for the CMA (constant modulus algorithm), which is one of the widely used algorithms for blind equalizationi are presented. We propose the FBCMA (frequency domain block CMA) which takes advantage of fast linear convolution in the DFT domain by using the overlap save method. For the FBCMA, a nonlinear error function in the frequency domain is derived using Parseval's relation. Also, an adaptive algorithm in the DFT domain is introduced to adjust the frequency domain filter coefficients. For a block size and filter length of N, the multiplications required for the conventional CMA and proposed FBCMA are on the order of O(N2) and O(N log N), respectively.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_10_1694/_p
Copy
@ARTICLE{e82-b_10_1694,
author={Yoon Gi YANG, Sang Uk LEE, },
journal={IEICE TRANSACTIONS on Communications},
title={Low Complexity Adaptive Blind Equalization Using the Frequency Domain Block Constant Modulus Algorithm},
year={1999},
volume={E82-B},
number={10},
pages={1694-1698},
abstract={In this paper, fast algorithms for the CMA (constant modulus algorithm), which is one of the widely used algorithms for blind equalizationi are presented. We propose the FBCMA (frequency domain block CMA) which takes advantage of fast linear convolution in the DFT domain by using the overlap save method. For the FBCMA, a nonlinear error function in the frequency domain is derived using Parseval's relation. Also, an adaptive algorithm in the DFT domain is introduced to adjust the frequency domain filter coefficients. For a block size and filter length of N, the multiplications required for the conventional CMA and proposed FBCMA are on the order of O(N2) and O(N log N), respectively.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Low Complexity Adaptive Blind Equalization Using the Frequency Domain Block Constant Modulus Algorithm
T2 - IEICE TRANSACTIONS on Communications
SP - 1694
EP - 1698
AU - Yoon Gi YANG
AU - Sang Uk LEE
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 1999
AB - In this paper, fast algorithms for the CMA (constant modulus algorithm), which is one of the widely used algorithms for blind equalizationi are presented. We propose the FBCMA (frequency domain block CMA) which takes advantage of fast linear convolution in the DFT domain by using the overlap save method. For the FBCMA, a nonlinear error function in the frequency domain is derived using Parseval's relation. Also, an adaptive algorithm in the DFT domain is introduced to adjust the frequency domain filter coefficients. For a block size and filter length of N, the multiplications required for the conventional CMA and proposed FBCMA are on the order of O(N2) and O(N log N), respectively.
ER -
English
