{"title":"Use of Wijsman's theorem for the ratio of maximal invariant densities in signal detection applications","authors":"J.R. Gabriel, S. Kay","doi":"10.1109/ACSSC.2002.1197281","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197281","url":null,"abstract":"We apply Wijsman's theorem for the ratio of densities of the maximal invariant to signal detection applications. The method does not require the explicit use of a maximal invariant statistic or its density to derive the uniformly most powerful invariant (UMPI) test. We describe its use for common classes of detection problems and illustrate its use in examples. The analytic form of the representation provides new insight into the relationship between the UMPI and generalized likelihood ratio test.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"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":"126427520","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}
A. Awawadeh, S.S.U. Chander, A. Kichenaradjo, M. Soderstrand
{"title":"Hardware efficient BPSK and QPSK detector","authors":"A. Awawadeh, S.S.U. Chander, A. Kichenaradjo, M. Soderstrand","doi":"10.1109/ACSSC.2002.1196946","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1196946","url":null,"abstract":"A very simple LMS-based adaptive notch filter implemented in FPGAs can be used for carrier recovery of a QPSK signal and for direct detection of a BPSK signal. The key aspect of our paper lies in the alternative approach in the realization of carrier frequency detection or synchronization circuit. The carrier frequency after detection is used in the conventional QPSK detector. Also the demodulator has a simple hardware realization that does not require a reference signal.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"18 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":"120954591","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":"GPS C/A code tracking with adaptive beamforming and jammer nulling","authors":"Seung-Jun Kim, R. Iltis","doi":"10.1109/ACSSC.2002.1196929","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1196929","url":null,"abstract":"A space-time adaptive processing (STAP) algorithm for delay tracking and acquisition of the GPS signature sequence with interference rejection capability is developed. The interference can consist of both broadband and narrowband jammers. The narrowband jammers are modeled as vector autoregressive (VAR) processes and rejected by temporal whitening. The spatial nulling is implicitly achieved by estimating a sample covariance matrix and feeding its inverse into the extended Kalman filter (EKF). Computer simulations demonstrate robust performance of the algorithm in severe jamming, and also show that the algorithm outperforms the conventional delay-locked loop (DLL).","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"84 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":"127488852","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}
Roland Gautier, Gilles Burel, J. Letessier, Olivier Berder
{"title":"Blind estimation of scrambler offset using encoder redundancy","authors":"Roland Gautier, Gilles Burel, J. Letessier, Olivier Berder","doi":"10.1109/ACSSC.2002.1197256","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197256","url":null,"abstract":"A self-recovering receiver for encoded and scrambled binary data streams is proposed in this paper. The generating polynomial of the scrambling sequence is known, as well as the encoder structure and coefficients, but the scrambler time offset is unknown. Taking profit of redundancy introduced by the encoder, we proposed a method which is able to estimate the scrambling sequence offset from the observed scrambled stream. The method is based on the projection of the observed data on the encoder orthogonal subspace. Once the offset has been estimated, classical data descrambling and decoding can be used to recover the information stream.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"594 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":"132658166","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 single-tone and two-tone frequency-shift keying for ultrawideband","authors":"Cheng-kai Luo, M. Médard","doi":"10.1109/ACSSC.2002.1197271","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197271","url":null,"abstract":"By using impulsive frequency-shift keying (FSK) with vanishingly small duty cycle, capacity can be achieved in the limit of infinite bandwidth in wideband systems that decorrelate in time and frequency. With limits on bandwidth and peak power, impulsive FSK schemes with small duty cycle can still achieve rates of the order of capacity in ultrawideband systems. We compare performance of a single tone and two-tone FSK schemes. Our results indicate that two-tone FSK can be applicable at lower bandwidth with almost no detriment in the error exponent.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"35 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":"132844130","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":"Location estimation accuracy in wireless sensor networks","authors":"Neal Patwari, A. Hero","doi":"10.1109/ACSSC.2002.1197033","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197033","url":null,"abstract":"The peer-to-peer nature of a wireless sensor network presents the opportunity for accurate and low-configuration sensor location estimation. Range measurements are made between pairs of sensors, regardless of their a priori coordinate knowledge. This paper quantifies via the Cramer-Rao bound (CRB) variance limits on location estimators which use measured time-of-arrival (TOA) or received signal strength (RSS). An extensive campaign measures TOA and RSS in a 44-device multipoint-to-multipoint indoor network for input into maximum-likelihood estimators (MLE) of location. RMS location errors of 1.2 and 2.2 m are demonstrated using TOA and RSS, respectively.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"291 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":"122202059","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":"On blind channel identifiability under space-time coded transmission","authors":"N. Ammar, Z. Ding","doi":"10.1109/ACSSC.2002.1197264","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197264","url":null,"abstract":"Space-time block coded (STBC) transmission has recently been established as an efficient method to enhance wireless communication performance over quasi-static fading channels. Often, the success of STBC requires accurate channel knowledge at the receiver side. In this work, we present a channel estimation approach that does not require training data to estimate the unknown channel. We establish that under real space-time coded transmission, if the STBC symbol dimension n is odd, then the channel is identifiable up to a scalar ambiguity. In case the STBC dimension is even, the channel matrix is still identifiable if it has full column rank and the number of transmit antennas is odd. We develop simple algorithms to identify the unknown space-time channel matrix for STBC transmission developed.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"7 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":"130756424","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":"Geometric analysis of planar shapes using geodesic paths","authors":"E. Klassen, A. Srivastava","doi":"10.1109/ACSSC.2002.1197226","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197226","url":null,"abstract":"We propose a differential geometric representation of planar shapes using \"direction\" functions of their boundaries. Each shape becomes an element of a constrained function space, an infinite-dimensional manifold, and pairwise differences between are quantified using the lengths of geodesics connecting them on this space. A gradient-based shooting method is used for finding geodesics between any two shapes. Some applications of this shape metric are illustrated including clustering of objects based on their shapes and computation of intrinsic mean shapes.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"417 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":"116702060","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 GLR-based group detection strategy for synchronous CDMA systems over frequency-selective fading channels","authors":"F. Bandiera, G. Ricci","doi":"10.1109/ACSSC.2002.1197026","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197026","url":null,"abstract":"The generalized likelihood rule (GLR) can be used to demodulate the bits of G out of the K users of a synchronous code-division multiple-access (CDMA) system without knowledge of the bits, the amplitudes, and the signatures of the interferers. Resorting to the GLR over M + 1 signaling intervals though leads to a detector whose computational complexity is exponential in the number of signaling intervals. Thus, we investigate the suitability of a decision-aided version of the GLR-detector; the proposed receiver is also implemented without knowledge of both the number of interferers, that is determined by resorting to the Akaike information criterion (AIC), and the channel impulse response, that is estimated by exploiting the presence of a training sequence (necessary for the initialization of the algorithm). The performance assessment of the proposed detector shows that its loss with respect to a plain group detector can be negligible in power-controlled scenarios.","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":"131341381","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 globally convergent CMA-based approach to blind multiuser detection","authors":"Ping Liu, Zhengyuan Xu","doi":"10.1109/ACSSC.2002.1197258","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197258","url":null,"abstract":"In this paper, we study blind multiuser detection in a CDMA system in the presence of multipath propagation. The receiver is forced to follow a minimum mean-square-error type parameterized by a channel like constraint vector. Then we minimize the Godard's CMA cost function with respect to such a constraint vector in a much smaller dimensional space. Global convergence of the proposed approach is established. Performance of the channel estimator and receiver is also analyzed, together with comparisons with existing methods. Simulation results show that the proposed method performs well by both batch and adaptive implementations.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"58 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":"128350829","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}