Better rate 1/2 coded continuous phase modulation schemes and the M-algorithm
Continuous phase modulation (CPM) signals may be precoded by a convolutional code followed by a mapping rule. Better codes may, however, be obtained by a more general code formed by a finite state machine. We provide improved codes for one such finite state machine. A new description of codes and de...
Saved in:
| Published in | IEEE transactions on information theory Vol. 39; no. 5; pp. 1687 - 1694 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
New York, NY
IEEE
01.09.1993
Institute of Electrical and Electronics Engineers |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0018-9448 |
| DOI | 10.1109/18.259658 |
Cover
| Abstract | Continuous phase modulation (CPM) signals may be precoded by a convolutional code followed by a mapping rule. Better codes may, however, be obtained by a more general code formed by a finite state machine. We provide improved codes for one such finite state machine. A new description of codes and design rules are presented. Better results are demonstrated for the partial response CPM schemes and previous optimum results are matched for the full response case. Tests of an M-algorithm decoder achieve near maximum-likelihood performance with only a fraction of the complexity of the Viterbi algorithm.< > |
|---|---|
| AbstractList | Continuous phase modulation (CPM) signals may be precoded by a convolutional code followed by a mapping rule. Better codes may, however, be obtained by a more general code formed by a finite state machine. We provide improved codes for one such finite state machine. A new description of codes and design rules are presented. Better results are demonstrated for the partial response CPM schemes and previous optimum results are matched for the full response case. Tests of an M-algorithm decoder achieve near maximum-likelihood performance with only a fraction of the complexity of the Viterbi algorithm.< > Continuous phase modulation (CPM) signals may be precoded by a convolutional code followed by a mapping rule. Better codes may, however, be obtained by a more general code formed by a finite state machine. We provide improved codes for one such finite state machine. A new description of codes and design rules are presented. Better results are demonstrated for the partial response CPM schemes and previous optimum results are matched for the full response case. Tests of an M-algorithm decoder achieve near maximum-likelihood performance with only a fraction of the complexity of the Viterbi algorithm |
| Author | Balachandran, K. Anderson, J.B. Pimentel, C.J.-L. Finamore, W.A. |
| Author_xml | – sequence: 1 givenname: K. surname: Balachandran fullname: Balachandran, K. organization: Pacific Commun. Sci. Inc., San Diego, CA, USA – sequence: 2 givenname: J.B. surname: Anderson fullname: Anderson, J.B. – sequence: 3 givenname: W.A. surname: Finamore fullname: Finamore, W.A. – sequence: 4 givenname: C.J.-L. surname: Pimentel fullname: Pimentel, C.J.-L. |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=3976236$$DView record in Pascal Francis |
| BookMark | eNptkL1PwzAQxT0UibYwsDJ5QEgMaf2ROM4IFV9SKxaYI8c5E6PEKbYz8N8TSNUBsdzpdL_39PQWaOZ6BwhdULKilBRrKlcsK0QmZ2hOCJVJkabyFC1C-BjPNKNsjnZ3ECN47FUETNcM676GepwuWjf0Q8D7RgXAXV8PrYq2dzjoBjoIWLkaxwbwLlHte-9tbLozdGJUG-D8sJfo7eH-dfOUbF8enze320RzImJCZZ0XICinmShkJUFxkYsqFwWrdKUl8NQQwwyluZLCpLIymUyZYoxyU_OaL9H15Lv3_ecAIZadDRraVjkYM5dMUpnmgozg1QFUQavWeOW0DeXe2075r5IXuWBcjNjNhGnfh-DBHAlKyp8uSyrLqcuRXf9htY2_zUSvbPuv4nJSWAA4Oh-e3xXigMQ |
| CODEN | IETTAW |
| CitedBy_id | crossref_primary_10_1109_26_481222 |
| Cites_doi | 10.1109/TIT.1982.1056454 10.1109/18.42212 10.1109/18.2634 10.1109/TCOM.1985.1096194 10.1109/TIT.1970.1054541 10.1109/TCOM.1983.1095778 10.1109/18.21225 10.1007/978-1-4899-2031-7 10.1109/26.35369 10.1109/ITS.1990.175658 10.1109/TIT.1984.1056912 10.1007/978-1-4615-3998-8 |
| ContentType | Journal Article |
| Copyright | 1994 INIST-CNRS |
| Copyright_xml | – notice: 1994 INIST-CNRS |
| DBID | AAYXX CITATION IQODW 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1109/18.259658 |
| DatabaseName | CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Applied Sciences |
| EndPage | 1694 |
| ExternalDocumentID | 3976236 10_1109_18_259658 259658 |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK AAYXX CITATION AAYOK IQODW RIG 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c306t-18d79e61315698b8ea3676b7692bcbc8e34f0f2f117a86f48bf5842a2213fd3d3 |
| IEDL.DBID | RIE |
| ISSN | 0018-9448 |
| IngestDate | Thu Oct 02 10:37:30 EDT 2025 Wed Apr 02 08:12:04 EDT 2025 Wed Oct 01 02:20:17 EDT 2025 Thu Apr 24 22:58:17 EDT 2025 Tue Aug 26 16:39:17 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | Phase modulation Convolutional code Coding Trellis code Maximum likelihood Continuous phase Sequential decoding |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c306t-18d79e61315698b8ea3676b7692bcbc8e34f0f2f117a86f48bf5842a2213fd3d3 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 28184760 |
| PQPubID | 23500 |
| PageCount | 8 |
| ParticipantIDs | proquest_miscellaneous_28184760 crossref_primary_10_1109_18_259658 pascalfrancis_primary_3976236 ieee_primary_259658 crossref_citationtrail_10_1109_18_259658 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 1900 |
| PublicationDate | 1993-09-01 |
| PublicationDateYYYYMMDD | 1993-09-01 |
| PublicationDate_xml | – month: 09 year: 1993 text: 1993-09-01 day: 01 |
| PublicationDecade | 1990 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY |
| PublicationTitle | IEEE transactions on information theory |
| PublicationTitleAbbrev | TIT |
| PublicationYear | 1993 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers |
| References | ref13 ref12 lindell (ref7) 1985 ref10 aulin (ref14) 1985 lindell (ref2) 1985 ref1 ref17 ref16 ref8 ho (ref18) 1986; 133 ref9 ref4 ref3 ref6 ref5 huber (ref11) 1987; 3 andersson (ref15a) 1988 (ref15b) 0 |
| References_xml | – volume: 133 start-page: 95 year: 1986 ident: ref18 article-title: Power spectral density of digital continuous phase modulation with correlated data symbols, Part I: Autocorrelation function method publication-title: Proc IEEE – ident: ref8 doi: 10.1109/TIT.1982.1056454 – ident: ref17 doi: 10.1109/18.42212 – year: 1985 ident: ref7 publication-title: High rate convolutional codes and multilevel continuous phase modulation – ident: ref5 doi: 10.1109/18.2634 – ident: ref3 doi: 10.1109/TCOM.1985.1096194 – year: 1985 ident: ref2 publication-title: On coded continuous phase modulation – ident: ref10 doi: 10.1109/TIT.1970.1054541 – ident: ref13 doi: 10.1109/TCOM.1983.1095778 – ident: ref4 doi: 10.1109/18.21225 – ident: ref1 doi: 10.1007/978-1-4899-2031-7 – year: 0 ident: ref15b – ident: ref12 doi: 10.1109/26.35369 – ident: ref9 doi: 10.1109/ITS.1990.175658 – volume: 3 start-page: 1687 year: 1987 ident: ref11 article-title: Convolutional codes for CPM using the memory of the modulation process publication-title: Conf Rec Proc 1987 Global Telecommunications Conf GLOBECOM'87 – ident: ref6 doi: 10.1109/TIT.1984.1056912 – ident: ref16 doi: 10.1007/978-1-4615-3998-8 – year: 1988 ident: ref15a publication-title: A limited tree search algorithm for noncoherent convolutionally encoded continuous phase modulation – year: 1985 ident: ref14 publication-title: Study of a new trellis decoding algorithm and its applications |
| SSID | ssj0014512 |
| Score | 1.4476225 |
| Snippet | Continuous phase modulation (CPM) signals may be precoded by a convolutional code followed by a mapping rule. Better codes may, however, be obtained by a more... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 1687 |
| SubjectTerms | Applied sciences Automata Binary sequences Coding, codes Continuous phase modulation Convolution Convolutional codes Exact sciences and technology Information, signal and communications theory Maximum likelihood decoding Modulation coding Registers Sampling methods Signal and communications theory Telecommunications and information theory Testing |
| Title | Better rate 1/2 coded continuous phase modulation schemes and the M-algorithm |
| URI | https://ieeexplore.ieee.org/document/259658 https://www.proquest.com/docview/28184760 |
| Volume | 39 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) issn: 0018-9448 databaseCode: RIE dateStart: 19630101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://ieeexplore.ieee.org/ omitProxy: false ssIdentifier: ssj0014512 providerName: IEEE |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT-MwELaAExx4FFaUXcBa7YFL2thxbOfIIqoKqZxA4hY5fgCCJogmF349YzutYJcDNyuZRMrYk5mxZ74PoT-GpmA1hicqZyJhQjEYpTBylXBGacO5b06eXfPpLbu6y-96nO3QC2OtDcVnduSH4SzfNLrzW2VjCNXBYa6jdSF5bNVaHRiwnERgcAL2CylHDyJE0mJM5Cg--Mn1BC4VXwmpFqAMF1ks_vshBy8z2Ynt24sATuiLS55GXVuN9Ns_0I3f_IBdtN1Hm_g8Lo89tGbrAdpZMjng3rAHaOsDLOE-mv0NPT7Yo0hgMqbY970b7KvaH-uu6Rb45QGcH543pif_wpAj27ldYFUbDCElniXq-b55fWwf5gfodnJ5czFNetqFREP-0CZEGlFYcPOQ2hWyklZ5VLdK8IJWutLSZsyljjpChJLcMVk5iGKoopRkzmQm-4E26qa2hwhLAemSonlWKM6cZ1dPVZ4J6YrMMKb1EJ0tZ6TUPSa5p8Z4LkNukhYlkWVU2hD9Xom-RCCOr4QGXukrgeXV40-zvLrtYzGa8SE6Xc56CcblT0xUbUGbpYfKYoKnR1--9yfajOWPvuLsF9poXzt7DCFKW52ExfkOha_j8A |
| linkProvider | IEEE |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Nb9QwEB1BOQAHCguIBUotxIFLdmPHsZ0jIKoFuj21Um-R44-2optU3eTSX9-xnV1R6IGblUwiZezJzNgz7wF8sixHq7Ei0yWXGZea4yjHkW-kt9pYIUJz8vJILE74z9PydMTZjr0wzrlYfOZmYRjP8m1nhrBVNsdQHR3mQ3hUcs7L1Ky1PTLgJU3Q4BQtGJOOEUaI5tWcqll69I7ziWwqoRZSr1EdPvFY_PNLjn7mYDc1cK8jPGEoL_k9G_pmZm7-Am_8z094Ds_GeJN8SQvkBTxw7QR2N1wOZDTtCTz9A5jwJSy_xi4fEnAkCJ0zEjrfLQl17Rft0A1rcnWO7o-sOjvSfxHMkt3KrYluLcGgkiwzfXnWXV_056tXcHLw_fjbIhuJFzKDGUSfUWVl5dDRY3JXqUY5HXDdGikq1pjGKFdwn3vmKZVaCc9V4zGOYZoxWnhb2OI17LRd694AURITJs3KotKC-8CvnuuykMpXheXcmCl83sxIbUZU8kCOcVnH7CSvaqrqpLQpfNyKXiUojvuEJkHpW4HN1b07s7y9HaIxVogp7G9mvUbzCmcmunWozTqAZXEp8rf3vncfHi-Ol4f14Y-jX-_gSSqGDPVn72Gnvx7cHgYsffMhLtRbmj3nPQ |
| 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=Better+rate+1%2F2+coded+continuous+phase+modulation+schemes+and+the+M-algorithm&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Balachandran%2C+K&rft.au=Anderson%2C+J+B&rft.au=Finamore%2C+W+A&rft.au=Pimentel%2C+C+J-L&rft.date=1993-09-01&rft.issn=0018-9448&rft.volume=39&rft.issue=5&rft.spage=1687&rft.epage=1694&rft_id=info:doi/10.1109%2F18.259658&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon |