ACM Home Page
Please provide us with feedback. Feedback
A fast parallel reed-solomon decoder on a reconfigurable architecture
Full text PdfPdf (292 KB)
Source International Symposium on Systems Synthesis archive
Proceedings of the 1st IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis table of contents
Newport Beach, CA, USA
SESSION: Case studies in embedded systems table of contents
Pages: 59 - 64  
Year of Publication: 2003
ISBN:1-58113-742-7
Authors
Arezou Koohi  University of California Irvine, CA
Nader Bagherzadeh  University of California Irvine, CA
Chengzi Pan  University of California Irvine, CA
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 45,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/944645.944660
What is a DOI?

ABSTRACT

This paper presents a software implementation of a very fast parallel Reed-Solomon decoder on the second generation of MorphoSys reconfigurable computation platform, which is targeting on streamed applications such as multimedia and DSP. Numerous modifications of the first-generation of the architecture have made a scalable computation and communication intensive architecture capable of extracting parallelisms of fine grain in instruction level. Many algorithms and the whole Digital Video Broadcasting base-band receiver as well, have been mapped onto the second architecture with impressing performance. The mapping of a Reed-Solomon decoder proposed in this paper highly parallelizes all of its sub-algorithms, including Syndrome Computation, Berlekamp Algorithm, Chein Search, and Error Value Computation, in a SIMD fashion. The mapping is tested on a cycle-accurate simulator, "Mulate", and the performance is encouragingly better than other architectures. The decoding speed of the RS (255,239,16) decoder using two different methods of GF multiplication can be 1.319Gbps and 2.534Gbps, respectively. Furthermore, since there is no functionality specifically tailored to Reed-Solomon decoder, the result has demonstrated the capability of MorphoSys architecture to extracting Instruction Level Parallelism from streamed applications.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
4
 
5
 
6
 
7
 
8
 
9
10
11
 
12
Implementation of high speed Reed-Solomon decoder. {Conference Paper} 42nd Midwest Symposium on Circuits and Systems (Cat. No.99CH36356). IEEE. Part vol. 2, 2000, pp.808-12 vol. 2. Piscataway, NJ, USA.
 
13
Martina M, Masera G, Piccinini G, Vacca F, Zamboni M. VLSI Reed Solomon decoder architecture for networked multimedia applications. {Conference Paper} Proceedings 14th Annual IEEE International ASIC/SOC Conference (IEEE Cat. No.01TH8558). IEEE. 2001, pp.347--51. Piscataway, NJ,USASystems II-Analog & Digital Signal Processing, vol.47, no.11, Nov. 2000, pp.1254--70. Publisher: IEEE, USA.
 
14
 
15
www.amphion.com <http://www.amphion.com>
 
16
www.ti.com <http://www.ti.com>
 
17
www.xilinx.com <http://www.xilinx.com>


Collaborative Colleagues:
Arezou Koohi: colleagues
Nader Bagherzadeh: colleagues
Chengzi Pan: colleagues

Peer to Peer - Readers of this Article have also read: