{"title":"Performance of a fixed delay decoding scheme for tail biting convolutional codes","authors":"Wonjin Sung, In-Kyung Kim","doi":"10.1109/ACSSC.1996.601139","DOIUrl":"https://doi.org/10.1109/ACSSC.1996.601139","url":null,"abstract":"A fixed delay decoding scheme for tail biting convolutional codes is described and its performance is investigated. Unlike other proposed algorithms that have iterative structures, the scheme requires a fixed number of computations and is suitable for practical DSP implementations. An analytic bound on the error probability is derived to indicate the decoding complexity and performance trade-off, and to provide criteria to determine the decoding parameters. It is shown that for the rate 1/4 tail biting convolutional code used in IS-54/IS-136 digital cellular standard, the bit error rate of the decoding scheme has negligible degradation from the maximum likelihood performance while the decoding complexity is less than twice the complexity of a single Viterbi algorithm trial.","PeriodicalId":270729,"journal":{"name":"Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126925336","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":"Cross term deleted Wigner representation-noise tolerance analysis","authors":"S. Kadambe, M. J. Lyall, R. Orr","doi":"10.1109/ACSSC.1996.600866","DOIUrl":"https://doi.org/10.1109/ACSSC.1996.600866","url":null,"abstract":"The effect of noise on cross term deleted Wigner representation (CDWR) is analyzed. The mean and variance of the CDWR of a deterministic signal contaminated by white Gaussian noise are derived. Based on these derivations, it has been shown that the effect of noise on the CDWR can be minimized if a minimum energy constraint is applied on the biorthogonal analysis window. The theoretical findings are corroborated by experimental results.","PeriodicalId":270729,"journal":{"name":"Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121592506","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 antenna arrays with fading signals","authors":"A. Weiss, B. Friedlander","doi":"10.1109/ACSSC.1996.600818","DOIUrl":"https://doi.org/10.1109/ACSSC.1996.600818","url":null,"abstract":"We study the effect of fading on estimating the antenna array response, and subsequently separating and estimating the unknown data streams. The results are presented in the form of output signal to interference ratio (SIR) and output signal to noise ratio (SNR). We obtain closed form expressions for the average output SNR and SIR for Rayleigh, Rician and Nagakami fading. It is shown that in the presence of slowly fading channels, the diversity advantage of the array decreases as the number of signals increases.","PeriodicalId":270729,"journal":{"name":"Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121695818","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 weight vectors for broadcast channels","authors":"M. Torlak, Guanghan Xu, B. Evans, Hui Liu","doi":"10.1109/ACSSC.1996.600820","DOIUrl":"https://doi.org/10.1109/ACSSC.1996.600820","url":null,"abstract":"In a multi-transmitter broadcast system, the weight vector for each message signal can provide an additional degree-of-freedom for signal enhancement and interference suppression by taking advantage of the spatial diversity among the users. To date, the design of the optimal weight vectors which maximize the overall channel capacity is still an open problem. The main reason is attributed to the fact that under certain power constraints, the channel capacity R is a highly nonlinear function of the M-dimensional weight vectors {w/sub i/}, where M is the number of transmitters. Therefore, the maximization of R over {w/sub i/} does not seem to be tractable to simple mathematic treatment. In this paper, we present our studies on designing optimal weight vectors for a two-user, multi-transmitter broadcast channel. Our primary contribution is to decouple the weight vectors in R which simplifies the optimization problem to a search for the maxima of a smooth two-dimensional function.","PeriodicalId":270729,"journal":{"name":"Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123058816","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 new approach to formant estimation and modification based on pole interaction","authors":"Yung-Sheng Hsiao, D. Childers","doi":"10.1109/ACSSC.1996.601162","DOIUrl":"https://doi.org/10.1109/ACSSC.1996.601162","url":null,"abstract":"In an LP model of speech, a speech formant is characterized by a pole frequency and its bandwidth. The conventional root-finding formant estimation algorithm derives the formant poles from the LP polynomial (coefficients) by selecting appropriate roots to simulate the formant resonances. However, the resulting formant polynomial suffers from the problem of spectral deviation since one or more \"spurious\" roots are deleted from the original LP polynomial. The main problem is pole interaction. We propose a new algorithm that characterizes speech formants by formant frequencies, as well as formant spectral densities, while formant bandwidths are modified to reduce the degradation of pole interaction. This approach is also applied to derive a formant modification algorithm that makes it possible to change the formant frequency while maintaining the desired formant structure. The experimental results show that the formant polynomial obtained by the proposed algorithm produces a more reliable formant spectrum than one that does not consider the pole interaction effect.","PeriodicalId":270729,"journal":{"name":"Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers","volume":"183 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123292140","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 new approach for design of paraunitary filter banks with linear phase","authors":"T. Nagai, M. Ikehara","doi":"10.1109/ACSSC.1996.599163","DOIUrl":"https://doi.org/10.1109/ACSSC.1996.599163","url":null,"abstract":"In this paper we propose a novel way to design nonparaunitary and paraunitary filter banks so that each individual filter has linear phase. M channel filter banks, which have perfect reconstruction (PR) and linear phase (LP) properties, have been well studied and some design methods were reported. Since almost these methods are based on lattice structures whose sections consist of an orthogonal matrix, the design requires nonlinear programming techniques. Here, we consider a design method which requires only to solve linear equations iteratively. In our proposed method, we minimize the least square error of PR constraints so as to get around using nonlinear programming. We first observe the minimization problem of a quadratic function with two variables. Next, we apply it to the design of nonparaunitary filter banks. Then, we show that this method is applicable to the paraunitary filter banks design with some modification. Several design examples are given to validate our proposed methods.","PeriodicalId":270729,"journal":{"name":"Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers","volume":"293 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131623288","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 compound near-far end least square-fourth error minimization for adaptive echo cancellation","authors":"A. Zerguine, C. Cowan, M. Bettayeb","doi":"10.1109/ACSSC.1996.599133","DOIUrl":"https://doi.org/10.1109/ACSSC.1996.599133","url":null,"abstract":"This article presents a novel algorithm for echo cancellers with near-end and far-end sections. The algorithm consists of simultaneously applying the least mean square (LMS) algorithm to the near-end section of the echo canceller and the least mean fourth (LMF) algorithm to the far-end section. This combination results in a substantial improvement of the performance of the proposed scheme over the LMS algorithm in Gaussian and non-Gaussian environments (additive noise). However, the application of the LMF and the LMS algorithms to the near-end and the far-end sections, respectively, results in a poor performance. Simulation results, confirm the superior performance of the new algorithm.","PeriodicalId":270729,"journal":{"name":"Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130436705","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 novel systolic design for fast computation of the discrete Hartley transform","authors":"Chin-Liang Wang, Chen-Tsai Ho, Yu-Tai Chang","doi":"10.1109/ACSSC.1996.599107","DOIUrl":"https://doi.org/10.1109/ACSSC.1996.599107","url":null,"abstract":"The discrete Hartley transform (DHT), first introduced by Bracewell (1983), has been emerging as a new tool for the analysis, design, and implementation of digital signal processing algorithms and systems. This paper presents a novel systolic array with log/sub 2/N multipliers and 3log/sub 2/N adders for computing the N-point DHT, where N is a power of two. The architecture reaches a throughput of one complete N-point transform per N clock cycles, i.e., one transform sample per clock cycle. It possesses the features of regularity and modularity, and is thus well suited to VLSI implementation. Compared to existing related systolic/regular designs, the proposed one gains improvements in area-time complexity.","PeriodicalId":270729,"journal":{"name":"Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123359811","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":"3-D segmentation-based video processing","authors":"G.K. Wu, T. Reed","doi":"10.1109/ACSSC.1996.600841","DOIUrl":"https://doi.org/10.1109/ACSSC.1996.600841","url":null,"abstract":"In this paper we investigate the improvements that can be obtained in several conventional video processing algorithms through the incorporation of 3-D (spatiotemporal) segmentation information. Segmentation-aided lowpass filtering, highpass filtering, high frequency emphasis and edge enhancement are described. It is demonstrated that segmentation information can improve the performance of these techniques substantially so that this approach may be promising for other applications (e.g. deinterlacing and resolution conversion) as well.","PeriodicalId":270729,"journal":{"name":"Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130212414","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 matched subspace detectors and adaptive coherence estimators","authors":"L. Scharf, L. T. McWhorter","doi":"10.1109/ACSSC.1996.599116","DOIUrl":"https://doi.org/10.1109/ACSSC.1996.599116","url":null,"abstract":"We adapt the matched subspace detectors (MSDs) of Scharf (1991) and Scharf and Friedlander (see IEEE Trans. Signal Proc., vol.42, no.8. p.2146-57, 1994) to unknown noise covariance matrices in order to produce adaptive MSDs that may be applied to signal detection in radar, sonar, mobile communication, and DOA estimation. A special case of the adaptive MSD uses the Reed (1974) ratio statistic and a special cease of the adaptive CFAR MSD uses an adaptive coherence estimator (ACE). We compare and contrast the invariances and performance of the two detectors and discuss extensions of them that make them maximum likelihood MSDs.","PeriodicalId":270729,"journal":{"name":"Conference Record of The Thirtieth Asilomar Conference on Signals, Systems and Computers","volume":"32 30_suppl 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128387957","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}