FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Computer Architecture: A Quantitative Approach
Computer Architecture: A Quantitative Approach
Implementation and Performance Evaluation of LT and Raptor Codes for Multimedia Applications
IIH-MSP '06 Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia
Design and evaluation of a hardware/software FPGA-based system for fast image processing
Microprocessors & Microsystems
A hardwired NoC infrastructure for embedded systems on FPGAs
Microprocessors & Microsystems
Microprocessors & Microsystems
IEEE Transactions on Information Theory
Strategies for the design of raptor decoding in broadcast/multicast delivery systems
IEEE Transactions on Consumer Electronics
MBMS raptor codes design trade-offs for IPTV
IEEE Transactions on Consumer Electronics
Hi-index | 0.00 |
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.