VLSI design concepts for iterative algorithms
| dc.contributor.advisor | Götze, Jürgen | |
| dc.contributor.author | Sun, Chi-Chia | |
| dc.contributor.referee | Kays, Rüdiger | |
| dc.date.accepted | 2011-04-11 | |
| dc.date.accessioned | 2011-04-28T11:36:05Z | |
| dc.date.available | 2011-04-28T11:36:05Z | |
| dc.date.issued | 2011-04-28 | |
| dc.description.abstract | Circuit design becomes more and more complicated, especially when the Very Large Scale Integration (VLSI) manufacturing technology node keeps shrinking down to nanoscale level. New challenges come up such as an increasing gap between the design productivity and the Moore’s Law. Leakage power becomes a major factor of the power consumption and traditional shared bus transmission is the critical bottleneck in the billion transistors Multi-Processor System–on–Chip (MPSoC) designs. These issues lead us to discuss the impact on the design of iterative algorithms. This thesis presents several strategies that satisfy various design con- straints, which can be used to explore superior solutions for the circuit design of iterative algorithms. Four selected examples of iterative al- gorithms are elaborated in this respect: hardware implementation of COordinate Rotation DIgital Computer (CORDIC) processor for sig- nal processing, configurable DCT and integer transformations based CORDIC algorithm for image/video compression, parallel Jacobi Eigen- value Decomposition (EVD) method with arbitrary iterations for com- munication, and acceleration of parallel Sparse Matrix–Vector Multipli- cation (SMVM) operations based Network–on–Chip (NoC) for solving systems of linear equations. These four applications of iterative meth- ods have been chosen since they cover a wide area of current signal processing tasks. Each method has its own unique design criteria when it comes to the direct implementation on the circuit level. Therefore, a balanced solution between various design tradeoffs is elaborated for each method. These tradeoffs are between throughput and power consumption, com- putational complexity and transformation accuracy, the number of in- ner/outer iterations and energy consumption, data structure and net- work topology. It is shown that all of these algorithms can be imple- mented on FPGA devices or as ASICs efficiently. | en |
| dc.identifier.uri | http://hdl.handle.net/2003/27714 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-553 | |
| dc.language.iso | en | de |
| dc.subject | CORDIC algorithm | en |
| dc.subject | FPGA | en |
| dc.subject | H.264 | en |
| dc.subject | Iterative algorithm | en |
| dc.subject | Jacobi method | en |
| dc.subject | MPEG-4 | en |
| dc.subject | NoC | en |
| dc.subject | Parallel computing | en |
| dc.subject | QDCT | en |
| dc.subject | SMVM | en |
| dc.subject | VLSI | en |
| dc.subject.ddc | 620 | |
| dc.title | VLSI design concepts for iterative algorithms | en |
| dc.type | Text | de |
| dc.type.publicationtype | doctoralThesis | de |
| dcterms.accessRights | open access |