Adaptive algorithms for a flexible equaliser

R Perry, AR Nix, DR Bull

Research output: Chapter in Book/Report/Conference proceedingConference Contribution (Conference Proceeding)

57 Citations (Scopus)

Abstract

In this paper, adaptive algorithms are considered for training a flexible equaliser for application in universal mobile radio receivers. A critical factor in the choice of algorithm is the power consumption of the equaliser, since this will affect the stand-by and talktime of the mobile receiver. The effect of the channel impulse response on the performance of the equaliser is discussed and how knowledge of this impulse response can be used to determine the best timing point for frame synchronisation. The application of parallel diversity and equalisation is also considered for application to rapidly time varying channel impulse responses
Translated title of the contributionAdaptive algorithms for a flexible equaliser
Original languageEnglish
Title of host publicationUnknown
PublisherInstitution of Engineering and Technology (IET)
Pages13/1 - 13/9
Number of pages8
Publication statusPublished - Nov 1994
EventColloquium on Digital and Analogue Filters and Filtering Systems - London, United Kingdom
Duration: 1 Nov 1994 → …

Conference

ConferenceColloquium on Digital and Analogue Filters and Filtering Systems
Country/TerritoryUnited Kingdom
CityLondon
Period1/11/94 → …

Bibliographical note

Conference Proceedings/Title of Journal: 14th IEE Saraga Coll. on Digital and Analogue Filters and Filtering Systems
Other: Number 13
Rose publication type: Conference contribution

Sponsorship: The authors would like to thank the EPSRC and Hewlett Packard Laboratories for their funding of this work. The authors also wish to thank Prof. J. McGeehan for providing facilities within the CCR for carrying out this work

Keywords

  • diversity reception
  • matched filters
  • mobile radio

Fingerprint

Dive into the research topics of 'Adaptive algorithms for a flexible equaliser'. Together they form a unique fingerprint.

Cite this