Loading…

Constant modulus blind equalisation algorithms under soft constraint satisfaction

New constant modulus (CM) algorithms are presented that are based on soft constraint satisfaction. The stationary points of an algorithm in this family are studied for an AR(p) channel and it is shown that Ding-type undesirable local solutions (ULS) do not exist. This is due to the normalisation of...

Full description

Saved in:
Bibliographic Details
Main Authors: Oguz Tanrikulu, Buyurman Baykal, A.G. Constantinides, Jonathon Chambers
Format: Default Conference proceeding
Published: 1997
Subjects:
Online Access:https://hdl.handle.net/2134/5862
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1818176096062930944
author Oguz Tanrikulu
Buyurman Baykal
A.G. Constantinides
Jonathon Chambers
author_facet Oguz Tanrikulu
Buyurman Baykal
A.G. Constantinides
Jonathon Chambers
author_sort Oguz Tanrikulu (7207646)
collection Figshare
description New constant modulus (CM) algorithms are presented that are based on soft constraint satisfaction. The stationary points of an algorithm in this family are studied for an AR(p) channel and it is shown that Ding-type undesirable local solutions (ULS) do not exist. This is due to the normalisation of the gradient vector and the soft nonlinearity used in these algorithms. Error performance surfaces (EPS) and convergence trajectories from arbitrary initialisations are presented for various channels that support the analytical findings
format Default
Conference proceeding
id rr-article-9555200
institution Loughborough University
publishDate 1997
record_format Figshare
spelling rr-article-95552001997-01-01T00:00:00Z Constant modulus blind equalisation algorithms under soft constraint satisfaction Oguz Tanrikulu (7207646) Buyurman Baykal (7207649) A.G. Constantinides (7207652) Jonathon Chambers (7121624) Mechanical engineering not elsewhere classified untagged Mechanical Engineering not elsewhere classified New constant modulus (CM) algorithms are presented that are based on soft constraint satisfaction. The stationary points of an algorithm in this family are studied for an AR(p) channel and it is shown that Ding-type undesirable local solutions (ULS) do not exist. This is due to the normalisation of the gradient vector and the soft nonlinearity used in these algorithms. Error performance surfaces (EPS) and convergence trajectories from arbitrary initialisations are presented for various channels that support the analytical findings 1997-01-01T00:00:00Z Text Conference contribution 2134/5862 https://figshare.com/articles/conference_contribution/Constant_modulus_blind_equalisation_algorithms_under_soft_constraint_satisfaction/9555200 CC BY-NC-ND 4.0
spellingShingle Mechanical engineering not elsewhere classified
untagged
Mechanical Engineering not elsewhere classified
Oguz Tanrikulu
Buyurman Baykal
A.G. Constantinides
Jonathon Chambers
Constant modulus blind equalisation algorithms under soft constraint satisfaction
title Constant modulus blind equalisation algorithms under soft constraint satisfaction
title_full Constant modulus blind equalisation algorithms under soft constraint satisfaction
title_fullStr Constant modulus blind equalisation algorithms under soft constraint satisfaction
title_full_unstemmed Constant modulus blind equalisation algorithms under soft constraint satisfaction
title_short Constant modulus blind equalisation algorithms under soft constraint satisfaction
title_sort constant modulus blind equalisation algorithms under soft constraint satisfaction
topic Mechanical engineering not elsewhere classified
untagged
Mechanical Engineering not elsewhere classified
url https://hdl.handle.net/2134/5862