{"title":"MPEG-2 video decoding on the TMS320C6X DSP architecture","authors":"S. Sriram, C. Hung","doi":"10.1109/ACSSC.1998.751622","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.751622","url":null,"abstract":"This paper explores implementation of MPEG-2 decoding functions (bitstream parsing, IDCT: variable length decoding, motion compensation, dequantization) in software on the TI TMS320C6X architecture. We discuss cycle count estimates for these functions; our estimates are based on optimized, functionally accurate implementations in some cases, and on analysis of C implementations of the function in other cases. We describe how we arrive at these estimates in detail, and discuss how we were able to use automatic compilation effectively for certain functions. We also compare the C6x implementation to other MPEG-2 implementations that have been reported for general purpose CPUs that support a multimedia enhanced instruction set, such as Intel Pentium (MMX), SUN UltraSPARC (VIS), and HP PA (MAX).","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"86 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":"123327875","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":"JPEG-2000: a new still image compression standard","authors":"O. Al-Shaykh, I. Moccagatta, Homer H. Chen","doi":"10.1109/ACSSC.1998.750835","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.750835","url":null,"abstract":"This paper describes the status and directions of the emerging ISO/IEC JPEG-2000 image compression coding standard. This new work item of the Joint Photographic Expert Group (JPEG) 2000 is intended to create a unified coding standard for different types of still images (bilevel, gray-level, color) with different characteristics (natural, medical, remote sensing, text). The paper presents an overview of the various aspects of JPEG-2000 and highlights new functionalities supported by this emerging standard and its potential applications. Experimental results are shown to illustrate its performance.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"25 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":"123351269","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":"Image transmission over channels with bit errors and packet erasures","authors":"P. Cosman, J. K. Rogers, P. G. Sherwood, K. Zeger","doi":"10.1109/ACSSC.1998.751600","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.751600","url":null,"abstract":"We consider a hybrid mixture of an image coder for bit error channels and an image coder for packet erasure channels. The first scheme uses rate-compatible punctured convolutional (RCPC)/cyclic redundancy code (CRC) concatenated channel coding with embedded zerotree wavelet source coding, while the second technique groups trees of wavelet coefficients into fixed-length packets that provide robustness against packet erasures. We demonstrate that the hybrid image coder outperforms either of the two building block methods on certain channels that suffer both packet losses and statistically varying bit errors.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"3 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":"123727702","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":"Power efficient FIR folding transformation for wireline digital communications","authors":"A. Shalash, K. Parhi","doi":"10.1109/ACSSC.1998.751637","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.751637","url":null,"abstract":"A new algorithm is introduced for power efficient implementation of the folding algorithm transformation for the adaptive FIR filters. The algorithm is based on the known minimum spanning tree problem which is a modification of the traveling sales person NP-hard problem. A sub-optimal solution can be obtained leading to dramatic reduction in the folded architecture switching activities. The optimum ordering within the folding sets is done in the steady state condition of the filtering operation. For a typical word length, and for large enough folding factor, the projected reduction in switching activity can be as large as 60%. The hierarchical energy analysis too (HEAT) was used to simulate the effect of this reduction on a typical Baugh-Wooley (1973) multiplier and reduction in power consumption for a typical wireline equalization implementation was found to be between 25% and 60%. The new algorithm is based on a simple breadth first search approach and can be easily performed for one time only when the filter is geared to the steady state mode. Dramatic improvement in power consumption can be achieved with minimal overhead.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"61 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":"121686446","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":"Impact of switching constraints on selection diversity performance","authors":"J. Ritcey, M. Azizoglu","doi":"10.1109/ACSSC.1998.750970","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.750970","url":null,"abstract":"Selection diversity (SELDIV), in which the best of N channel outputs is selected, provides significant diversity gain for digital communications over fading channels. Classical SELDIV analysis assumes that the best channel is immediately selected, implying no constraint on the switching rate of the system. We obtain an exact result for the average BER, as a function of the time since the last switch. Our results assume BFSK modulation and Nakagami (1960) fading with an arbitrary correlation function, treating Rayleigh fading as a special case.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"135 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":"122037884","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":"Software radio implementation of carrier offset estimation for OFDM communications","authors":"U. Tureli, Hui Liu","doi":"10.1109/ACSSC.1998.750828","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.750828","url":null,"abstract":"The main objective of this paper is to describe the implementation of a robust and computationally inexpensive orthogonal frequency division multiplexing (OFDM) scheme on a fading channel. While channel-induced intersymbol interference can be eliminated by dividing the data stream into parallel bit sequences in OFDM communications, the loss of orthogonality due to the carrier frequency offset must be compensated before DFT-based demodulation can be performed. A new solution to the carrier offset estimation problem was developed without using reference symbols. The technique provides a high accuracy carrier estimate by taking advantage of the inherent orthogonality among OFDM subchannels. The authors show that this algorithm can be used to perform offset estimation and compensation in a practical system.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"52 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":"122102809","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":"MMD-ARMA approximation to the Volterra series expansion","authors":"Veit, Ulrich Appel","doi":"10.1109/ACSSC.1998.750867","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.750867","url":null,"abstract":"Nonlinear filtering based on the Volterra series expansion is a powerful universal tool in signal processing. Due to the problem of increased complexity for higher orders and filter lengths, approximations up to third order nonlinearities using linear FIR-filters and multipliers have been developed earlier called multimemory decomposition (MMD). In our paper we go a step further in this approach using ARMA-filters instead which leads to a reduction in the number of coefficients to about 50% for similar system functions. The good performance of this new approach is demonstrated by means of a processor designed for identification of nonlinear loudspeaker distortions.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"147 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":"122771650","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 approximation for adaptive multichannel radar filtering","authors":"A. Bojanczyk, W. Melvin, E. J. Holder","doi":"10.1109/ACSSC.1998.751585","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.751585","url":null,"abstract":"In this paper we consider a subspace approximation tailored to adaptive airborne radar. Motivation for this research includes the need for reduced computational burden and approaches for practical implementation. Measured radar data only approximately satisfies the statistical assumptions intrinsic to the adaptive processor. Hence, approximate numerical methods for adaptive weight computation may successfully be used in place of exact methods. We propose a numerical procedure based on partial bi-diagonalization of the interference covariance matrix, coupled with a preconditioned conjugate gradient iterative method, to approximate the dominant subspace and construct the adaptive weights. Through example, we show the potential of this method for adaptive radar.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"36 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":"124274249","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":"Discrete multiscale Bayesian image reconstruction","authors":"T. Frese, C. Bouman, K. Sauer","doi":"10.1109/ACSSC.1998.751613","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.751613","url":null,"abstract":"Statistical and discrete-valued methods can substantially improve the reconstruction quality by incorporating prior information about both the imaging system and the object being imaged. A statistical method shown to perform well in the tomographic setting is Bayesian MAP estimation. However, computing the MAP estimate in the tomographic domain is a computationally involved optimization problem. Furthermore, discrete-valued MAP reconstruction requires accurate knowledge of the density or emission levels in the cross-section. In this paper we present an efficient multiscale algorithm for discrete-valued MAP reconstruction including estimation of the discrete levels. Experimental results indicate that the multiscale algorithm has improved convergence behaviour over fixed scale reconstruction and is more robust with respect to local minima.","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-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126156230","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":"Manipulating rates, complexity and error-resilience with discrete transforms","authors":"V. K. Goyal, M. Vetterli","doi":"10.1109/ACSSC.1998.750905","DOIUrl":"https://doi.org/10.1109/ACSSC.1998.750905","url":null,"abstract":"The common conception of transform coding is a a computationally efficient alternative to vector quantization. At high rates, it is not the partitioning itself but the efficiency of the scalar entropy coding which makes transform coding useful. With this view a class of discrete transforms derived from linear transforms are used to pursue three objectives: reducing coefficient entropies (getting coding gain as in conventional transform coding), reducing the complexity of entropy coding (allowing many coefficients to be efficiently coded with identical entropy codes), and having robustness to coefficient erasures.","PeriodicalId":393743,"journal":{"name":"Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284)","volume":"67 5 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":"126018245","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}