Comparison of two recursive constant modulus algorithms.
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F03%3A16030120" target="_blank" >RIV/67985556:_____/03:16030120 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Comparison of two recursive constant modulus algorithms.
Original language description
In the paper we compare two recursive constant modulus algorithms for blind equalization: the gradient steap descent CMA and recursive Finite Interval Constant Modulus Algorithm (FI-CMA). Algorithms are tested on the BPSK random data. Their convergence speed and computation requirements is discussed.
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
2003
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
Proceedings of the 4th Electronic Circuits and Systems Conference.
ISBN
80-227-1939-0
ISSN
—
e-ISSN
—
Number of pages
4
Pages from-to
159-162
Publisher name
Slovak University of Technology
Place of publication
Bratislava
Event location
Bratislava [SK]
Event date
Sep 11, 2003
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—