The University of Southampton
University of Southampton Institutional Repository

Multi-stage blind clustering equaliser

Multi-stage blind clustering equaliser
Multi-stage blind clustering equaliser
A multi-stage blind clustering algorithm is proposed for equalisation of multi-level quadrature amplitute modulation (M-$AM) channels. A hierarchical decomposition divides the task of equalising a high-order QAM channel into much simpler sub-tasks. Each sub-task can be accomplished fast and reliably using a blind clustering algorithm derived originally for 4-QAM signals. The constant modulus algorithm (CMA) is used as a benchmark to assess this multi-stage blind equaliser. It is demonstrated that the new blind algorithm achieves much faster convergence and is very robust when input symbols are not sufficiently white. This multi-stage clustering equaliser only requires slightly more computations than the CMA and, like the latter, its computational complexity does not increase as the levels of digital symbols increase.
701 - 705
Chen, Sheng
9310a111-f79a-48b8-98c7-383ca93cbb80
McLaughlin, S
a51618ba-53f2-4815-a492-4f4911f3725d
Grant, P.M.
eedba4d3-5e35-446b-bf5d-34dc76cff3b8
Mulgrew, B.
95a3fbda-7de2-4583-b1f2-0a54a69b414a
Chen, Sheng
9310a111-f79a-48b8-98c7-383ca93cbb80
McLaughlin, S
a51618ba-53f2-4815-a492-4f4911f3725d
Grant, P.M.
eedba4d3-5e35-446b-bf5d-34dc76cff3b8
Mulgrew, B.
95a3fbda-7de2-4583-b1f2-0a54a69b414a

Chen, Sheng, McLaughlin, S, Grant, P.M. and Mulgrew, B. (1995) Multi-stage blind clustering equaliser. IEEE Transacations on Communications, 43 (2/3/4), 701 - 705. (doi:10.1109/26.380093).

Record type: Article

Abstract

A multi-stage blind clustering algorithm is proposed for equalisation of multi-level quadrature amplitute modulation (M-$AM) channels. A hierarchical decomposition divides the task of equalising a high-order QAM channel into much simpler sub-tasks. Each sub-task can be accomplished fast and reliably using a blind clustering algorithm derived originally for 4-QAM signals. The constant modulus algorithm (CMA) is used as a benchmark to assess this multi-stage blind equaliser. It is demonstrated that the new blind algorithm achieves much faster convergence and is very robust when input symbols are not sufficiently white. This multi-stage clustering equaliser only requires slightly more computations than the CMA and, like the latter, its computational complexity does not increase as the levels of digital symbols increase.

Text
TCOM1995-43-2-3-4 - Author's Original
Download (451kB)

More information

Published date: 1 April 1995

Identifiers

Local EPrints ID: 454138
URI: http://eprints.soton.ac.uk/id/eprint/454138
PURE UUID: 12e96221-1ea2-430e-a612-e3c52ef7fdb8

Catalogue record

Date deposited: 01 Feb 2022 17:40
Last modified: 01 Feb 2022 17:40

Export record

Altmetrics

Contributors

Author: Sheng Chen
Author: S McLaughlin
Author: P.M. Grant
Author: B. Mulgrew

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×