Performance of parallel decodable turob and repeat-accumulate codes implemented on an fpga platform

Download

index.pdf

Date

2009

Author

Erdin, Enes

Metadata

Show full item record

Item Usage Stats

112
views

61
downloads

In this thesis, we discuss the implementation of a low latency decoding algorithm for turbo codes and repeat accumulate codes and compare the implementation results in terms of maximum available clock speed, resource consumption, error correction performance, and the data (information bit) rate. In order to decrease the latency a parallelized decoder structure is introduced for these mentioned codes and the results are obtained by implementing the decoders on a field programmable gate array. The memory collision problem is avoided by using collision-free interleavers. Through a proposed quantization scheme and normalization approximations, computational issues are handled for overcoming the overflow and underflow issues in a fixed point arithmetic. Also, the effect of different implementation styles are observed.

Subject Keywords

Electrical engineering., Numerical analysis.

URI

http://etd.lib.metu.edu.tr/upload/2/12610998/index.pdf
https://hdl.handle.net/11511/19073

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Implementation and performance of parallellised turbo decoders Yılmaz, Ali Özgür; Yılmaz, Ayşen (2011-01-04) In this study, the authors discuss the implementation of a low latency decoding algorithm for turbo codes and repeat accumulate codes and compare the implementation results in terms of maximum available clock speed, resource consumption, error correction performance and the data (information bit) rate. In order to decrease the latency a parallellised decoder structure is introduced for these mentioned codes and the results are obtained by implementing the decoders on a field programmable gate array. The mem...
Effects of parallel programming design patterns on the performance of multi-core processor based real time embedded systems Kekeç, Burak; Bilgen, Semih; Department of Electrical and Electronics Engineering (2010) Increasing usage of multi-core processors has led to their use in real time embedded systems (RTES). This entails high performance requirements which may not be easily met when software development follows traditional techniques long used for single processor systems. In this study, parallel programming design patterns especially developed and reported in the literature will be used to improve RTES implementations on multi-core systems. Specific performance parameters will be selected for assessment, and pe...
Asynchronous design of systolic array architectures in cmos İsmailoğlu, Ayşe Neslin; Aşkar, Murat; Department of Electrical and Electronics Engineering (2008) In this study, delay-insensitive asynchronous circuit design style has been adopted to systolic array architectures to exploit the benefits of both techniques for improved throughput. A delay-insensitivity verification analysis method employing symbolic delays is proposed for bit-level pipelined asynchronous circuits. The proposed verification method allows datadependent early output evaluation to co-exist with robust delay-insensitive circuit behavior in pipelined architectures such as systolic arrays. Reg...
Cooperative interval games Alparslan Gök, Sırma Zeynep; Weber, Gerhard Wilhelm; Department of Scientific Computing (2009) Interval uncertainty affects our decision making activities on a daily basis making the data structure of intervals of real numbers more and more popular in theoretical models and related software applications. Natural questions for people or businesses that face interval uncertainty in their data when dealing with cooperation are how to form the coalitions and how to distribute the collective gains or costs. The theory of cooperative interval games is a suitable tool for answering these questions. In this ...
Efficient parallelization of the multilevel fast multipole algorithm for the solution of large-scale scattering problems Ergül, Özgür Salih (Institute of Electrical and Electronics Engineers (IEEE), 2008-08-01) We present fast and accurate solutions of large-scale scattering problems involving three-dimensional closed conductors with arbitrary shapes using the multilevel fast multipole algorithm (MLFMA). With an efficient parallelization of MLFMA, scattering problems that are discretized with tens of millions of unknowns are easily solved on a cluster of computers. We extensively investigate the parallelization of MLFMA, identify the bottlenecks, and provide remedial procedures to improve the efficiency of the imp...

Citation Formats

E. Erdin, “Performance of parallel decodable turob and repeat-accumulate codes implemented on an fpga platform,” M.S. - Master of Science, Middle East Technical University, 2009.