Recursive Finite Interval Constant Modulus Algorithm for blind equalization.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F02%3A16020187" target="_blank" >RIV/67985556:_____/02:16020187 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Recursive Finite Interval Constant Modulus Algorithm for blind equalization.
Original language description
In the paper, we reexamine the Finite Interval Constant Modulus Algorithm (FI-CMA) proposed by P.Regalia and we present our modifications leading to its recursive form. The proposed modifications are based on recursive updates of QR decomposition. The presented results shows the computation savings and ability to use Recursive FI-CMA for tracking time variant channels.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
MATLAB 2002. Sborník příspěvků 10. ročníku konference.
ISBN
80-7080-500-5
ISSN
—
e-ISSN
—
Number of pages
9
Pages from-to
133-141
Publisher name
VŠCHT
Place of publication
Praha
Event location
Praha [CZ]
Event date
Nov 7, 2002
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—