Grant: Engage Grants Program
University of Saskatchewan
$25,000.00
Joint synchronization and channel equalization for high-speed modems
FY 2012-13
Summary
High-speed data burst transmissions by multiple users over multi-path channels require an efficient timing and
carrier synchronization mechanism as well as a fast-converging adaptive equalization algorithm. When the
channel characteristics do not change too rapidly, transmit equalization at each user's terminal can help to
reduce the signal processing workload at the receiver. The basic idea is that each user pre-distorts its
transmitted signal according to the inverse of the channel distortion so that the signal coming to the receiver is
almost free of distortion. In such an approach, the receiver needs to estimate the channels, compute the transmit
equalization coefficients for all channels and send them back to each user.
There have been considerable research efforts dealing with adaptive equalization at the receiver side. The
algorithms used to adapt the coefficients of these equalizers can be categorized into two main classes: least
mean squares (LMS) and recursive least squares (RLS). While the RLS-based algorithms converge more
quickly, their high complexity may only be suitable for an ASIC-based demodulator. The aim of this research
project is to develop a fast-converging LMS-based transmit equalization algorithm suitable for FPGA-based
implementation. The focus shall be on exploring new training sequences since they strongly affect the
convergence behavior of the equalizer as well as the performance of the timing and carrier synchronization.
With an efficient training sequence, initial equalization coefficients can also be computed, which, in turn, can
accelerate the convergence speed of the equalizer. In fact, timing and carrier synchronization can be carried out
in parallel with the power estimation and equalizer training in order to reduce the acquisition time of the whole
process. When higher-order modulation schemes are used, which is usually the case in high-speed modems, an
increased precision in the estimation of acquisition parameters is required. The trade-offs between the required
accuracy and practicality of the proposed algorithms shall also be considered in the project.
Program
Engage Grants Program
Recipient
Location
Saskatchewan, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
429992-2012
Name nom
Nguyen, Ha
Department département
Electrical & Computer Engineering
Organization id
16
Institution établissement
University of Saskatchewan
Province en
Saskatchewan
Province fr
Saskatchewan
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2012
Competition year année de concours
2012
Award amount
25000
Program id
EGP
Program name en
Engage Grants Program
Program name fr
Programme de subventions d'engagement partenariat
Group en
Research partnerships programs
Group fr
Programmes de partenariat
Committee code
1555
Committee name en
Prairie Internal Decision Committee
Committee name fr
Comité de décision interne pour les Prairies
Area of application code
805
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Communications technologies (satellites, radar, etc.)
Area of application fr
Technologie des télécommunications (satellites, radar,etc.)
Research subject code
2507
Research subject group en
Electrical and electronic engineering
Research subject group fr
Génie électrique et électronique
Research subject en
Communications systems
Research subject fr
Systèmes de télécommunications
Partie
1
Nb partie
1
Application title
Joint synchronization and channel equalization for high-speed modems
Keyword
NSERC
Application summary
High-speed data burst transmissions by multiple users over multi-path channels require an efficient timing and
carrier synchronization mechanism as well as a fast-converging adaptive equalization algorithm. When the
channel characteristics do not change too rapidly, transmit equalization at each user's terminal can help to
reduce the signal processing workload at the receiver. The basic idea is that each user pre-distorts its
transmitted signal according to the inverse of the channel distortion so that the signal coming to the receiver is
almost free of distortion. In such an approach, the receiver needs to estimate the channels, compute the transmit
equalization coefficients for all channels and send them back to each user.
There have been considerable research efforts dealing with adaptive equalization at the receiver side. The
algorithms used to adapt the coefficients of these equalizers can be categorized into two main classes: least
mean squares (LMS) and recursive least squares (RLS). While the RLS-based algorithms converge more
quickly, their high complexity may only be suitable for an ASIC-based demodulator. The aim of this research
project is to develop a fast-converging LMS-based transmit equalization algorithm suitable for FPGA-based
implementation. The focus shall be on exploring new training sequences since they strongly affect the
convergence behavior of the equalizer as well as the performance of the timing and carrier synchronization.
With an efficient training sequence, initial equalization coefficients can also be computed, which, in turn, can
accelerate the convergence speed of the equalizer. In fact, timing and carrier synchronization can be carried out
in parallel with the power estimation and equalizer training in order to reduce the acquisition time of the whole
process. When higher-order modulation schemes are used, which is usually the case in high-speed modems, an
increased precision in the estimation of acquisition parameters is required. The trade-offs between the required
accuracy and practicality of the proposed algorithms shall also be considered in the project.