{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T05:30:22Z","timestamp":1738387822740,"version":"3.35.0"},"reference-count":39,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"vor","delay-in-days":3117,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Trans Emerging Tel Tech"],"published-print":{"date-parts":[[2000,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Using the principles of generalized concatenation we introduce a new design for coded M\u2010ary CPFSK systems with modulation index<jats:italic>h<\/jats:italic>= l\/<jats:italic>M<\/jats:italic>. This technique is based on a set partitioning method of inner CPFSK into nested subsystems with increasing free Euclidean distance which are combined with several outer convolutional codes having different error\u2010correcting capabilities. In other words, we construct multilevel codes on the basis of inner modulation<jats:italic>with memory<\/jats:italic>, namely CPFSK. The new generalized concatenated constructions were simulated in an additive white Gaussian noise channel. The multistep decoding algoritm is described where for soft output decoding the well\u2010known symbol\u2010by\u2010symbol maximum a<jats:italic>posteriori<\/jats:italic>probability (MAP) algorithm is applied to the inner CPFSK. A comparison of the generalized concatenated codes with the best known trellis\u2010coded CPFSK schemes is also presented.<\/jats:p>","DOI":"10.1002\/ett.4460110205","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T13:53:43Z","timestamp":1221227623000},"page":"173-182","source":"Crossref","is-referenced-by-count":2,"title":["Generalized Concatenation of Encoded CPFSK Modulation"],"prefix":"10.1002","volume":"11","author":[{"given":"Armin","family":"Hautle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Bossert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergo","family":"Shavgulidze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nodar","family":"Ugrelidze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-2031-7"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096194"},{"key":"e_1_2_1_4_2","unstructured":"V. L.BanketandN. A.Ugrelidze Convolutional codes for channels with minimum shift keying.Radiotechnika pages11\u201315 January1988."},{"key":"e_1_2_1_5_2","unstructured":"V. L.Banket A. V.Salabai andN. A.Ugrelidze Convolutional codes for channels with coherent CPFSK.Proceedings Moscow Radio Institute pages10\u201317 April\/June1988."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.2634"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.9773"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.35369"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.241735"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1049\/el:19940590"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","unstructured":"N.Ugrelidze S.Shavgulidze andL.Chachua Concordant and partially concordant ring convolutional codes for CPFSK. InIEEE International Symposium on Information Theory page168 1997.","DOI":"10.1109\/ISIT.1997.613083"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.335968"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.481222"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.486328"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.494300"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056454"},{"issue":"2","key":"e_1_2_1_17_2","first-page":"45","article-title":"Coding of generalized concatenated codes","volume":"10","author":"Blokh E. L.","year":"1974","journal-title":"Problemy Peredachi Informatsii"},{"key":"e_1_2_1_18_2","first-page":"5","article-title":"Generalized cascade codes","volume":"12","author":"Zinoviev V. A.","year":"1976","journal-title":"Problerny Peredachi Informatsii"},{"issue":"4","key":"e_1_2_1_19_2","first-page":"9","article-title":"Generalized concatenated convolutional codes with unit memory","volume":"22","author":"Zyablov V. V.","year":"1986","journal-title":"Problemy feredachi Informatsii"},{"issue":"2","key":"e_1_2_1_20_2","first-page":"17","article-title":"The estimation of the minimum distance for unit memory generalized concatenated convolutional codes","volume":"23","author":"Zyablov V. V.","year":"1987","journal-title":"Problemy Peredachi Information"},{"volume-title":"Generalized Concatenated Constructions on a Base of Convolutional Codes","year":"1991","author":"Zyablov V. V.","key":"e_1_2_1_21_2"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460070603"},{"issue":"3","key":"e_1_2_1_23_2","first-page":"14","article-title":"Characteristics of coding and modulation systems from the standpoint of concatenated codes","volume":"21","author":"Portnoy S. L.","journal-title":"Problemy Peredachi Informatsii"},{"issue":"4","key":"e_1_2_1_24_2","first-page":"17","article-title":"Construction and performance of the new systems of modulation and convolutional codes","volume":"24","author":"Zyablov V. V.","year":"1988","journal-title":"Problemy Peredachi Informatsii"},{"issue":"6","key":"e_1_2_1_25_2","first-page":"345","article-title":"Bounds on free Euclidean distance for various systems of modulation and coding","volume":"17","author":"Zyablov V. V.","year":"1988","journal-title":"Problems of Control and Information Theory"},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055718"},{"key":"e_1_2_1_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.20095"},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055186"},{"key":"e_1_2_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1973.9030"},{"key":"e_1_2_1_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.536915"},{"key":"e_1_2_1_31_2","doi-asserted-by":"publisher","DOI":"10.1049\/el:19961524"},{"key":"e_1_2_1_32_2","doi-asserted-by":"crossref","unstructured":"F.Xiong Modem techniques in satellite communications.IEEE Communications Magazine pages84\u201398 Aug.1994.","DOI":"10.1109\/35.299842"},{"key":"e_1_2_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.1994.577036"},{"key":"e_1_2_1_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.212363"},{"key":"e_1_2_1_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.380193"},{"key":"e_1_2_1_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1984.1096047"},{"key":"e_1_2_1_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.21246"},{"key":"e_1_2_1_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.1987.1093541"},{"key":"e_1_2_1_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057329"},{"key":"e_1_2_1_40_2","first-page":"1680","article-title":"A Viterbi algorithm with soft\u2010decision outputs and its applications","volume":"3","author":"Hagenauer J.","year":"1989","journal-title":"Proceedings of the IEEE GLOBECOM '89"}],"container-title":["European Transactions on Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fett.4460110205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/ett.4460110205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:37:18Z","timestamp":1738363038000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/ett.4460110205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,3]]}},"alternative-id":["10.1002\/ett.4460110205"],"URL":"https:\/\/doi.org\/10.1002\/ett.4460110205","archive":["Portico"],"relation":{},"ISSN":["1124-318X","1541-8251"],"issn-type":[{"type":"print","value":"1124-318X"},{"type":"electronic","value":"1541-8251"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}