Please use this identifier to cite or link to this item: https://dspace.upt.ro/xmlui/handle/123456789/3767
Title: An efficient linear systolic array architecture for a memory-based VLSI implementation of type III generalized Hartley transform [articol]
Authors: Chiper, Doru Florin
Subjects: Generalized discrete Hartley transform
Systolic algorithms
Systolic architectures
Memory-based architectures
Issue Date: 2004
Publisher: Timişoara: Editura Politehnica
Citation: Chiper, Doru Florin. An efficient linear systolic array architecture for a memory-based VLSI implementation of type III generalized Hartley transform. Timişoara: Editura Politehnica, 2004
Series/Report no.: Buletinul ştiinţific al Universităţii „Politehnica” din Timişoara, România. Seria electronică şi telecomunicaţii, Tom 49(63), fasc. 1 (2004), p. 117-121
Abstract: An efficient design approach for a VLSI array of a prime length type III Generalized Discrete Hartley Transform (GDHT) is proposed. The presented approach uses an appropriate decomposition of type III GDHT into two cyclic convolutions having the same length and structure. The two computational structures can be implemented in parallel using the same hardware structure based on using bi-port ROMS. Using an appropriate hardware sharing technique and a VLSI architecture based on small bi-port ROMs we can obtain high computing speed with low hardware complexity and low I/O costs together with all the other advantages of the systolic array implementation of cyclic convolution as regular and modular structures with local connections.
URI: http://primo.upt.ro:1701/primo-explore/search?query=any,contains,An%20efficient%20linear%20systolic%20array%20architecture%20for%20a%20memory-based%20VLSI%20implementation%20of%20type%20III%20generalized%20Hartley%20transform&tab=default_tab&search_scope=40TUT&vid=40TUT_V1&lang=ro_RO&offset=0 Link Primo
Appears in Collections:Articole științifice/Scientific articles

Files in This Item:
File Description SizeFormat 
BUPT_ART_Chiper_f.pdf552.25 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.