Skip to main content

Advertisement

Springer Nature Link
Log in

Evaluation of mixed permutation codes in PLC channels, using Hamming distance profile

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

We report a new concept involving an adaptive mixture of different sets of permutation codes (PC) in a single DPSK–OFDM modulation scheme. Since this scheme is robust and the algorithms involved are simple, it is a good candidate for implementation for OFDM-based power line communication (PLC) systems. By using a special and easy concept called Hamming distance profile, as a comparison tool, we are able to showcase the strength of the new PC scheme over other schemes reported in literature, in handling the incessant noise types associated with PLC channels. This prediction tool is also useful for selecting an efficient PC codebook out of a number of similar ones.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Ferreira, H. C., Grové, H. M., Hooijen, O., & Vinck, A. J. H. (2001). Power line communication. Wiley Encyclopedia of Electrical and Electronics Engineering.

  2. Papilaya, V. N., Shongwe, T., Vinck, A. J. H., & Ferreira, H. C. (2012). Selected subcarriers QPSK-OFDM transmission schemes to combat frequency disturbances. IEEE International Symposium on Power Line Communications and Its Application (pp. 200–205).

  3. Vinck, A. J. H., & Häring, J. (2000). Coding and modulation for power-line communications, IEEE International Symposium on Power Line Communications and Its Application (pp. 265–271).

  4. CENELEC (1992). 50065 part 1: Signalling on low voltage electrical installations in the frequency range 3 kHz to 148.5 kHz, general requirments, frequency bands and electromagnetic disturbances.

  5. CENELEC (2008). PRIME Technology, whitepaper: PHY, MAC and Convergence layers, (21st Ed.).

  6. eRDF (2013). PLC G3 Physical Layer Specification.

  7. Juwono, F. H., Guo, Q., Huang, D., & Wong, K. P. (2014). Deep clipping for impulsive noise mitigation in OFDM-based power-line communications. IEEE Transactions on Power Delivery, 29(3), 1335–1343.

    Article  Google Scholar 

  8. Juwono, F. H., Guo, Q., Huang, D., & Wong, K. P (2013). Joint peak amplitude and impulsive noise clippings in OFDM-based power line communications. Asia-Pacific Conference on Communications (pp. 567–571).

  9. Al-Mawali, K. S., & Hussain, Z. M. (2009). Adaptive-threshold clipping for impulsive noise reduction in OFDM-based power line communications. International Conference on Advanced Technologies for Communications (pp. 43–48).

  10. Salehi, V., Mohamed, A., Mazloomzadeh, A., & Mohammed, O. A. (2012). Laboratory-based smart power system, part II: Control, monitoring, and protection. IEEE Transactions on Smart Grid, 3(3), 1405–1417.

    Article  Google Scholar 

  11. Zhang, P., Li, F., & Bhatt, N. (2010). Next-generation monitoring, analysis, and control for the future smart control center. IEEE Transactions on Smart Grid, 1(2), 186–192.

    Article  Google Scholar 

  12. Cheng, L., & Ferreira, H. C. (2012). Time-diversity permutation coding scheme for narrow-band power-line channels. In IEEE International Symposium on Power Line Communications and Its Application (pp. 120–125).

  13. Cheng, L., Swart, T. G, & Ferreira, H. C. Adaptive rateless permutation coding scheme for OFDM-based PLC. (2013). In IEEE International Symposium on Power Line Communications and Its Application (pp. 242–246).

  14. Swart, T. G., & Ferreira, H. C. (2007). Decoding distance-preserving permutation codes for power-line communications. In IEEE AFRICON (pp. 1–7).

  15. Ferreira, H. C., Vinck, A. J. H., Swart, T. G., & de Beer, I. (2005). Permutation trellis codes. IEEE Transactions on Communications, 53(11), 1782–1789.

    Article  Google Scholar 

  16. Dukes, P. J. (2012). Coding with injections. Designs, Codes and Cryptography, 65(3), 213–222.

    Article  Google Scholar 

  17. Huczynska, S., & Mullen, G. L. (2006). Frequency permutation arrays. Journal of Combinatorial Designs, 14(6), 463–478.

    Article  Google Scholar 

  18. Hunt, F. H., Perkins, S., & Smith, D. H. (2015). Decoding mixed errors and erasures in permutation codes. Designs, Codes and Cryptography, 74(2), 481–493.

    Article  Google Scholar 

  19. Bailey, R. F. (2009). Error-correcting codes from permutation groups. Discrete Mathematics, 309(13), 4253–4265.

    Article  Google Scholar 

  20. Chee, Y. M., Kiah, H. M., Purkayastha, P., & Wang, C. (2012). Importance of symbol equity in coded modulation for power line communications. IEEE International Symposium on Information Theory (pp. 661–665).

  21. Ogunyanda, K., Familua, A. D., Swart, T. G., Ferreira, H. C., & Cheng, L. (2014). Permutation coding with differential quinary phase shift keying for power line communication. IEEE PES Innovative Smart Grid Technology European Conference (pp. 1–6).

  22. Barta, J., Montemanni, R., & Smith, D. H. (2014). A branch and bound approach to permutation codes. IEEE International Conference on Infromation and Communication Technology (pp. 187–192).

  23. Vinck, A. J. H. (2000). Coded modulation for power line communications. AEU International Journal of Electronics and Communications, 54(1), 45–49.

    Google Scholar 

  24. Deza, M., & Vanstone, S. A. (1978). Bounds for permutation arrays. Journal of Statistical Planning and Inference, 2(2), 197–209.

    Article  Google Scholar 

  25. Wadayama, T., & Hagiwara, M. (2012). LP-decodable permutation codes based on linearly constrained permutation matrices. IEEE Transactions on Information Theory, 58(8), 5454–5470.

    Article  Google Scholar 

  26. Kong, J., & Hagiwara, M. (2012). Comparing Euclidean, Kendall tau metrics toward extending LP decoding. IEEE International Symposium on Information Theory and its Applications (pp. 91–95).

  27. Klove, T., Lin, T. T., Tsai, S. C., & Tzeng, W. G. (2010). Permutation arrays under the Chebyshev distance. IEEE Transactions on Information Theory, 56(6), 2611–2617.

    Article  Google Scholar 

  28. Gologlu, F., Lember, J., Riet, A. E., & Skachek, V. (2015). New bounds for permutation codes in Ulam metric. IEEE International Symposium on Information Theory and its Applications (pp. 1726–1730).

  29. Swart, T. G. (2006). Distance-preserving mappings and trellis codes with permutation sequences. Ph.D. dissertation, University of Johannesburg, Johannesburg.

  30. Swart, T. G., de Beer, I., & Ferreira, H. C. (2005). On the distance optimality of permutation mappings. IEEE International Symposium on Information Theory (pp. 1068–1072).

  31. Sklar, B., & Grant, P. M. (1988). Digital communications: Fundamentals and applications. Englewood Cliffs: Prentice Hall.

    Google Scholar 

  32. Alexandre, G. A., Guido, M., & Sergio, B. (2001). A new approach to the construction of high-rate convolutional codes. IEEE Communications Letters, 5(11), 453–455.

    Article  Google Scholar 

  33. Ucha-Filho, B. F., Souza, R. D., Pimentel, C., & Jar, M. (2006). Further results on convolutional codes based on a minimal trellis complexity measure. IEEE International Telecommunications Symposium (pp. 123–128).

  34. Bian, Y., Popplewell, A., & O’Reilly, J. J. (1994). New very high rate punctured convolutional codes. Electronics Letters, 30(14), 1119–1120.

    Article  Google Scholar 

  35. Viterbi, A. J. (1971). Convolutional codes and their performance in communication systems. IEEE Transactions on Communications Technology, 19(5), 751–772.

    Article  Google Scholar 

  36. Guftaar, A. S. S. (2007). Computation of the distance spectrum of convolutional codes and the delay spectrum of a network. Semester Project, Jacobs University Bremen, Bremen.

  37. Bellare, M. (1997). A note on negligible functions. Technical Report CS97-529. San Diego: University of California.

    Google Scholar 

  38. MathWiki (2015). The negligible, the noticeable and the overwhelming. http://mathwiki.cs.ut.ee/asymptotics/06_the_negligible_the_noticeable_/and_the_overwhelming

  39. Courant, J., Daubignard, M., Ene, C., Lafourcade, P., & Lakhnech, Y. (2011). Automated proofs for asymmetric encryption. Journal of Automated Reasoning on Computer Security, 46(3–4), 261–291.

    Article  Google Scholar 

  40. Katz, J., & Lindell, Y. (2007). Introduction to modern cryptography: Principles and protocols. illustrated (Ed.). Taylor & Francis.

  41. Riegelman, R. (2004). Studying a study and testing a test: How to read the medical evidence (5th ed.). Philadelphia, PA: Lippincott Williams & Wilkins.

  42. Concept Stew. (2015). Statistics for the terrified: The importance of n (sample size) in statistics. http://www.conceptstew.co.uk/PAGES/nsamplesize.html

  43. Johnson, R., & Kuby, P. (2011). Elementary statistics, student (Ed.). Cengage Learning.

  44. Ogunyanda, K., Familua, A. D., Swart, T. G., Ferreira, H. C., & Cheng, L. (2014). Adaptive permutation coded differential OFDM system for power line communications. IEEE International Conference on Adaptive Science & Technology (pp. 1–7).

  45. Ogunyanda, K., Familua, A. D., Swart, T. G., Ferreira, H. C., & Cheng, L. (2014). Evaluation and implementation of cyclic permutation coding for power line communications. IEEE International Conference on Adaptive Science & Technology (pp. 1–7).

  46. Oh, M., & Sweeney, P. (1999). Low complexity soft-decision sequential decoding using hybrid permutation for Reed-Solomon codes. IMA International Conference on Cryptography and Coding (pp. 163–172).

  47. Singh, A. (2010). A hybrid permutation-coded evolutionary algorithm for the early/tardy scheduling problem. Asia-Pacific Journal of Operational Research, 27(6), 713–725.

    Article  Google Scholar 

Download references

Acknowledgments

This work is based on research supported in part by the National Research Foundation of South Africa (UID 77596)

Author information

Authors and Affiliations

  1. Department of Electrical and Electronic Engineering Science, University of Johannesburg, PO Box 524, Auckland Park, 2006, South Africa

    Kehinde Ogunyanda, Theo G. Swart & Hendrik C. Ferreira

  2. School of Electrical and Information Engineering, University of the Witwatersrand, WITS, Private Bag 3, Johannesburg, 2050, South Africa

    Ayokunle D. Familua & Ling Cheng

Authors
  1. Kehinde Ogunyanda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ayokunle D. Familua
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Theo G. Swart
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hendrik C. Ferreira
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ling Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kehinde Ogunyanda.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ogunyanda, K., Familua, A.D., Swart, T.G. et al. Evaluation of mixed permutation codes in PLC channels, using Hamming distance profile. Telecommun Syst 65, 169–179 (2017). https://doi.org/10.1007/s11235-016-0224-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-016-0224-9

Keywords

Search

Navigation