{"title":"Evaluation of a clocking strategy with relaxed constraints on clock edges","authors":"E. Backenius, M. Vesterbacka","doi":"10.1109/TENCON.2004.1414957","DOIUrl":"https://doi.org/10.1109/TENCON.2004.1414957","url":null,"abstract":"A strategy that aims at relaxing the design of the clock network in digital circuits is evaluated through simulations and measurements on a test circuit. In the strategy a clock with long rise and fall times is used in conjunction with a D flip-flop that operates well with this clock. The test circuit consists of a digital FIR filter and a clock buffer with adjustable driving strength. It was designed and manufactured in a 0.35 /spl mu/m CMOS process. The energy dissipation of the circuit increased 14% when the rise and fall times of the clock increased from 0.5 ns to 10 ns. The corresponding increase in propagation delay was less than 0.5 ns, i.e. an increase of 50% in propagation delay of the register. The results in this paper show that the clocking strategy can be implemented with low costs of power and speed.","PeriodicalId":434986,"journal":{"name":"2004 IEEE Region 10 Conference TENCON 2004.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114488795","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":"Multipath delay estimation for acoustic echo channel","authors":"R.N. Sharma, A. Chaturvedi, G. Sharma","doi":"10.1109/TENCON.2004.1414373","DOIUrl":"https://doi.org/10.1109/TENCON.2004.1414373","url":null,"abstract":"A new algorithm for multipath delay estimation based upon autocorrelation estimator (AE) has been proposed. The existing generalized autocorrelation estimator (GAE) has been modified by passing it through a sliding window of suitable shape and size resulting in improvement in performance. The performance improvement obtained because of the window has been determined for the case when the input is a filtered version of a white Gaussian signal. Accuracy percentage (AP) has been plotted against SNR. Simulation results show that the proposed scheme performs better delay estimation even at relatively low SNR","PeriodicalId":434986,"journal":{"name":"2004 IEEE Region 10 Conference TENCON 2004.","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114811462","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 surface-projection MMI for the fusion of brain MR and SPECT images","authors":"Jiann-Der Lee, B. Huang, Chung-Hsien Huang","doi":"10.1109/TENCON.2004.1414386","DOIUrl":"https://doi.org/10.1109/TENCON.2004.1414386","url":null,"abstract":"Recently, maximization mutual information (MMI) of image intensities has been proposed as a new matching criterion for automated multimodality image registration. However, the success of the MMI relies on the similarity of the histogram distribution between the images to be fused. This condition is usually hard to be achieved in practical application. Besides, MMI is time consuming because it needs to find an optimal solution about six parameters (three for shifts and three for rotations) during the registration process. To improve the performance of traditional MMI, a novel scheme named surface-projection MMI algorithm (SP-MMI) is proposed here. SP-MMI is a two-stage registration algorithm included MMI of surface projection and the following MMI of axial plane. The experimental results, using MR and SPECT images, to confirm the good performance of the proposed method in comparison with the traditional MMI method are also included.","PeriodicalId":434986,"journal":{"name":"2004 IEEE Region 10 Conference TENCON 2004.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114651219","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}
D. Nualhong, S. Chusanapiputt, S. Phomvuttisarn, T. Saengsuwan, S. Jantarang
{"title":"Diversity control approach to ant colony optimization for unit commitment problem","authors":"D. Nualhong, S. Chusanapiputt, S. Phomvuttisarn, T. Saengsuwan, S. Jantarang","doi":"10.1109/TENCON.2004.1414814","DOIUrl":"https://doi.org/10.1109/TENCON.2004.1414814","url":null,"abstract":"This paper presents a new method to solve the constrained unit commitment problem by applying ant colony optimization (ACO) based on the diversity control approach. The pheromone updating rule is modified to control the diversification by adopting a simple mechanism for random selection in ACO. The proposed method is tested on the 10-unit test system with a scheduling time horizon of 24 hours. The numerical results show an economical saving in the total operating cost when compared to the previous literature results. Moreover, two types of the proposed diversity control technique have the features of easy implementation and a better convergence rate superior to a standard ACO.","PeriodicalId":434986,"journal":{"name":"2004 IEEE Region 10 Conference TENCON 2004.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114715324","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":"Hardware efficient DCT implementation for portable multimedia terminals using subexpression sharing","authors":"A. P. Vinod, E. Lai","doi":"10.1109/TENCON.2004.1414398","DOIUrl":"https://doi.org/10.1109/TENCON.2004.1414398","url":null,"abstract":"Low-power and high-speed implementation of discrete cosine transform (DCT) for mobile multimedia terminals presents a hardware design challenge. The cost of DCT implementation is dominated by the complexity of the multiplier. The systolic array and the memory-based designs do not consider the optimization of the multiplications in transform coding. A method to minimize the complexity of multiplication in DCT by efficient sharing of the common subexpressions that occur in the canonic signed digit (CSD) representation of the elements of the DCT matrix is presented here. Design example of a 8/spl times/8 DCT using 16 bits shows that our method offers hardware reduction of 38% over conventional method.","PeriodicalId":434986,"journal":{"name":"2004 IEEE Region 10 Conference TENCON 2004.","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114947974","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":"Reducing the data size of spatial databases using sign vectors","authors":"Y.L. Lu, K. Kaneko, A. Makinouchi, M. Tanaka","doi":"10.1109/TENCON.2004.1414608","DOIUrl":"https://doi.org/10.1109/TENCON.2004.1414608","url":null,"abstract":"In this paper, we describe a method for effectively expressing spatial geometric data in spatial database systems. The hyperplane is used to split a space into convex polytopes, each having a position vector. These position vectors are used to evaluate the spatial operations: the intersection, the union and the difference between two complexes of convex polytopes in any dimension. First, we explain the idea to represent a spatial object as a set of polytopes induced by hyperplanes, which must be stored in databases. We then present the conversion algorithms between position vectors and sign vectors of the complex model in any dimension. Next, we propose algorithms for compressing and uncompressing the sign vector to be stored in the database data. These algorithms are invoked when evaluating spatial operations. The above algorithms are implemented on an object database system. We also present the results of experimental tests to evaluate the data size of the spatial database.","PeriodicalId":434986,"journal":{"name":"2004 IEEE Region 10 Conference TENCON 2004.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114973910","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":"Implementation of PBS/spl I.bar/LMS algorithm for adaptive filters on FPGA","authors":"R.S. Majdar, M. Eshghi","doi":"10.1109/TENCON.2004.1414343","DOIUrl":"https://doi.org/10.1109/TENCON.2004.1414343","url":null,"abstract":"In this paper the result of implementing the PBS/spl I.bar/LMS algorithm is reported. Transversal adaptive filters for digital signal processing have traditionally been implemented onto DSP processors due to their ability to perform fast floating-point arithmetic operations. Motorola implemented an adaptive filter on ASICS technology (DSP56300). However, with its growing die size as well as incorporating the embedded digital signal processing blocks, the FPGA devices have become a serious contender in the signal processing market. In this paper an adaptive filter is implemented on 2V1500bg575 (Virtex-II family) and on EPIS25F1020C (Stratix family) FPGA from XiIinx and Altera companies. A comparison with this implementation shows a speed about 10:1 with respect to Motorola ASICS is achieved.","PeriodicalId":434986,"journal":{"name":"2004 IEEE Region 10 Conference TENCON 2004.","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115992609","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":"Fast macroblock mode decision in H.264","authors":"Ki-Hun Han, Yung-Lyul Lee","doi":"10.1109/TENCON.2004.1414428","DOIUrl":"https://doi.org/10.1109/TENCON.2004.1414428","url":null,"abstract":"This paper proposes a fast 16/spl times/16 macroblock (MB) mode decision algorithm, which skips variable block size motion estimation/compensation and spatial-predictive coding in H.264 video coding standard. In experimental results, the encoder using the proposed method runs about 2.76 times as fast as that using H.264 rate-distortion optimization (RDO) tool, while the PSNR (peak signal-to-noise ratio) of the reconstructed images are maintained.","PeriodicalId":434986,"journal":{"name":"2004 IEEE Region 10 Conference TENCON 2004.","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123457223","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 switched-capacitor DC-DC converter with various stepped-down outputs","authors":"K. Eguchi, F. Ueno, H. Zhu, T. Tabata","doi":"10.1109/TENCON.2004.1414862","DOIUrl":"https://doi.org/10.1109/TENCON.2004.1414862","url":null,"abstract":"This paper introduces a family of ring-type switched-capacitor (SC) converters, which produces 0.75/spl sim/2.3 V outputs by being stepped-down from a 3.6 V input. The circuit consists of 2 series-connected DC-DC conversion blocks. Since the input voltage is converted twice by these blocks, the proposed circuit can provide more various types of output-voltages than conventional ring-type converters. Furthermore, the power efficiency and the hardware-cost are improved since the number of driver circuits can be reduced. As an example, the circuit is designed with 17 types of output voltages in the range of 0.75/spl sim/2.3 V. The SPICE simulations show that the power efficiency is more than 80% in the output current range from about 110 to 360 mA.","PeriodicalId":434986,"journal":{"name":"2004 IEEE Region 10 Conference TENCON 2004.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123535438","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":"Accurate model of hydroelectric power plant for load pickup during power system restoration","authors":"S. Jadid, A. Salami","doi":"10.1109/TENCON.2004.1414768","DOIUrl":"https://doi.org/10.1109/TENCON.2004.1414768","url":null,"abstract":"Restoration objectives are to restore the system to normal operation as quickly as may be consistent with system security, minimizing the amount of disconnected loads. In the initial phase of restoration, operators are often concerned with load pickup problem. One of the important problems during load pickup is keeping frequency response in an allowable range. The aim of this paper is to investigate load pickup problem based on calculation frequency response of the power system. This paper considers hydro power plants for evaluating the stability and frequency response during load pickup in the early stages of power system restoration. Hydro power plants have capability of black start operation and can be used for early stages of power system restoration. Simulation results are highlighted based on an accurate proposed model of hydro power plant. The main characteristic of the developed model is to consider different parts of hydro power plant. The developed model shows a more detailed and precise calculation of the frequency response in the power system. This work proposes a linearized model that can be utilized instead of nonlinear hydro turbine model. This model is more appropriate for controller analysis using linear methods. Simulation results show that the proposed method helps determine the amount of load pickup during power system restoration.","PeriodicalId":434986,"journal":{"name":"2004 IEEE Region 10 Conference TENCON 2004.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121933222","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}