Blind channel identification using evolutionary programming

C. Kalluri, S. S. Rao, Sudarshan Rao Nelatury

Research output: Contribution to journalArticle

Abstract

The problem of blind channel identification involves estimation of the channel coefficients based on the received noisy signal. The coefficients are estimated by using higher order cumulant fitting of the received signal. The optimization of the cumulant-fitting cost function is a multimodal problem, and conventional approaches using gradient algorithms often involve local optima in the absence of a good initial estimate. In this paper, we use evolutionary algorithms which evolve towards better regions of search space by means of randomized processes of selection and variation, to optimize the cost function. The effectiveness of genetic algorithms as well as evolutionary programming using self-adaptive mutation as stochastic optimization techniques is studied, and the results presented for the blind channel identification problem.

Original languageEnglish (US)
Pages (from-to)1212-1216
Number of pages5
JournalConference Record of the Asilomar Conference on Signals, Systems and Computers
Volume2
StatePublished - 2000

Fingerprint

Evolutionary algorithms
Cost functions
Genetic algorithms

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

@article{44ee4212226c4f9a99f66d501e46ee9c,
title = "Blind channel identification using evolutionary programming",
abstract = "The problem of blind channel identification involves estimation of the channel coefficients based on the received noisy signal. The coefficients are estimated by using higher order cumulant fitting of the received signal. The optimization of the cumulant-fitting cost function is a multimodal problem, and conventional approaches using gradient algorithms often involve local optima in the absence of a good initial estimate. In this paper, we use evolutionary algorithms which evolve towards better regions of search space by means of randomized processes of selection and variation, to optimize the cost function. The effectiveness of genetic algorithms as well as evolutionary programming using self-adaptive mutation as stochastic optimization techniques is studied, and the results presented for the blind channel identification problem.",
author = "C. Kalluri and Rao, {S. S.} and Nelatury, {Sudarshan Rao}",
year = "2000",
language = "English (US)",
volume = "2",
pages = "1212--1216",
journal = "Conference Record of the Asilomar Conference on Signals, Systems and Computers",
issn = "1058-6393",
publisher = "IEEE Computer Society",

}

Blind channel identification using evolutionary programming. / Kalluri, C.; Rao, S. S.; Nelatury, Sudarshan Rao.

In: Conference Record of the Asilomar Conference on Signals, Systems and Computers, Vol. 2, 2000, p. 1212-1216.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Blind channel identification using evolutionary programming

AU - Kalluri, C.

AU - Rao, S. S.

AU - Nelatury, Sudarshan Rao

PY - 2000

Y1 - 2000

N2 - The problem of blind channel identification involves estimation of the channel coefficients based on the received noisy signal. The coefficients are estimated by using higher order cumulant fitting of the received signal. The optimization of the cumulant-fitting cost function is a multimodal problem, and conventional approaches using gradient algorithms often involve local optima in the absence of a good initial estimate. In this paper, we use evolutionary algorithms which evolve towards better regions of search space by means of randomized processes of selection and variation, to optimize the cost function. The effectiveness of genetic algorithms as well as evolutionary programming using self-adaptive mutation as stochastic optimization techniques is studied, and the results presented for the blind channel identification problem.

AB - The problem of blind channel identification involves estimation of the channel coefficients based on the received noisy signal. The coefficients are estimated by using higher order cumulant fitting of the received signal. The optimization of the cumulant-fitting cost function is a multimodal problem, and conventional approaches using gradient algorithms often involve local optima in the absence of a good initial estimate. In this paper, we use evolutionary algorithms which evolve towards better regions of search space by means of randomized processes of selection and variation, to optimize the cost function. The effectiveness of genetic algorithms as well as evolutionary programming using self-adaptive mutation as stochastic optimization techniques is studied, and the results presented for the blind channel identification problem.

UR - http://www.scopus.com/inward/record.url?scp=0034441905&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034441905&partnerID=8YFLogxK

M3 - Article

VL - 2

SP - 1212

EP - 1216

JO - Conference Record of the Asilomar Conference on Signals, Systems and Computers

JF - Conference Record of the Asilomar Conference on Signals, Systems and Computers

SN - 1058-6393

ER -