Pub Date : 1996-09-01DOI: 10.1109/DSPWS.1996.555497
M. Vesterbacka, K. Palmkvist, L. Wanhammar
An approach to schedule lattice wave digital filters so that the maximal sample frequency is obtained is presented. In the approach, bit-serial arithmetic and a scheduling method that decouples the sample period from the scheduling period are used. A lower bound on the scheduling period required to arrive at the minimum sample period is given. Different latency models for the arithmetic operations, and their effect on the minimum sample period are discussed. The operation schedule is mapped to a hardware structure using isomorphic mapping. The throughput of the resulting implementations is comparable to corresponding bit-parallel implementations.
{"title":"Maximally fast, bit-serial lattice wave digital filters","authors":"M. Vesterbacka, K. Palmkvist, L. Wanhammar","doi":"10.1109/DSPWS.1996.555497","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555497","url":null,"abstract":"An approach to schedule lattice wave digital filters so that the maximal sample frequency is obtained is presented. In the approach, bit-serial arithmetic and a scheduling method that decouples the sample period from the scheduling period are used. A lower bound on the scheduling period required to arrive at the minimum sample period is given. Different latency models for the arithmetic operations, and their effect on the minimum sample period are discussed. The operation schedule is mapped to a hardware structure using isomorphic mapping. The throughput of the resulting implementations is comparable to corresponding bit-parallel implementations.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121035790","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}
Pub Date : 1996-09-01DOI: 10.1109/DSPWS.1996.555545
A. Bastys
The Shannon multiresolution analysis and two methods of its periodization are considered. The class of all shift-invariant multiperiodic analyses with complex-valued scaling functions is described. All weakly shift-invariant periodic analogues of the Shannon scaling function are found. Among them, two shift-invariant periodic analogues of the sine function are revealed. A wavelet packet transform that generalizes the discrete Fourier transformation is found. An application of the shift-invariant periodic wavelet packet bases for time-frequency analysis of speech signals is discussed and illustrated.
{"title":"Periodic shift-invariant multiresolution analysis","authors":"A. Bastys","doi":"10.1109/DSPWS.1996.555545","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555545","url":null,"abstract":"The Shannon multiresolution analysis and two methods of its periodization are considered. The class of all shift-invariant multiperiodic analyses with complex-valued scaling functions is described. All weakly shift-invariant periodic analogues of the Shannon scaling function are found. Among them, two shift-invariant periodic analogues of the sine function are revealed. A wavelet packet transform that generalizes the discrete Fourier transformation is found. An application of the shift-invariant periodic wavelet packet bases for time-frequency analysis of speech signals is discussed and illustrated.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123719971","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}
Pub Date : 1996-09-01DOI: 10.1109/DSPWS.1996.555525
B. Upshaw
Due to the very low signal levels (/spl mu/V) and the significantly higher levels of interference from adjacent muscles (and other noise sources), the overall signal-to-noise ratios (SNRs) of human nerve signals recorded from whole-cuff electrodes is very poor. Typically, non-real-time methods (ensemble averaging) are used to contend with these poor SNRs. However, if these signals are to be useful in providing real-time information (in a closed-loop control system), other methods must be employed to this end, subspace analysis methods using the eigenvalues of the autocorrelation (a 2/sup nd/ order statistic) and cumulant (a 3/sup rd/ order statistic) matrices of time-series samples were evaluated.
{"title":"SVD and higher-order statistics applied in the detection of human nerve signal activity","authors":"B. Upshaw","doi":"10.1109/DSPWS.1996.555525","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555525","url":null,"abstract":"Due to the very low signal levels (/spl mu/V) and the significantly higher levels of interference from adjacent muscles (and other noise sources), the overall signal-to-noise ratios (SNRs) of human nerve signals recorded from whole-cuff electrodes is very poor. Typically, non-real-time methods (ensemble averaging) are used to contend with these poor SNRs. However, if these signals are to be useful in providing real-time information (in a closed-loop control system), other methods must be employed to this end, subspace analysis methods using the eigenvalues of the autocorrelation (a 2/sup nd/ order statistic) and cumulant (a 3/sup rd/ order statistic) matrices of time-series samples were evaluated.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126781453","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}
Pub Date : 1996-09-01DOI: 10.1109/DSPWS.1996.555508
Michael S. Lew, T. S. Huang
The information theoretic approach provides a foundation for determining new insights and solutions toward image modeling and analysis problems. The underlying principle is that a search through an image can be viewed as a reduction of the expected uncertainty in the classification of the image. Specifically, we propose using the Kullback (1959) relative information for the determination of the support which maximizes the feature class separation, which consequently should minimize the probability of misclassifications. The methods are applied to face detection and two view image matching using internationally available databases.
{"title":"Optimal supports for image matching","authors":"Michael S. Lew, T. S. Huang","doi":"10.1109/DSPWS.1996.555508","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555508","url":null,"abstract":"The information theoretic approach provides a foundation for determining new insights and solutions toward image modeling and analysis problems. The underlying principle is that a search through an image can be viewed as a reduction of the expected uncertainty in the classification of the image. Specifically, we propose using the Kullback (1959) relative information for the determination of the support which maximizes the feature class separation, which consequently should minimize the probability of misclassifications. The methods are applied to face detection and two view image matching using internationally available databases.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114561533","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}
Pub Date : 1996-09-01DOI: 10.1109/DSPWS.1996.555520
C. Chichereau, J. Lacoume, R. Blanpain, G. Dassot
In the context of electromagnetic surveillance, our aim is to detect a transient in a non-stationary Gaussian noise by a higher order statistic test. We prove that the higher order statistic detection test provides a very short delay detection and a good estimation of the transient arrival time. We develop the theoretical ground and use a new formalism (an extension of Gardner's (1988) work) that enables us to evaluate theoretically the response of higher order statistic test for detection. The theory is applied on a simple and typical example: the kurtosis. We then compare the theoretical results to simulation results.
{"title":"Short delay detection of a transient in additive Gaussian noise via higher order statistic test","authors":"C. Chichereau, J. Lacoume, R. Blanpain, G. Dassot","doi":"10.1109/DSPWS.1996.555520","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555520","url":null,"abstract":"In the context of electromagnetic surveillance, our aim is to detect a transient in a non-stationary Gaussian noise by a higher order statistic test. We prove that the higher order statistic detection test provides a very short delay detection and a good estimation of the transient arrival time. We develop the theoretical ground and use a new formalism (an extension of Gardner's (1988) work) that enables us to evaluate theoretically the response of higher order statistic test for detection. The theory is applied on a simple and typical example: the kurtosis. We then compare the theoretical results to simulation results.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130310371","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}
Pub Date : 1996-09-01DOI: 10.1109/DSPWS.1996.555487
H. Yasukawa
This paper describes the implementation of a speech quality enhancement system that achieves spectrum extrapolation of band limited signals. In telephone communication, spectrum based on aliasing processing is widely known. This paper proposes a new implementation using an adaptive method. This method introduces frequency domain adaptive digital filtering to broaden band limited signals into wide band signals. Implementation of the system and its performance are discussed.
{"title":"Adaptive filtering for broad band signal reconstruction using spectrum extrapolation","authors":"H. Yasukawa","doi":"10.1109/DSPWS.1996.555487","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555487","url":null,"abstract":"This paper describes the implementation of a speech quality enhancement system that achieves spectrum extrapolation of band limited signals. In telephone communication, spectrum based on aliasing processing is widely known. This paper proposes a new implementation using an adaptive method. This method introduces frequency domain adaptive digital filtering to broaden band limited signals into wide band signals. Implementation of the system and its performance are discussed.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123911963","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}
Pub Date : 1996-09-01DOI: 10.1109/DSPWS.1996.555521
Horng-Ming Chien, Chong-Yung Chi
Yang and Chi (se Proc. IEEE Seventh SP Workshop on Statistical Signal and Array Processing, Quebec City, Canada, p.231-34, 1994) proposed a family of 1-D criteria for estimating the phase of a 1-D nonminimum phase linear time-invariant (LTI) system with only non-Gaussian measurements corrupted by additive Gaussian noise. The phase of the LTI system is obtained through an iterative algorithm which processes the given measurements by an ARMA allpass model such that a single absolute Mth-order (M/spl ges/3) cumulant of the allpass model output is maximum. A family of 1-D and 2-D criteria, in which Yang and Chi's 1-D criteria are included, is proposed for phase estimation using a Fourier series based allpass model. The optimum allpass models for 1-D and 2-D LTI systems are obtained by a 1-D and a 2-D iterative algorithms, respectively. The paper concludes with some simulation results followed by some conclusions.
Yang和Chi (seproc . IEEE第七届统计信号和阵列处理研讨会，Quebec City, Canada, p.231- 34,1994)提出了一组一维非最小相位线性时不变(LTI)系统的相位估计准则，其中只有非高斯测量被加性高斯噪声破坏。LTI系统的相位通过一种迭代算法得到，该算法通过ARMA allpass模型处理给定的测量，使allpass模型输出的单个绝对M阶(M/spl ges/3)累积量最大。使用基于傅立叶级数的全通模型，提出了一组一维和二维准则，其中包括Yang和Chi的一维准则，用于相位估计。分别采用一维和二维迭代算法得到了一维和二维LTI系统的最优全通模型。最后给出了一些仿真结果，并得出了一些结论。
{"title":"Cumulant based phase estimation for 1-D and 2-D nonminimum phase systems by Fourier series based allpass model","authors":"Horng-Ming Chien, Chong-Yung Chi","doi":"10.1109/DSPWS.1996.555521","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555521","url":null,"abstract":"Yang and Chi (se Proc. IEEE Seventh SP Workshop on Statistical Signal and Array Processing, Quebec City, Canada, p.231-34, 1994) proposed a family of 1-D criteria for estimating the phase of a 1-D nonminimum phase linear time-invariant (LTI) system with only non-Gaussian measurements corrupted by additive Gaussian noise. The phase of the LTI system is obtained through an iterative algorithm which processes the given measurements by an ARMA allpass model such that a single absolute Mth-order (M/spl ges/3) cumulant of the allpass model output is maximum. A family of 1-D and 2-D criteria, in which Yang and Chi's 1-D criteria are included, is proposed for phase estimation using a Fourier series based allpass model. The optimum allpass models for 1-D and 2-D LTI systems are obtained by a 1-D and a 2-D iterative algorithms, respectively. The paper concludes with some simulation results followed by some conclusions.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114210604","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}
Pub Date : 1996-09-01DOI: 10.1109/DSPWS.1996.555559
D. Gesbert, P. Duhamel, S. Mayrargue
This article addresses the problem of recovering blindly a source which has been sent through a multipath environment in a wireless multichannel context. A possible approach, primarily based on a joint data/channel estimation strategy, is outlined. The single-input/multiple-output (SIMO) deconvolution problem is first considered in a purely deterministic context, based on the minimization of a bilinear least-squares cost function, where the parameters to be adjusted are the channel coefficients and the transmitted signal vector, regardless of the finite alphabet property. A similar-output matching philosophy is used to construct a blind adaptive multichannel equalization scheme, with decision-feedback. The simulations show the robustness of the algorithm with respect to problems like channel order estimation errors and lack of channel diversity.
{"title":"Blind least-squares approaches for joint data/channel estimation","authors":"D. Gesbert, P. Duhamel, S. Mayrargue","doi":"10.1109/DSPWS.1996.555559","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555559","url":null,"abstract":"This article addresses the problem of recovering blindly a source which has been sent through a multipath environment in a wireless multichannel context. A possible approach, primarily based on a joint data/channel estimation strategy, is outlined. The single-input/multiple-output (SIMO) deconvolution problem is first considered in a purely deterministic context, based on the minimization of a bilinear least-squares cost function, where the parameters to be adjusted are the channel coefficients and the transmitted signal vector, regardless of the finite alphabet property. A similar-output matching philosophy is used to construct a blind adaptive multichannel equalization scheme, with decision-feedback. The simulations show the robustness of the algorithm with respect to problems like channel order estimation errors and lack of channel diversity.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114821190","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}
Pub Date : 1996-09-01DOI: 10.1109/DSPWS.1996.555492
L. Franchina
This paper presents the design of the access unit (AU) of the transceiver of a wireless RTLAN based on a controlled access protocol called TPCF (two phases collision free) and on spread spectrum transmission techniques. The AU implements the protocol instructions and a DSSS (direct sequence spread spectrum) co-decodifier. The baseband part is realized by a DSP (AD21010), a clock recovery circuit and an interface circuit that manages the transmission between DSP and host.
{"title":"A real-time wireless LAN access unit based on a DSP architecture","authors":"L. Franchina","doi":"10.1109/DSPWS.1996.555492","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555492","url":null,"abstract":"This paper presents the design of the access unit (AU) of the transceiver of a wireless RTLAN based on a controlled access protocol called TPCF (two phases collision free) and on spread spectrum transmission techniques. The AU implements the protocol instructions and a DSSS (direct sequence spread spectrum) co-decodifier. The baseband part is realized by a DSP (AD21010), a clock recovery circuit and an interface circuit that manages the transmission between DSP and host.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126531324","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}
Pub Date : 1996-09-01DOI: 10.1109/DSPWS.1996.555517
K. Yuasa, H. Sawai, M. Yoneyama
In order to estimate the image restoration capability of discrete type Hopfield neural network having an associative memory effect, some simulation experiments were performed. The memorized patterns to the network are binary dot alphabet capital characters consisting of 10/spl times/10 pixels. On the other hand, artificially degraded binary dot patterns of those original characters are used as the input patterns for the neural network to recall the original characters. As a result, the rate of success to recall the correct pattern is strongly related to both degradation degree of input patterns and number of patterns previously memorized in the network.
{"title":"Restoration of degraded character dot image using discrete Hopfield neural network","authors":"K. Yuasa, H. Sawai, M. Yoneyama","doi":"10.1109/DSPWS.1996.555517","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555517","url":null,"abstract":"In order to estimate the image restoration capability of discrete type Hopfield neural network having an associative memory effect, some simulation experiments were performed. The memorized patterns to the network are binary dot alphabet capital characters consisting of 10/spl times/10 pixels. On the other hand, artificially degraded binary dot patterns of those original characters are used as the input patterns for the neural network to recall the original characters. As a result, the rate of success to recall the correct pattern is strongly related to both degradation degree of input patterns and number of patterns previously memorized in the network.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128142707","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：