{"title":"Threshold-based substream selection combining for adaptive spatial multiplexing","authors":"Youngwook Ko, C. Tepedelenlioğlu","doi":"10.1109/SPAWC.2005.1506230","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1506230","url":null,"abstract":"We propose a novel closed-loop spatial multiplexing method with limited feedback and low bit error rates over MIMO fading channels. The transmitter adaptation is designed to satisfy spectral efficiency and average transmit power constraints. The transmit adaptation is performed simply by selecting the number of sub-streams based on a given threshold with a fixed nonadaptive constellation and transmit power per substream. The proposed system chooses the substream selection threshold as a function of the slowly changing average SNR. We analyze the performance of the proposed system by deriving closed-form expressions for spectral efficiency, average transmit power, and BER. Under spectral efficiency and average transmit power constraints, we show that the average BER decreases exponentially in terms of average SNR over fading channels. We present numerical and simulation results that validate our analysis.","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133558007","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 bounds for the rate-constrained universal decentralized estimators in sensor networks","authors":"Jinjun Xiao, Zhi-Quan Luo, G. Giannakis","doi":"10.1109/SPAWC.2005.1505885","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1505885","url":null,"abstract":"We consider the decentralized estimation of a noise corrupted deterministic parameter using a bandwidth constrained sensor network with a fusion center (FC). The sensor noises are assumed to be additive, zero mean, and spatially uncorrelated. Assuming that each sensor sends to the FC a one-bit message per sample, we derive a Cramer-Rao lower bound (CRLB) for the rate-constrained decentralized estimators using the noise probability distribution functions (pdfs) and local quantization rules. We then optimize this CRLB with respect to the noise pdfs and local quantization rules to obtain a lower bound for the mean squared error (MSE) performance of a class of universal decentralized estimators [Z-Q. Luo (2004), A. Ribeiro et al. (2004)]. Our results show that if the noises and the parameter to be estimated both have finite range in [-U, U], then the minimum MSE performance of any rate-constrained universal decentralized estimator is at least in the order of U/sup 2//(4K), where K is the total number sensors. This bound implies that the recently proposed universal decentralized estimators [Z.-Q. Luo (2004), A. Ribeiro et al. (2004)] are optimal up to a constant factor (of 16).","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"83 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":"124941839","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}
M. Guenach, E. Simoens, Henk Wymeersch, M. Moeneclaey
{"title":"Uplink acquisition of a new user accessing a fixed wireless DS-CDMA system","authors":"M. Guenach, E. Simoens, Henk Wymeersch, M. Moeneclaey","doi":"10.1109/SPAWC.2005.1506046","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1506046","url":null,"abstract":"In this paper, we consider synchronization and detection in a space-time bit-interleaved coded modulation (BICM) scheme for an asynchronous direct-sequence code division multiple access (DS-CDMA) uplink transmission over static frequency selective channels for fixed wireless transmission. We propose a strategy to synchronize and detect a new user accessing the system by exploiting the knowledge of the synchronization parameters of previously synchronized users. In this way, we can synchronize one user at a time and hereby avoid complex multi-dimensional optimization problems. To limit the number of pilot symbols required for this problem, we exploit all available information, i.e., pilot symbols and the unknown coded symbols of all users. We resort to the iterative space alternating generalized expectation maximization (SAGE) algorithm to tackle this problem in a systematic manner.","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"3 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":"122327329","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":"Optimal pilot spacing and power in rate-adaptive MIMO diversity systems with imperfect transmitter CSI","authors":"D. Duong, B. Holter, G. Oien","doi":"10.1109/SPAWC.2005.1505869","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1505869","url":null,"abstract":"We analyze and optimize the performance of an adaptive coded modulation system with imperfect channel state information, operating on a multiple-input multiple-output channel where space-time block coding is utilized to exploit spatial diversity and, thereby combat fading in wireless channel communications. The pilot symbol period and the power allocated to pilot and data symbols are optimized in such a way that the average spectral efficiency is maximized. At the same time, the bit error rate is maintained below a desired level. A numerical example is given for independent flat Rayleigh fading subchannels with Jakes spectrum.","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"1973 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":"129955077","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":"The turbo decoder as a least squares cost gradient descent","authors":"John MacLaren Walsh, C. R. Johnson, P. Regalia","doi":"10.1109/SPAWC.2005.1506225","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1506225","url":null,"abstract":"In this paper we show that the iterative decoding algorithm can be viewed as descending a nonlinear least squares cost function. When at least one component code has a likelihood function that can be written as the product of its bitwise marginals, the iterative decoding algorithm is exactly a steepest descent on this cost function. Furthermore, when the iterative decoder converges to infinite log likelihood ratios, we show that its trajectories must locally descend the cost function. Conditions are then given under which the iterative decoder may be thought of as globally descending this cost function This suggests, together with its positive definiteness, that the proposed cost function makes a suitable Lyapunov function.","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"48 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":"128723509","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":"Signal processing for single-ended loop make-up identification","authors":"Stefano Galli, K. Kerpez","doi":"10.1109/SPAWC.2005.1506049","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1506049","url":null,"abstract":"Broadband digital subscriber line (DSL) access for small business and residential customers is one of the most important new services currently being offered by network and service providers. To date, DSL service providers are still in need of an advanced loop qualification system that can minimize qualification errors. Loop qualification consists of determining whether a loop can support DSL services or not and, generally, the estimate of the loop transfer function is sufficient for such purposes. We propose here to solve a more ambitious problem: single ended automatic loop make-up identification (LMID), i.e. the determination of the length and the gauge of all loop sections (including bridged taps) via single-ended testing without human intervention. It is proposed here to use time domain reflectometry (TDR) measurements, which are analyzed by a novel step-by-step ML algorithm, to achieve accurate LMID. This problem is equivalent to resolving via a single sensor experiment an unknown number of closely spaced echoes, some overlapping some not, which exhibit unknown amplitudes, unknown times of arrival and unknown shapes.","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"179 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":"123340566","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":"Efficient synchronization-demodulation for UWB ad hoc access: performance analysis and comparisons with RAKE","authors":"X. Luo, G. Giannakis","doi":"10.1109/SPAWC.2005.1506270","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1506270","url":null,"abstract":"Synchronization is a performance-critical factor in all communication systems, but becomes particularly challenging in ultra-wideband (UWB) radios due to the ultra-short length of the transmitted pulses. Presence of severe inter-symbol interference (ISI) and multi-user interference (MUI) render the synchronization task even more difficult. The present paper deals with a blind synchronization and demodulation scheme which relies on intermittent transmission of nonzero mean symbols. This transmission pattern enables MUI-and ISI-resilient timing acquisition via energy detection and low-complexity demodulation by correlating the received waveform with a synchronized aggregate template (SAT). The resultant SAT receiver offers distinct advantages over the traditional RAKE and has remarkably low-complexity. Analytical performance evaluation of the novel timing estimator and the SAT demodulator is provided along with comparisons with the RAKE receiver for a single user link without ISI. Simulations confirm the analytical results and corroborate the high potential SAT-based UWB modems have for deployment.","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":"121669363","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":"Nonstationary vector AR modeling of wireless channels","authors":"M. Jachan, Gerald Matz","doi":"10.1109/SPAWC.2005.1506215","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1506215","url":null,"abstract":"We propose a novel long-term parametric channel model for wireless channels that do not satisfy the usual assumption of wide-sense stationary uncorrelated scattering (WSSUS). Our non-WSSUS channel model is based on an innovations system representation that models the channel taps jointly as nonstationary vector autoregressive (AR) process, leading to a highly parsimonious description of the channel statistics. We also present a Yule-Walker type approach for estimating the parameters of this vector time-frequency AR model. Numerical results involving a simulated channel and real-world measurements illustrate the usefulness of our approach.","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"41 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":"127681884","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":"Minimum interference prolate based spreading codes design DS-CDMA overlaying narrow band systems","authors":"S. Zazo, I. Raos","doi":"10.1109/SPAWC.2005.1505900","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1505900","url":null,"abstract":"The overlaying of a CDMA system on an existing narrowband system has been proposed and investigated in several publications. This topic is critical in many environments where new broadband systems are required to coexist with legacy narrowband systems. This paper is focused on minimisation of the performance degradation of the narrow-band system(s) caused by the CDMA one. Common background in most of this topic deals with notch-filtering of CDMA signals in transmitter to minimise its interference over the narrowband signal. However, this solution results in effective spreading codes longer that bit time, causing ISI within the CDMA system. The solution that is proposed in this contribution is the design of spreading codes that notch the CDMA power spectrum density (PSD) on specified bandwidth intervals where narrow-band signals are transmitted. To achieve this, spreading codes are selected from the orthogonal set of polynomials arising from digital prolate functions (DPF) which have property of energy concentration in specified intervals. Provided solution guarantees null interference in CDMA system with orthogonal codes, strictly located within the bit period.","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":"121441660","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":"Amplifier predistortion using unscented Kalman filtering","authors":"A. Malipatil, Yih-Fang Huang","doi":"10.1109/SPAWC.2005.1505904","DOIUrl":"https://doi.org/10.1109/SPAWC.2005.1505904","url":null,"abstract":"Bandwidth efficient modulation schemes like M-ary quadrature amplitude modulation (M-QAM) and orthogonal frequency division multiplexing (OFDM) suffer from amplifier nonlinearities when operated near saturation. The high power amplifier (HPA) characteristics could be memoryless or with memory, as experienced in wideband CDMA (W-CDMA). Digital baseband predistortion is an efficient technique to compensate for the amplifier nonlinearities. In this paper, an unscented Kalman filter (UKF) is used to design an adaptive predistorter (PD) for the general case of a nonlinear amplifier with memory. Simulation results are shown to verify the performance of the proposed method.","PeriodicalId":273666,"journal":{"name":"IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005.","volume":"11 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":"132196121","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}