{"title":"Both direction and time of arrival estimation by using beamforming and MUSIC algorithm for stepped FM array radar","authors":"A. Fujita, T. Fukue, N. Hamada","doi":"10.1109/MWSCAS.2004.1354097","DOIUrl":"https://doi.org/10.1109/MWSCAS.2004.1354097","url":null,"abstract":"In this research, we propose a method to estimate both direction of arrival (DOA) and time of arrival (TOA) using stepped FM radar system. The method uses beamformer and MUSIC algorithm with respect to time and space. The multiple target f s directions and distances are estimated accurately, and they are combined to represent the parameter of each target. Some simulations are performed and they show the validity of our method.","PeriodicalId":185817,"journal":{"name":"The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130482665","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 human motion compression with constraints on frames","authors":"Shiyu Li, M. Okuda, S. Takahashi","doi":"10.1109/MWSCAS.2004.1353975","DOIUrl":"https://doi.org/10.1109/MWSCAS.2004.1353975","url":null,"abstract":"This paper presents a compression method for motion data with special characteristics which can be indicated by motion behavior or specified by user with constraint. Motion capture systems have been widely used to model motion behavior in feature film production, action games and virtual environments on network. In general, the motion data consist of three coordinates or some rotation angles in each frame. For storing motion data and real-time transmission, an uncompressed raw data is often unacceptable. Our method combines wavelet transform and kinematics to implement an efficient motion data compression. Controlling the distortion yielded by the quantization, we enable user to specify constrains of motion. The max shift ROI method is adopted to sign the constraint frames. We further apply an adaptive quantization to establish the optimal position of the joint. Our method achieves 5-20% compression without any visual artifacts. The experiment result shows the validity of our method.","PeriodicalId":185817,"journal":{"name":"The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04.","volume":"249 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134059808","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 high performance class-D amplifier with cascaded sigma-delta modulators","authors":"C. Trehan, Kwong, Chao","doi":"10.1109/MWSCAS.2004.1353998","DOIUrl":"https://doi.org/10.1109/MWSCAS.2004.1353998","url":null,"abstract":"A topology for high performance of a class-D amplifier is proposed. The structural design consists of two sigma-delta modulator (SDM) stages in cascade with an intermediate decimation-filter between them. Noise and high tone introduced at the first stage are filtered out through the decimation-filter. The signal is converted to a 1-bit pulse duration modulation signal by the second stage SDM. The H-bridge is made part of the SDM loop, which not only enables the shaping of quantization noise but also stabilizes the output power switching stage.","PeriodicalId":185817,"journal":{"name":"The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04.","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134111736","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":"Theory of the optimum approximation of vector-signals with applications","authors":"Y. Kida, T. Kida","doi":"10.1109/MWSCAS.2004.1354102","DOIUrl":"https://doi.org/10.1109/MWSCAS.2004.1354102","url":null,"abstract":"Recently, it has been required to develop efficient method of solving large-scale set of variable-coefficient linear differential equations in the field of the quantum mechanics in order to analyse the 3D structure of prion-protein. In this paper, we present generalized optimum approximation for a certain set of vector-signals that must be useful in solving these differential equations. The presented approximation is quite flexible in choosing sample points and linear preprocessing. The number of variables for a signal and its generalized spectrum are different, in general. In this analysis, we consider the set of vector-signals such that the generalized spectrums have weighted norms smaller than a given positive number. The presented approximation minimizes various worst-case measure of approximation error at the same time among all the linear and the nonlinear approximations under the same conditions.","PeriodicalId":185817,"journal":{"name":"The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04.","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134113381","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":"Scalable pipeline insertion in floating-point division and square root units","authors":"I. Ortiz, Manuel Jimenez","doi":"10.1109/MWSCAS.2004.1354133","DOIUrl":"https://doi.org/10.1109/MWSCAS.2004.1354133","url":null,"abstract":"Division and square root are important operations in a number of data processing algorithms. They are inherently time consuming operations and can require a significant amount of resources when implemented in hardware. This work reports the development of scalable, floating-point (FP) division and square root operators with adjustable precision, range, and pipeline granularity. An algorithm for pipeline insertion was used for both operators, enabling speeds up to 204MFLOPS when implemented on a Xilinx Virtex II FPGA.","PeriodicalId":185817,"journal":{"name":"The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134192108","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 robust technique for multiuser detection in non Gaussian channels","authors":"T. Anil Kumar, K. Deergha Rao, M. Swamy","doi":"10.1109/MWSCAS.2004.1354338","DOIUrl":"https://doi.org/10.1109/MWSCAS.2004.1354338","url":null,"abstract":"In many physical channels where multiuser detection techniques are to be applied, the ambient channel noise is known through experimental measurements to be decidedly non-Gaussian, due largely to impulsive phenomenon. This is due to impulsive nature of man-made electromagnetic interference and a great deal of natural noise. This paper presents a robust multiuser detector for combating multiple access interference and impulsive noise in CDMA communication systems. This detector is essentially a robust version of the linear decorrelating multiuser detector. The robustification is based on the Hampel's M-estimator found in robust statistics. The approach is corroborated with simulation results. Simulation results show that the proposed approach yields significant performance gain over the linear decorrelating multiuser detector with little attendant increase in the computational complexity. Further, it offers better gain over the Huber's M-estimator.","PeriodicalId":185817,"journal":{"name":"The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131557852","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":"General splitting and merging of 2-D DCT in the DCT domain","authors":"Yuh-Jue Chuang, Ting-Jian Pan, Ja-Ling Wu","doi":"10.1109/MWSCAS.2004.1353886","DOIUrl":"https://doi.org/10.1109/MWSCAS.2004.1353886","url":null,"abstract":"An efficient method for splitting an N/spl times/N 2-D DCT block into four (N/2)/spl times/(N/2) or two N/spl times/(N/2) (or (N/2)/spl times/N) 2-D DCT blocks is presented and vice versa. The computational complexity of the proposed methods is lower than the direct approach and the same as the most efficient converting approach existed in the literature. Besides, the proposed DCT splitter/merger is suitable for implementation by specific multimedia instruction set available nowadays. When N=8, our method can be applied to realize the transcoding between the latest video coding standards AVC/H.264 and the older ones, such as MPEG-1, MPEG-2 and MPEG-4 part 2.","PeriodicalId":185817,"journal":{"name":"The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126574002","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":"Kalman filter-based channel estimation for space-time block code","authors":"K. Teo, D. Teo, S. Ohno, T. Hinamoto","doi":"10.1109/MWSCAS.2004.1354247","DOIUrl":"https://doi.org/10.1109/MWSCAS.2004.1354247","url":null,"abstract":"In mobile radio applications, the relative motion between the receiver and the transmitter gives rise to a time-varying channel and as a result, channel estimation is essential to acquire the channel so as to coherently decode the received signals. For space-time block code(STBC) transmitted over time-selective slowly fading channels, a novel Kalman filter-based channel estimation method, based on the incorporation of the quasi-ML symbol decoding mechanism will be developed throughout this paper, complete with computer simulations to see the influence of various parameters like the fading rate, SNR and pilot symbol placement on the BER performance. Evaluation of the results reveals that Kalman filtering, coupled with adequate pilot symbol placement, provides an optimum BER performance with little loss in channel capacity.","PeriodicalId":185817,"journal":{"name":"The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130806076","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 lattice predictor based adaptive Volterra filter and its convergence property analysis","authors":"K. Nakayama, A. Hirano, H. Kashimoto","doi":"10.1109/MWSCAS.2004.1354085","DOIUrl":"https://doi.org/10.1109/MWSCAS.2004.1354085","url":null,"abstract":"This paper proposes a lattice predictor-based adaptive Volterra filter (lattice-AVF), and its convergence property is analyzed. In the adaptive FIR Volterra filter (AVF), the eigen value spread of a correlation matrix is extremely amplified, and its convergence is very slow for gradient methods. A lattice predictor is employed for whitening the input signal. For stationary colored input signals, the lattice-AVF can provide a fast convergence and the well-reduced residual error. Its convergence is highly dependent on a time constant, used in updating the reflection coefficients. A very large time constant is required. In the case of nonstationary colored input signal, the eigen value spread after the Volterra polynomial is not so highly amplified. This means fast convergence will be expected, and effects of the whitening will be small. These properties are analyzed. A problem of asynchronous updating the reflection coefficients and the filter coefficients observed in linear lattice predictor-based adaptive filters is also observed in the lattice-AVF.","PeriodicalId":185817,"journal":{"name":"The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133543983","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}
A. Azaron, C. Perkgoz, K. Kato, H. Katagiri, M. Sakawa
{"title":"Time-cost trade-off in PERT networks using a genetic algorithm","authors":"A. Azaron, C. Perkgoz, K. Kato, H. Katagiri, M. Sakawa","doi":"10.1109/MWSCAS.2004.1354290","DOIUrl":"https://doi.org/10.1109/MWSCAS.2004.1354290","url":null,"abstract":"We develop a multi-objective model for the time-cost trade-off problem in PERT networks with generalized Erlang distributions of activity durations, using a genetic algorithm. The mean duration of each activity is assumed to be a non-increasing function and the direct cost of each activity is assumed to be a non-decreasing function of the amount of resource allocated to it. The decision variables of the model are the allocated resource quantities. The problem is formulated as a multi-objective optimal control problem that involves four conflicting objective functions. The objective functions are the project direct cost (to be minimized), the mean of project completion time (min), the variance of project completion time (min), and the probability that the project completion time does not exceed a certain threshold (max). It is impossible to solve this problem, optimally. Therefore, we apply a genetic algorithm for numerical optimizations of constrained problems (GENOCOP) to solve this multi-objective problem, using goal attainment technique.","PeriodicalId":185817,"journal":{"name":"The 2004 47th Midwest Symposium on Circuits and Systems, 2004. MWSCAS '04.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133694290","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}