{"title":"Performance of Shalvi and Weinstein's blind deconvolution criteria for channels with/without zeros on the unit circle","authors":"Chih-Chun Feng, Chen-Hua Hsi, Chong-Yung Chi","doi":"10.1109/SPAWC.1999.783024","DOIUrl":"https://doi.org/10.1109/SPAWC.1999.783024","url":null,"abstract":"In this paper, we show that Shalvi and Weinstein's (1994) blind deconvolution criteria are applicable for finite SNR regardless of channels having zeros on the unit circle or not. The associated deconvolution filter is stable with a nonlinear relation to the nonblind MMSE equalizer and capable of performing perfect phase equalization for finite SNR.","PeriodicalId":365086,"journal":{"name":"1999 2nd IEEE Workshop on Signal Processing Advances in Wireless Communications (Cat. No.99EX304)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124049790","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":"Subspace-based noncoherent detection for CDMA channels","authors":"Yong-Suk Moon, M. Kaveh","doi":"10.1109/SPAWC.1999.783049","DOIUrl":"https://doi.org/10.1109/SPAWC.1999.783049","url":null,"abstract":"This paper presents a noncoherent subspace detection approach based on oblique projections for DS-CDMA systems, which performs complete rejection of interfering signals. The synchronous and asynchronous subspace detectors are introduced and examined. The transmission delays in asynchronous CDMA channels are not known to the receiver in practice. The effect of code acquisition errors on the performance of the noncoherent subspace detector is investigated. A robust noncoherent subspace detector in the presence of acquisition errors is presented, which shows reliable performance even under worse condition than the code acquisition algorithms may support.","PeriodicalId":365086,"journal":{"name":"1999 2nd IEEE Workshop on Signal Processing Advances in Wireless Communications (Cat. No.99EX304)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129957591","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":"Canonical space-time coordinates for multiuser wireless communications","authors":"E. Onggosanusi, A. Sayeed, B. V. Van Veen","doi":"10.1109/SPAWC.1999.783076","DOIUrl":"https://doi.org/10.1109/SPAWC.1999.783076","url":null,"abstract":"We propose a space-time multiuser detection scheme for wireless communications that projects the received signal onto a fixed set of basis signals. The basis signals are dictated by a canonical characterization of channel propagation dynamics in terms of discrete multipath delays, Doppler shifts, and directions of arrival. They capture the essential degrees of freedom in the received signal. The canonical space-time coordinates induced by the underlying basis provide a natural framework for multi-access interference (MAI) suppression and diversity processing. The signal of the desired user is concentrated in a subset of coordinates, while the interference generally occupies the entire space-time coordinate system. It is demonstrated that MAI suppression can be improved by incorporating a subset of coordinates where the desired user is absent.","PeriodicalId":365086,"journal":{"name":"1999 2nd IEEE Workshop on Signal Processing Advances in Wireless Communications (Cat. No.99EX304)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128880700","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 algorithms for sequence detection in non-Gaussian noise with intersymbol interference","authors":"Yue Chen, Rick S. Blum","doi":"10.1109/SPAWC.1999.783016","DOIUrl":"https://doi.org/10.1109/SPAWC.1999.783016","url":null,"abstract":"Sequence detection is studied for communication channels with intersymbol interference and non-Gaussian noise using a novel adaptive receiver structure. The receiver adapts itself to the noise environment using an algorithm which employs a Gaussian mixture distribution model and the expectation maximization algorithm. Two alternate procedures are studied for sequence detection. These are a procedure based on the Viterbi (1967) algorithm and a symbol-by-symbol detection procedure. The Viterbi algorithm minimizes the probability the sequence is in error and the symbol-by-symbol detector minimizes symbol error rate, which are different.","PeriodicalId":365086,"journal":{"name":"1999 2nd IEEE Workshop on Signal Processing Advances in Wireless Communications (Cat. No.99EX304)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127609662","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 data predistortion technique for the compensation of nonlinear distortion in MC-CDMA systems","authors":"Jaehyun Jeon, Yoan Shin, S. Im","doi":"10.1109/SPAWC.1999.783047","DOIUrl":"https://doi.org/10.1109/SPAWC.1999.783047","url":null,"abstract":"We present a data predistorter to compensate for nonlinear distortion introduced by a traveling wave tube amplifier employed in multi carrier-code division multiple access (MC-CDMA) system. The proposed predistorter rests upon the fixed point iteration (FPI) associated with the contraction mapping theorem. Unlike the predistorter based on the FPI already proposed by the authors in another study which operates on complex-valued modulated signal, the proposed predistorter in this paper deals with real-valued FPI on signal amplitude, resulting in much less complexity. Simulation results on a 64-subcarrier synchronous MC-CDMA system indicate that the proposed predistorter achieves significant improvement in terms of total degradation over that without the predistorter. Moreover, the proposed predistorter outperforms its complex-valued counterpart, in particular, for small output back-off levels.","PeriodicalId":365086,"journal":{"name":"1999 2nd IEEE Workshop on Signal Processing Advances in Wireless Communications (Cat. No.99EX304)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125040119","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":"Linear detector length conditions for DS-CDMA perfect symbol recovery","authors":"D.R. Brown, C. R. Johnson, D. Anair","doi":"10.1109/SPAWC.1999.783048","DOIUrl":"https://doi.org/10.1109/SPAWC.1999.783048","url":null,"abstract":"Within the established framework of linear detection for multiuser DS-CDMA systems, we derive length conditions for perfect recovery of the transmitted symbols of all K in-cell mobile users. The analysis accounts for multiple access interference with arbitrary asynchronism as well as multipath interference with arbitrary delay spread. The results imply that linear detectors achieving perfect symbol recovery may require an observation interval much longer than a single bit. Moreover, we show that linear detectors employing oversampling and/or antenna arrays require less taps to achieve perfect symbol recovery than conventional non-oversampled, single antenna receivers. Simulation results are presented verifying the derived length conditions.","PeriodicalId":365086,"journal":{"name":"1999 2nd IEEE Workshop on Signal Processing Advances in Wireless Communications (Cat. No.99EX304)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125168129","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":"Single user synchronization in fading channel","authors":"J. Joutsensalo, T. Ristaniemi","doi":"10.1109/SPAWC.1999.783037","DOIUrl":"https://doi.org/10.1109/SPAWC.1999.783037","url":null,"abstract":"In this paper, a pilot channel is used for transmitting a constant preamble to the desired user in CDMA synchronization. Then the specific data correlation matrix of the short code signal consists only of the information of the desired user, while interferers and noise are suppressed out. The performance of the method is competitive especially when a large number of users exists. The method can be applied when the channels are fading. In addition, the method has essentially the same complexity as the matched filter, and therefore it is suitable candidate as a practical initial acquisition algorithm.","PeriodicalId":365086,"journal":{"name":"1999 2nd IEEE Workshop on Signal Processing Advances in Wireless Communications (Cat. No.99EX304)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129612398","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 chip design for pulse shaping","authors":"M. Rupp, J. Balakrishnan","doi":"10.1109/SPAWC.1999.783079","DOIUrl":"https://doi.org/10.1109/SPAWC.1999.783079","url":null,"abstract":"Pulse shaping is a crucial operation for every modem transceiver. It usually requires a large portion of the modem's computational power and, therefore, an efficient implementation can be very beneficial to the overall modem design. In particular, in the transmitter part where well defined signals are to be computed, the typical pulse shaping operation can be greatly simplified. While a standard filter design requires many mult/add operations, the transmitter pulse shaping filter could also be designed by a pure look-up table. However, for higher constellations and large pulse shaping filter lengths the look-up table can become too large to implement. This paper presents a new idea for implementing the pulse shaping filter for a modem transmitter. It is shown that for QPSK and other higher order modulations, like 16/32/64 QAM, no multiplication is required at all. Further, the number of multiplications for 8PSK (and 16/32 PSK) can be reduced to a very small number that is independent of the number of coefficients necessary for implementing the filter function.","PeriodicalId":365086,"journal":{"name":"1999 2nd IEEE Workshop on Signal Processing Advances in Wireless Communications (Cat. No.99EX304)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130897120","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 phase noise programmable clock generators for wireless modems","authors":"J. Belzile, N. Batani","doi":"10.1109/SPAWC.1999.783035","DOIUrl":"https://doi.org/10.1109/SPAWC.1999.783035","url":null,"abstract":"Modern digital programmable modems require very stable clock generation at the transmit side to provide a clean spectrum and to guarantee bit count integrity in the presence of prolonged signal outages. On the other hand, such modems need also to carry various traffic rates which in turn require a programmable clock. This paper covers the design performance and analysis of a high frequency, DDS driven, third order DPLL. The paper identifies the noise sources in such a design which differ from the traditional VCO driven PLL noise sources. Furthermore the analysis and hardware implementation of a low cost, low phase noise, wide range, high frequency and programmable clock generator are presented in the paper.","PeriodicalId":365086,"journal":{"name":"1999 2nd IEEE Workshop on Signal Processing Advances in Wireless Communications (Cat. No.99EX304)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126652026","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":"Fixed-window constant modulus algorithms: adaptive implementations","authors":"Xiangyang Zhuang, A. Swindlehurst","doi":"10.1109/SPAWC.1999.783026","DOIUrl":"https://doi.org/10.1109/SPAWC.1999.783026","url":null,"abstract":"Adaptive implementations of two previously proposed block-iterative algorithms; referred to as fixed-window constant modulus algorithms (FWCMA), are developed. Their transient behavior, in relation to the delay at which the user sequence is recovered, is discussed and compared with other existing variations of CMA. The adaptive FWCMA-2 appears to be particularly promising, attaining convergence with little data. It retains the merits of its batch counterpart, namely, fast convergence, robustness to ill-conditioning, no required step-size tuning, and relatively low complexity. The built-in control over the converged delay translates into more reliable and predictable transient behavior. Equalizer calculation can be initiated from any initialization, and at any time instant, to attain convergence instantaneously without storing any received data. Thus, different initializations can be used to easily obtain multiple equalizers recovering the signal at different delays or recovering distinct users under a near-far simulation.","PeriodicalId":365086,"journal":{"name":"1999 2nd IEEE Workshop on Signal Processing Advances in Wireless Communications (Cat. No.99EX304)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131689539","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}