| bibtype |
C -
Conference Paper (international conference)
|
| ARLID |
0411133 |
| utime |
20240103182304.3 |
| mtime |
20060210235959.9 |
| ISBN |
80-227-1939-0 |
| title
(primary) (eng) |
Comparison of two recursive constant modulus algorithms |
| publisher |
| place |
Bratislava |
| name |
Slovak University of Technology |
| pub_time |
2003 |
|
| specification |
|
| serial |
| title
|
Proceedings of the 4th Electronic Circuits and Systems Conference |
| page_num |
159-162 |
| editor |
|
| editor |
| name1 |
Stopjaková |
| name2 |
V. |
|
|
| keyword |
blind equalization |
| keyword |
constant modulus algorithm |
| author
(primary) |
| ARLID |
cav_un_auth*0101105 |
| name1 |
Heřmánek |
| name2 |
Antonín |
| institution |
UTIA-B |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| author
|
| ARLID |
cav_un_auth*0021102 |
| name1 |
Regalia |
| name2 |
P. |
| country |
FR |
|
| COSATI |
09G |
| COSATI |
09H |
| cas_special |
| research |
CEZ:AV0Z1075907 |
| abstract
(eng) |
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. |
| action |
| ARLID |
cav_un_auth*0213064 |
| name |
International Conference on Electronic Circuits and Systems. /4./ |
| place |
Bratislava |
| country |
SK |
| dates |
11.09.2003-12.09.2003 |
|
| RIV |
JC |
| department |
ZS |
| permalink |
http://hdl.handle.net/11104/0131220 |
| ID_orig |
UTIA-B 20030120 |
| arlyear |
2003 |
| mrcbU10 |
2003 |
| mrcbU10 |
Bratislava Slovak University of Technology |
| mrcbU12 |
80-227-1939-0 |
| mrcbU63 |
Proceedings of the 4th Electronic Circuits and Systems Conference 159 162 |
| mrcbU67 |
Butaš J. 340 |
| mrcbU67 |
Stopjaková V. 340 |
|