{"title":"Low voltage switched-current /spl Sigma//spl Delta/ analog-to-digital converters modelling based on VHDL-AMS","authors":"P. Sniatala, K. Hsu, B. Woz","doi":"10.1109/ACSSC.2002.1196942","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1196942","url":null,"abstract":"The purpose of this paper is to provide accurate and fast models to design and simulate complex switched current (SI) circuits. SI circuits can be manufactured using deep submicron CMOS technology, hence they are suitable for mixed analog-digital systems. As a mixed signal design, it makes them very difficult to simulate. With the VHDL-AMS models presented in this paper, we were able to design a low-power A/D converter based on a EA modulator. This system was designed with a Hewlett-Packard low-voltage, 0.5 /spl mu/m, digital CMOS technology. Obtained results proved the correctness of our models. The system works with a 2.5V power supply.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"68 4 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":"125380391","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":"Design of optimum multi-dimensional energy compaction filters","authors":"Niranjan Damera-Venkata, J. Tuqan, B. Evans","doi":"10.1109/ACSSC.2002.1197205","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197205","url":null,"abstract":"We discuss the design of optimum signal-adapted multi-dimensional energy compaction filters. As in the one-dimensional (1-D) case, the energy compaction problem is linear in the auto-correlation coefficients of the compaction filter, which must also satisfy the multi-dimensional (m-D) equivalent of the Nyquist-(M) condition. If a minimum-phase spectral factor exists the optimum compaction filter is recovered using the m-D Discrete Hilbert Transform (DHT). If a minimum phase spectral factor does not exist, an iterative algorithm based on multi-objective goal attainment is proposed. The Nyquist-M condition is enforced while simultaneously forcing the autocorrelation coefficients of the compaction filter to be as close as possible to the coefficients of the product filter and the compaction gain of the optimum compaction filter to be close to the compaction gain produced by using the optimum product filter.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"11 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":"115196183","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":"Hybrid EMODL Ling addition","authors":"J. Grad, J. Stine","doi":"10.1109/ACSSC.2002.1197052","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197052","url":null,"abstract":"Carry-lookahead adders have traditionally demonstrated that they are among the fastest adders available. By computing carry signals in parallel as much as possible the propagation delay of this type of adder is significantly reduced as opposed to carry propagation adders. Further algorithmic advancements have been proposed by Ling to use pseudo-carries, which are even faster to compute. For CMOS dynamic logic the EMODL adder has demonstrated that a 32-bit adder can be constructed with only 3 stages of logic and an unprecedented small hardware complexity. This paper presents a novel hybrid adder. By introducing Ling's algorithm into the EMODL adder, the critical path can be shortened with only a slight increase in hardware complexity.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"606 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":"116074345","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 fractionally-sampling based frequency offset enhanced blind estimator for non-circular transmissions","authors":"P. Ciblat, E. Serpedin, Yan Wang","doi":"10.1109/ACSSC.2002.1197263","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197263","url":null,"abstract":"This paper deals with the problem of non-data-aided carrier frequency offset estimation of non-circular modulations transmitted through unknown frequency-selective channels. By exploiting the unconjugated cyclostationary statistics induced by oversampling the received waveform, an optimized carrier frequency offset estimator is proposed and its asymptotic (large sample) performance analyzed. In order for the proposed frequency estimator to achieve the minimum mean-square estimation error, it is shown that the oversampling rate need not be larger than twice the symbol rate. It is also shown that the proposed synchronizer is asymptotically jitter-free, admits a feedforward structure that may be implemented in digital form and is suitable for burst transmissions.","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":"116143899","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 identification of discrete symmetric planar shapes from a single view","authors":"O. Poliannikov, H. Krim","doi":"10.1109/ACSSC.2002.1197227","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197227","url":null,"abstract":"In this paper, we consider a problem of identifying a discrete symmetric shape from a single view. For the proposed class of objects, we derive their representation in terms of their \"skeletons\", which in turn yield invariants readily computable from any single image. In addition, the representation is almost optimal in the sense that it captures virtually all geometric information contained in the image. Further, we consider the case of a noisy image, i.e. when the points defining a shape are known up to an additive Gaussian noise. We derive the distribution for the noisy \"skeleton\" points and propose an optimal technique to estimate the true \"skeleton\" and thus identify the true shape.","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":"122372618","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":"Achievable uniform rates for ad hoc networks","authors":"O. Oteri, A. Goldsmith","doi":"10.1109/ACSSC.2002.1196967","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1196967","url":null,"abstract":"Ad hoc networks are self-organizing wireless networks without any centralized control. A fundamental property of such networks is the achievable rate per node under uniform traffic conditions. It has been shown by Gupta et. al. that for ad hoc networks without mobility, the throughput per node decreases exponentially as the number of nodes (n) increases without bound. We simulate the communication scheme proposed to achieve this rate, model the rate as K/((n log n)/sup m/) and find K and m for finite n. The behavior of the function is studied for different path-loss exponents and for different routing strategies.","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":"122998844","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":"Analysis of equalizer-based baud-spaced timing recovery for digital subscriber line systems","authors":"S. Haar, D. Daecke, R. Zukunft, F. Vogelbruch","doi":"10.1109/ACSSC.2002.1197215","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197215","url":null,"abstract":"This paper presents an analysis of symbol-spaced timing recovery algorithms which are based on the equalizer precursor tap weights of the equalizer. These algorithms break the coupling of conventional adaptive decision-directed timing recovery (based e.g. on the well known M&M algorithm) and the adaptive equalizer in the tracking mode, once acquisition has been reached. The performance and key characteristics of a precursor tap weight based timing recovery algorithm are evaluated exemplarily for a very high bit-rate digital subscriber line (VDSL) application and compared to conventional M&M timing recovery, dependent on the step size of the equalizer LMS adaptation algorithm of the equalizer and the parameters of the timing loop filter.","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":"117103273","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 the design of optimal spreading sequences for CDMA systems","authors":"T. Strohmer, R. Heath, A. Paulraj","doi":"10.1109/ACSSC.2002.1197016","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197016","url":null,"abstract":"Signatures constructed from Welch bound equality sequences have been shown to be optimal in terms of sum capacity in synchronous CDMA systems. Unfortunately, these codebooks are a function of the number of active signatures and need to be reassigned as the number of active users changes to maintain optimality. We describe and analyze two subclasses of Welch bound equality sequences from a theoretical and practical viewpoint. We show that maximum Welch bound equality sequences are equiangular and thus each active interferer experiences the same amount of interference. We show that codebooks constructed by concatenating multiple orthonormal bases come closer to the Welch bound when not all signatures are active. Discussions and illustrations for both constructions are presented.","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":"128545492","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}
Jianzhong Zhang, H. Berg, A. Sayeed, B. V. Van Veen
{"title":"Reduced-state MIMO sequence estimation for EDGE systems","authors":"Jianzhong Zhang, H. Berg, A. Sayeed, B. V. Van Veen","doi":"10.1109/ACSSC.2002.1197240","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197240","url":null,"abstract":"In this paper, we propose a joint reduced-state sequence estimator (JRSSE) for a multiple input multiple output (MIMO) system. The proposed JRSSE incorporates the set-partitioning principle to obtain a reduced-state trellis and is the space-time extension of the RSSE proposed earlier for a single input, single output (SISO) temporal equalization problem. We show that two elements are essential in achieving the desired complexity and performance tradeoff for the proposed JRSSE algorithm: a proper multi-symbol set-partition and an efficient space-time structure that effectively decouples the spatial and temporal processing. Numerical simulations show that the performance of JRSSE is near to that of the more complex delayed decision feedback sequence estimator (DDFSE).","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":"128804116","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-complexity detection of OFDM in doubly-dispersive channels","authors":"P. Schniter, S. D'Silva","doi":"10.1109/ACSSC.2002.1197084","DOIUrl":"https://doi.org/10.1109/ACSSC.2002.1197084","url":null,"abstract":"When OFDM systems with large block length are used in fast-fading multipath channels, the channel may induce significant intercarrier interference (ICI). As a result, the standard ML, MMSE and ZF detectors become prohibitively complex. In response, we propose a computationally-efficient decision-feedback detection strategy based on optimal windowing and linear MMSE estimation. Simulation results indicate good performance relative to the standard MMSE detector but with significant computational savings.","PeriodicalId":284950,"journal":{"name":"Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002.","volume":"32 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":"124606031","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}