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

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 1993-09, Vol.39 (5), p.1687-1694
Main Authors: Balachandran, K., Anderson, J.B., Finamore, W.A., Pimentel, C.J.-L.
Format: Article
Language:English
Subjects:
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
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c306t-18d79e61315698b8ea3676b7692bcbc8e34f0f2f117a86f48bf5842a2213fd3d3
cites cdi_FETCH-LOGICAL-c306t-18d79e61315698b8ea3676b7692bcbc8e34f0f2f117a86f48bf5842a2213fd3d3
container_end_page 1694
container_issue 5
container_start_page 1687
container_title IEEE transactions on information theory
container_volume 39
creator Balachandran, K.
Anderson, J.B.
Finamore, W.A.
Pimentel, C.J.-L.
description 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.< >
doi_str_mv 10.1109/18.259658
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_28184760</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>259658</ieee_id><sourcerecordid>28184760</sourcerecordid><originalsourceid>FETCH-LOGICAL-c306t-18d79e61315698b8ea3676b7692bcbc8e34f0f2f117a86f48bf5842a2213fd3d3</originalsourceid><addsrcrecordid>eNo9kL1PwzAQxS0EEqUwsDJ5QEgMaX224zgjVHxJrVhgjhznTILyUWxn4L8nKFWXu3u63z2dHiHXwFYALF-DXvE0V6k-IQtI0yyZZnlKFoyBTnIp9Tm5COF7kjIFviC7R4wRPfUmIoU1p3aosJpqH5t-HMZA97UJSLuhGlsTm6GnwdbYYaCmr2iske4S034Nvol1d0nOnGkDXh36knw-P31sXpPt-8vb5mGbWMFUTEBXWY4KBKQq16VGI1SmykzlvLSl1SikY447gMxo5aQuXaolN5yDcJWoxJLczb57P_yMGGLRNcFi25oep58LrkHLTLEJvJ9B64cQPLpi75vO-N8CWPEfWAG6mAOb2NuDqQnWtM6b3jbheCDyTHGhJuxmxhpEPG4PHn9cGHFT</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>28184760</pqid></control><display><type>article</type><title>Better rate 1/2 coded continuous phase modulation schemes and the M-algorithm</title><source>IEEE Xplore (Online service)</source><creator>Balachandran, K. ; Anderson, J.B. ; Finamore, W.A. ; Pimentel, C.J.-L.</creator><creatorcontrib>Balachandran, K. ; Anderson, J.B. ; Finamore, W.A. ; Pimentel, C.J.-L.</creatorcontrib><description>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.&lt; &gt;</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/18.259658</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>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</subject><ispartof>IEEE transactions on information theory, 1993-09, Vol.39 (5), p.1687-1694</ispartof><rights>1994 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c306t-18d79e61315698b8ea3676b7692bcbc8e34f0f2f117a86f48bf5842a2213fd3d3</citedby><cites>FETCH-LOGICAL-c306t-18d79e61315698b8ea3676b7692bcbc8e34f0f2f117a86f48bf5842a2213fd3d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/259658$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=3976236$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Balachandran, K.</creatorcontrib><creatorcontrib>Anderson, J.B.</creatorcontrib><creatorcontrib>Finamore, W.A.</creatorcontrib><creatorcontrib>Pimentel, C.J.-L.</creatorcontrib><title>Better rate 1/2 coded continuous phase modulation schemes and the M-algorithm</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>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.&lt; &gt;</description><subject>Applied sciences</subject><subject>Automata</subject><subject>Binary sequences</subject><subject>Coding, codes</subject><subject>Continuous phase modulation</subject><subject>Convolution</subject><subject>Convolutional codes</subject><subject>Exact sciences and technology</subject><subject>Information, signal and communications theory</subject><subject>Maximum likelihood decoding</subject><subject>Modulation coding</subject><subject>Registers</subject><subject>Sampling methods</subject><subject>Signal and communications theory</subject><subject>Telecommunications and information theory</subject><subject>Testing</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1993</creationdate><recordtype>article</recordtype><recordid>eNo9kL1PwzAQxS0EEqUwsDJ5QEgMaX224zgjVHxJrVhgjhznTILyUWxn4L8nKFWXu3u63z2dHiHXwFYALF-DXvE0V6k-IQtI0yyZZnlKFoyBTnIp9Tm5COF7kjIFviC7R4wRPfUmIoU1p3aosJpqH5t-HMZA97UJSLuhGlsTm6GnwdbYYaCmr2iske4S034Nvol1d0nOnGkDXh36knw-P31sXpPt-8vb5mGbWMFUTEBXWY4KBKQq16VGI1SmykzlvLSl1SikY447gMxo5aQuXaolN5yDcJWoxJLczb57P_yMGGLRNcFi25oep58LrkHLTLEJvJ9B64cQPLpi75vO-N8CWPEfWAG6mAOb2NuDqQnWtM6b3jbheCDyTHGhJuxmxhpEPG4PHn9cGHFT</recordid><startdate>19930901</startdate><enddate>19930901</enddate><creator>Balachandran, K.</creator><creator>Anderson, J.B.</creator><creator>Finamore, W.A.</creator><creator>Pimentel, C.J.-L.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19930901</creationdate><title>Better rate 1/2 coded continuous phase modulation schemes and the M-algorithm</title><author>Balachandran, K. ; Anderson, J.B. ; Finamore, W.A. ; Pimentel, C.J.-L.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c306t-18d79e61315698b8ea3676b7692bcbc8e34f0f2f117a86f48bf5842a2213fd3d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1993</creationdate><topic>Applied sciences</topic><topic>Automata</topic><topic>Binary sequences</topic><topic>Coding, codes</topic><topic>Continuous phase modulation</topic><topic>Convolution</topic><topic>Convolutional codes</topic><topic>Exact sciences and technology</topic><topic>Information, signal and communications theory</topic><topic>Maximum likelihood decoding</topic><topic>Modulation coding</topic><topic>Registers</topic><topic>Sampling methods</topic><topic>Signal and communications theory</topic><topic>Telecommunications and information theory</topic><topic>Testing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Balachandran, K.</creatorcontrib><creatorcontrib>Anderson, J.B.</creatorcontrib><creatorcontrib>Finamore, W.A.</creatorcontrib><creatorcontrib>Pimentel, C.J.-L.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Balachandran, K.</au><au>Anderson, J.B.</au><au>Finamore, W.A.</au><au>Pimentel, C.J.-L.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Better rate 1/2 coded continuous phase modulation schemes and the M-algorithm</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>1993-09-01</date><risdate>1993</risdate><volume>39</volume><issue>5</issue><spage>1687</spage><epage>1694</epage><pages>1687-1694</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><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.&lt; &gt;</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/18.259658</doi><tpages>8</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0018-9448
ispartof IEEE transactions on information theory, 1993-09, Vol.39 (5), p.1687-1694
issn 0018-9448
1557-9654
language eng
recordid cdi_proquest_miscellaneous_28184760
source IEEE Xplore (Online service)
subjects 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
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T18%3A13%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Better%20rate%201/2%20coded%20continuous%20phase%20modulation%20schemes%20and%20the%20M-algorithm&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Balachandran,%20K.&rft.date=1993-09-01&rft.volume=39&rft.issue=5&rft.spage=1687&rft.epage=1694&rft.pages=1687-1694&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/18.259658&rft_dat=%3Cproquest_cross%3E28184760%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c306t-18d79e61315698b8ea3676b7692bcbc8e34f0f2f117a86f48bf5842a2213fd3d3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=28184760&rft_id=info:pmid/&rft_ieee_id=259658&rfr_iscdi=true