The cyclic autocorrelation of common digital modulation is researched, and the relationship between the cyclic autocorrelation and the delay, corresponding to the symbol rate, is deduced, then a searching algorithm for the symbol rate is proposed. Theoretical analyses and simulation results show that this method has less computation complexity and is also quite accurate. The estimation result is almost immune to the stationary noise. It's of practical value to modulation recognition and blind demodulation.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Suhua TANG, Yi YU, "Fast Algorithm for Symbol Rate Estimation" in IEICE TRANSACTIONS on Communications,
vol. E88-B, no. 4, pp. 1649-1652, April 2005, doi: 10.1093/ietcom/e88-b.4.1649.
Abstract: The cyclic autocorrelation of common digital modulation is researched, and the relationship between the cyclic autocorrelation and the delay, corresponding to the symbol rate, is deduced, then a searching algorithm for the symbol rate is proposed. Theoretical analyses and simulation results show that this method has less computation complexity and is also quite accurate. The estimation result is almost immune to the stationary noise. It's of practical value to modulation recognition and blind demodulation.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.4.1649/_p
Copy
@ARTICLE{e88-b_4_1649,
author={Suhua TANG, Yi YU, },
journal={IEICE TRANSACTIONS on Communications},
title={Fast Algorithm for Symbol Rate Estimation},
year={2005},
volume={E88-B},
number={4},
pages={1649-1652},
abstract={The cyclic autocorrelation of common digital modulation is researched, and the relationship between the cyclic autocorrelation and the delay, corresponding to the symbol rate, is deduced, then a searching algorithm for the symbol rate is proposed. Theoretical analyses and simulation results show that this method has less computation complexity and is also quite accurate. The estimation result is almost immune to the stationary noise. It's of practical value to modulation recognition and blind demodulation.},
keywords={},
doi={10.1093/ietcom/e88-b.4.1649},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Fast Algorithm for Symbol Rate Estimation
T2 - IEICE TRANSACTIONS on Communications
SP - 1649
EP - 1652
AU - Suhua TANG
AU - Yi YU
PY - 2005
DO - 10.1093/ietcom/e88-b.4.1649
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2005
AB - The cyclic autocorrelation of common digital modulation is researched, and the relationship between the cyclic autocorrelation and the delay, corresponding to the symbol rate, is deduced, then a searching algorithm for the symbol rate is proposed. Theoretical analyses and simulation results show that this method has less computation complexity and is also quite accurate. The estimation result is almost immune to the stationary noise. It's of practical value to modulation recognition and blind demodulation.
ER -