MMSE and ML estimation of chaotic sequences with coded signs with applications in coding discrete-time analog signals

Isaac Rosenhouse, Anthony J. Weiss

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We consider estimation of a set of tent-map chaotic sequences. These sequences are obtained by iterating a one dimensional chaotic function in the (-1,1) domain. We demonstrate how to construct a set of n sequences, in which information in the form of n arbitrary samples in the (-1,1) domain is embedded. Additionally the signs of all sequences jointly form a valid digital codeword. Each sequence in the set consists of m elements, hence the set of sequences is equivalent to a rate 1/m analog error correcting-code. We present performance in terms of coding gain when maximum likelihood (ML) and minimum-mean-square-error (MMSE) estimation approaches are employed.

Original languageEnglish
Title of host publication2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP
Pages2981-2984
Number of pages4
DOIs
StatePublished - 2008
Event2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP - Las Vegas, NV, United States
Duration: 31 Mar 20084 Apr 2008

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN (Print)1520-6149

Conference

Conference2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP
Country/TerritoryUnited States
CityLas Vegas, NV
Period31/03/084/04/08

Keywords

  • Chaos
  • Communication system signaling
  • Error correction coding
  • Estimation

Fingerprint

Dive into the research topics of 'MMSE and ML estimation of chaotic sequences with coded signs with applications in coding discrete-time analog signals'. Together they form a unique fingerprint.

Cite this