Quality-driven methodology for demanding accelerator design
- 1 March 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19483287,p. 380-389
- https://doi.org/10.1109/isqed.2010.5450546
Abstract
This paper focuses on mastering the architecture development of hardware accelerators for demanding applications. It presents the results of our analysis of the main problems that have to be solved when designing accelerators for modern demanding applications, and illustrates the problems with an example of accelerator design for LDPC code decoders for the newest communication system standards. Based on the results of our analysis, we formulate the main requirements that have to be satisfied by an adequate methodology for demanding accelerator design, and propose an architecture design methodology which satisfies the requirements.Keywords
This publication has 18 references indexed in Scilit:
- Modern development methods and tools for embedded reconfigurable systems: A surveyIntegration, 2010
- IntroductionPublished by Springer Nature ,2008
- Multi-Rate Layered Decoder Architecture for Block LDPC Codes of the IEEE 802.11n Wireless StandardPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- FPGA Pipeline Synthesis Design Exploration Using Module Selection and Resource SharingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2007
- Multi-Gbit/sec Low Density Parity Check Decoders with Reduced Interconnect ComplexityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Interconnection Network for Structured Low-Density Parity-Check DecodersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- High-throughput LDPC decodersIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2003
- VLSI architectures for iterative decoders in magnetic recording channelsIEEE Transactions on Magnetics, 2001
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981