access icon openaccess Time-varying block codes for synchronisation errors: maximum a posteriori decoder and practical issues

In this study, the authors consider time-varying block (TVB) codes, which generalise a number of previous synchronisation error-correcting codes. They also consider various practical issues related to maximum a posteriori (MAP) decoding of these codes. Specifically, they give an expression for the expected distribution of drift between transmitter and receiver because of synchronisation errors. They determine an appropriate choice for state space limits based on the drift probability distribution. In turn, they obtain an expression for the decoder complexity under given channel conditions in terms of the state space limits used. For a given state space, they also give a number of optimisations that reduce the algorithm complexity with no further loss of decoder performance. They also show how the MAP decoder can be used in the absence of known frame boundaries, and demonstrate that an appropriate choice of decoder parameters allows the decoder to approach the performance when frame boundaries are known, at the expense of some increase in complexity. Finally, they express some existing constructions as TVB codes, comparing performance with published results and showing that improved performance is possible by taking advantage of the flexibility of TVB codes.

Inspec keywords: block codes; error correction codes; synchronisation; optimisation; radio transmitters; maximum likelihood decoding; radio receivers

Other keywords: time-varying block codes; state space limits; channel conditions; drift probability distribution; error-correcting codes; receiver; decoder complexity; maximum a posteriori decoder; synchronisation errors; frame boundaries; optimisations; decoder parameters; MAP decoding; transmitter

Subjects: Optimisation techniques; Radio links and equipment; Codes; Other topics in statistics

References

    1. 1)
    2. 2)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
    7. 7)
    8. 8)
    9. 9)
    10. 10)
    11. 11)
    12. 12)
      • 15. Buttigieg, V., Briffa, J.A.: ‘Codebook and marker sequence design for synchronization-correcting codes’. Proc. IEEE Int. Symp. Information Theory, St. Petersburg, Russia, 31 July–5 August 2011.
    13. 13)
    14. 14)
      • 8. Schlauweg, M., Profrock, D., Muller, E.: ‘Correction of insertions and deletions in selective watermarking’. IEEE Int. Conf. Signal Image Technology and Internet Based Systems (SITIS), 2008, 30 November–3 December 2008, pp. 277284.
    15. 15)
    16. 16)
    17. 17)
    18. 18)
    19. 19)
      • 14. Briffa, J.A., Schaathun, H.G.: ‘Improvement of the Davey–MacKay construction’. Proc. IEEE Int. Symp. Information Theory and its Applications, Auckland, New Zealand, December 7–10, 2008, pp. 235238.
    20. 20)
      • 5. Ratzer, E.A.: ‘Marker codes for channels with insertions and deletions’, Ann. Telecommun., 2005, 60, pp. 2944.
    21. 21)
      • 20. Davey, M.C.: ‘Error-correction using low-density parity-check codes’. PhD dissertation, University of Cambridge, 1999.
    22. 22)
      • 21. MacKay, D.J.C.: ‘Information theory, inference, and learning algorithms’ (Cambridge University Press, 2003).
    23. 23)
      • 7. Swart, T., Ferreira, H., dos Santos, M.: ‘Using parallel-interconnected Viterbi decoders to correct insertion/deletion errors’. Seventh AFRICON Conf. Africa, September 2004, vol. 1, pp. 341344.
    24. 24)
    25. 25)
    26. 26)
      • 13. Briffa, J.A., Schaathun, H.G., Wesemeyer, S.: ‘An improved decoding algorithm for the Davey–MacKay construction’. Proc. IEEE Int. Conf. Communications, Cape Town, South Africa, 23–27 May 2010.
    27. 27)
      • 2. Levenshtein, V.I.: ‘Binary codes capable of correcting deletions, insertions and reversals’, Sov. Phys.–Dokl., 1966, 10, (8), pp. 707710.
    28. 28)
      • 3. Gallager, R.G.: ‘Sequential decoding for binary channels with noise and synchronization errors’. Technical Report, 2502, Massachusetts Institute of Technology Lexington Lincoln Laboratory, 27October1961.
    29. 29)
    30. 30)
http://iet.metastore.ingenta.com/content/journals/10.1049/joe.2014.0062
Loading

Related content

content/journals/10.1049/joe.2014.0062
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading