Study of the Decoding Complexity for Rateless Erasure Codes
Journal Title: Acta Technica Napocensis- Electronica-Telecomunicatii (Electronics and Telecommunications) - Year 2011, Vol 52, Issue 4
Abstract
Over the Internet, bit errors within the data packets translate into packet losses at the higher layers of the OSI model, yielding a packet erasure channel. Modern erasure correcting codes promise to offer a very simple and efficient solution to data transfers over these channels, opening up also other interesting applications. Amongst them one can enumerate reliable large scale content distribution, high quality real-time data transfers, distributed storage and others. These considerations make the study of such codes an actual and interesting topic. Most of the analyses presented in literature focus on the evaluation of the performances ensured by these codes. This paper presents an evaluation of the decoding complexity of some rateless erasure codes, which is another relevant issue that affects the applicability of these codes. The complexities of several decoding methods are evaluated using several metrics which reflect different operations performed during the decoding. All results used in the evaluation are based on simulations
Authors and Affiliations
Anghel BOTOŞ, Vasile BOTA, Aurel VLAICU
Keywords
Related Articles
- EP ID EP124624
- DOI -
- Views 99
- Downloads 0
Novel Voltage-Controlled Amplifiers For Multistandard Integrated Radio Receivers
This paper proposes a new architecture for transconductance (Gm)-based variable-gain amplifiers (VGA) that is better suited for multi-standard radio receivers than the classical two-Gm structure: its bandwidth and linear...
Divide-and-Conquer Piecewise Linear Approximation of Gain and Phase Evaluation
Certain approaches to phase approximation ask as a first step in implementation for a piecewise linear fitting of gain. When the breakpoints are given, there are few ways to determine the slopes of the broken line approx...
FPGA Implementation of LMS and NLMS adaptive filters for acoustic echo cancellation
The paper proposes a register transfer level (RTL) description of two well-known adaptive algorithms used in acoustic echo cancellation: the Least Mean Square (LMS) and Normalized Least Mean Square (NLMS). The RTL descri...
Robust Feature Sets for the Speech Processing
This paper compares the various feature sets for speech signal such as cepstral-based and acoustically-driven parameters to analyze and see how robust they are in different noise environments. Despite the success of the...
Digital Implementation of The Sigmoid Function for FPGA Circuits
In this paper, is proposed a method to implement in FPGA (Field Programmable Gate Array) circuits different approximation of the sigmoid function. Three previously published piecewise linear and one piecewise second-orde...