电路与系统学报最新文献

{"title":"Multimedia content classification using motion and audio information","authors":"Yao Wang, Jincheng Huang, Zhu Liu, Tsuhan Chen","doi":"10.1109/ISCAS.1997.622200","DOIUrl":"https://doi.org/10.1109/ISCAS.1997.622200","url":null,"abstract":"Content-based video segmentation and classification is a key to the success of future multimedia databases. Research in this area in the past several years has focused on the use of speech recognition and image analysis techniques. As a complimentary effort to prior research, we have focused on the use of motion and audio characteristics. Fundamental to both segmentation and classification tasks is the characterization by certain features of a given video segment. In this paper, we describe several audio and motion features that have been found to be effective in distinguishing motion and audio characteristics of different types of scenes.","PeriodicalId":68559,"journal":{"name":"电路与系统学报","volume":"19 2 1","pages":"1488-1491 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85416940","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 techniques and paradigms toward design of low-voltage CMOS analog circuits","authors":"V. Prodanov, M. Green","doi":"10.1109/ISCAS.1997.608633","DOIUrl":"https://doi.org/10.1109/ISCAS.1997.608633","url":null,"abstract":"Techniques for the design of robust low-voltage CMOS analog circuits are given. It is shown that both V/sub t/-independence and proper alignment between the input and output swings are crucial for effective design of low-voltage circuits.","PeriodicalId":68559,"journal":{"name":"电路与系统学报","volume":"15 1","pages":"129-132 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81675472","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 neural network based CDMA detector with robust near-far resistance","authors":"D.C. Chen, B. Sheu, W. Fang","doi":"10.1109/ISCAS.1997.621576","DOIUrl":"https://doi.org/10.1109/ISCAS.1997.621576","url":null,"abstract":"In code division multiple access (CDMA), high efficiency for spectrum usage and robust jamming resistance have been increasingly important. However the inherent near-far problem is an impediment. Although deliberate power control algorithms can partially solve this problem, the cost is high. In this paper, a compact neural network based detector for CDMA is proposed. By proper array processing and applying hardware annealing technique, the VLSI implementation of optimal multiuser detector (OMD) is suitable.","PeriodicalId":68559,"journal":{"name":"电路与系统学报","volume":"12 1","pages":"2120-2123 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81790674","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":"Call admission: dimensioning a single VBR video source using transition probability matrix","authors":"Y. J. Chung, Antonio Ortega, C.-C. Jay Kuo","doi":"10.1109/ISCAS.1997.622111","DOIUrl":"https://doi.org/10.1109/ISCAS.1997.622111","url":null,"abstract":"This paper describes a novel and simple comparison method for variable bit rate (VBR) video sources according to their average excess rate/frame. We present the parameter average excess rate/frame (/spl alpha/) as an alternative to the traditional parameters used in call admission, e.g. long term rate, variance, peak rate. We propose a way of calculating /spl alpha/ through the use of transition probability matrices (TPM) of VBR sources, specifically using their holding times and asymptotic mean occupancies. A useful property of the proposed algorithm is that it allows comparisons between TPMs of different sizes and VBR video sequences of different durations. This algorithm can serve as an aid in call admission for bandwidth allocation purposes.","PeriodicalId":68559,"journal":{"name":"电路与系统学报","volume":"33 1","pages":"1345-1348 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81945133","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":"New A/D converter architectures based on Gray coding","authors":"S. Signell, B. Jonsson, H. Stenstrom, N. Tan","doi":"10.1109/ISCAS.1997.608755","DOIUrl":"https://doi.org/10.1109/ISCAS.1997.608755","url":null,"abstract":"In this paper, we propose the use of Gray codes in algorithmic and pipeline A/D converters. The major advantage is the tolerance to offset errors in circuit realizations compared with traditional A/D converters using binary coding. Both theoretical investigation and system simulation indicate that the Gray code algorithmic and pipeline AID converters are well suited for high-resolution and/or low-distortion applications.","PeriodicalId":68559,"journal":{"name":"电路与系统学报","volume":"8 1","pages":"413-416 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82153076","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":"Pipelined LMS adaptive filter using a new look-ahead transformation","authors":"K. Matsubara, K. Nishikawa, H. Kiya","doi":"10.1109/ISCAS.1997.612784","DOIUrl":"https://doi.org/10.1109/ISCAS.1997.612784","url":null,"abstract":"This paper proposes an adaptive algorithm that can be pipelined and an efficient architecture for hardware implementation of the least mean square (LMS) adaptive algorithm. The proposed algorithm provides the possibility of the pipelined processing of the LMS algorithm without degradation of the convergence characteristic. The architecture based on the proposed algorithm is considered and the efficient implementation of the architecture to reduce the amount of hardware required is also considered.","PeriodicalId":68559,"journal":{"name":"电路与系统学报","volume":"16 1","pages":"2309-2312 vol.4"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79463321","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":"An optimal solution of the Shannon switching game played on a graph","authors":"L. Weinberg","doi":"10.1109/ISCAS.1997.621483","DOIUrl":"https://doi.org/10.1109/ISCAS.1997.621483","url":null,"abstract":"In a previous paper of the writer's, co-authored with John Bruno, a simple graph-theoretic solution to the Shannon two-person switching game was presented. The solution is constructive in that efficient algorithms were formulated that determined if a game played on any given graph is a short, cut, or neutral game, and gave the strategies for winning each type of game. The proof makes use of Lehman's solution combined with the principal partition of a graph, a unique decomposition of a graph discovered by Kishi and Kajitani. In addition, by a correct application of duality theory Bruno and Weinberg also proved that the strategies are global strategies, that is, they guarantee a win in the so-called global game for the short, cut, and neutral games. Another of their proofs showed that a further decomposition of the principal partition of Kishi and Kajitani was possible, that is, a refined unique partition can be obtained. Finally, they generalized all the new results on the principal partition to matroids so that the complete analysis can be automatically applied to solve the Shannon game played on a matroid. In this paper we improve the solution to an optimal one. This optimal solution also generalizes to the game played on a matroid, but here we focus attention on the graph-theoretic case and present the solution entirely within the context of graph theory. We accomplish this by using an enhanced version of graph theory that we claim is a new paradigm for graph theory (which we present in a companion paper). By an optimal solution we mean that a global game is won in a minimum number of plays. This is brought about by determining at the beginning of the game the smallest possible minor of the given graph on which a winning game with respect to the distinguished edge can be played. The size of this minor is automatically given by the co-spanning sets of the minor formed by the union of those atoms, and only those atoms, of the associated partial order, that are required for guaranteeing the winning game. The latter minor is thus unique, and the minimum number of plays for the global game is given by the strategies and determined by the size of the co-spanning sets in the smallest possible minor. Just as the previous solution was based on the principal partition, so the optimal solution is based on a refinement of the principal partition, which we designate as the general principal partition, whose development was begun by Bruno and Weinberg using concepts and algorithms first formulated by them and then applied in a further and final extension independently by Narayanan and Tomizawa. The optimal solution uses the same strategies and efficient algorithms (but now applied to the smallest minor) as the earlier solution and thus continues to be constructive. Finally, there are also versions of the Shannon switching game played on a directed graph and an oriented matroid, at least two of which have a solution with the same necessary and sufficient cond","PeriodicalId":68559,"journal":{"name":"电路与系统学报","volume":"1 1","pages":"1752-1755 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79819197","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 lattice vector quantization for wavelet-based image coding","authors":"J. Ni, K. Ho, K. Tse","doi":"10.1109/ISCAS.1997.621965","DOIUrl":"https://doi.org/10.1109/ISCAS.1997.621965","url":null,"abstract":"It is well known that there exists strong energy correlation between various subbands of a real-world image. A new powerful technique of Finite State Vector Quantization (FSVQ) has been introduced to fully exploit the self-similarity of the image in wavelet domain across different scales. Lattices in R/sup N/ have considerable structure, and hence, Lattice VQ offers the promise of design simplicity and reduced complexity encoding. The combination of FSVQ and LVQ gives rise to the so-called FSLVQ, which is proved to be successful in exploiting the energy correlation across scales and is simple enough in implementation.","PeriodicalId":68559,"journal":{"name":"电路与系统学报","volume":"47 1","pages":"1137-1140 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81779278","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 true single-phase clocking scheme for low-power and high-speed VLSI","authors":"B. Kong, Young-Hyun Jun, K. Lee","doi":"10.1109/ISCAS.1997.621522","DOIUrl":"https://doi.org/10.1109/ISCAS.1997.621522","url":null,"abstract":"This paper describes a true-single-phase clocking scheme with charge-recycling differential logic (CRDL). The original CRDL circuit is modified for use with only a single-phase clock signal which is never inverted. This circuit achieves low-power and high-speed operation by eliminating the need for slow PMOS-logic blocks in a pipelined configuration, in addition to using charge-recycling technique. XOR/XNOR gates and a pipelined 32-bit adder are constructed with this circuit technique. The simulation results show that the proposed clocking scheme improves power-delay product by 30.1 to 49.8% as compared to the true-single-phase clocking scheme with conventional differential cascode voltage switch (DCVS) logic.","PeriodicalId":68559,"journal":{"name":"电路与系统学报","volume":"86 5 1","pages":"1904-1907 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84025748","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":"Lossless compression of color images using an improved integer-based nonlinear wavelet transform","authors":"I. Singh, P. Agathoklis, A. Antoniou","doi":"10.1109/ISCAS.1997.612859","DOIUrl":"https://doi.org/10.1109/ISCAS.1997.612859","url":null,"abstract":"New technique for lossless color images is proposed. The technique is based on a new color image transformation using integer arithmetic and an improved integer-based nonlinear discrete wavelet transform. The proposed mapping is compared with the existing RGB (red, green, blue) and YIQ (luminance and chrominance) transformations. The compression technique is illustrated by applying the proposed wavelet-based algorithm on various color images. Comparisons with other techniques are made with respect to compression efficiency (bits per pixel) and computational complexity. The results indicate that the proposed technique leads to higher compression without increasing the computation time.","PeriodicalId":68559,"journal":{"name":"电路与系统学报","volume":"87 12 1","pages":"2609-2612 vol.4"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84032509","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}