bibtype |
C -
Conference Paper (international conference)
|
ARLID |
0410973 |
utime |
20240103182252.6 |
mtime |
20060210235959.9 |
ISBN |
80-7080-500-5 |
title
(primary) (eng) |
Recursive Finite Interval Constant Modulus Algorithm for blind equalization |
part_num |
1 |
publisher |
place |
Praha |
name |
VŠCHT |
pub_time |
2002 |
|
specification |
|
serial |
title
|
MATLAB 2002. Sborník příspěvků 10. ročníku konference |
page_num |
133-141 |
|
keyword |
blind equalization |
keyword |
signal processing |
keyword |
telecommunication |
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 |
09H |
cas_special |
project |
project_id |
33544 |
agency |
Esprit |
country |
XE |
|
research |
CEZ:AV0Z1075907 |
abstract
(eng) |
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. |
action |
ARLID |
cav_un_auth*0212971 |
name |
MATLAB 2002 |
place |
Praha |
country |
CZ |
dates |
07.11.2002 |
|
RIV |
JC |
department |
ZS |
permalink |
http://hdl.handle.net/11104/0131060 |
ID_orig |
UTIA-B 20020187 |
arlyear |
2002 |
mrcbU10 |
2002 |
mrcbU10 |
Praha VŠCHT |
mrcbU12 |
80-7080-500-5 |
mrcbU63 |
MATLAB 2002. Sborník příspěvků 10. ročníku konference 133 141 MATLAB 2002. Proceedings of the 10th conference |
|