{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T14:40:04Z","timestamp":1725115204734},"reference-count":23,"publisher":"Engineering and Technology Publishing","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["jcm"],"published-print":{"date-parts":[[2021]]},"abstract":"<jats:p>With a view to adapting information signals to suit the frequency characteristics of digital transmission channels, it is pertinent to design channel coding schemes that can exhibit spectral shaping capabilities after being processed with a suitable modulation technique. This involves concentrating the frequency energy of the coded and modulated information signal towards a predetermined range of the frequency spectrum, or making it have low power content at such frequencies. One modulation scheme that is suitable for achieving this is pulse amplitude modulation (PAM). We thus present a permutation coding (PC) system with injections that can exhibit spectral nulls at rational sub-multiples of the symbol frequency. Such injections are achieved by strategically removing \u03b4 columns from the source PC. We also present a mathematical expression that allows for the prediction of zero energy positions in the codebook\u2019s spectrum. Due to the way the injections are introduced, it gives the scheme an advantage of achieving higher symbol rate, when compared with conventional PC systems. The work is however limited to cases where \u03b4 =2 and the lengths of the codewords involved are even numbers.<\/jats:p>","DOI":"10.12720\/jcm.16.5.167-174","type":"journal-article","created":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T06:29:58Z","timestamp":1621924198000},"page":"167-174","source":"Crossref","is-referenced-by-count":0,"title":["Injection Coding with Spectral Nulls for Even Codeword Lengths"],"prefix":"10.12720","author":[{"name":"Dept. of Elect. and Electron. Eng. Sc., Univ. of Johannesburg, Johannesburg, SA","sequence":"first","affiliation":[]},{"given":"O. O.","family":"Ogunyanda","sequence":"first","affiliation":[]},{"given":"T.","family":"Shongwe","sequence":"additional","affiliation":[]},{"given":"T. G.","family":"Swart","sequence":"additional","affiliation":[]}],"member":"4977","published-online":{"date-parts":[[2021]]},"reference":[{"key":"ref0","doi-asserted-by":"publisher","unstructured":"[1] P. J. Dukes, \"Coding with injections,\" Designs, Codes and Cryptography, vol. 65, no. 3, pp. 213-222, 2012.","DOI":"10.1007\/s10623-011-9547-4"},{"key":"ref1","doi-asserted-by":"publisher","unstructured":"[2] P. J. Dukes, F. Ihringer, and N. Lindzey, \"On the algebraic combinatorics of injections and its applications to injection codes,\" IEEE Trans. Inf. Theory, vol. 66, no. 11, pp. 6898-6907, 2020.","DOI":"10.1109\/TIT.2020.3005544"},{"key":"ref2","doi-asserted-by":"publisher","unstructured":"[3] T. G. Swart and H. C. Ferreira, \"Decoding distance-preserving permutation codes for power-line communications,\" in Proc. IEEE AFRICON 2007, Windhoek, Namibia, Sept. 2007, pp. 1-7.","DOI":"10.1109\/AFRCON.2007.4401563"},{"key":"ref3","unstructured":"[4] A. J. H. Vinck and J. Haring, \"Coding and modulation for power-line\u00a8 communications,\" in Proc. Power Line Commun. and Its Applicat. (ISPLC), 2000 4th IEEE Int. Symp., Limerick, Ireland, Apr. 2000, pp. 265-271."},{"key":"ref4","doi-asserted-by":"publisher","unstructured":"[5] C. J. Colbourn, T. Klove, and A. C. H. Ling, \"Permutation arrays for powerline communication and mutually orthogonal latin squares,\" IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1289-1291, 2004.","DOI":"10.1109\/TIT.2004.828150"},{"key":"ref5","doi-asserted-by":"publisher","unstructured":"[6] K. Ogunyanda, A. D. Familua, T. G. Swart, H. C. Ferreira, and L. Cheng, \"Permutation coding with differential quinary phase shift keying for power line communication,\" in Proc. IEEE PES Innovative Smart Grid Technol. European Conference, Istanbul, Turkey, Oct. 12-15, 2014, pp. 1-6.","DOI":"10.1109\/ISGTEurope.2014.7028891"},{"key":"ref6","doi-asserted-by":"publisher","unstructured":"[7] \"Evaluation of mixed permutation codes in PLC channels, using Hamming distance profile,\" Telecommun. Syst., vol. 65, no. 1, pp. 1-11, 2016.","DOI":"10.1007\/s11235-016-0224-9"},{"key":"ref7","unstructured":"[8] T. G. Swart and H. C. Ferreira, \"Analysis of permutation distancepreserving mappings using graphs,\" in Proc. Int. Symp. on Commun. Theory and Applicat., 2007."},{"key":"ref8","doi-asserted-by":"publisher","unstructured":"[9] F. Gologlu, J. Lember, A. E. Riet, and V. Skachek, \"New bounds for permutation codes in Ulam metric,\" in Proc. Int. Symp. Informat. Theory and Its Applications, Hong Kong, Jun. 2015, pp. 1726-1730.","DOI":"10.1109\/ISIT.2015.7282751"},{"key":"ref9","doi-asserted-by":"publisher","unstructured":"[10] T. Shongwe and T. G. Swart, \"Distance-preserving mapping with Euclidean distance for 4-ary PAM,\" in Proc. IEEE Int. Symp. on Commun. Syst., Netw. Digit. Signal Process. (CSNDSP), Budapest, Hungary, Jul. 2018, pp. 1-6.","DOI":"10.1109\/CSNDSP.2018.8471854"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"[11] T. Shongwe, \"Trellis coded 4-ary PAM using distance-preserving mapping,\" Int. J. Electron. and Telecommunications, vol. 64, no. 4, pp. 527-533, Oct. 2018.","DOI":"10.24425\/123555"},{"key":"ref11","doi-asserted-by":"publisher","unstructured":"[12] K. Ouahada, T. G. Swart, and H. C. Ferreira, \"Permutation sequences and coded PAM signals with spectral nulls at rational submultiples of the symbol frequency,\" Cryptography and Commun., vol. 3, no. 2, pp. 87-108, Jun. 2011.","DOI":"10.1007\/s12095-010-0040-0"},{"key":"ref12","doi-asserted-by":"publisher","unstructured":"[13] C. D. Nguyen, K. Cai, B. Wang, and Y. Hong, \"On the design of DCfree K-constrained LDPC codes,\" in Proc. Asia-Pacific Magnetic Recording Conference (APMRC), 2018, pp. 1-2.","DOI":"10.1109\/APMRC.2018.8601099"},{"key":"ref13","unstructured":"[14] E. Gorog and J. Pierret, \"Redundant alphabets with desirable frequency spectrum properties,\" IBM Technical Disclosure Bulletin, vol. 10, no. 1, p. 1295, 1968."},{"key":"ref14","doi-asserted-by":"publisher","unstructured":"[15] E. Gorog, \"Redundant alphabets with desirable frequency spectrum properties,\" IBM J. Rese. Develop., vol. 12, no. 3, pp. 234-241, May 1968.","DOI":"10.1147\/rd.123.0234"},{"key":"ref15","doi-asserted-by":"publisher","unstructured":"[16] B. Marcus and P. Siegel, \"On codes with spectral nulls at rational submultiples of the symbol frequency,\" IEEE Transactions on Information Theory, vol. 33, no. 4, pp. 557-568, 1987.","DOI":"10.1109\/TIT.1987.1057334"},{"key":"ref16","unstructured":"[17] K. A. S. Immink, Codes for Mass Data Storage Systems. The Netherlands: Shannon Foundation Publishers, 1999."},{"key":"ref17","doi-asserted-by":"publisher","unstructured":"[18] K. Georg, \"Alphabets with desirable frequency spectrum properties,\" IBM J. Res. Develop., vol. 12, no. 0, pp. 234-241, Jun. 1968.","DOI":"10.1147\/rd.123.0234"},{"key":"ref18","unstructured":"[19] K. A. S. Immink, Coding Techniques for Digital Recorders, UK: Prentice Hall International, 1991."},{"key":"ref19","unstructured":"[20] T. G. Swart, I. D. Beer, H. C. Ferreira, and A. J. H. Vinck, \"Simulation results for permutation trellis codes using M-ary FSK,\" in Proc. Int. Symp. Power Line Commun. and Its Applicat., (ISPLC) 2005 IEEE Int. Symp., Vancouver, CA, Apr. 2005, pp. 317-321."},{"key":"ref20","doi-asserted-by":"publisher","unstructured":"[21] H. C. Ferreira, D. A. Wright, and A. Nel, \"Hamming distance preserving mappings and trellis codes with constrained binary symbols,\" IEEE Trans. Inform. Theory, vol. 35, pp. 1098-1103, Nov. 1989.","DOI":"10.1109\/18.42229"},{"key":"ref21","unstructured":"[22] K. Ouahada, \"Spectral shaping and distance mappings with permutation sequences,\" Ph.D. dissertation, Univ. Johannesburg, Johannesburg, South Africa, 2009."},{"key":"ref22","doi-asserted-by":"publisher","unstructured":"[23] K. Ouahada, T. G. Swart, H. C. Ferreira, and L. Cheng, \"Spectral shaping technique for permutation distance-preserving mapping codes,\" in Proc. IEEE Inf. Theory Workshop, 2007, pp. 36-41.","DOI":"10.1109\/ITW.2007.4313046"}],"container-title":["Journal of Communications"],"original-title":[],"link":[{"URL":"http:\/\/www.jocm.us\/uploadfile\/2021\/0422\/20210422105928484.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T13:43:06Z","timestamp":1725111786000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.jocm.us\/show-255-1652-1.html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":23,"URL":"https:\/\/doi.org\/10.12720\/jcm.16.5.167-174","relation":{},"ISSN":["2374-4367"],"issn-type":[{"type":"print","value":"2374-4367"}],"subject":[],"published":{"date-parts":[[2021]]}}}