Trellis Coded 4-ary PAM using Distance-Preserving Mapping

Thokozani Shongwe


A trellis coded 4-ary Pulse Amplitude Modulation
(4-PAM) is presented, where the encoding algorith is derived
from Distance Preserving Mapping (DPM) algorithm. In this
work, we modify the DPM algorithm for 4-PAM and obtain a
new construction for mapping binary sequences to permutation
sequences, where the permutation sequences are obtained by
permuting symbols of a 4-PAM constellation. The resulting
codebook of permutation sequences formed this way are termed
mappings. We also present several metrics for assessing the
performance of the mappings from our construction, and we show
that a metric called the Sum of Product of Distances (SOPD) is
the best metric to use when judging the performance of the
mappings. Finally, performance results are presented, where the
mappings from our construction are compared against each other
and also against the conventional mappings in the literature

Full Text:



H. C. Ferreira, D. A. Wright, and A. L. Nel, “Hamming distance

preserving mappings and trellis codes with constrained binary symbols,” IEEE Transactions on Information Theory, vol. 35, no. 5, pp. 1098–1103, Sept. 1989.

C. A. French, “Distance preserving run-length limited codes,” IEEE Transactions on Magnetics, vol. 25, no. 5, pp. 4093–4095, Sept. 1989.

H. C. Ferreira and A. J. H. Vinck, “Interference cancellation with permutation trellis codes,” in Proceedings of the 2000 IEEE Vehicular Technology Conference, Boston, MA, USA, Sept. 24–28, 2000, pp. 2401–2407.

A. J. H. Vinck and H. C. Ferreira, “Permutation trellis codes,” in

Proceedings of the 2001 IEEE International Symposium on Information Theory, Washington, DC, USA, June 24–29, 2001, p. 279.

H. C. Ferreira, A. J. H. Vinck, T. G. Swart, and I. de Beer, “Permutation trellis codes,” IEEE Transactions on Communications, vol. 53, no. 11, pp. 1782–1789, Nov. 2005.

J.-C. Chang, R.-J. Chen, T. Kløve, and S.-C. Tsai, “Distance-preserving mappings from binary vectors to permutations,” IEEE Transactions on Information Theory, vol. 49, no. 4, pp. 1054–1059, Apr. 2003.

K. Lee, “New distance-preserving mappings of odd length,” IEEE Transactions on Information Theory, vol. 50, no. 10, pp. 2539–2543, Oct. 2004.

T. G. Swart and H. C. Ferreira, “A generalized upper bound and a multilevel construction for distance-preserving mappings,” IEEE Transactions on Information Theory, vol. 52, no. 8, pp. 3685–3695, Aug. 2006.

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 Communications, vol. 3, no. 2, pp. 87–108, 2011.


  • There are currently no refbacks.

International Journal of Electronics and Telecommunications
is a periodical of Electronics and Telecommunications Committee
of Polish Academy of Sciences

eISSN: 2300-1933