Decoding distance-preserving permutation codes for power-line communications

A new decoding method is presented for permutation codes obtained from distance-preserving mapping algorithms, used in conjunction with M-ary FSK for use on power- line channels. The new approach makes it possible for the permutation code to be used as an inner code with any other error correction code used as an outer code. The memory and number of computations necessary for this method is lower than when using a minimum distance decoding method.

[1]  H. C. Ferreira,et al.  Interference cancellation with permutation trellis codes , 2000, Vehicular Technology Conference Fall 2000. IEEE VTS Fall VTC2000. 52nd Vehicular Technology Conference (Cat. No.00CH37152).

[2]  A. J. Han Vinck,et al.  CODED MODULATION for POWER LINE COMMUNICATIONS In AEÜ Journal, 2000, pp. 45-49, Jan 2000 , 2000 .

[3]  A.J.H. Vinck,et al.  Coded M-FSK for power line communications , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[4]  H.C. Ferreira,et al.  Permutation trellis codes , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[5]  Torleiv Kløve,et al.  Distance-preserving mappings from binary vectors to permutations , 2003, IEEE Trans. Inf. Theory.

[6]  Kwankyu Lee.  New distance-preserving maps of odd length , 2004, IEEE Transactions on Information Theory.

[7]  Kwankyu Lee.  Cyclic constructions of distance-preserving maps , 2005, IEEE Transactions on Information Theory.

[8]  Hendrik C. Ferreira,et al.  On the distance optimality of permutation mappings , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[9]  Hendrik C. Ferreira,et al.  Simulation results for permutation Trellis codes using M-ary FSK , 2005, International Symposium on Power Line Communications and Its Applications, 2005..

[10]  Jen-Chun Chang.  Distance-increasing mappings from binary vectors to permutations that increase hamming distances by at least two , 2006, IEEE Transactions on Information Theory.

[11]  Kwankyu Lee.  Distance-increasing maps of all lengths by simple mapping algorithms , 2006, IEEE Transactions on Information Theory.

[12]  Hendrik C. Ferreira,et al.  A Generalized Upper Bound and a Multilevel Construction for Distance-Preserving Mappings , 2006, IEEE Transactions on Information Theory.

[13]  Hendrik C. Ferreira,et al.  Using Graphs for the Analysis and Construction of Permutation Distance-Preserving Mappings , 2008, IEEE Transactions on Information Theory.