Pub Date : 2005-12-01DOI: 10.1109/ACSSC.2005.1599709
I. Kyriakides, D. Morrell, A. Papandreou-Suppappola
Particle filtering has been successfully used in complex target tracking applications such as multiple target tracking. The particle filter can be used to incorporate constraints on target motion to improve tracking performance; this can be achieved using likelihood functions and sampling distributions. In this paper, we propose the constraint likelihood function independent partitions (CLIP) algorithm that uses constraints on target motion. This is achieved by incorporating a constraint likelihood function with the particle weights. As demonstrated by our simulations, a higher increase in tracking performance is obtained with our proposed constrained motion proposal (COMP) algorithm that incorporates target kinematic constraint information directly into the proposal density of the particle filter
{"title":"A Particle Filtering Approach To Constrained Motion Estimation In Tracking Multiple Targets","authors":"I. Kyriakides, D. Morrell, A. Papandreou-Suppappola","doi":"10.1109/ACSSC.2005.1599709","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599709","url":null,"abstract":"Particle filtering has been successfully used in complex target tracking applications such as multiple target tracking. The particle filter can be used to incorporate constraints on target motion to improve tracking performance; this can be achieved using likelihood functions and sampling distributions. In this paper, we propose the constraint likelihood function independent partitions (CLIP) algorithm that uses constraints on target motion. This is achieved by incorporating a constraint likelihood function with the particle weights. As demonstrated by our simulations, a higher increase in tracking performance is obtained with our proposed constrained motion proposal (COMP) algorithm that incorporates target kinematic constraint information directly into the proposal density of the particle filter","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130498922","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}
Pub Date : 2005-12-01DOI: 10.1109/ACSSC.2005.1599806
J. Gunther, T. Bose, Wang Song
This paper considers the problem of prototype filter design for subband adaptive filtering applied to system identification. The minimum mean-squared estimation error (MMSE) depends only the subband analysis filter and the response of the unknown system. We use MMSE as a design criterion to select the best analysis filter response. We show how this can be done independently of the unknown system. The connection between a minimizing MSE and a least-squares estimation problem inspires a new adaptive filter structure in which different analysis filters are used in the two branches of the subband adaptive filter
{"title":"Filter Bank Design for Minimizing Mean-Squared Estimation Error in Subband Adaptive Filtering","authors":"J. Gunther, T. Bose, Wang Song","doi":"10.1109/ACSSC.2005.1599806","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599806","url":null,"abstract":"This paper considers the problem of prototype filter design for subband adaptive filtering applied to system identification. The minimum mean-squared estimation error (MMSE) depends only the subband analysis filter and the response of the unknown system. We use MMSE as a design criterion to select the best analysis filter response. We show how this can be done independently of the unknown system. The connection between a minimizing MSE and a least-squares estimation problem inspires a new adaptive filter structure in which different analysis filters are used in the two branches of the subband adaptive filter","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129562770","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}
Pub Date : 2005-12-01DOI: 10.1109/ACSSC.2005.1599735
S.F.A. Shah, A. Ribeiro, G. Giannakis
We deal with distributed parameter estimation algorithms for use in wireless sensor networks (WSNs) with a fusion center when only quantized observations are available due to power/bandwidth constraints. The main goal of the paper is to design efficient estimators when the parameter can be modelled as random with a priori information. In particular, we develop maximum a posteriori (MAP) estimators for distributed parameter estimation and formulate the problem under different scenarios. We show that the pertinent objective function is concave and hence, the corresponding MAP estimator can be obtained efficiently through simple numerical maximization algorithms
{"title":"Bandwidth-Constrained MAP Estimation for Wireless Sensor Networks","authors":"S.F.A. Shah, A. Ribeiro, G. Giannakis","doi":"10.1109/ACSSC.2005.1599735","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599735","url":null,"abstract":"We deal with distributed parameter estimation algorithms for use in wireless sensor networks (WSNs) with a fusion center when only quantized observations are available due to power/bandwidth constraints. The main goal of the paper is to design efficient estimators when the parameter can be modelled as random with a priori information. In particular, we develop maximum a posteriori (MAP) estimators for distributed parameter estimation and formulate the problem under different scenarios. We show that the pertinent objective function is concave and hence, the corresponding MAP estimator can be obtained efficiently through simple numerical maximization algorithms","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"20 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115454715","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}
Pub Date : 2005-12-01DOI: 10.1109/ACSSC.2005.1600041
Kyungtae Han, Brian L. Evans, E. E. Swartzlander
Multiprecision multipliers reduce power consump- tion by selecting smaller multipliers (i.e., submultiplier) according to the wordsize of the input operands. However, arbitrary levels of bit precision are not achieved by multiprecision multipliers. Two proposed wordlength reduction techniques that reduce power consumption with arbitrary levels of bit precision are considered. Expectation values of bit switching activity for reduction in the signed right shift method and the truncation method are derived. The signed right shift method and the truncation method are applied to a 16-bit radix-4 modified Booth multiplier and a 16-bit Wallace multiplier. The truncation method with 8-bit operands reduces the power consumption by 56% in the Wallace multiplier and 31% in the Booth multiplier. The signed right shift method shows no power reduction in the Wallace multiplier and 25% power reduction in the Booth multiplier. Unequal levels of precision in operands show different power reduction value for the Booth multiplier. The non-recoded operand in the Booth multiplier with 8-bit reduction has 13% more sensitivity in power consumption than the recoded multiplicand.
{"title":"Low-Power Multipliers with Data Wordlength Reduction","authors":"Kyungtae Han, Brian L. Evans, E. E. Swartzlander","doi":"10.1109/ACSSC.2005.1600041","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1600041","url":null,"abstract":"Multiprecision multipliers reduce power consump- tion by selecting smaller multipliers (i.e., submultiplier) according to the wordsize of the input operands. However, arbitrary levels of bit precision are not achieved by multiprecision multipliers. Two proposed wordlength reduction techniques that reduce power consumption with arbitrary levels of bit precision are considered. Expectation values of bit switching activity for reduction in the signed right shift method and the truncation method are derived. The signed right shift method and the truncation method are applied to a 16-bit radix-4 modified Booth multiplier and a 16-bit Wallace multiplier. The truncation method with 8-bit operands reduces the power consumption by 56% in the Wallace multiplier and 31% in the Booth multiplier. The signed right shift method shows no power reduction in the Wallace multiplier and 25% power reduction in the Booth multiplier. Unequal levels of precision in operands show different power reduction value for the Booth multiplier. The non-recoded operand in the Booth multiplier with 8-bit reduction has 13% more sensitivity in power consumption than the recoded multiplicand.","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121034659","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}
Pub Date : 2005-12-01DOI: 10.1109/ACSSC.2005.1599869
Wen-Chih Kan, G. Sobelman
We present a reduced complexity MIMO MMSE-DFE coefficient computation algorithm which is based on an improvement to the fast block algorithm developed in N. Al-Dhahir and A.H. Sayed (2000). We have achieved a nearly 50% reduction in complexity by eliminating the computation of unnecessary terms. The effects due to finite precision arithmetic on SNR are also considered and a minimum fixed-point word length of 32 bits results in no noticeable performance loss. Hardware implementation issues depend on several factors and these are also discussed
{"title":"Reduced Complexity MIMO MMSE-DFE","authors":"Wen-Chih Kan, G. Sobelman","doi":"10.1109/ACSSC.2005.1599869","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599869","url":null,"abstract":"We present a reduced complexity MIMO MMSE-DFE coefficient computation algorithm which is based on an improvement to the fast block algorithm developed in N. Al-Dhahir and A.H. Sayed (2000). We have achieved a nearly 50% reduction in complexity by eliminating the computation of unnecessary terms. The effects due to finite precision arithmetic on SNR are also considered and a minimum fixed-point word length of 32 bits results in no noticeable performance loss. Hardware implementation issues depend on several factors and these are also discussed","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116440481","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}
Pub Date : 2005-12-01DOI: 10.1109/ACSSC.2005.1599701
H. Shah, D. Morrell
We present a new method to adaptively configure the focal-length of a pan-tilt-zoom camera to track a point target with improved accuracy. The target tracker is implemented by using a Rao-Blackwellized particle filter. The focal-length of the camera is configured to include a time varying percentage of the projected particles on the camera image plane. The performance of the adaptive zoom algorithm was evaluated using Monte Carlo simulations and found to significantly reduce tracking errors compared to a previous method presented by the same authors
{"title":"A New Adaptive Zoom Algorithm for Tracking Targets Using Pan-Tilt-Zoom Cameras","authors":"H. Shah, D. Morrell","doi":"10.1109/ACSSC.2005.1599701","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599701","url":null,"abstract":"We present a new method to adaptively configure the focal-length of a pan-tilt-zoom camera to track a point target with improved accuracy. The target tracker is implemented by using a Rao-Blackwellized particle filter. The focal-length of the camera is configured to include a time varying percentage of the projected particles on the camera image plane. The performance of the adaptive zoom algorithm was evaluated using Monte Carlo simulations and found to significantly reduce tracking errors compared to a previous method presented by the same authors","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130492742","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}
Pub Date : 2005-12-01DOI: 10.1109/ACSSC.2005.1599925
Xiliang Luo, G. Giannakis
Timing synchronization is known to affect critically the performance of all coherent communication systems. Its effects are particularly pronounced in contemporary wireless technologies including ultra-wideband radios and wireless sensor networks, where cooperative or ad hoc access is challenged by arbitrary asynchronism, intersymbol interference, receiver noise, as well as interand intra-piconet interference arising from concurrently communicating nodes. To cope with these challenges, the present paper introduces piconet-specific synchronization patterns and simple averaging operations at the receiving ends, which enable low complexity timing acquisition through energy detection and demodulation by matching to a synchronized aggregate template. Pattern sequences are designed for both training-based and blind operation. Either way, the idea behind these designs is to periodically increase the transmit-power of each piconet’s synchronizing node with a period characteristic of each piconet. Performance of the novel synchronization protocols is tested with simulations conforming to an ultra-wideband wireless personal area network (WPAN) setup.
{"title":"Synchronization of Multiple UWB Piconets","authors":"Xiliang Luo, G. Giannakis","doi":"10.1109/ACSSC.2005.1599925","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599925","url":null,"abstract":"Timing synchronization is known to affect critically the performance of all coherent communication systems. Its effects are particularly pronounced in contemporary wireless technologies including ultra-wideband radios and wireless sensor networks, where cooperative or ad hoc access is challenged by arbitrary asynchronism, intersymbol interference, receiver noise, as well as interand intra-piconet interference arising from concurrently communicating nodes. To cope with these challenges, the present paper introduces piconet-specific synchronization patterns and simple averaging operations at the receiving ends, which enable low complexity timing acquisition through energy detection and demodulation by matching to a synchronized aggregate template. Pattern sequences are designed for both training-based and blind operation. Either way, the idea behind these designs is to periodically increase the transmit-power of each piconet’s synchronizing node with a period characteristic of each piconet. Performance of the novel synchronization protocols is tested with simulations conforming to an ultra-wideband wireless personal area network (WPAN) setup.","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114466377","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}
Pub Date : 2005-12-01DOI: 10.1109/ACSSC.2005.1599883
K. Shirai, M. Ikehara
In this paper, we describe a deblurring method using Image-Fusion of multiple images taken with different object-distances. Our method uses the wavelet transform for the fusion, but we create new wavelet coefficients by mixing each pixel value by using "reference image usage rate (IUR)". And we present simple and effective algorithms "Fusion rule for the lowest frequency subband" "Noise reduction algorithm" "Blur reduction algorithm" that use this IUR. I. INTRODUCTION When we take a photo, we adjust the object-distance (focus position) manually or automatically to take the clear image of the photographic subject. In other words, we put the subject into the zone of focus that is called depth-of-field. However, in the case of the short object distance, the zone becomes too narrow to cover the whole region of the subject(s) and the image of such regions become unclear. But, clear regions are also contained in a photo image, so we can correct the subject image by synthesizing (fusing) images that are taken with different object distance (See Fig.1).
{"title":"All-in-focus Photo image Creation by Wavelet Transform","authors":"K. Shirai, M. Ikehara","doi":"10.1109/ACSSC.2005.1599883","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599883","url":null,"abstract":"In this paper, we describe a deblurring method using Image-Fusion of multiple images taken with different object-distances. Our method uses the wavelet transform for the fusion, but we create new wavelet coefficients by mixing each pixel value by using \"reference image usage rate (IUR)\". And we present simple and effective algorithms \"Fusion rule for the lowest frequency subband\" \"Noise reduction algorithm\" \"Blur reduction algorithm\" that use this IUR. I. INTRODUCTION When we take a photo, we adjust the object-distance (focus position) manually or automatically to take the clear image of the photographic subject. In other words, we put the subject into the zone of focus that is called depth-of-field. However, in the case of the short object distance, the zone becomes too narrow to cover the whole region of the subject(s) and the image of such regions become unclear. But, clear regions are also contained in a photo image, so we can correct the subject image by synthesizing (fusing) images that are taken with different object distance (See Fig.1).","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"271 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133079966","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}
Pub Date : 2005-12-01DOI: 10.1109/ACSSC.2005.1599847
M. Yadav, K. K. Parhi
In this paper, we present the design and FPGA implementation of 11 LDPC codes with code rates 1/4, 1/3, 2/5, 1/2, 3/5, 2/3, 3/4, 4/5, 5/6, 8/9 and 9/10 for normal frame length of 64800 bits as used in DVB-S2. Out of these 11 codes, 7 are regular and 4 are irregular. All of them have been synthesized into Xilinx Virtex-II XC2V8000 FPGA
{"title":"Design and Implementation of LDPC Codes for DVB-S2","authors":"M. Yadav, K. K. Parhi","doi":"10.1109/ACSSC.2005.1599847","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599847","url":null,"abstract":"In this paper, we present the design and FPGA implementation of 11 LDPC codes with code rates 1/4, 1/3, 2/5, 1/2, 3/5, 2/3, 3/4, 4/5, 5/6, 8/9 and 9/10 for normal frame length of 64800 bits as used in DVB-S2. Out of these 11 codes, 7 are regular and 4 are irregular. All of them have been synthesized into Xilinx Virtex-II XC2V8000 FPGA","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122310738","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}
Pub Date : 2005-12-01DOI: 10.1109/ACSSC.2005.1600065
S. Ahmad, Aleksandar Jovičić, P. Viswanath
{"title":"Outer Bounds on the Capacity Region of Wireless Networks","authors":"S. Ahmad, Aleksandar Jovičić, P. Viswanath","doi":"10.1109/ACSSC.2005.1600065","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1600065","url":null,"abstract":"","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121890916","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：