{"title":"Robust and reduced-rank matrix Wiener filter based on the conjugate gradient algorithm","authors":"G. Dietl, M. Botsch, F. Dietrich, W. Utschick","doi":"10.1109/SPAWC.2005.1506201","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1506201","url":null,"abstract":"In this paper, we consider the block conjugate gradient (BCG) algorithm as a robust and reduced-rank implementation of the matrix Wiener filter (MWF). Stopping the BCG iterations before the algorithm converges, reduces the computational complexity as well as the performance loss due to channel estimation errors which is especially a problem in low sample support scenarios. We investigate the inherent robustness of the BCG method by deriving the corresponding filter factor matrix which is a well-known tool in the theory of ill-posed problems to describe and analyze regularizing effects. Moreover, we present a robust BCG algorithm where we applied the regularization method of diagonal loading in order to increase both robustness against estimation errors and flexibility in choosing the number of BCG iterations without decreasing performance. Finally, we use quasi-optimal loading instead of common heuristic choices. Simulation results of a frequency-selective multi-user single-input multiple-output (MU-SIMO) system show the improved performance of the robust BCG filter compared to the conventional MWF despite of the enormously reduced computational complexity.","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114054149","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":"Performance of iterative channel estimation and iterative PIC detection for the uplink coded MC-CDMA system","authors":"Y. Yuan-Wu, R. Legouable","doi":"10.1109/SPAWC.2005.1505880","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1505880","url":null,"abstract":"This paper is devoted to the coded MC-CDMA (or OFCDM) uplink radio mobile system study. It highlights that the iterative PIC detector outperforms the MUD-MMSE detector when combining with the proposed channel estimation technique. The channel estimation is based on the delay profile algorithm considering the improved path indexes in the frequency domain and on the enhanced polynomial interpolation in the time domain. The proposed scheme is considered iteratively with the pilot and the decoded feedback data. The simulation results show that an important performance improvement is obtained.","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115010901","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":"Adaptive neighborhoods for manifold learning-based sensor localization","authors":"Neal Patwari, A. Hero III","doi":"10.1109/SPAWC.2005.1506310","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1506310","url":null,"abstract":"Connectivity measurements, i.e., whether or not two sensors can communicate, can be used to calculate localization in networks of inexpensive wireless sensors. We show that a Laplacian eigenmaps-based algorithm, combined with an adaptive neighbor weighting method, can provide an accurate, low complexity solution. Laplacian eigenmaps is a manifold learning method which optimizes using eigen-decomposition, thus is non-iterative and finds the global optimum. Comparatively, the new localization method is less computationally complex than multi-dimensional scaling (MDS), and we show via simulation that it has lower variance.","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116509433","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":"Performance analysis of an amplify-based differential modulation for wireless relay networks under Nakagami-m fading channels","authors":"Qiang Zhao, Hongbin Li","doi":"10.1109/SPAWC.2005.1505902","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1505902","url":null,"abstract":"This paper examines differential binary modulation for wireless networks that utilize wireless relays to seek cooperative diversity and improved performance over Nakagami-m fading channels. A differential cooperative transmission scheme, referred to as differential amplify-and-forward (DAF), is introduced. The scheme requires no channel state information (CSI) at any node in the system. A differential detection is discussed. A set of analytical results pertaining to the probability density function (PDF) of the instantaneous signal-to-noise ratio (SNR) and average bit error rate (BER) are obtained. The analytical results are confirmed by numerical simulations. It is instrumental to apply the derived closed-from BER expression to evaluate system performance under Nakagami-m fading channels.","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116747857","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":"Joint blind channel and carrier frequency offset estimation in orthogonally space-time block coded MIMO systems","authors":"S. Shahbazpanahi, A. Gershman, G. Giannakis","doi":"10.1109/SPAWC.2005.1506048","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1506048","url":null,"abstract":"The problem of joint channel and carrier frequency offset (CFO) estimation is considered in the context of multiple-input multiple-output (MIMO) communication systems that use orthogonal space-time-block codes (OSTBCs). A new blind approach, is proposed to jointly estimate the channel matrix and the CFO. Our technique is based on a relaxed version of maximum likelihood (ML) estimator that ignores the finite alphabet constraint. Using such an approach, we show that the joint channel and CFO estimation problem is equivalent to finding the parameter estimates that maximize the principal eigenvalue of a certain data dependent matrix. Simulation results demonstrate that, despite relaxing the finite alphabet constraint, the performance of the proposed blind detection scheme can approach that of the coherent receiver, provided that there are sufficient data blocks available per channel realization.","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134393287","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":"Low-complexity nulling-canceling detection algorithm for coded MIMO systems with near-optimal performance","authors":"W. Mo, Z. Wang","doi":"10.1109/SPAWC.2005.1506204","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1506204","url":null,"abstract":"We propose a nulling/canceling algorithm for decoding coded multi-input multi-output (MIMO) transmissions over flat fading channels. The algorithm works with a soft-input soft-output error-control decoder to iteratively detect the information symbols. Our algorithm is based on the BLAST (Bell-Labs Layered Space-Time) nulling/canceling algorithm, with the following differences: i) prior information from the error-control decoder is incorporated, ii) the ordering is based on a posteriori probabilities instead of signal to noise ratio (SNR), and iii) soft (as opposed to hard) interferences computed from a posteriori probabilities are canceled. Based on a previous work on low-complexity nulling/canceling without prior information and with SNR ordering, we present a modified \"square-root\" algorithm for the proposed nulling canceling detection scheme, with cubic-order complexity. We compared the performance of an iterative detection and decoding scheme based on the proposed MIMO detector and that based on a maximum a posteriori (MAP) detector. In a 4/spl times/4 system, our proposed detector had the same performance as the MAP detector for binary phase-shift keying (BPSK) modulation. For 16-quadrature amplitude modulation, our algorithm came within 1 dB of the performance of an approximated MAP detector, list sphere decoder, at bit error rate of 10/sup -4/.","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134053504","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":"Cooperative diversity with incremental redundancy turbo coding for quasi-static wireless networks","authors":"Ruoheng Liu, P. Spasojevic, E. Soljanin","doi":"10.1109/SPAWC.2005.1506248","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1506248","url":null,"abstract":"We propose an incremental redundancy (IR) cooperative coding scheme employing punctured turbo codes for quasi-static wireless networks. Our scheme enhances the network performance by embedding IR cooperative coding into an existing noncooperative route. More precisely, for each of the noncooperative hops, we consider the following cooperation strategy: we form collaborating cluster of M nodes consisting cf the (hop) sender and its M-1 neighbors. A decode-and-forward algorithm within the cluster enables the IR turbo coding scheme. The approach improves the reliability of multihop routing by employing a powerful coding scheme to enable cooperative diversity. We study its frame-error rate (FER) performance for quasi-static Rayleigh-fading channels based on the threshold behavior of turbo codes. A FER upper bound on the maximum-likelihood decoding and its asymptotic version are derived as a function of channel SNRs and the mother code noise threshold. Simulation results show that our bounds are very good predictors of the proposed scheme performance.","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133393235","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":"Semi-blind ML channel estimation for MC-CDMA systems with code-multiplexed pilots","authors":"F. Rubio, X. Mestre","doi":"10.1109/SPAWC.2005.1506234","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1506234","url":null,"abstract":"We consider an iterative ML channel estimator for MC-CDMA systems with code-multiplexed training. Its performance has been studied by using results from the asymptotics of Fourier matrices with dimensions growing without bound with a certain constant ratio between them. Our results are then more representative of real non-asymptotic situations because, as in practical scenarios, different quantities in the signal model are assumed to have the same order of magnitude. This asymptotic analysis allows us to characterize the estimator analitically in terms of a parameter related to the evolution through the iterations of the symbol estimate. The results can efficiently be used for detection purposes, whereby a larger performance gain could be attained if employed for nonconstant-amplitude M-ary-QAM modulations.","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125783954","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 eigenvector-based algebraic approach for two-dimensional frequency estimation with improved identifiability","authors":"J. Liu, X. Liu","doi":"10.1109/SPAWC.2005.1506221","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1506221","url":null,"abstract":"This paper presents an algebraic method for two-dimensional (2-D) frequency estimation. The algorithm is based on multidimensional smoothing and data folding, and offers significantly improved identifiability than existing algebraic approaches, thus is termed the improved multidimensional folding (IMDF) algorithm. It is shown that with IMDF, up to approximately 0.34 M/sub 1/M/sub 2/ 2-D frequencies can be uniquely resolved with probability one from an M/sub 1/ by M/sub 2/ data mixture. The IMDF algorithm achieves automatic frequency N-dimensional frequency estimation. Simulation results demonstrate its competitive performance compared to some existing algebraic methods.","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123848222","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":"Statistical performance of subspace matching mobile localization using experimental data","authors":"M. Nezafat, M. Kaveh, H. Tsuji, T. Fukagawa","doi":"10.1109/SPAWC.2005.1506219","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1506219","url":null,"abstract":"In this paper, we present some statistical results on localization performance of subspace matching localization (SML), a technique for localizing non-cooperative transmitters in a microcellular environment Nezafat, M et al. (2004) using one (multiple) base-station(s) that is (are) equipped with an (multiple) antenna array(s). We use extensive experimental measurements obtained in Yokosuka, Japan. SML exploits the dissimilarities in spatial multipath propagation characteristics of distinct locations, as reflected in the received respective signal subspaces to localize a transmitter. The location detector utilizes a match of the received signal subspace with those in a database. The database can be constructed by measurement campaigns, or ray tracing based simulations. In this paper, we report the localization accuracy of SML using a database that is constructed using a measurement campaign and up to two base stations. Issues regarding the variations of signal subspace due to non-stationarities in the environment and tracking of mobile transmitters are also addressed briefly.","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"61 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129600625","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}