Paper
7 June 1995 Parallel filter structures for RLS-type blind equalization algorithms
Marc Moonen, Ed F. A. Deprettere
Author Affiliations +
Abstract
It is shown that several RLS-type blind equalization algorithms, e.g., decision-directed schemes as well as 'orthogonalized' constant modulus algorithms, possess a common algorithmic structure and are therefore straightforwardly implemented on an earlier developed triangular array (filter structure) for recursive least squares estimation with inverse updating. While the computational complexity for such algorithms is O(N2), where N is the problem size, the throughput rate for the array implementation is O(1), i.e., independent of the problem size. Such a throughput rate cannot be achieved with standard (Gentleman-Kung- type) RLS/QR-updating arrays because of feedback loops in the computational schemes.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Marc Moonen and Ed F. A. Deprettere "Parallel filter structures for RLS-type blind equalization algorithms", Proc. SPIE 2563, Advanced Signal Processing Algorithms, (7 June 1995); https://doi.org/10.1117/12.211420
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Algorithm development

Evolutionary algorithms

Digital filtering

Chemical elements

Feedback loops

Detection and tracking algorithms

Data transmission

Back to Top