Title | ||
---|---|---|
Schroeder sequences for time dispersive frequency selective channel estimation using DFT and Least Sum of Squared Errors methods. |
Abstract | ||
---|---|---|
Digital communication systems operating on time varying depressive channels often employ a signalling format in which customer data are organized in blocks proceeded by a known sequence. The training sequence at the beginning of each block is used to train an adaptive equalizer and/or data sequence detector to combat intersymbol interference (ISI). This paper addresses the problem of comparing the Schroeder sequences as a very close to optimal training sequence for channel estimation (start up) in communication systems over time dispersive frequency selective channels. Schroeder sequences of comparable lengths to the designed -computer searched- sequences demonstrated a tight performance for both the optimal sequences designed using Discrete Fourier Transform (DFT) technique and the sequences designed via Least Sum of Squared Errors (LSSE) channel estimation, Performance results are provided for Schroeder sequences of lengths 36 and 28 (the choice of 28 is driven by the fact that channel estimation sequences for GSM system are of length 28). |
Year | DOI | Venue |
---|---|---|
2002 | 10.1109/ICASSP.2002.5745188 | ICASSP |
Field | DocType | Volume |
Intersymbol interference,Square (algebra),Computer science,Communications system,Adaptive equalizer,Artificial intelligence,Detector,GSM,Pattern recognition,Algorithm,Communication channel,Speech recognition,Discrete Fourier transform | Conference | 3 |
ISSN | Citations | PageRank |
1520-6149 | 1 | 0.39 |
References | Authors | |
4 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Messaoud Ahmed-Ouameur | 1 | 7 | 5.94 |
Daniel Massicotte | 2 | 6 | 2.86 |