{"title":"Optimum decision feedback multiuser equalization with successive decoding achieves the total capacity of the Gaussian multiple-access channel","authors":"M. Varanasi, T. Guess","doi":"10.1109/ACSSC.1997.679134","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.679134","url":null,"abstract":"The complex Gaussian multiple-access channel (GMAC) Y_=AX_+N_ is considered. The transmitters send information independently with a power constraint so that X_ has a product distribution with E[|X/sub k/|/sup 2/]/spl les/P/sub k/. It is known that multiuser codes exist that will achieve any rate-tuple in the capacity region of the GMAC provided that an optimum joint decoder is used. However, little progress has been made in multiuser coding, and moreover, optimum joint decoding would be too complex. We restrict the decoder to be of a successive decoding type with equalization. Such a decoder is parameterized by feedforward and feedback equalization vectors. The optimum successive decoder (OSD) is obtained by maximizing the mutual information for each user over those vectors. The key result of this paper is that the OSD achieves the total capacity of the GMAC at any vertex of the capacity region. With the OSD, each transmitter can use a single-user code independently of the other users. The complexity of equalization is also only linear in the number of users. For the conventional GMAC, Y=/spl Sigma//sub i=1//sup M/ X/sub i/+N, where A is a row vector with unit elements, the OSD is degenerate and involves no equalization. It reduces to the well-known successive decoder for that channel as described by Wynter (1974) and Cover (1975). Furthermore, for the particular case of the uncoded channel, the OSD reduces to a new decision feedback multiuser detector. This detector is optimum in the sense that it maximizes signal-to-interference ratio for each user.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116337997","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 structured approach for designing low power adders","authors":"A. Shams, Magdy A. Bayoumi","doi":"10.1109/ACSSC.1997.680546","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.680546","url":null,"abstract":"A performance analysis of a general 1-bit full adder cell is presented. The adder cell is anatomized into smaller modules using the proposed structured approach. The modules are studied extensively and several designs of each of them are shown. Connecting combinations of designs of these modules together we construct 24 different 1-bit full adder cells (some of them are novel circuits). Each of these cells exhibits different power consumption, speed, area, and driving capability figures. Some of the new cells outperform existing standard designs of the full adder cell.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116475467","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":"Robust image compression for transmission over time-varying channels","authors":"S. Regunathan, K. Rose","doi":"10.1109/ACSSC.1997.679051","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.679051","url":null,"abstract":"We propose a rate-distortion (RD) approach to the optimization of image coding for transmission over time-varying channels. The information available about the channel error rate, is used to adapt the joint source-channel coding (JSCC) scheme. We focus on structured JSCC schemes to obtain realizations with feasible complexity. The image is hierarchically quantized, followed by unequal channel error protection matched to the importance of the bits. We allow the use of variable length codes in the source coder which provides adaptation to image statistics and higher compression performance. At the same time, we maintain error resilience by sending the synchronization information error free (through heavy protection). We show that efficient rate-distortion performance can be achieved by optimizing the overall system for the target rate and channel conditions. We present simulation results obtained on coding images for time-varying channels, which show that RD optimized JSCC schemes substantially outperforms conventional fixed length JSCC and can gain more than 6 dB in PSNR of the reconstructed frames.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114991169","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":"Parameter estimation and data analysis for stable distributions","authors":"J. P. Nolan","doi":"10.1109/ACSSC.1997.680366","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.680366","url":null,"abstract":"It is now practical to use maximum likelihood estimation to estimate stable parameters and to give large sample confidence regions. Just as important as estimating parameters is assessing whether or not a given sample is stably distributed. Diagnostics for this purpose are demonstrated. Several methods of estimating the spectral measure of a multivariate stable distribution are described, and diagnostics for assessing stability of a multivariate sample are also demonstrated.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131873713","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":"Bayesian estimation of filtered point processes using Markov chain Monte Carlo methods","authors":"C. Andrieu, A. Doucet, P. Duvaut","doi":"10.1109/ACSSC.1997.679075","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.679075","url":null,"abstract":"Filtered point processes model a huge amount of physical phenomena. Usually, only noisy observations are in practice available. From these data, one would like to estimate the parameters of the filtered point process. This is a complex problem which in general does not admit any closed-form solution. In this paper, we propose stochastic algorithms to perform statistical estimation for such processes in a Bayesian framework. These algorithms rely on Markov chain Monte Carlo methods which are powerful stochastic simulation methods.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132231638","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":"Blind optimal MMSE receiver for asynchronous CDMA in the presence of multipath","authors":"I. Ghauri, D. Slock","doi":"10.1109/ACSSC.1997.680427","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.680427","url":null,"abstract":"We consider multiple users in a DS-CDMA system operating in a multipath environment. The received cyclostationary spread signal sampled at the chip rate is converted to a stationary vector signal, leading to a linear multichannel model. Prior knowledge of the transmission pulse (spreading sequence) is exploited to obtain the desired user channel estimate blindly. It is shown that the multiple user problem can be decoupled and a single user scenario can be obtained to apply the blind estimation and interference cancelation algorithms banking on limited a priori knowledge. The FIR channel estimation problem is investigated and the optimal MMSE receiver for multipath channels is presented along with a computationally more efficient interference canceling RAKE receiver (ICRR). Both the MMSE receiver and the ICRR are parameterized in terms of the desired user's channel and quantities that can be estimated from second-order statistics.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128225575","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 in non-Gaussian noise using mixture distributions and the EM algorithm","authors":"R. Kozick, R. Blum, B. Sadler","doi":"10.1109/ACSSC.1997.680365","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.680365","url":null,"abstract":"Many techniques have been developed and optimized for processing signals that are corrupted by additive, Gaussian noise. The schemes designed for Gaussian noise typically perform very poorly when the noise is non-Gaussian. An approach for non-Gaussian signal processing is presented in this paper that is based on modeling the probability density function (pdf) of the additive noise with a finite mixture of Gaussian pdfs. Model parameters are estimated using iterative procedures derived from the expectation-maximization (EM) algorithm. Explicit algorithms are presented for several signal processing problems using this framework, including linear regression, array processing, and sequence estimation for intersymbol interference communication channels. The resulting algorithms are data-adaptive, in that they characterize the non-Gaussian noise and then modify the signal processing accordingly.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128687711","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":"New edge detection algorithms based on adaptive estimation filters","authors":"M.C. Woodhall, C. Lindquist","doi":"10.1109/ACSSC.1997.679191","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.679191","url":null,"abstract":"In this paper we describe new edge detection algorithms based on adaptive two-dimensional estimation filters. Examples with the Lena image are used to illustrate our concepts.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133724399","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":"Coefficient rate and significance maps in transform coding","authors":"W. Yang, J. Gibson","doi":"10.1109/ACSSC.1997.679128","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.679128","url":null,"abstract":"A significance map is a representation of positions of significant transform coefficients. In adaptive coding schemes, this map changes with the sample functions and a large fraction of code bits are used to encode it in low bit rate situations. In this paper, using the component variance as significance measure, a coding scheme is designed to reduce the number of code bits used for the significance map. Although it is a suboptimal approach, the performance is close to the rate distortion limit at a low bit rate. The result also justifies some earlier adaptive schemes using spectral entropy as an indicator of the number of coefficients to be coded.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134051236","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":"Partially blind antenna diversity equalization of a jammed fading channel","authors":"V. Radionov, S. Mayrargue","doi":"10.1109/ACSSC.1997.679176","DOIUrl":"https://doi.org/10.1109/ACSSC.1997.679176","url":null,"abstract":"For wireless mobile communications systems operating on a jammed frequency-selective fading channel, the receiver performance can be improved by using the joint antenna diversity and equalization techniques to eliminate both time- and frequency-selective fades and jammers effects. The spatio-temporal processing techniques introduced previously use the reference part of the transmitted sequence only for channel/noise covariance estimation. We present a novel approach to joint channel identification/symbol estimation in the presence of colored noise based on a maximum likelihood criterion and exploiting both the training and unknown part of the transmitted sequence. This approach results in computationally efficient iterative algorithms which outperform existing techniques.","PeriodicalId":240431,"journal":{"name":"Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133242747","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}