Evaluation of channel coding and decoding algorithms using discrete chaotic maps

In this paper we address the design of channel encoding algorithms using one-dimensional nonlinear chaotic maps starting from the desired invariant probability density function (pdf) of the data sent to the channel. We show that, with some simple changes, it is straightforward to make use of a known...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Chaos (Woodbury, N.Y.) Ročník 16; číslo 1; s. 013103
Hlavní autori: Escribano, Francisco J, López, Luis, Sanjuán, Miguel A F
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: United States 01.03.2006
ISSN:1054-1500
On-line prístup:Zistit podrobnosti o prístupe
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract In this paper we address the design of channel encoding algorithms using one-dimensional nonlinear chaotic maps starting from the desired invariant probability density function (pdf) of the data sent to the channel. We show that, with some simple changes, it is straightforward to make use of a known encoding framework based upon the Bernoulli shift map and adapt it readily to carry the information bit sequence produced by a binary source in a practical way. On the decoder side, we introduce four already known decoding algorithms and compare the resulting performance of the corresponding transmitters. The performance in terms of the bit error rate shows that the most important design clue is related not only to the pdf of the data produced by the chosen discrete map: the own dynamics of the maps is also of the highest importance and has to be taken into account when designing the whole transmitting and receiving system. We also show that a good performance in such systems needs the extensive use of all the evidence stored in the whole chaotic sequence.
AbstractList In this paper we address the design of channel encoding algorithms using one-dimensional nonlinear chaotic maps starting from the desired invariant probability density function (pdf) of the data sent to the channel. We show that, with some simple changes, it is straightforward to make use of a known encoding framework based upon the Bernoulli shift map and adapt it readily to carry the information bit sequence produced by a binary source in a practical way. On the decoder side, we introduce four already known decoding algorithms and compare the resulting performance of the corresponding transmitters. The performance in terms of the bit error rate shows that the most important design clue is related not only to the pdf of the data produced by the chosen discrete map: the own dynamics of the maps is also of the highest importance and has to be taken into account when designing the whole transmitting and receiving system. We also show that a good performance in such systems needs the extensive use of all the evidence stored in the whole chaotic sequence.In this paper we address the design of channel encoding algorithms using one-dimensional nonlinear chaotic maps starting from the desired invariant probability density function (pdf) of the data sent to the channel. We show that, with some simple changes, it is straightforward to make use of a known encoding framework based upon the Bernoulli shift map and adapt it readily to carry the information bit sequence produced by a binary source in a practical way. On the decoder side, we introduce four already known decoding algorithms and compare the resulting performance of the corresponding transmitters. The performance in terms of the bit error rate shows that the most important design clue is related not only to the pdf of the data produced by the chosen discrete map: the own dynamics of the maps is also of the highest importance and has to be taken into account when designing the whole transmitting and receiving system. We also show that a good performance in such systems needs the extensive use of all the evidence stored in the whole chaotic sequence.
In this paper we address the design of channel encoding algorithms using one-dimensional nonlinear chaotic maps starting from the desired invariant probability density function (pdf) of the data sent to the channel. We show that, with some simple changes, it is straightforward to make use of a known encoding framework based upon the Bernoulli shift map and adapt it readily to carry the information bit sequence produced by a binary source in a practical way. On the decoder side, we introduce four already known decoding algorithms and compare the resulting performance of the corresponding transmitters. The performance in terms of the bit error rate shows that the most important design clue is related not only to the pdf of the data produced by the chosen discrete map: the own dynamics of the maps is also of the highest importance and has to be taken into account when designing the whole transmitting and receiving system. We also show that a good performance in such systems needs the extensive use of all the evidence stored in the whole chaotic sequence.
Author Escribano, Francisco J
López, Luis
Sanjuán, Miguel A F
Author_xml – sequence: 1
  givenname: Francisco J
  surname: Escribano
  fullname: Escribano, Francisco J
  email: francisco.escribano@urjc.es
  organization: Nonlinear Dynamics and Chaos Group, Departamento de Matemáticas y Física Aplicadas y Ciencias de la Naturaleza, Universidad Rey Juan Carlos, C/ Tulipán, s/n, 28933 Móstoles, Madrid, Spain. francisco.escribano@urjc.es
– sequence: 2
  givenname: Luis
  surname: López
  fullname: López, Luis
– sequence: 3
  givenname: Miguel A F
  surname: Sanjuán
  fullname: Sanjuán, Miguel A F
BackLink https://www.ncbi.nlm.nih.gov/pubmed/16599734$$D View this record in MEDLINE/PubMed
BookMark eNo1UD1PwzAU9FBEP2DgDyBPbCnPSWzHI6rKh1QJBpijV_u5DUrsEidI_HuoaKfTne5Op5uzSYiBGLsRsBSginuxzEWuKtATNhMgy0xIgCmbp_QJACIv5CWbCiWN0UU5Y2_rb2xHHJoYePTc7jEEarmNrgk7jsFxR2fS7mLfDPsu8TEdBdck29NAx1QcGss7PKQrduGxTXR9wgX7eFy_r56zzevTy-phk9lCVUNmhPBkgXBrjC_AlqA0Wicr74wsJWxLAisJjdWkPJGSZFSBFYHPhUbMF-zuv_fQx6-R0lB3f3OobTFQHFOtdFUKLao_4-3JOG47cvWhbzrsf-rzB_kvjYJdyQ
ContentType Journal Article
DBID NPM
7X8
DOI 10.1063/1.2126807
DatabaseName PubMed
MEDLINE - Academic
DatabaseTitle PubMed
MEDLINE - Academic
DatabaseTitleList MEDLINE - Academic
PubMed
Database_xml – sequence: 1
  dbid: NPM
  name: PubMed
  url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
