{"title":"On the formal derivation of a systolic array for recursive least squares estimation","authors":"I. Proudler, J. McWhirter, M. Moonen","doi":"10.1109/ISCAS.1994.408971","DOIUrl":"https://doi.org/10.1109/ISCAS.1994.408971","url":null,"abstract":"We present the proof of a new systolic array for implementing a recursive least squares (RLS) algorithm based on the QR decomposition (QRD) inverse-updates method. In its basic formulation, this algorithm contains a long data feedback path which makes the construction of a systolic architecture very difficult. Here we show how to transform the algorithm so as to circumvent this problem.<<ETX>>","PeriodicalId":140999,"journal":{"name":"Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129184175","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":"Design and implementation of cosine-modulated 2 dimensional perfect reconstruction FIR filter banks","authors":"M. Ikehara","doi":"10.1109/ISCAS.1994.408909","DOIUrl":"https://doi.org/10.1109/ISCAS.1994.408909","url":null,"abstract":"It is well known that FIR filter banks, satisfying the perfect reconstruction (PR) property, can be obtained by cosine modulation of linear-phase prototype FIR digital filter. In this paper, it is shown to be possible to design 2-dimensional (2-D) PR filter banks using cosine modulation as for the 1-D case. At first, the author designs a 2-D digital filter with half passband obtained by the sampling matrix. Next, 2-D analysis filter banks are realized by cosine-modulating this prototype 2-D digital filter. It is shown that the modulation in 2-D frequency plane is equivalent to the 1-D modulation. A necessary and sufficient condition for 2-D perfect reconstruction filter banks is derived. Furthermore the author formulates the design method as a quadratic-constrained least-square minimization problem.<<ETX>>","PeriodicalId":140999,"journal":{"name":"Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126660547","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 \"generalized bilinear system\" : a class of nonlinear discrete systems","authors":"T. Bose, K. S. Joo","doi":"10.1109/ISCAS.1994.408935","DOIUrl":"https://doi.org/10.1109/ISCAS.1994.408935","url":null,"abstract":"A new class of nonlinear discrete-time systems is formulated and called the \"Generalized Bilinear System (GBLS)\". The well known bilinear system is a special class of this system, and hence the reason for the name. The GBLS is investigated for bounded input bounded output (BIBO) stability. It is shown that the GBLS is a special class of linear shift variant (LSV) systems. Three different sufficient conditions are established for the stability of LSV systems. Two of these conditions can be used in a very straightforward manner for monitoring the stability of a GBLS used as an adaptive filter.<<ETX>>","PeriodicalId":140999,"journal":{"name":"Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114947500","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 new block adaptive algorithm using order recursive UD factorization method","authors":"T. Furukawa, S. Yoshimoto, H. Kubota","doi":"10.1109/ISCAS.1994.408980","DOIUrl":"https://doi.org/10.1109/ISCAS.1994.408980","url":null,"abstract":"Adaptive algorithm especially plays the important role in adaptive signal processing, and much work has been proposed with various techniques until up to now. Among them, the algorithms using orthogonal projection are well known, which can be expressed with Moore-Penrose type generalized inverse matrix, with respect to the convergence characteristics. This paper presents a new block adaptive algorithm in which Moore-Penrose type generalized matrix can be efficiently calculated with order-update UD factorization. The proposed algorithm is expected to have stable property, since it includes less divisions in the procedures compared with the traditional last block adaptive algorithms.<<ETX>>","PeriodicalId":140999,"journal":{"name":"Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125840463","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":"Correlation-feedback approach to computation of optical flow","authors":"J. N. Pan, Y. Shi, C. Shu","doi":"10.1109/ISCAS.1994.409094","DOIUrl":"https://doi.org/10.1109/ISCAS.1994.409094","url":null,"abstract":"The optical flow techniques have been developed for more than one decade. Once the optical flow field is computed accurately, this measurement of image velocity can be used widely in many tasks in computer vision area. Current computer vision techniques require that the relative errors in the optical flow be less than 10%. However, to reduce error in determination of the optical flow is still a difficult problem. In this paper, firstly, errors occurring in the correlation-based approaches to optical flow computation are analyzed. Through understanding how the errors arise, we developed a new approach to computation of optical flow named the correlation-feedback approach. It is based on the idea of feedback and the correlation-based approach. In this approach, a virtual continuous image is obtained by a bilinear interpolation applied to a digital image. The idea of feedback is used so that errors in determining optical flow are reduced considerably in the iterative procedure. It is proved that the algorithm is convergent generally. Several experiments working on real image sequences in the laboratory demonstrate that our correlation-feedback algorithm performs better than the gradient-based and correlation-based algorithms in terms of accuracy.<<ETX>>","PeriodicalId":140999,"journal":{"name":"Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131682042","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":"Feedback-controlled enhance-pull-down BiCMOS for sub-3-V digital circuit","authors":"Yuh-Kuang Tseng, Kuo-Hsing Cheng, Chung-Yu Wu","doi":"10.1109/ISCAS.1994.409187","DOIUrl":"https://doi.org/10.1109/ISCAS.1994.409187","url":null,"abstract":"This paper describes a new feedback-controlled enhanced-pull-down BiCMOS (FC-EPD-BiCMOS) logic scheme for the low-supply-voltage operation. Through the use of the feedback-controlled enhanced-pull-down structure, the driving capability is improved and bipolar transistor saturation during operation period is avoided. Based upon the proposed. Structure, both static and differential logic gates are developed. The new BiCMOS three-input NAND gate offers 35% reduction in the propagation delay time as compared to conventional BiCMOS circuits at 2.5 V supply voltage. The proposed three-input FC-EPD-BiCMOS CPL XOR/XNOR gate has 33% improvement in delay time as compared to conventional BiCMOS 3-input XOR/XNOR gates at 2.4 V supply voltage.<<ETX>>","PeriodicalId":140999,"journal":{"name":"Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128915847","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":"Efficient Gabor filter design using Rician output statistics","authors":"T. Weldon, W. Higgins, Dennis F. Dunn","doi":"10.1109/ISCAS.1994.409092","DOIUrl":"https://doi.org/10.1109/ISCAS.1994.409092","url":null,"abstract":"Gabor filters have been applied successfully to a broad range of multidimensional signal processing and image processing tasks. The present paper considers the design of a single filter to segment a two-texture image. A new efficient algorithm for Gabor-filter design is presented. The algorithm draws upon previous results that showed that the output of a Gabor-filtered texture is well represented by a Rician distribution. The new algorithm uses the Rician model to estimate the output statistics of a pair of sample textures from their windowed autocorrelation functions. A measure of the total output power is used to select the center frequency of the filter and estimate the output statistics. The method is further generalized to include the statistics of post-filtered outputs. Experimental results are presented that demonstrate the efficacy of the algorithms.<<ETX>>","PeriodicalId":140999,"journal":{"name":"Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126209010","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":"Hierarchical techniques for symbolic analysis of large electronic circuits","authors":"S. Jou, Mei-Fang Perng, C. Su, C. K. Wang","doi":"10.1109/ISCAS.1994.408745","DOIUrl":"https://doi.org/10.1109/ISCAS.1994.408745","url":null,"abstract":"A hierarchical symbolic analyzer (SAGA2) for the analysis of electronic circuits is presented. SAGA2 analyzes lumped, linear, or linearized (small-signal) circuits in the S- and Z-domain. For large circuits, a hierarchical two-port method is used that is two to three order faster than that without using the hierarchical method. Also, the memory used is dramatically reduced.<<ETX>>","PeriodicalId":140999,"journal":{"name":"Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94","volume":"44 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132640273","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":"Finite state vector quantization with multi-path tree search strategy for image/video coding","authors":"S. Juan, Yen Chao, Chen-Yi Lee","doi":"10.1109/ISCAS.1994.409136","DOIUrl":"https://doi.org/10.1109/ISCAS.1994.409136","url":null,"abstract":"This paper presents a new vector quantization (VQ) algorithm exploiting the features of tree-search as well as finite state VQs for image/video coding. In the tree-search VQ, multiple candidates are identified for on-going search to optimally determine an index of the minimum distortion. In addition, the desired codebook has been reorganized hierarchically to meet the concept of multi-path search of neighboring trees so that picture quality can be improved by 4 dB on the average. In the finite state VQ, adaptation to the state codebooks is added to enhance the hit-ratio of the index produced by the tree-search VQ and hence to further reduce compressed bits. An identifier code is then included to indicate to which output indices belong. Our proposed algorithm not only reaches a higher compression ratio but also achieves better quality compared to conventional finite-state and tree-search VQs.<<ETX>>","PeriodicalId":140999,"journal":{"name":"Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134284458","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 general approach to design VLSI arrays for the multi-dimensional discrete Hartley transform","authors":"Jiun-In Guo, Chi-Min Liu, C. Jen","doi":"10.1109/ISCAS.1994.409240","DOIUrl":"https://doi.org/10.1109/ISCAS.1994.409240","url":null,"abstract":"In this paper, a general memory-based approach to design VLSI arrays for the multi-dimensional (M-D) discrete Hartley transform (DHT) with any length is proposed. There are four parts of this approach: (1) a new M-D DHT formulation, (2) cyclic convolution representation, (3) systolic array realization, and (4) memory-based implementation. Deriving a new M-D DHT formulation avoids the undesirable overhead required in formal designs. Taking cyclic convolution provides high computing parallelism and low computation complexity. Using systolic array realisation results in high computing speeds and low I/O cost. Adopting the memory-based implementation yields low hardware cost and low power dissipation. In summary the proposed approach will lead to efficient and high-performance VLSI array designs for the M-D DHT.<<ETX>>","PeriodicalId":140999,"journal":{"name":"Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123861901","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}