{"title":"Performance tradeoffs in digit-serial DSP systems","authors":"H. Suzuki, Yun-Nan Chang, K. Parhi","doi":"10.1109/ACSSC.1998.751522","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.751522","url":null,"abstract":"This paper addresses performance tradeoffs in digit-serial arithmetic architectures for design of dedicated and programmable DSP systems. The advantages and the disadvantages of the digit-serial approach over the bit-parallel approach are discussed in terms of area, latency and power consumption. The addition and the multiplication are chosen for comparison. Digit-serial adders have a significant area advantage over bit-parallel adders. Digit-serial multipliers, however, have less area advantage due to the large number of feedback registers. In addition, critical paths of digit-serial multipliers cannot be reduced significantly compared to low-latency bit-parallel multipliers such as the Wallace tree multiplier. Quantitative performance tradeoffs in design of both programmable and dedicated DSP systems are considered. It is shown that the digit-serial arithmetic is not suitable for programmable DSPs. However, dedicated DSPs can be successfully implemented with the digit-serial arithmetic in limited silicon area.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128255194","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":"Continuous wavelet transform application to EMG signals during human gait","authors":"A. R. Ismail, S. Asfour","doi":"10.1109/ACSSC.1998.750880","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.750880","url":null,"abstract":"EMG signals are important in quantifying deviations from normal gait. Traditionally, Fourier transforms were utilized in determining the frequency spectrum of the typically non-stationary EMG signals. The continuous wavelet transform, suggested in this paper, is more appropriate. In this study, signals from four muscles of the right lower extremity were recorded, for eight normal subjects, during steady-state gait. The time-frequency distributions of these signals were computed using the fourth order Daubechies mother wavelet. Wavelet-based time-frequency representations were useful in identifying the recruitment patterns of slow and fast fibers to meet the varying demands imposed on the muscles during different phases of the gait cycle.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125510769","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 power detection using stochastic resonance","authors":"M. Nafie, A. Tewfik","doi":"10.1109/ACSSC.1998.751569","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.751569","url":null,"abstract":"Mobile communications dictates the use of low power detection and estimation algorithms to prolong the battery life. We present a very low power detection scheme and evaluate its performance. This scheme can be used instead of the optimal quantized detectors when the noise variance, or other problem parameters, are unknown or change online. This detector uses an adaptive discrete time stochastic resonator that consists of a simple Schmitt trigger. Theoretical results evaluating the detection capability of such a device are presented, and simulations show an improvement in the detection probability over other low power schemes.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132467453","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 M-hypotheses detection: M vectors case","authors":"M. Nafie, A. Tewfik","doi":"10.1109/ACSSC.1998.750960","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.750960","url":null,"abstract":"Low complexity algorithms are essential in many applications which require low power implementation. We present a low complexity technique for solving M-hypotheses detection problems, that involve vector observations. This technique works in these cases where the number of vectors is equal to or smaller than the dimensionality of the vectors. It attempts to optimally trade off complexity with probability of error through solving the problem in a lower dimension.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123702833","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":"Systolic VLSI architectures for 1-D discrete wavelet transforms","authors":"T. C. Denk, K. Parhi","doi":"10.1109/ACSSC.1998.751521","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.751521","url":null,"abstract":"This paper presents systolic VLSI architectures for the discrete wavelet transform (DWT) and inverse discrete wavelet transform (IDWT) which operate on one-dimensional signals. Previously, a dependence graph (DG) of the DWT has been presented which enables systolic mapping techniques to be used to derive DWT architectures. We use this DG to systematically derive new DWT architectures. In addition, we present a DG for the IDWT and use it to systematically derive new IDWT architectures. The resulting DWT and IDWT architectures are scalable with filter length and number of octaves, modular, have high hardware utilization, and use fixed-coefficient multipliers. These properties make them well-suited for VLSI implementation.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128869320","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":"Turbo multiuser detection","authors":"Xiaodong Wang, H. Poor","doi":"10.1109/ACSSC.1998.750940","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.750940","url":null,"abstract":"An iterative receiver structure is proposed for decoding multiuser information data in a convolutionally coded DS-CDMA system. The receiver performs two successive soft-output decisions, achieved by a soft-input soft-output (SISO) multiuser detector and a bank of single-user SISO channel decoders, through an iterative process. At each iteration, extrinsic information is extracted from detection and decoding stages and is then used as a priori information an the next iteration, just as in turbo decoding. A low-complexity SISO multiuser detector is developed based on a novel nonlinear interference suppression technique, which makes use of both soft-interference cancellation. And instantaneous linear MMSE filtering. Simulation results demonstrate that the proposed receiver offers significant performance gain over the traditional non-iterative receiver structure. Moreover, at high signal-to-noise ratio (SNR), single-user performance can be approached by iterative processing.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114189808","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":"Computationally efficient iterative multiuser detection and decoding","authors":"S. Das, E. Erkip, B. Aazhang","doi":"10.1109/ACSSC.1998.750939","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.750939","url":null,"abstract":"We describe an iterative detection and decoding scheme for the uplink in a convolutionally coded direct sequence code division multiple access (DS-CDMA) system. We consider maximum-a-posteriori (MAP) decoding and reduce the complexity through an iterative interference cancelation scheme combined with a suboptimal channel decoding algorithm. The MAP priors are updated at every iteration step. We investigate the performance of this low complexity scheme and observe that it is close to optimal.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122696364","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":"Joint source channel coding of images over frequency selective fading channels with feedback using DCT and multicarrier block pulse amplitude modulation","authors":"V. Kafedziski","doi":"10.1109/ACSSC.1998.750824","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.750824","url":null,"abstract":"A novel approach to joint source channel coding over frequency selective fading channels with feedback using source decomposition and multicarrier block pulse amplitude modulation is proposed. A set of representative frequency responses for a slowly varying frequency selective channel, corresponding to channel states, is mean square error sense. The amount of source information transmitted per channel symbol frame depends on the channel conditions: during favorable conditions, twice as much information is transmitted; during deep fades, no information is transmitted. We design linear encoders and decoders for each of the states, using multicarrier block pulse amplitude modulation. Our approach results in graceful degradation of the decoded signal and good performance in the low SNR region. Simulation results are presented for the \"Lena\" image and compared to the OPTA bound.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115233103","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":"Motion vector re-estimation and dynamic frame-skipping for video transcoding","authors":"Jenq-Neng Hwang, Tzong-Der Wu","doi":"10.1109/ACSSC.1998.751597","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.751597","url":null,"abstract":"This paper investigates the dynamic frame-skipping strategy in video transcoding. To speed up the operation, a video transcoder usually reuses the decoded motion vectors to reencode the video sequences at a lower bit-rate. When frame-skipping is allowed in a transcoder, those motion vectors can not be reused because the motion vectors of the current frame is no longer estimated from the immediate past frame. To reduce the computational complexity of motion vectors re-estimation, a bilinear interpolation approach is developed to overcome this problem. Based on these interpolated motion vectors, the search range can be much reduced. Furthermore, we propose a frame rate control scheme which can dynamically adjust the number of skipped frames according to the accumulated magnitude of motion vectors. As a result, the decoded sequence can present much smoother motion.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115280565","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":"Optimal multistage interference cancellation for CDMA systems using the nonlinear MMSE criterion","authors":"S. Gollamudi, S. Nagaraj, Y. Huang, R. Buehrer","doi":"10.1109/ACSSC.1998.750946","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.750946","url":null,"abstract":"This paper proposes an optimal multistage interference cancellation scheme for a multiuser DS/CDMA system with linear or nonlinear modulation. The proposed canceler is optimal in terms of minimizing the energy of the difference between true and reconstructed interference due to each user. Solutions for the special cases of BPSK and M-ary orthogonal modulation are derived using the general solution and efficient architectures are proposed for implementation. A novel blind channel estimation strategy based on an adaptive filtering approach that yields unbiased channel estimates and low estimation variance is also proposed. Simulation results indicate that the proposed scheme achieves substantial capacity gains with very little additional computational complexity compared to the conventional multistage canceler.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116916044","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}