– sequence: 2
  dbid: 7X8
  name: MEDLINE - Academic
  url: https://search.proquest.com/medline
  sourceTypes: Aggregation Database
DeliveryMethod no_fulltext_linktorsrc
Discipline Sciences (General)
Physics
ExternalDocumentID 16599734
Genre Journal Article
GroupedDBID ---
-~X
.DC
0ZJ
1UP
2-P
29B
4.4
53G
5VS
6TJ
8WZ
A6W
AAAAW
AABDS
AAEUA
AAPUP
AAYIH
ABJGX
ABJNI
ACBRY
ACGFS
ACLYJ
ACNCT
ACZLF
ADCTM
AEJMO
AENEX
AFATG
AFFNX
AFHCQ
AGKCL
AGLKD
AGMXG
AGTJO
AHSDT
AJJCW
AJQPL
ALEPV
ALMA_UNASSIGNED_HOLDINGS
AQWKA
ATXIE
AWQPM
BDMKI
BPZLN
DU5
EBS
EJD
ESX
F5P
FDOHQ
FFFMQ
HAM
M6X
M71
M73
N9A
NEUPN
NPM
NPSNA
O-B
P2P
RDFOP
RIP
RNS
ROL
RQS
TAE
WH7
WHG
7X8
AAGWI
AMVHM
ID FETCH-LOGICAL-c368t-911fec0eab99f30c4067acd58fd95450b4e0c5ea9c7e6fee65e963a8e0f217aa2
IEDL.DBID 7X8
ISICitedReferencesCount 7
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000236464500003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1054-1500
IngestDate Fri Jul 11 07:22:22 EDT 2025
Wed Feb 19 01:48:58 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c368t-911fec0eab99f30c4067acd58fd95450b4e0c5ea9c7e6fee65e963a8e0f217aa2
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
PMID 16599734
PQID 67841718
PQPubID 23479
ParticipantIDs proquest_miscellaneous_67841718
pubmed_primary_16599734
PublicationCentury 2000
PublicationDate 2006-03-01
PublicationDateYYYYMMDD 2006-03-01
PublicationDate_xml – month: 03
  year: 2006
  text: 2006-03-01
  day: 01
PublicationDecade 2000
PublicationPlace United States
PublicationPlace_xml – name: United States
PublicationTitle Chaos (Woodbury, N.Y.)
PublicationTitleAlternate Chaos
PublicationYear 2006
SSID ssj0001235
Score 1.800265
Snippet In this paper we address the design of channel encoding algorithms using one-dimensional nonlinear chaotic maps starting from the desired invariant probability...
SourceID proquest
pubmed
SourceType Aggregation Database
Index Database
StartPage 013103
Title Evaluation of channel coding and decoding algorithms using discrete chaotic maps
URI https://www.ncbi.nlm.nih.gov/pubmed/16599734
https://www.proquest.com/docview/67841718
Volume 16
WOSCitedRecordID wos000236464500003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEB6qVfCitr7qMwcPeljMPpLdgCAiLV4sPSj0VtLspArtbu1Wf7-T7a6exIOXQA4hIZnHN5kXwKUYh8KSmezFYYRe5KP0EqFjT8ZGhlGkwkhHZbOJuN9PhkM1aMBtnQvjwiprmVgK6jQ37o_8RjoHGQnSu_m753pGOd9q1UBjDZohARkX0BUPf2qFuyzQ0tcpIo9gD6_rCsnwhgxDP5AJj3_HlaV-6e3872S7sF3hSna_IoQWNDBrw2YZ32mKNrQqHi7YVVVo-noPBt3vUt8st8zlAGc4ZSZ3-ozpLGUp1pPphDZdvs4K5iLlJ8xl8y4IcLtVOe3JZnpe7MNLr_v88OhVHRY8E8pk6SSdRcNRj5WiFzOk3WNtUpHYVBG04uMIuRGolYlRWkQpkBhWJ8gtmTJaBwewnuUZHgFLfLSBNMpy60w0rceBJPBoBZcYcKE7cFHf3ogo2LkldIb5RzGq768Dh6sHGM1XhTZGvhRKEREd_7n2BLZWfyMuOOwUmpZ4F89gw3wu34rFeUkYNPYHT1_KHcKu
linkProvider ProQuest
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Evaluation+of+channel+coding+and+decoding+algorithms+using+discrete+chaotic+maps&rft.jtitle=Chaos+%28Woodbury%2C+N.Y.%29&rft.au=Escribano%2C+Francisco+J&rft.au=L%C3%B3pez%2C+Luis&rft.au=Sanju%C3%A1n%2C+Miguel+A+F&rft.date=2006-03-01&rft.issn=1054-1500&rft.volume=16&rft.issue=1&rft.spage=013103&rft_id=info:doi/10.1063%2F1.2126807&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1054-1500&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1054-1500&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1054-1500&client=summon