{"title":"Pipelined Wave Digital Filter design for narrow-band sharp-transition digital filters","authors":"Jin-Gyun Chung, K. K. Parhi","doi":"10.1109/VLSISP.1994.574774","DOIUrl":"https://doi.org/10.1109/VLSISP.1994.574774","url":null,"abstract":"The finite word-length effects in most IIR digital filters can be improved by realizing the transfer function in terms of a cascade or parallel arrangement of second order filter sections instead of a direct-form realization. However, for narrow-band sharp-transition filters, we still have large roundoff noise problems even with second order sections. In this case, the WDF (Wave Digital Filter) can be a good solution. Although the WDFs can be pipelined by the cut-set localization procedure, the maximum sample rate cannot be increased by this technique due to the presence of the feedback loops in the WDFs. In this paper, a pipelined WDF design method for narrow-band sharp transition filters is proposed. The pipelining method is based on the DIFIR (Decomposed and Interpolated FIR) method, where an IIR filter with M-times wider transition bandwidth (compared with the original specification) is cascaded with log/sub 2/ M FIR filters which have very wide transition bandwidths. The new IIR filter produces much smaller noise. In addition, the new IIR transfer function satisfies the pipelining property which can be used in high speed or low power applications.","PeriodicalId":427356,"journal":{"name":"Proceedings of 1994 IEEE Workshop on VLSI Signal Processing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124917937","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":"Low power design of memory intensive functions. Case study: vector quantization","authors":"D. Lidsky, J. Rabaey","doi":"10.1109/VLSISP.1994.574762","DOIUrl":"https://doi.org/10.1109/VLSISP.1994.574762","url":null,"abstract":"This paper demonstrates techniques to optimize power consumption of memory intensive applications. A design example-a video, vector quantizer encoder-demonstrates how optimization at the algorithm, architecture and circuit level can reduce power consumption by reducing both the effective switched capacitance and the required speed of the system's memory.","PeriodicalId":427356,"journal":{"name":"Proceedings of 1994 IEEE Workshop on VLSI Signal Processing","volume":" 27","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113953394","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":"Digital automatic gain control for hearing aids","authors":"P. Camilleri, G. Sobelman","doi":"10.1109/VLSISP.1994.574725","DOIUrl":"https://doi.org/10.1109/VLSISP.1994.574725","url":null,"abstract":"A new digital method for implementing Automatic Gain Control (AGC) in a hearing aid is described. The AGC characteristics are programmable, which allows the system to be customized for a particular user. Since no external timing components are required the implementation is area-efficient, completely monolithic, and insensitive to temperature variation and component aging. The technique may be applied to both input and output compression systems. Simulation results are presented.","PeriodicalId":427356,"journal":{"name":"Proceedings of 1994 IEEE Workshop on VLSI Signal Processing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123905562","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":"Microphone array signal processing for hearing aid application","authors":"D. Korompis, K. Yao, R. E. Hudson, F. Lorenzelli","doi":"10.1109/VLSISP.1994.574726","DOIUrl":"https://doi.org/10.1109/VLSISP.1994.574726","url":null,"abstract":"We consider an equally spaced linear array with R microphone sections each with L FIR taps. The tap coefficients are obtained upon the maximization of the array energy concentration over some desired spatial \"look\" region and wide frequency band subject to user imposed spatial and frequency attenuation constraints. These coefficients are given by the dominant generalized eigenvector of a generalized eigenvalue problem. Analytical, numerical, and computational complexity properties of the generalized eigenvector solution are discussed. Numerical and simulation examples for an array with four microphones, a sampling frequency of 7.35 kHz, and different number of tap coefficients, illustrate the feasibility of achieving real-time high speech quality acoustic beamformer with spatial interference rejection capability.","PeriodicalId":427356,"journal":{"name":"Proceedings of 1994 IEEE Workshop on VLSI Signal Processing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128216058","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":"Processor-optimal implementation of real-time DSP algorithms","authors":"Y. Hu, Duen-Jeng Wang","doi":"10.1109/VLSISP.1994.574741","DOIUrl":"https://doi.org/10.1109/VLSISP.1994.574741","url":null,"abstract":"In this paper, we consider the real-time implementation of recursive digital signal processing algorithms on an application-specific multiprocessor system. The objective is to devise a periodic schedule, and a fully static task assignment scheme to meet the desired throughput rate while minimizing the number of processors. Toward this goal, we propose a notion called cutoff time. We prove that the optimal periodic schedule can be found within a finite time interval bounded by the cutoff time. As such the complexity of the scheduling algorithm and the allocation algorithm can be significantly reduced.","PeriodicalId":427356,"journal":{"name":"Proceedings of 1994 IEEE Workshop on VLSI Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129009656","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":"Improved scheduling of signal flow graphs onto multiprocessor systems through an accurate network modelling technique","authors":"S. Banerjee, D. Picker, R. Fellman, P. Chau","doi":"10.1109/VLSISP.1994.574740","DOIUrl":"https://doi.org/10.1109/VLSISP.1994.574740","url":null,"abstract":"This paper presents a new integrated technique for accurately scheduling acyclic precedence expansion graphs (APEGs) onto multiprocessor networks with various topologies. APEGs specify the nature, connectivity, and precedence relationships of all tasks, as well as data amounts that pass between tasks. We present a scheduling algorithm that uses the Branch and Bound technique when the number of tasks in the graph is small, and the Earliest Task First heuristic, otherwise. Graph partitioning and scheduling algorithms however, require a good estimate of interprocessor communication (IPC) costs within the target network. We thus use a technique called Successive Superposition to accurately determine IPC costs. Successive Superposition provides a methodology to decompose a complex network, containing primarily deterministic traffic, into simpler queueing models which may then be analyzed in isolation. By combining a heuristic scheduling algorithm with this exact IPC analysis technique, we avoid unpredictable behavior and incorrect mapping decisions that could result in longer graph execution times. We present an example in which an inaccurate assessment of IPC costs leads to a 22% to 30% increase in the graph execution time.","PeriodicalId":427356,"journal":{"name":"Proceedings of 1994 IEEE Workshop on VLSI Signal Processing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132949161","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}
E. Deprettere, G.H. Hekstra, Li-Shen Sheng, J. Bu, G. Boersma
{"title":"A parallel system for photo realistic artificial scene rendering","authors":"E. Deprettere, G.H. Hekstra, Li-Shen Sheng, J. Bu, G. Boersma","doi":"10.1109/VLSISP.1994.574767","DOIUrl":"https://doi.org/10.1109/VLSISP.1994.574767","url":null,"abstract":"We present a parallel system for fast rendering of artificial scenes with photo realism. The underlying parallel algorithm is based on ray-tracing and radiosity shading. The system consists of a standard workstation, a medium-size mesh of cluster processors and a high-bandwidth interconnection between them. Each cluster processor consists of a programmable TMS320C40 core and three dedicated VLSI satellites. The rendering algorithm runs on both the workstation host and its rendering mate in a true shared/distributed manner. The system is the result of an exercise in combined algorithm and architecture design as well as software/hardware co-design.","PeriodicalId":427356,"journal":{"name":"Proceedings of 1994 IEEE Workshop on VLSI Signal Processing","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116406828","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":"HLS based DSP optimization with ASIC RTL libraries","authors":"J. Isoaho, J. Oberg, A. Hemani, H. Tenhunen","doi":"10.1109/VLSISP.1994.574746","DOIUrl":"https://doi.org/10.1109/VLSISP.1994.574746","url":null,"abstract":"In this paper we show how the High Level Synthesis (HLS) tool can efficiently be used for DSP ASIC development. The performance of general HLS tool is improved with simple transformations and code optimizations, and a direct mapping to technology optimized parameterizable ASIC Register Transfer Level (RTL) library. The library mapping contains three phases: a structure recognition, an architecture selection and a parameter optimization. As an optimization framework SYNT, Synopsys and Matlab design environments are integrated. Lsi10k and Xilinx 4000 series are used as target technologies to demonstrate the performance of the approach.","PeriodicalId":427356,"journal":{"name":"Proceedings of 1994 IEEE Workshop on VLSI Signal Processing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122726657","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":"Techniques for at-speed testing of VLSI ASIC designs","authors":"S. Dey, M. Potkonjak","doi":"10.1109/VLSISP.1994.574748","DOIUrl":"https://doi.org/10.1109/VLSISP.1994.574748","url":null,"abstract":"This paper presents non-scan design-for-testability techniques applicable to register-transfer (RT) level data path circuits, which are usually very hard-to-test due to the presence of complex loop structures. We develop a new DFT measure, and utilize the RT-level structure of the data path together with adding constants, for cost-effective re-design of the circuit to make it easily testable, without having to either scan any FF, or break loops directly. The non-scan DFT technique was applied to several data paths. Experimental results demonstrate the feasibility of producing non-scan testable data paths, which can be tested at-speed, with marginal area overheads.","PeriodicalId":427356,"journal":{"name":"Proceedings of 1994 IEEE Workshop on VLSI Signal Processing","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123227353","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":"A VLSI architecture for modified frequency sensitive self-organizing neural network for image data compression","authors":"L. Chiou, J. Limqueco, M. Bayoumi","doi":"10.1109/VLSISP.1994.574766","DOIUrl":"https://doi.org/10.1109/VLSISP.1994.574766","url":null,"abstract":"We present an adaptive neural network processor for image compression based on a modified frequency-sensitive self-organization algorithm. In this algorithm updating the code vector has a complexity of O(1) and O(N) for best case and worst case situations respectively. Experiments have shown that the worst case situation occurs only at the initial stage of the learning process, and performance improves as the learning continues. The utilization of learning neurons is considerably increased compared to other algorithms. This algorithm not only achieves a near-optimal result, comparable with Linde-Buzo-Gray (LBG), but also retains simplicity for hardware implementation. A mixed-signal architecture is proposed for this algorithm. It consists of analog circuitry which is responsible for neural network computation and digital circuitry for frequency updating and loser selection.","PeriodicalId":427356,"journal":{"name":"Proceedings of 1994 IEEE Workshop on VLSI Signal Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131685211","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}