http://iet.metastore.ingenta.com
1887

access icon openaccess SimCommSys: taking the errors out of error-correcting code simulations

  • PDF
    799.5224609375Kb
  • HTML
    61.4326171875Kb
  • XML
    72.0712890625Kb
Loading full text...

Full text loading...

/deliver/fulltext/joe/2014/6/JOE.2014.0055.html;jsessionid=178s1tx9qwqkx.x-iet-live-01?itemId=%2fcontent%2fjournals%2f10.1049%2fjoe.2014.0055&mimeType=html&fmt=ahah

References

    1. 1)
    2. 2)
      • 2. Berrou, C., Glavieux, A., Thitimajshima, P.: ‘Near Shannon limit error-correcting coding and decoding: turbo-codes’. Proc. IEEE Int. Conf. Communications, Geneva, Switzerland, May 1993, pp. 10641070.
    3. 3)
    4. 4)
    5. 5)
      • 5. Matlab: The language of technical computing’ (MathWorks, Inc., 2012). [Online]. Available at http://www.mathworks.co.uk/products/datasheets/pdf/matlab.pdf.
    6. 6)
      • 6. de Lima, C.H.M., Stancanelli, E.M.G., Rodrigues, E.B., da S.Maciel, J.M., Cavalcanti, F.R.P.: ‘A software development framework based on C + + OOP language for link-level simulation tools’. Int. Telecommunications Symp., 2006, pp. 597602.
    7. 7)
      • 7. Cristea, B.: ‘Turbo receivers with IT + +’. Second Int. ICST Conf. Simulation Tools and Techniques. ACM, May 2010.
    8. 8)
      • 8. NVIDIA CUDA C Programming Guide, NVIDIA Corporation, October 2012, version 5.0.
    9. 9)
    10. 10)
      • 10. 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.
    11. 11)
      • 11. Briffa, J.A., Schaathun, H.G.: ‘Improvement of the Davey–MacKay construction’. Proc. IEEE Int. Symp. Information Theory and its Applications, Auckland, New Zealand, 7–10 December 2008, pp. 235238.
    12. 12)
      • 12. Briffa, J.A., Schaathun, H.G.: ‘Non-binary turbo codes and applications’. Proc. IEEE Int. Symp. Turbo Codes & Related Topics, Lausanne, Switzerland, 1–5 September 2008, pp. 294298.
    13. 13)
    14. 14)
    15. 15)
    16. 16)
      • 16. Ratzer, E.A.: ‘Marker codes for channels with insertions and deletions’, Ann. Telecommun., 2005, 60, pp. 2944.
    17. 17)
      • 17. 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.
    18. 18)
    19. 19)
      • 19. Digital Video Broadcasting (DVB); Interaction channel for satellite distribution systems, ETSI, 5th September 2005, eN 301 790 v1.4.1.
    20. 20)
    21. 21)
      • 21. Levenshtein, V.I.: ‘Binary codes capable of correcting deletions, insertions and reversals’, Sov. Phys. Dokl., 1966, 10, (8), pp. 707710.
    22. 22)
    23. 23)
      • 23. McEliece, R.J., Swanson, L.: ‘Reed-Solomon codes and the exploration of the solar system’. Technical Report, Jet Propulsion Laboratory, California Institute of Technology, 20th August, 1993. [Online]. Available at http://www.hdl.handle.net/2014/34531.
    24. 24)
      • 24. Miller, R.L., Deutsch, L.J., Butman, S.A.: ‘On the error statistics of Viterbi decoding and the performance of concatenated codes’, NASA STI/Recon Tech. Rep., 1981, 81, (9).
    25. 25)
      • 25. Abrahams, D., Gurtovoy, A.: ‘C + + template metaprogramming: concepts, tools, and techniques from boost and beyond’ (Addison-Wesley Professional, 2004).
http://iet.metastore.ingenta.com/content/journals/10.1049/joe.2014.0055
Loading

Related content

content/journals/10.1049/joe.2014.0055
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address