Pub Date : 2008-10-01DOI: 10.1109/ACSSC.2008.5074752
Yao Zhao, Liang Dong, Jiangchun Wang, Bo Hu, Yuzhuo Fu
A wireless indoor positioning system is developed with the ZigBee technology. ZigBee devices with chipset reference designs or design-in modules are used for hardware implementation. Using Jennic's JN5121 and Texas Instrument's CC2430 system-on-chip modules for 2.4 GHz IEEE 802.15.4 and ZigBee, we developed the indoor positioning system testbed. Channel measurements via the testbed verified the log-normal indoor channel propagation model and were used to calculate the model parameters. We proposed an effective cooperative localization algorithm that is tailored to the ZigBee profile. It uses the ZigBee link quality indicator, which is directly related to the received signal strength, to acquire the pair-wise distances between the nodes in the network. In order to yield positioning accuracy, the algorithm combines the multidimensional scaling with the maximum likelihood estimation, and overcomes their inherent drawbacks.
{"title":"Implementing indoor positioning system via ZigBee devices","authors":"Yao Zhao, Liang Dong, Jiangchun Wang, Bo Hu, Yuzhuo Fu","doi":"10.1109/ACSSC.2008.5074752","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074752","url":null,"abstract":"A wireless indoor positioning system is developed with the ZigBee technology. ZigBee devices with chipset reference designs or design-in modules are used for hardware implementation. Using Jennic's JN5121 and Texas Instrument's CC2430 system-on-chip modules for 2.4 GHz IEEE 802.15.4 and ZigBee, we developed the indoor positioning system testbed. Channel measurements via the testbed verified the log-normal indoor channel propagation model and were used to calculate the model parameters. We proposed an effective cooperative localization algorithm that is tailored to the ZigBee profile. It uses the ZigBee link quality indicator, which is directly related to the received signal strength, to acquire the pair-wise distances between the nodes in the network. In order to yield positioning accuracy, the algorithm combines the multidimensional scaling with the maximum likelihood estimation, and overcomes their inherent drawbacks.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133614791","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 : 2008-10-01DOI: 10.1109/ACSSC.2008.5074630
Ching-Chih Weng, Chun-Yang Chen, P. Vaidyanathan
The transceiver optimization problem for MIMO channels has been considered in the past with linear receivers as well as with decision feedback (DFE) receivers. Joint optimization of bit allocation, precoder, and equalizer has in the past been considered only for the linear transceiver (transceiver with linear precoder and linear equalizer). It has also been observed that the use of DFE even without bit allocation in general results in better performance that linear transceivers with bit allocation. This paper provides a general study of this for transceivers with the zero-forcing constraint. It is formally shown that when the bit allocation, precoder, and equalizer are jointly optimized, linear transceivers and transceivers with DFE have identical performance in the sense that transmitted power is identical for a given bit rate and error probability. The developments of this paper are based on the generalized triangular decomposition (GTD) recently introduced by Jiang, Li, and Hager. It will be shown that a broad class of GTD-based systems solve the optimal DFE problem with bit allocation. The special case of a linear transceiver with optimum bit allocation will emerge as one of the many solutions.
{"title":"Joint optimization of transceivers with decision feedback and bit loading","authors":"Ching-Chih Weng, Chun-Yang Chen, P. Vaidyanathan","doi":"10.1109/ACSSC.2008.5074630","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074630","url":null,"abstract":"The transceiver optimization problem for MIMO channels has been considered in the past with linear receivers as well as with decision feedback (DFE) receivers. Joint optimization of bit allocation, precoder, and equalizer has in the past been considered only for the linear transceiver (transceiver with linear precoder and linear equalizer). It has also been observed that the use of DFE even without bit allocation in general results in better performance that linear transceivers with bit allocation. This paper provides a general study of this for transceivers with the zero-forcing constraint. It is formally shown that when the bit allocation, precoder, and equalizer are jointly optimized, linear transceivers and transceivers with DFE have identical performance in the sense that transmitted power is identical for a given bit rate and error probability. The developments of this paper are based on the generalized triangular decomposition (GTD) recently introduced by Jiang, Li, and Hager. It will be shown that a broad class of GTD-based systems solve the optimal DFE problem with bit allocation. The special case of a linear transceiver with optimum bit allocation will emerge as one of the many solutions.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133438848","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 : 2008-10-01DOI: 10.1109/ACSSC.2008.5074621
Jinshan Tang, Xiaoming Liu
The wavelet/scalar quantization (WSQ) [1] fingerprint image compression algorithm is effective and has been widely applied to fingerprint image compression. However, WSQ cannot control the compression ratio and its performance on fuzzy images is poor. We propose an improved WSQ fingerprint image compression algorithm to overcome the above shortcomings. Our algorithm uses a mixed quantizer so that the algorithm can treat fuzzy and non-fuzzy fingerprint images separately. In order to control the compression ration, an optimization parameters for a specific compression ratio. The proposed algorithm is compared with the traditional WSQ fingerprint image compression algorithm and the results are encouraging.
{"title":"An improved WSQ fingerprint image compression algorithm","authors":"Jinshan Tang, Xiaoming Liu","doi":"10.1109/ACSSC.2008.5074621","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074621","url":null,"abstract":"The wavelet/scalar quantization (WSQ) [1] fingerprint image compression algorithm is effective and has been widely applied to fingerprint image compression. However, WSQ cannot control the compression ratio and its performance on fuzzy images is poor. We propose an improved WSQ fingerprint image compression algorithm to overcome the above shortcomings. Our algorithm uses a mixed quantizer so that the algorithm can treat fuzzy and non-fuzzy fingerprint images separately. In order to control the compression ration, an optimization parameters for a specific compression ratio. The proposed algorithm is compared with the traditional WSQ fingerprint image compression algorithm and the results are encouraging.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134641865","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 : 2008-10-01DOI: 10.1109/ACSSC.2008.5074479
H. Godrich, A. Haimovich, Rick S. Blum
This paper undertakes the study of localization performance of multiple targets in coherent MIMO radar systems with widely spread elements. MIMO radar systems with coherent processing and a single target were shown to benefit from a coherency and spatial advantages. The first is proportional to the ratio of the signal carrier frequency to the effective bandwidth, while the latter provides a gain proportional to the product of the number of transmitting and receiving sensors. In the current study, the model in extended to the estimation accuracy of multiple targets. The Cramer-Rao lower bound (CRLB) for the multiple targets localization problem is derived and analyzed. The localization is shown to benefit from coherency advantage. The tradeoff between target localization accuracy and the number of targets that can be localized is shown to be incorporated in the spatial advantage term. An increase in the number of targets to be localized exposes the system to increased mutual interferences. This tradeoff depends on the geometric footprint of both the sensors and the targets, and the relative positions of the two. Numerical analysis of some special cases offers an insight to the mutual relation between a given deployment of radars and targets and the spatial advantage it presents.
{"title":"Target localization accuracy and multiple target localization: Tradeoff in MIMO radars","authors":"H. Godrich, A. Haimovich, Rick S. Blum","doi":"10.1109/ACSSC.2008.5074479","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074479","url":null,"abstract":"This paper undertakes the study of localization performance of multiple targets in coherent MIMO radar systems with widely spread elements. MIMO radar systems with coherent processing and a single target were shown to benefit from a coherency and spatial advantages. The first is proportional to the ratio of the signal carrier frequency to the effective bandwidth, while the latter provides a gain proportional to the product of the number of transmitting and receiving sensors. In the current study, the model in extended to the estimation accuracy of multiple targets. The Cramer-Rao lower bound (CRLB) for the multiple targets localization problem is derived and analyzed. The localization is shown to benefit from coherency advantage. The tradeoff between target localization accuracy and the number of targets that can be localized is shown to be incorporated in the spatial advantage term. An increase in the number of targets to be localized exposes the system to increased mutual interferences. This tradeoff depends on the geometric footprint of both the sensors and the targets, and the relative positions of the two. Numerical analysis of some special cases offers an insight to the mutual relation between a given deployment of radars and targets and the spatial advantage it presents.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133770633","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 : 2008-10-01DOI: 10.1109/ACSSC.2008.5074495
Young-Han Kim
Multiple description coding, in general, requires separate codebooks for each description. Motivated by the problem of sparse linear representation, we propose a simple coding scheme that recursively describes successive description errors using the same codebook, resulting in a sparse linear combination of codewords that achieves the Gaussian rate distortion region. This result, in particular, provides an elementary proof of successive refinability and additive refinability of white Gaussian sources.
{"title":"Multiple descriptions with codebook reuse","authors":"Young-Han Kim","doi":"10.1109/ACSSC.2008.5074495","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074495","url":null,"abstract":"Multiple description coding, in general, requires separate codebooks for each description. Motivated by the problem of sparse linear representation, we propose a simple coding scheme that recursively describes successive description errors using the same codebook, resulting in a sparse linear combination of codewords that achieves the Gaussian rate distortion region. This result, in particular, provides an elementary proof of successive refinability and additive refinability of white Gaussian sources.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115842858","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 : 2008-10-01DOI: 10.1109/ACSSC.2008.5074638
S. Kar, J.M.F. Moura
The paper considers the problem of distributed linear vector parameter estimation in sensor networks, when sensors can exchange quantized state information and the inter-sensor communication links fail randomly. We show that our algorithm LU leads to almost sure (a.s.) consensus of the local sensor estimates to the true parameter value, under the assumptions that, a minimal global observability criterion is satisfied and the network is connected in the mean, i.e., lambda2(Lmacr) Gt 0, where Lmacr is the expected Laplacian matrix. We show that the local sensor estimates are asymptotically normal and characterize the convergence rate of the algorithm in the framework of moderate deviations.
{"title":"Distributed linear parameter estimation in sensor networks: Convergence properties","authors":"S. Kar, J.M.F. Moura","doi":"10.1109/ACSSC.2008.5074638","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074638","url":null,"abstract":"The paper considers the problem of distributed linear vector parameter estimation in sensor networks, when sensors can exchange quantized state information and the inter-sensor communication links fail randomly. We show that our algorithm LU leads to almost sure (a.s.) consensus of the local sensor estimates to the true parameter value, under the assumptions that, a minimal global observability criterion is satisfied and the network is connected in the mean, i.e., lambda2(Lmacr) Gt 0, where Lmacr is the expected Laplacian matrix. We show that the local sensor estimates are asymptotically normal and characterize the convergence rate of the algorithm in the framework of moderate deviations.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124501516","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 : 2008-10-01DOI: 10.1109/ACSSC.2008.5074719
Radoslaw Mazur, A. Mertins
In this paper we present a method for estimating the bin-wise separation performance in convolutive blind source separation. A common way to separate convolutive mixtures is the transformation to the time-frequency domain and the separation of the single bins using an instantaneous ICA algorithm. This approach reduces the complexity but leads to the so-called permutation problem which has been widely studied. Another problem arises when the single bins are only poorly separable or even not separable at all. These bins can significantly reduce the overall performance. In this paper we propose a method for detecting such bins based on properties of the unmixing matrices.
{"title":"On separation performance enhancement in convolutive blind source separation","authors":"Radoslaw Mazur, A. Mertins","doi":"10.1109/ACSSC.2008.5074719","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074719","url":null,"abstract":"In this paper we present a method for estimating the bin-wise separation performance in convolutive blind source separation. A common way to separate convolutive mixtures is the transformation to the time-frequency domain and the separation of the single bins using an instantaneous ICA algorithm. This approach reduces the complexity but leads to the so-called permutation problem which has been widely studied. Another problem arises when the single bins are only poorly separable or even not separable at all. These bins can significantly reduce the overall performance. In this paper we propose a method for detecting such bins based on properties of the unmixing matrices.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114749974","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 : 2008-10-01DOI: 10.1109/ACSSC.2008.5074728
Zhi Quan, Y. Zakharov, Junruo Zhang
In this paper, we propose a multiple phase decoder (MPD) for MIMO communication systems with M-PSK signals. The proposed decoder is based on a phase descent search (PDS) algorithm. The PDS algorithm is based on coordinate descent iterations and constraints elements of the solution to have unit magnitudes. In the MPD, the PDS algorithm is used multiple times with different initializations. The solution from the PDS algorithm with the minimum cost is chosen as the final solution of the proposed decoder. Simulation results show that, for QPSK modulation, the proposed decoder can approach the performance of the Maximum Likelihood decoder. Comparing to the sphere decoder, the MPD offers a lower complexity, especially at low signal-to-noise ratios and with a large number of transmit antennas. Thus the proposed decoder may be regarded as an alternative to the sphere decoder for MIMO systems.
{"title":"Multiple phase decoder for MIMO systems","authors":"Zhi Quan, Y. Zakharov, Junruo Zhang","doi":"10.1109/ACSSC.2008.5074728","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074728","url":null,"abstract":"In this paper, we propose a multiple phase decoder (MPD) for MIMO communication systems with M-PSK signals. The proposed decoder is based on a phase descent search (PDS) algorithm. The PDS algorithm is based on coordinate descent iterations and constraints elements of the solution to have unit magnitudes. In the MPD, the PDS algorithm is used multiple times with different initializations. The solution from the PDS algorithm with the minimum cost is chosen as the final solution of the proposed decoder. Simulation results show that, for QPSK modulation, the proposed decoder can approach the performance of the Maximum Likelihood decoder. Comparing to the sphere decoder, the MPD offers a lower complexity, especially at low signal-to-noise ratios and with a large number of transmit antennas. Thus the proposed decoder may be regarded as an alternative to the sphere decoder for MIMO systems.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114880680","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 : 2008-10-01DOI: 10.1109/ACSSC.2008.5074657
Jianqi Wang, S. Park, D. Love, M. Zoltowski
In this paper, we present a hybrid ARQ scheme for wireless multicast, i.e., common information broadcast. In this scheme, incremental redundancy channel coding and packet retransmission are employed. This scheme enables the reliable delivery of the same copy of information to different users with mild delay. In addition, the design of the feedback channel for this scheme can be greatly simplified as no effort must be expended to combat the cross user interference. In this paper, we study the delay and throughput trade-offs for three specific schemes including generalized slotted ALOHA (GSA), repetition time diversity (RTD), and general incremental redundancy (INR). We also prove that when we increase the rate per packet linearly with K, we can obtain a linear scaling for both the throughput and the delay with respect to K. This is the best optimal scaling law for wireless mulitcast.
{"title":"Throughput delay tradeoff for wireless multicast using hybrid-ARQ protocols","authors":"Jianqi Wang, S. Park, D. Love, M. Zoltowski","doi":"10.1109/ACSSC.2008.5074657","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074657","url":null,"abstract":"In this paper, we present a hybrid ARQ scheme for wireless multicast, i.e., common information broadcast. In this scheme, incremental redundancy channel coding and packet retransmission are employed. This scheme enables the reliable delivery of the same copy of information to different users with mild delay. In addition, the design of the feedback channel for this scheme can be greatly simplified as no effort must be expended to combat the cross user interference. In this paper, we study the delay and throughput trade-offs for three specific schemes including generalized slotted ALOHA (GSA), repetition time diversity (RTD), and general incremental redundancy (INR). We also prove that when we increase the rate per packet linearly with K, we can obtain a linear scaling for both the throughput and the delay with respect to K. This is the best optimal scaling law for wireless mulitcast.","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114659246","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 : 2008-10-01DOI: 10.1109/ACSSC.2008.5074673
K. Parhi
{"title":"Session TP5a: Integrated algorithm and architecture implementation","authors":"K. Parhi","doi":"10.1109/ACSSC.2008.5074673","DOIUrl":"https://doi.org/10.1109/ACSSC.2008.5074673","url":null,"abstract":"","PeriodicalId":416114,"journal":{"name":"2008 42nd Asilomar Conference on Signals, Systems and Computers","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117240878","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
扫码关注我们
求助内容：
应助结果提醒方式：