{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/7574"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/7574","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"On trellis coded continuous phase frequency shift keying","abstract":"<p>This thesis reports my research work in the area of trellis coded continuous phase frequency shift keying (CPFSK). Previous approaches [1, 2, 3, 4, 5] applied binary convolutional codes to CPFSK to achieve power and bandwidth efficiency. However, the work in [6] and part of this thesis show that no single approach among previous approaches can be outperformed by the others if only binary convolutional codes are considered.</p> <p>A new coding scheme based on cnovolutional codes on the ring of integers modulo-P is shown to be a natural way to apply trellis coding to CPFSK [7]. Recent work has decomposed CPFSK into two parts; a linear encoder with memory, called the continuous phase encoder (CPE), and a memoryless modulator (MM), where the CPE often has a code structure defined over the ring of integers modulo-P. The combination of modulo-P convolutional channel encoder (CE) and the CPE, is a linear modulo-P encoder. Design examples are given for rate 1/2 coded quaternary CPFSK with modulation indices 1/2 and 1/4, and rate-2/3 coded octal CPFSK with modulation index 1/8. Combinations are optimized in the normalized minimum Euclidean distance sense for a given total number of states in the overall maximum likelihood sequence estimation (MLSE) receiver. Numerical results show that this new coding scheme consistently achieves better performance than previous schemes. [1, 2, 3, 4, 5].</p> <p>An upper bound on the bit error probability (BER) for ring convolutionally encoded CPFSK is derived. The bound shows that feedback-free CPFSK usually has a smaller error coefficient than CPFSK. The minimum Eucildean distance is a good parameter for estimating performance, and the ring convolutionally encoded CPFSK has a good BER for both moderate and practical signal to noise ratio.</p>","abstract_html":"&lt;p&gt;This thesis reports my research work in the area of trellis coded continuous phase frequency shift keying (CPFSK). Previous approaches [1, 2, 3, 4, 5] applied binary convolutional codes to CPFSK to achieve power and bandwidth efficiency. However, the work in [6] and part of this thesis show that no single approach among previous approaches can be outperformed by the others if only binary convolutional codes are considered.&lt;/p&gt; &lt;p&gt;A new coding scheme based on cnovolutional codes on the ring of integers modulo-P is shown to be a natural way to apply trellis coding to CPFSK [7]. Recent work has decomposed CPFSK into two parts; a linear encoder with memory, called the continuous phase encoder (CPE), and a memoryless modulator (MM), where the CPE often has a code structure defined over the ring of integers modulo-P. The combination of modulo-P convolutional channel encoder (CE) and the CPE, is a linear modulo-P encoder. Design examples are given for rate 1/2 coded quaternary CPFSK with modulation indices 1/2 and 1/4, and rate-2/3 coded octal CPFSK with modulation index 1/8. Combinations are optimized in the normalized minimum Euclidean distance sense for a given total number of states in the overall maximum likelihood sequence estimation (MLSE) receiver. Numerical results show that this new coding scheme consistently achieves better performance than previous schemes. [1, 2, 3, 4, 5].&lt;/p&gt; &lt;p&gt;An upper bound on the bit error probability (BER) for ring convolutionally encoded CPFSK is derived. The bound shows that feedback-free CPFSK usually has a smaller error coefficient than CPFSK. The minimum Eucildean distance is a good parameter for estimating performance, and the ring convolutionally encoded CPFSK has a good BER for both moderate and practical signal to noise ratio.&lt;/p&gt;","abstract_has_math":false,"creators":["Yang, Richard Hsin-Ysyong"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Electrical and Computer Engineering","school":null,"contributors":[],"advisors":["Taylor, D. P."],"committee_chairs":[],"committee_members":[],"year":1994,"date_issued":"1994-06","date_published":"1994-06","updated_at":"2026-11-18T19:30:45Z","subjects":["Electrical and Computer Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/8345"],"render_values":[{"text":"https://doi.org/10.71548/8345","href":"https://doi.org/10.71548/8345","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/2843","3859","1412586"],"render_values":[{"text":"opendissertations/2843","href":null,"code":true},{"text":"3859","href":null,"code":true},{"text":"1412586","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/7574","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/7574","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F7574","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Taylor, D. P."]},{"key":"dc:contributor.department","label":"Department","values":["Electrical and Computer Engineering"]},{"key":"dc:creator","label":"Author","values":["Yang, Richard Hsin-Ysyong"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T16:39:46Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T16:39:46Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2010-07-27"]},{"key":"dc:date.issued","label":"Date","values":["1994-06"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical and Computer Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/2843","3859","1412586"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/7574","https://doi.org/10.71548/8345"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<p>This thesis reports my research work in the area of trellis coded continuous phase frequency shift keying (CPFSK). Previous approaches [1, 2, 3, 4, 5] applied binary convolutional codes to CPFSK to achieve power and bandwidth efficiency. However, the work in [6] and part of this thesis show that no single approach among previous approaches can be outperformed by the others if only binary convolutional codes are considered.</p> <p>A new coding scheme based on cnovolutional codes on the ring of integers modulo-P is shown to be a natural way to apply trellis coding to CPFSK [7]. Recent work has decomposed CPFSK into two parts; a linear encoder with memory, called the continuous phase encoder (CPE), and a memoryless modulator (MM), where the CPE often has a code structure defined over the ring of integers modulo-P. The combination of modulo-P convolutional channel encoder (CE) and the CPE, is a linear modulo-P encoder. Design examples are given for rate 1/2 coded quaternary CPFSK with modulation indices 1/2 and 1/4, and rate-2/3 coded octal CPFSK with modulation index 1/8. Combinations are optimized in the normalized minimum Euclidean distance sense for a given total number of states in the overall maximum likelihood sequence estimation (MLSE) receiver. Numerical results show that this new coding scheme consistently achieves better performance than previous schemes. [1, 2, 3, 4, 5].</p> <p>An upper bound on the bit error probability (BER) for ring convolutionally encoded CPFSK is derived. The bound shows that feedback-free CPFSK usually has a smaller error coefficient than CPFSK. The minimum Eucildean distance is a good parameter for estimating performance, and the ring convolutionally encoded CPFSK has a good BER for both moderate and practical signal to noise ratio.</p>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Doctor of Philosophy (PhD)"]},{"key":"dc:title","label":"Title","values":["On trellis coded continuous phase frequency shift keying"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Taylor, D. P."],"dc:contributor.department":["Electrical and Computer Engineering"],"dc:creator":["Yang, Richard Hsin-Ysyong"],"dc:date.accessioned":["2014-06-18T16:39:46Z"],"dc:date.available":["2014-06-18T16:39:46Z"],"dc:date.created":["2010-07-27"],"dc:date.issued":["1994-06"],"dc:description.abstract":["<p>This thesis reports my research work in the area of trellis coded continuous phase frequency shift keying (CPFSK). Previous approaches [1, 2, 3, 4, 5] applied binary convolutional codes to CPFSK to achieve power and bandwidth efficiency. However, the work in [6] and part of this thesis show that no single approach among previous approaches can be outperformed by the others if only binary convolutional codes are considered.</p> <p>A new coding scheme based on cnovolutional codes on the ring of integers modulo-P is shown to be a natural way to apply trellis coding to CPFSK [7]. Recent work has decomposed CPFSK into two parts; a linear encoder with memory, called the continuous phase encoder (CPE), and a memoryless modulator (MM), where the CPE often has a code structure defined over the ring of integers modulo-P. The combination of modulo-P convolutional channel encoder (CE) and the CPE, is a linear modulo-P encoder. Design examples are given for rate 1/2 coded quaternary CPFSK with modulation indices 1/2 and 1/4, and rate-2/3 coded octal CPFSK with modulation index 1/8. Combinations are optimized in the normalized minimum Euclidean distance sense for a given total number of states in the overall maximum likelihood sequence estimation (MLSE) receiver. Numerical results show that this new coding scheme consistently achieves better performance than previous schemes. [1, 2, 3, 4, 5].</p> <p>An upper bound on the bit error probability (BER) for ring convolutionally encoded CPFSK is derived. The bound shows that feedback-free CPFSK usually has a smaller error coefficient than CPFSK. The minimum Eucildean distance is a good parameter for estimating performance, and the ring convolutionally encoded CPFSK has a good BER for both moderate and practical signal to noise ratio.</p>"],"dc:description.degree":["Doctor of Philosophy (PhD)"],"dc:identifier.other":["opendissertations/2843","3859","1412586"],"dc:identifier.uri":["http://hdl.handle.net/11375/7574","https://doi.org/10.71548/8345"],"dc:subject":["Electrical and Computer Engineering"],"dc:title":["On trellis coded continuous phase frequency shift keying"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:30:45Z"}