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

Isaac Rosenhouse; Anthony J. Weiss

doi:10.1109/ICASSP.2008.4518276

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

Isaac Rosenhouse^*, Anthony J. Weiss

^*Corresponding author for this work

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP
Pages	2981-2984
Number of pages	4
DOIs	https://doi.org/10.1109/ICASSP.2008.4518276
State	Published - 2008
Event	2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP - Las Vegas, NV, United States Duration: 31 Mar 2008 → 4 Apr 2008

Publication series

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

Conference

Conference	2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP
Country/Territory	United States
City	Las Vegas, NV
Period	31/03/08 → 4/04/08

Keywords

Chaos
Communication system signaling
Error correction coding
Estimation

Access to Document

10.1109/ICASSP.2008.4518276

Cite this

Rosenhouse, I., & Weiss, A. J. (2008). MMSE and ML estimation of chaotic sequences with coded signs with applications in coding discrete-time analog signals. In 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP (pp. 2981-2984). Article 4518276 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings). https://doi.org/10.1109/ICASSP.2008.4518276

@inproceedings{e16c49a5e8a844d5b6c58095a5798dce,

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

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.",

keywords = "Chaos, Communication system signaling, Error correction coding, Estimation",

author = "Isaac Rosenhouse and Weiss, {Anthony J.}",

year = "2008",

doi = "10.1109/ICASSP.2008.4518276",

language = "אנגלית",

isbn = "1424414849",

series = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",

pages = "2981--2984",

booktitle = "2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP",

note = "2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP ; Conference date: 31-03-2008 Through 04-04-2008",

}

Rosenhouse, I & Weiss, AJ 2008, MMSE and ML estimation of chaotic sequences with coded signs with applications in coding discrete-time analog signals. in 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP., 4518276, ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, pp. 2981-2984, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP, Las Vegas, NV, United States, 31/03/08. https://doi.org/10.1109/ICASSP.2008.4518276

MMSE and ML estimation of chaotic sequences with coded signs with applications in coding discrete-time analog signals. / Rosenhouse, Isaac; Weiss, Anthony J.
2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP. 2008. p. 2981-2984 4518276 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Rosenhouse, Isaac

AU - Weiss, Anthony J.

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

KW - Chaos

KW - Communication system signaling

KW - Error correction coding

KW - Estimation

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

U2 - 10.1109/ICASSP.2008.4518276

DO - 10.1109/ICASSP.2008.4518276

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:51449111776

SN - 1424414849

SN - 9781424414840

T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

SP - 2981

EP - 2984

BT - 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP

T2 - 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP

Y2 - 31 March 2008 through 4 April 2008

ER -

Rosenhouse I, Weiss AJ. MMSE and ML estimation of chaotic sequences with coded signs with applications in coding discrete-time analog signals. In 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP. 2008. p. 2981-2984. 4518276. (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings). doi: 10.1109/ICASSP.2008.4518276

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

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this