{"title":"On the power efficiency of sensory and ad-hoc wireless networks","authors":"B. Hassim, A. Dana","doi":"10.1109/ACSSC.2002.1197035","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197035","url":null,"abstract":"We consider the power efficiency of a communications channel, i.e., the maximum bit rate that can be achieved per unit power (energy rate). For AWGN channels, it is well known that power efficiency is attained in the low SNR regime where capacity is proportional to the transmit power. In this paper we show that for a sensory wireless network with n nodes, or for an ad-hoc wireless network with n users and up to /spl radic/n transmit/receive pairs, the power efficiency scales at least by a factor of /spl radic/n. In other words, each user in a wireless channel with n nodes can support the same communications rate as a single user system, but by expending only 1/(/spl radic/n) the energy. We also give a description of how to achieve these gains.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"907 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":"123272247","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 modified hidden weight optimization algorithm for feedforward neural networks","authors":"Changhua Yu, M. Manry","doi":"10.1109/ACSSC.2002.1196941","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1196941","url":null,"abstract":"The output weight optimization-hidden weight optimization (OWO-HWO) feedforward network training algorithm alternately solves linear equations for output weights and reduces a separate hidden layer error function with respect to hidden layer weights. Here, a new hidden layer error function is proposed which de-emphasizes net function errors that correspond to saturated activation function values. In addition, an adaptive learning rate based on the local shape of the error surface is used in hidden layer training. Faster learning convergence is experimentally verified.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"13 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":"121542824","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 transmission for Infostations: a MC-CDMA implementation","authors":"C. Ibars, M. Tan, Y. Bar-Ness","doi":"10.1109/ACSSC.2002.1196976","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1196976","url":null,"abstract":"The Infostation concept is proposed for fourth generation cellular communications to provide very low cost data transfer. It provides non-ubiquitous coverage and very high data rates for users within small, isolated coverage areas by means of adaptive transmission. We propose a transmission scheme for infostations based on multi-carrier CDMA (MC-CDMA). The proposed system performs adaptive transmission by changing spreading code allocation and using adaptive modulation. In the receiver we propose to use successive interference cancellation (SIC), which decodes the most reliable symbols first. Approximate analytic and simulated results for bit error rate are given for a Rice Infostation channel. Transmission rates for the two user case under two proposed resource allocation policies are shown.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"106 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":"122260977","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":"An ASIC implementation of adaptive arithmetic coding","authors":"G. Acunto, M. Sans, A. Burg, W. Fichtner","doi":"10.1109/ACSSC.2002.1196950","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1196950","url":null,"abstract":"We present an improved version of an ASIC implementation of the adaptive arithmetic coding algorithm which uses a two-level memory hierarchy. We propose algorithmic modifications and a special hardware structure to speed-up the design without degrading the compression ratio obtained using this memory hierarchy. Moreover, several new features which increase the compression efficiency are introduced. Finally, a VLSI implementation based on the results of our work is presented.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"40 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":"115257352","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":"Spatial diversity vs. array gain in cellular communication systems","authors":"B. Friedlander, S. Scherzer","doi":"10.1109/ACSSC.2002.1197248","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197248","url":null,"abstract":"Multiple antennas are used in cellular communication systems to create spatial diversity and array gain. Techniques such as transmit diversity do for the former, while beamforming systems do the latter. This paper investigates the tradeoff between spatial diversity and array gain as a function of the total diversity available in the system, both spatial and temporal.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"15 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":"123863774","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":"Space-time equalization and interference cancellation for MIMO OFDM","authors":"M. B. Breinholt, M. Zoltowski, T. Thomas","doi":"10.1109/ACSSC.2002.1197063","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197063","url":null,"abstract":"The paper develops equalization techniques that facilitate aggressive frequency reuse in cellular OFDM systems. The initial focus is on the case of a single strong interfering base at the mobile. The interfering base is asynchronous in that its cyclic prefix is not time-aligned with the desired base's cyclic prefix. Various methods for combating the asynchronous, interfering base are developed, based on channel shortening ideas. The most promising method works to align the cyclic prefixes while holding all channel lengths equal to the cyclic prefix length or less. For the case of two receive antennas at the mobile, two sets of space-time filters are designed so that the respective channels at either output for either base are time-aligned with length no greater than the cyclic prefix length. As a result, standard frequency-domain equalization/interference suppression techniques (e.g., MMSE combining) can be applied to the outputs of the space-time filters on a per frequency bin basis to obtain symbol estimates for the desired base. Simulations are presented comparing the BER performance of the candidate techniques.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"113 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":"133644098","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":"Weighted bit-set encodings for redundant digit sets: theory and applications","authors":"G. Jaberipur, B. Parhami, Mohammad Ghodsi","doi":"10.1109/ACSSC.2002.1197053","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197053","url":null,"abstract":"This paper aims to fill the gap between theoretical studies of redundant number representation dealing with digit-level algorithms, without considering circuit-level details or impact of digit-set encodings, and implementation-oriented studies that typically focus on one particular digit-set encoding. We recognize that radices of practical interest are powers of two, giving each high-radix digit a weight that is a power of two. Furthermore, digit sets are typically encoded in such a way that each bit of the encoded form has a power-of-2 weight within the corresponding position. These observations lead us to define the class of weighted bit-set (WBS) encodings for redundant number systems and study the general properties of this class of representations. While by no means completely general, the class of WBS encodings includes virtually every implementation of redundant arithmetic that we have encountered, including those based on hybrid redundancy. We derive general conditions for a WBS encoding to be viable or efficient and describe how arithmetic operations can be performed on redundant numbers of this type using standard arithmetic components such as full/half-adders and multiplexers.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"152 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":"134624615","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":"Stability and maximum stable throughput of blind retransmission diversity multiple access","authors":"G. Dimić, N. Sidiropoulos, L. Tassiulas","doi":"10.1109/ACSSC.2002.1196966","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1196966","url":null,"abstract":"Building on the concept of retransmission diversity, a class of collision resolution protocols has recently been introduced - NDMA (network-assisted diversity multiple access) (see Tsatsanis, M. et al., IEEE Trans. Sig. Processing, vol.48, no.3, p.702-11, 2000) and BNDMA (blind NDMA) (see Zhang, R. et al., IEEE Trans. on Commun., vol.50, no.1, p.146-55, 2002) - using signal separation tools from array processing to resolve, as opposed to discard, collided data packets. Formal analysis of the stability and maximum stable throughput for xNDMA protocols is difficult, because the associated Markov chain is non-separable multidimensional. We tackle this problem for BNDMA. We show that BNDMA is stable if /spl Sigma//sub j/(/spl lambda//sub j/)+max/sub j/(/spl lambda//sub j/)<1, where /spl lambda//sub j/ stands for the arrival rate of the j-th user.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"49 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":"133139094","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":"Mean and variance CFAR performance via fiber integration","authors":"S.T. Smith","doi":"10.1109/ACSSC.2002.1197279","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197279","url":null,"abstract":"A closed-form analysis of the performance of two-parameter (mean and variance) CFAR normalizers is described. Typically, CFAR normalizers remove the background mean, then display and/or detect using a fixed threshold. If the background variance is varying and unknown, as is oftentimes the case across frequency or beamformer bins, a different threshold must be set for each bin independently, and human operators must view displays with large dynamic ranges. To avoid these problems, the variance may also be normalized. However, in contrast to the case of mean-level normalizers, the output distributions of mean and variance normalizers was previously unknown due to the complicated dependence of their outputs on the mutually dependent sample mean and variance. This paper describes the approach of fiber integration to obtain the distributions of these normalizers. This approach is very general, and can be used to obtain the output statistics of a very wide class of CFAR normalizers and input statistics. An analysis is presented for the case of chi-squared background statistics input to three different two-parameter normalizers: the so-called deflection ratio (z - /spl mu/)//spl sigma/, the log deflection ratio (log z - /spl mu//sub log/)//spl sigma//sub log/, and a new power domain method, called the log-gamma CFAR normalizer, -log/spl Gamma/(v,vz//spl mu/)//spl mu///spl Gamma/(v), where z is the input data, /spl mu/ and /spl sigma//sup 2/ are the sample estimates of the background mean and variance, and v = /spl mu//sup 2///spl sigma//sup 2/. Compared to mean level CFAR, it is shown that the deflection ratios has the least amount of CFAR loss (typically less than 1 dB) of these three, the log-gamma method has slightly more (typically 1 to 2 dB), and that the log-deflection ratio has by far the greatest (typically 4 dB or more).","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"16 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":"133143028","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":"Beamspace array processing for moving sources","authors":"Yuanwei Jin, B. Friedlander","doi":"10.1109/ACSSC.2002.1197302","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197302","url":null,"abstract":"We consider a method for signal detection given a small number of data samples, such as in the case of tracking moving sources. By employing a linear transformation, we map the full dimension sensor space data onto a lower dimension space (beamspace) to lower the computation complexity and enhance the signal-to-interference-plus-noise ratio (SINR). The SINR of the beamspace MVDR beamformer is compared with that of diagonally loaded MVDR. Analysis and simulation show that the beamspace MVDR has better performance when the number of data samples is small.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"10 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":"134107365","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}