Instruction Set Extensions for Reed-Solomon Encoding and Decoding

Mamidi, Suman; Schulte, Michael; Iancu, Daniel; Iancu, Andrei; Glossner, John

doi:10.1109/asap.2005.42

Cited by 13 publications

(8 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We investigate the performance benefits of four GF arithmetic vector operations; gfmul, gfmac, gfmul2, and gfmac2 [19]. Table 1 summarizes these operations and their functionality.…”

Section: Reed-solomon Encoding/decodingmentioning

confidence: 99%

Instruction set extensions for software defined radio on a multithreaded processor

Mamidi

Blem

Schulte

et al. 2005

Proceedings of the 2005 International Conference on Compilers, Architectures and Synthesis for Embedded Systems

View full text Add to dashboard Cite

Software defined radios, which provide a programmable solution for implementing the physical layer processing of multiple communication standards, are widely recognized as one of the most important new technologies for wireless communication systems. Emerging communication standards, however, require tremendous processing capabilities to perform high-bandwidth physical-layer processing in real time.In this paper, we present instruction set extensions for several important communication algorithms including convolutional encoding, Viterbi decoding, turbo decoding, and Reed-Solomon encoding and decoding. The performance benefits of these extensions are evaluated using a supercomputer class vectorizing compiler and the Sandblaster lowpower multithreaded processor for software defined radio. The proposed instruction set extensions provide significant performance improvements, while maintaining a high degree of programmability.

show abstract

“…We investigate the performance benefits of four GF arithmetic vector operations; gfmul, gfmac, gfmul2, and gfmac2 [19]. Table 1 summarizes these operations and their functionality.…”

Section: Reed-solomon Encoding/decodingmentioning

confidence: 99%

Instruction set extensions for software defined radio on a multithreaded processor

Mamidi

Blem

Schulte

et al. 2005

Proceedings of the 2005 International Conference on Compilers, Architectures and Synthesis for Embedded Systems

View full text Add to dashboard Cite

show abstract

“…Galois field arithmetic is fundamental to RS encoding and decoding. There are several approaches to performing Galois field multiplication in software [18]. In our implementation, we represent the Galois field elements either in the index or polynomial format.…”

Section: Erasure Coding Implementationmentioning

confidence: 99%

“…RS codes are described in numerous coding theory books and papers [17] [18]. Given a data polynomial a(x) of degree k < n, n = 2 m (k is the number of information symbols and n is the code length), in Galois field GF(2 m ) and a code generating polynomial g(x) of degree p, where p ≤ n -k and…”

Section: Erasure Coding Implementationmentioning

confidence: 99%

Robust video transmission over lossy network by exploiting H.264/AVC data partitioning

Zhang

Peng

Haywood

et al. 2008

2008 5th International Conference on Broadband Communications, Networks and Systems

View full text Add to dashboard Cite

Abstract-In this paper, a robust H.264/AVC video transmission system over lossy packet network is investigated and implemented. The H.264/AVC standard has defined a new data partition scheme which can be used to perform unequal loss protection (ULP) in video transmission systems. However, few actual implementation and experiments which integrate data partition and loss protection algorithms have been reported. Based on the H.264/AVC data partitioning mechanism, we implement three loss protection schemes using Reed-Solomon and XOR parity codes, namely equal loss protection (ELP), ULP and partition A protection only (PAP) .The performance of each scheme is evaluated under different network environments. Experimental results and performance analysis show that ELP has higher Peak Signal-to-Noise Ratio (PSNR) values than ULP and PAP, but PAP requires the least redundancy and offers the best tradeoffs between PSNR values and redundancy among all the three schemes.

show abstract

“…Galois field arithmetic is fundamental to RS encoding and decoding. There are several approaches to performing Galois field multiplication in software [22]. In our implementation, we represent the GF elements either in the index or polynomial format.…”

Section: Erasure Coding Implementationmentioning

confidence: 99%

“…As a typical example, we implement a systematic RS code in our testbed. RS codes are described in numerous coding theory books and papers [10] [22] [24]- [26]. Given a data polynomial a(x) of degree k < n, n = 2 m (k is the number of information symbols and n is the code length), in Galois field GF(2 m ) and a code generating polynomial g(x) of degree p, where p ≤ n -k and…”

Section: Erasure Coding Implementationmentioning

confidence: 99%

A testbed of erasure coding on video streaming system over lossy networks

Zhang

Peng

2007

2007 International Symposium on Communications and Information Technologies

View full text Add to dashboard Cite

Abstract-As one of the most challenging aspects of streaming video over lossy networks, the technology for controlling packet losses has attracted more and more attention. Erasure coding is one of the ideal choices to deal with this problem. In most cases, the researchers need an effective method or tool to validate the erasure codes used for dealing with different packet loss patterns. Although some previous work has been done on employing erasure codes in video streaming system, few actual buildups and experiments which involve implementation of erasure codes against real packet loss in streaming systems have been reported. In this paper, we focus on constructing a testbed that integrates loss pattern generation and erasure coding implementation into video streaming services over lossy networks. With this approach, we are able to assess the capability of erasure coding in packet loss control and compare the performances of the video streaming systems with and without erasure coding. As an example, we have implemented the Reed-Solomon (7, 5) code for protecting MPEG streaming data under random packet losses. Experiment results show that the replay quality can be improved significantly by using erasure coding in video streaming systems, and that the testbed can suggest appropriate erasure code parameters for different loss environments.

show abstract

Instruction Set Extensions for Reed-Solomon Encoding and Decoding

Abstract: Abstract

Cited by 13 publications

References 9 publications

Instruction set extensions for software defined radio on a multithreaded processor

Instruction set extensions for software defined radio on a multithreaded processor

Robust video transmission over lossy network by exploiting H.264/AVC data partitioning

A testbed of erasure coding on video streaming system over lossy networks

Contact Info

Product

Resources

About