Decoding of Raptor codes on embedded systems

  • Authors:
  • Todor Mladenov;Saeid Nooshabadi;Juan A. Montiel-Nelson;Kiseon Kim

  • Affiliations:
  • Dept. of Information & Communications, Gwangju Institute of Science and Technology (GIST), Gwangju 500-712, Republic of Korea and Dept. of Nanobio Materials & Electronics, Gwangju Institute of Sci ...;Dept. of Electrical & Computer Engineering, Michigan Technological University, Houghton, MI 49931, USA;Institute for Applied Microelectronics, University of Las Palmas de Gran Canaria, 35017 Las Palmas de Gran Canaria, Spain;Dept. of Information & Communications, Gwangju Institute of Science and Technology (GIST), Gwangju 500-712, Republic of Korea and Dept. of Nanobio Materials & Electronics, Gwangju Institute of Sci ...

  • Venue:
  • Microprocessors & Microsystems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Raptor codes have been proven very suitable for mobile multimedia content delivery. A systematic Raptor code is employed for the application layer Forward Error Correction (FEC), schemes of the 3rd Generation Partnership Project (3GPP), Multimedia Broadcast/Multicast Service (MBMS) and standard and the IP Datacast over Digital Video Broadcasting (DVB) services. Those services run on mobile devices powered by embedded systems. This paper analyzes the performance, energy profile and resource implication of Raptor decoder on a system on a chip (SoC) platform with a soft-core embedded processor. At the heart of the Raptor decoder for binary erasure channel (BEC) is the decoding of the pre-code. The following three methods are used for that task: Belief Propagation (BP), Gaussian Elimination (GE) and the 3GPP inactivation decoding Gaussian elimination (IDGE). The paper analyzes the error correction capability and the complexity of each algorithm on embedded system. Additionally, the paper investigates how the cache size, matrix memory type and organization affect the algorithms under consideration. Finally, a power and energy dissipation analysis for the operation of the three algorithms under consideration is presented.