Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Exploiting symbolic dynamics in chaos coded communications with maximum a posteriori algorithm

Exploiting symbolic dynamics in chaos coded communications with maximum a posteriori algorithm

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

  • Author(s): F.J. Escribano 1 ; L. López 2 ; M.A.F. Sanjuán 1
    • View affiliations
    • Affiliations: 1: Nonlinear Dynamics and Chaos Group, Departamento de Matemáticas y Fısica Aplicadas y Ciencias de la Naturaleza, Universidad Rey Juan Carlos, Móstoles, Spain
      2: Laboratorio de Algoritmia Distribuida y Redes, Departamento de Informática, Estadıstica y Telemática, Universidad Rey Juan Carlos, Móstoles, Spain
  • Source: Volume 42, Issue 17, 17 August 2006, p. 984 – 986
    DOI:  10.1049/el:20060649 , Print ISSN 0013-5194, Online ISSN 1350-911X
© The Institution of Engineering and Technology
Published

A known maximum a posteriori (MAP) algorithm is adapted to decode chaotic signals sent over a noisy channel and get a low complexity MAP decoder that could be easily implemented. It is shown that this algorithm is useful for all chaotic encoding frameworks where symbolic dynamics could be applied and that the final bit error rate is better than that obtained with other usually employed maximum likelihood (ML) algorithms of similar complexity.

Inspec keywords: chaotic communication; communication complexity; error statistics; decoding; maximum likelihood estimation

Other keywords: maximum likelihood algorithms; chaotic signals decoding; bit error rate; symbolic dynamics; chaos coded communications; chaotic encoding frameworks; maximum a posteriori algorithm

Subjects: Communication system theory; Codes; Other topics in statistics

References

    1. 1)
      • L. Bahl , J. Cocke , F. Jelinek , J. Raviv . Optimal decoding of linear codes for minimizing symbol error rate. IEEE Trans. Inf. Theory , 2 , 284 - 287
    2. 2)
      • A. Kisel , H. Dedieu , T. Schimming . Maximum likelihood approaches for noncoherent communications with chaotic carriers. IEEE Trans. Commun. , 5 , 533 - 542
    3. 3)
      • C. Pantaleon . Bayesian estimation of chaotic signals generated by piecewise-linear maps. IEEE Trans. Signal Process. , 3 , 659 - 664
    4. 4)
      • J. Schweizer , T. Schimming . Symbolic dynamics for processing chaotic signals – II: Communication and coding. IEEE Trans. Circuits Syst. I, Fundam. Theory Appl. , 11 , 1283 - 1295
    5. 5)
      • C. Pantaleon , D. Luengo , I. Santamaria . Optimal estimation of chaotic signals generated by piecewise-linear maps. IEEE Signal Process. Lett. , 8 , 235 - 237
    6. 6)
      • M. Ciftci , D. Williams . Optimal estimation and sequential channel equalization algorithms for chaotic communications systems. EURASIP J. Appl. Signal Process. , 249 - 256
    7. 7)
      • Kozic, S., Oshima, K., Schimming, T.: `Minimum distance properties of coded modulations based on iterated chaotic maps', Proc. NDES, May 2003, Scuol, Switzerland, p. 141–144.
    8. 8)
http://iet.metastore.ingenta.com/content/journals/10.1049/el_20060649
Loading

Related content

content/journals/10.1049/el_20060649
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address