Please use this identifier to cite or link to this item:
https://idr.l1.nitk.ac.in/jspui/handle/123456789/11545
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kini, R.M. | - |
dc.contributor.author | Sumam, David S. | - |
dc.date.accessioned | 2020-03-31T08:35:18Z | - |
dc.date.available | 2020-03-31T08:35:18Z | - |
dc.date.issued | 2013 | - |
dc.identifier.citation | International Journal of Electronics, 2013, Vol.100, 3, pp.319-336 | en_US |
dc.identifier.uri | https://idr.nitk.ac.in/jspui/handle/123456789/11545 | - |
dc.description.abstract | The performance of signal-processing algorithms implemented in hardware depends on the efficiency of datapath, memory speed and address computation. Pattern of data access in signal-processing applications is complex and it is desirable to execute the innermost loop of a kernel in a single-clock cycle. This necessitates the generation of typically three addresses per clock: two addresses for data sample/coefficient and one for the storage of processed data. Most of the Reconfigurable Processors, designed for multimedia, focus on mapping the multimedia applications written in a high-level language directly on to the reconfigurable fabric, implying the use of same datapath resources for kernel processing and address generation. This results in inconsistent and non-optimal use of finite datapath resources. Presence of a set of dedicated, efficient Address Generator Units (AGUs) helps in better utilisation of the datapath elements by using them only for kernel operations; and will certainly enhance the performance. This article focuses on the design and application-specific integrated circuit implementation of address generators for complex addressing modes required by multimedia signal-processing kernels. A novel algorithm and hardware for AGU is developed for accessing data and coefficients in a bit-reversed order for fast Fourier transform kernel spanning over log 2 N stages, AGUs for zig-zag-ordered data access for entropy coding after Discrete Cosine Transform (DCT), convolution kernels with stored/streaming data, accessing data for motion estimation using the block-matching technique and other conventional addressing modes. When mapped to hardware, they scale linearly in gate complexity with increase in the size. 2013 Copyright Taylor and Francis Group, LLC. | en_US |
dc.title | Implementation of comprehensive address generator for digital signal processor | en_US |
dc.type | Article | en_US |
Appears in Collections: | 1. Journal Articles |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.