{"title":"Systolic FFT Processors: Past, Present and Future","authors":"E. Swartzlander","doi":"10.1109/ASAP.2006.63","DOIUrl":"https://doi.org/10.1109/ASAP.2006.63","url":null,"abstract":"This paper reviews developments in the implementation of systolic fast Fourier transform processors over two decades (early 1980s to early 2000s) and identifies positive and negative lessons learned. The modular transform processor was developed at TRW in 1983-84. It is a set of 6 large circuit boards that computes 4096 point FFTs using 22-bit floating-point arithmetic at sustained data rates of 40 MSPS. A single chip systolic FFT developed by the Mayo Foundation in 2001-02 computes 4096 point FFTs using 16-bit fixed-point arithmetic at sustained data rates of 200 MSPS. Some thoughts on the future directions of systolic FFT processor development are offered. Future systems will compute larger FFTs at higher data rates, will employ IEEE standard floating point arithmetic and will consume less power","PeriodicalId":234262,"journal":{"name":"IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115416448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Array Processing Using Alternate Arithmetic - A 20 Year Legacy","authors":"G. Jullien","doi":"10.1109/ASAP.2006.18","DOIUrl":"https://doi.org/10.1109/ASAP.2006.18","url":null,"abstract":"20 years ago, the first Systolic Array Workshop was held at the University of Oxford. This became an annual event with the name being changed to the Application Specific Array Processor (ASAP) Conference at the Princeton Workshop in 1990. Under either name, the conference highlights the implementation of special purpose computational processors, a basic feature of which is performing large numbers of arithmetic computations per second. In this paper we discuss representations of numbers and, in particular, the properties and advantages of arithmetic processors using these representations. In a retrospective, this paper looks at our own attempts, over the past 2 decades, to find new ways of representing, and computing with, numbers in order to achieve some advantages at the implementation level.","PeriodicalId":234262,"journal":{"name":"IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117115638","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analysis of a Fully-Scalable Digital Fractional Clock Divider","authors":"Thomas B. Preußer, R. Spallek","doi":"10.1109/ASAP.2006.14","DOIUrl":"https://doi.org/10.1109/ASAP.2006.14","url":null,"abstract":"It was previously shown [5] that the BRESENHAM algorithm [2] is well-suited for digital fractional clock generation. Specifically, it proved to be the optimal approximation of a desired clock in terms of the edges provided by the reference clock. Moreover, some synthesis results for hardwired dividers on Altera FPGAs showed that this technique for clock division achieves a high performance often at or close to the maximum frequency supported by the devices for moderate bit widths of up to 16 bits. This paper extends the investigations on the clock division by the BRESENHAM algorithm. It draws out the limits encountered by the existing implementation for both FPGA and VLSI realizations. A rather unconventional adoption of the carry-save representation combined with a soft-threshold comparison is proposed to circumvent these limitations. The resulting design is described and evaluated. Mathematically appealing results on the quality of the approximation achieved by this approach are presented.","PeriodicalId":234262,"journal":{"name":"IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124833457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Molen FemtoJava Engine","authors":"J. Mattos, Stephan Wong, L. Carro","doi":"10.1109/ASAP.2006.64","DOIUrl":"https://doi.org/10.1109/ASAP.2006.64","url":null,"abstract":"This paper presents the Molen FemtoJava engine that is extended with concepts taken from the Molen polymorphic processor. This allows for the existing FemtoJava to be augmented with reconfigurable hardware with only a single extension of the bytecodes and thereby but still allowing the implementation of arbitrary hardware implementations. Therefore, computationally intensive functions can be moved to the reconfigurable hardware to improve their performance. Our experimental results on MP3 decoding, which is a common embedded application, can be improved by at least of 27% reduction of execution cycles with minimal additional hardware area (about 7%). Finally, our synthesis results also show that the Molen extension of the FemtoJava engine only required an additional 10% of area (in terms of FPGA slices).","PeriodicalId":234262,"journal":{"name":"IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124857894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Francisco J. Jaime, J. Villalba, J. Hormigo, E. Zapata
{"title":"Pipelined Range Reduction for Floating Point Numbers","authors":"Francisco J. Jaime, J. Villalba, J. Hormigo, E. Zapata","doi":"10.1109/ASAP.2006.53","DOIUrl":"https://doi.org/10.1109/ASAP.2006.53","url":null,"abstract":"This paper presents a new pipelined architecture to deal with range reduction for floating point representation. It is based on Horner's scheme and a look-up table. The overall design has been optimized for a module equal to 2π, which is the most widely used due to trigonometric functions requirements. To ensure an accuracy of one unit in the last place (ULP), a complete error propagation study has been carried out.","PeriodicalId":234262,"journal":{"name":"IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122774259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
G. M. D. Dormale, R. Ambroise, D. Bol, J. Quisquater, J. Legat
{"title":"Low-Cost Elliptic Curve Digital Signature Coprocessor for Smart Cards","authors":"G. M. D. Dormale, R. Ambroise, D. Bol, J. Quisquater, J. Legat","doi":"10.1109/ASAP.2006.44","DOIUrl":"https://doi.org/10.1109/ASAP.2006.44","url":null,"abstract":"This paper proposes different low-cost coprocessors for public key authentication on 8-bit smart cards. Elliptic curve cryptography is used for its efficiency per bit of key and the Elliptic Curve Digital Signature Algorithm is chosen. For this functionality, an area constrained coprocessor is probably the best approach to perform the most computer-intensive operations at an acceptable speed considering the limited memory and power of the selected platform. For that purpose, the scalar point multiplication in GF(2m) in both affine and projective coordinates was implemented in order to compare their performances with the same level of optimization and the same technology. A hardware/ software co-design strategy was also used to avoid the need of a dedicated register file.","PeriodicalId":234262,"journal":{"name":"IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122898500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ming-Yung Ko, Claudiu Zissulescu, S. Puthenpurayil
{"title":"Parameterized Looped Schedules for Compact Representationof Execution Sequences","authors":"Ming-Yung Ko, Claudiu Zissulescu, S. Puthenpurayil","doi":"10.1109/ASAP.2006.51","DOIUrl":"https://doi.org/10.1109/ASAP.2006.51","url":null,"abstract":"This paper is concerned with the compact representation of execution sequences in terms of efficient looping constructs. Here, by a looping construct, we mean a compact way of specifying a finite repetition of a set of execution primitives. Such compaction, which can be viewed as a form of hierarchical run-length encoding (RLE), has application in many DSP system synthesis contexts, including efficient control generation for Kahn processes on FPGAs, and software synthesis for static dataflow models of computation. In this paper, we significantly generalize previous models for loop-based code compaction of DSP programs to yield a configurable code compression methodology that exhibits a broad range of achievable trade-offs. Specifically, we formally develop and apply to DSP hardware and software implementation a parameterizable loop scheduling approach with compact format, dynamic reconfigurability, and low-overhead decompression. In our experiments, this new approach demonstrates up to 99% storage saving (versus RLE) and up to 46% frequency enhancement (versus another parameterized approach) in FPGA synthesis, and an average of 11% code size reduction in software synthesis compared to existing methods for code size reduction.","PeriodicalId":234262,"journal":{"name":"IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130504653","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
F. Balasa, P. G. Kjeldsberg, M. Palkovic, Arnout Vandecappelle, F. Catthoor
{"title":"Loop Transformation Methodologies for Array-Oriented Memory Management","authors":"F. Balasa, P. G. Kjeldsberg, M. Palkovic, Arnout Vandecappelle, F. Catthoor","doi":"10.1109/ASAP.2006.42","DOIUrl":"https://doi.org/10.1109/ASAP.2006.42","url":null,"abstract":"The storage requirements in data-dominant signal processing systems, whose behavior is described by arraybased, loop-organized algorithmic specifications, have an important impact on the overall energy consumption, data access latency, and chip area. Applying different loop transformations on the specification code can significantly enhance the memory management of such VLSI systems, improving all the major parameters of the design space - power, area, and performance. This paper gives a global view on existing and recently proposed memory size evaluation approaches for procedural and non-procedural specifications. Moreover, it discusses typical memory management trade-offs taken into account during the exploration of system specifications by loop transformations, that can exploit these early size evaluations.","PeriodicalId":234262,"journal":{"name":"IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126683583","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Quantitative Analysis of Embedded FPGA-Architectures for Arithmetic","authors":"T. V. Sydow, B. Neumann, H. Blume, T. Noll","doi":"10.1109/ASAP.2006.56","DOIUrl":"https://doi.org/10.1109/ASAP.2006.56","url":null,"abstract":"Embedding FPGAs (eFPGAs) in modern SoCs provides a high amount of flexibility while high-throughput digital signal processing algorithms can be realised efficiently. An analysis of eFPGA architectures and corresponding structural elements is presented to determine the optimisation potential for eFPGAs tailored to an arithmetic oriented application domain. The applied design flow incorporating an automated layout generation approach and the utilised simulation environment is discussed. An eFPGA macro designed and realised for arithmetic oriented applications is quantitatively compared to an actual commercial FPGA in terms of area, power consumption and delay time. It can be shown that this optimised eFPGA macro outperforms a state of the art commercial device for a couple of arithmetic operators which are commonly applied in arithmetic datapaths","PeriodicalId":234262,"journal":{"name":"IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06)","volume":"30 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123532134","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dynamic-SIMD for lens distortion compensation","authors":"B. Mesman, H. Fatemi, H. Corporaal, T. Basten","doi":"10.1109/ASAP.2006.29","DOIUrl":"https://doi.org/10.1109/ASAP.2006.29","url":null,"abstract":"An increasing computational demand is placed on the image processing capacity of current and future smart cameras. SIMD processor architectures provide an efficient solution because their repetitive structure matches the data-parallel execution pattern inherent in pixel-type processing. But the lack of support for communicating pixel data over variable distances has forced designers to allocate dedicated hardware or FPGAs for compensating lens distortion and other non-linear operations. We propose a hardware extension to SIMD processors that enables dynamic communication. Using detailed area cost models and a high-level simulator we optimize the extension with regard to the number of buses, bus arbitration policies, and local instruction buffer sizes","PeriodicalId":234262,"journal":{"name":"IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06)","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121415259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}