{"title":"Trace balancing for multiuser MIMO downlink transmission","authors":"H. Boche, M. Schubert, Eduard Axel Jorswieck","doi":"10.1109/ACSSC.2002.1197005","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197005","url":null,"abstract":"We consider the problem of balancing individual capacities in a multiuser MIMO downlink channel. If perfect channel state information is available at the base station, the rates of all users can be jointly controlled by adjusting the transmit covariance matrices. We propose a new transmission strategy based on trace balancing, which is optimal in the low SNR regime. Otherwise, it provides an approximation. An iterative algorithm is proposed, which rapidly converges to the global optimum of the trace balancing problem.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132145475","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 novel model for reverberant signals; robust maximum likelihood localization of real signals based on a sub-Gaussian model","authors":"P. Georgiou, C. Kyriakakis","doi":"10.1109/ACSSC.2002.1196986","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1196986","url":null,"abstract":"We present a novel model for signals encountered in reverberant environments using the sub-Gaussian distribution that can describe both the impulsive nature of the signals and their inter-dependence. The proposed system can be viewed as one where the sources are stochastic and Gaussian and the transfer medium is varying in a highly impulsive manner, introducing the sub-Gaussian nature at the receiver or alternatively, the impulsive transformation to the signals can be viewed as part of the source model, creating a multivariate source signal whose components can not be independent, and is of impulsiveness equal to the one of the Cauchy distribution. We formulate the separable maximum likelihood solution to an array signal processing problem based on a derived sub-Gaussian density. We proceed to give both simulations and experimental results of the validity of the algorithm. In the experiments sound signals are played from loudspeakers in a room and localized with a microphone array and it is demonstrated that the localization based on the sub-Gaussian moded significantly outperforms the one based on the traditional Gaussian model.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134294018","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 statistical analysis of shape reconstruction from areas of shadows","authors":"A. Poonawala, P. Milanfar, R. Gardner","doi":"10.1109/ACSSC.2002.1197310","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197310","url":null,"abstract":"We present a statistical analysis of the problem of shape reconstruction from measurements of the brightness function (areas of shadows) by deriving the Cramer-Rao lower bound (CRLB) on the estimated 2-D boundary. Confidence region techniques are used to analyze and visualize the performance of the 2-D parametric shape estimation problem. The brightness function data is very weak, so a constrained CRLB is used on the shape parameters to form the confidence regions. Algorithms for reconstructing the shape of a convex object from multiple measurements of its brightness function were developed in [R. J. Gardner and P. Milanfar, \"Shape reconstruction from brightness functions\", August 2001] and [R. J. Gardner and P. Milanfar, \"Reconstruction of convex bodies from brightness functions\"]. The Cramer-Rao bound analysis presented provides statistical estimates that can be used for performance evaluation of these algorithms.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124015807","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 space-time codes over a flat-fading channel using a subspace-invariant detector","authors":"K. W. Forsythe","doi":"10.1109/ACSSC.2002.1197280","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197280","url":null,"abstract":"Multiple-input, multiple-output (MIMO) communications has received considerable attention in recent years. The flat-fading channel, with identical, independently distributed gains between all transmitter and receiver pairs has been one of the MIMO channels studied extensively. Many studies have focused on channel capacity and coding in additive white Gaussian noise. When the noise background has an unknown spatial covariance due to interference, receivers that adapt to the noise background can be more robust. One way of achieving robustness builds invariances into the detector, creating a channel model that incorporates adaptive beamforming naturally into signal detection and coding. In the particular case of frequency-hopped waveforms with random fading and hop to hop white noise, the capacity of this channel can be evaluated. A family of space-time codes for the invariant detector is investigated and its performance compared with the derived capacity bounds. Theoretical predictions of performance in interference and in different fading conditions are presented and compared with simulation results for a concatenated coding architecture involving space-time inner codes and low density parity-check outer code.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129181290","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":"Iterative constrained penalized likelihood estimation of parameters for CDMA","authors":"E. Khan, D. Slock","doi":"10.1109/ACSSC.2002.1197023","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197023","url":null,"abstract":"We describe an iterative method for maximum likelihood (ML) parameter estimation corrupted by additive white Gaussian noise. In the objective function we subtract/add the Kullback-Leibler (KL) distance function or Euclidean distance function to keep the old parameter set close to the new ones and it can be considered as a penalty term. The above augmented cost function can be maximized/minimized over the constraint that the detected data vector lie on the sphere. We simplify this constraint function by using first order Taylor expansion at the old parameter value. The useful behavior of the proposed algorithm is verified by numerical experiments.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129195607","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":"OFDM space-time trellis-coded MIMO systems with experimental results","authors":"J. Liberti, A. Triolo, T.R. Hoerning","doi":"10.1109/ACSSC.2002.1196999","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1196999","url":null,"abstract":"Multi-Input Multi-Output (MIMO) systems have been shown to provide extremely high capacity in non-line-of-sight channels. Using Space-Time Trellis Coded vector transmission, this paper shows that Maximum Likelihood Joint Detection (MLJD) receivers provide substantial improvements over Layered Space Time (LST) approaches. It is shown that in full-rank channels, the MLJD approach provides significant SNR improvement over LST techniques. It is also shown that an MLJD receiver is much more robust in reduced rank channels. These improvements come at the cost of high computational complexity at the receiver. Hybrid approaches allow complexity to be reduced by applying ML techniques to groups of transmit antennas, rather than all transmit antennas. Methods of performing this grouping based on channel conditions is presented and shown to provide a means of smoothly trading complexity for performance. Simulations and over-the-air measurements are presented that compare various MIMO receiver techniques.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129120215","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":"Iterative decoding schemes for source and joint source-channel coding of correlated sources","authors":"J. Garcia-Frías, W. Zhong, Y. Zhao","doi":"10.1109/ACSSC.2002.1197186","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197186","url":null,"abstract":"We propose the use of linear codes with low density generator matrix for channel coding, and joint source-channel coding of correlated sources. The use of iterative decoding techniques, i.e. message passing, over the corresponding graph achieves a performance close to the theoretical limits. As an advantage with respect to turbo and standard low-density parity check codes, the complexity of the decoding and encoding procedures is very low.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"38 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114287657","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 modulation for multiple antenna channels","authors":"June Chul Roh, B. Rao","doi":"10.1109/ACSSC.2002.1197237","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197237","url":null,"abstract":"We consider the use of adaptive modulation scheme for a multiple transmit and multiple receive antenna system with instantaneous channel information known to both the receiver and the transmitter. We derive an efficient bit allocation algorithm which maximizes the transmission rate for a given transmit power. The algorithm is generally a greedy algorithm; however, we derive a sufficient condition for the bit allocation algorithm to be globally optimal, which is found to satisfy all digital modulation schemes. It is found that when uncoded M-ary QAM is used with a target symbol error probability of 10/sup -5/ there is about 9 dB gap between the channel capacity and the throughput of adaptive modulation.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127336042","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":"Soft vs. hard antenna selection based on the minimum distance for MIMO systems","authors":"L. Collin, O. Berder, P. Rostaing, Gilles Burel","doi":"10.1109/ACSSC.2002.1197003","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197003","url":null,"abstract":"Assuming that channel state information (CSI) can be available at the transmitter, we provide a simplified representation of multi-input multi-output (MIMO) systems and derive a new precoder which maximizes the smallest distance between the received symbols. When the number of transmit antennas, n/sub T/, is greater than the number of transmit data streams, b, R.W. Heath and A. Paulraj (see Proc. ICC 2001) have proposed a \"hard\" antenna selection (or switch precoder) which consists in choosing the best b (among n/sub T/) antennas of the transmitter according to a criterion based on the minimum distance. Using the same criterion, we propose a \"soft\" (or linear) precoder that performs power allocation among the transmit antennas. Comparisons in term of bit error rate (BER) between switch and linear precoders are performed considering b=2 independent data streams, a QPSK modulation and the maximum likelihood (ML) receiver.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127534203","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":"Digital DS-CDMA receivers working below the chip rate","authors":"I. Maravic, M. Vetterli","doi":"10.1109/ACSSC.2002.1197022","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197022","url":null,"abstract":"We consider the problem of designing low-complexity digital receivers for CDMA systems operating over channels with single or multiple propagation paths. We extend some of our recent sampling results for certain classes of non-bandlimited signals and develop a method that takes advantage of transform techniques to perform channel estimation and signal detection from a low-dimensional subspace of a received signal, that is, by sampling below the traditional Nyquist rate. By lowering the sampling rate we can reduce computational requirements compared to existing solutions, allow for slower A/D converters and significantly reduce the power consumption of digital receivers. In effect, we use an algorithmic solution to improve hardware specifications in terms of complexity and power.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125429445","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}