Pub Date : 1996-09-01DOI: 10.1109/DSPWS.1996.555522
R. Jennane, R. Harba, G. Jacquet
The article compares the quality of synthesis and analysis methods for fractional Brownian motion (fBm). Three conditions are necessary and sufficient for a process to be fBm. This allows one to check the correspondence between a given synthesis method and the fBm model. Two synthesis methods among 6 tested give good results. Reference signals obtained by these 2 methods are used to evaluate 8 analysis methods. Three estimators have a low bias and a variance close to the Cramer-Rao lower bound.
{"title":"Quality of synthesis and analysis methods for fractional Brownian motion","authors":"R. Jennane, R. Harba, G. Jacquet","doi":"10.1109/DSPWS.1996.555522","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555522","url":null,"abstract":"The article compares the quality of synthesis and analysis methods for fractional Brownian motion (fBm). Three conditions are necessary and sufficient for a process to be fBm. This allows one to check the correspondence between a given synthesis method and the fBm model. Two synthesis methods among 6 tested give good results. Reference signals obtained by these 2 methods are used to evaluate 8 analysis methods. Three estimators have a low bias and a variance close to the Cramer-Rao lower bound.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"13 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":"131148076","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.555536
V. Lukin, T. Saramaki
Step-like weighting windows are proposed for various applications in digital signal processing. Their parameters are optimized to minimize either the maximal sidelobe level of the corresponding frequency response (equidistant array pattern) or the ratio of the energies concentrated in the sidelobes and in the mainlobe. These parameters together with the mainlobe width are compared to the corresponding values of the optimal Dolph-Chebyshev and Kaiser-Bessel responses. Several advantages provided by the step-like window implementation are considered.
{"title":"Step-like weighting windows for DSP in spectral analysis and antenna arrays","authors":"V. Lukin, T. Saramaki","doi":"10.1109/DSPWS.1996.555536","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555536","url":null,"abstract":"Step-like weighting windows are proposed for various applications in digital signal processing. Their parameters are optimized to minimize either the maximal sidelobe level of the corresponding frequency response (equidistant array pattern) or the ratio of the energies concentrated in the sidelobes and in the mainlobe. These parameters together with the mainlobe width are compared to the corresponding values of the optimal Dolph-Chebyshev and Kaiser-Bessel responses. Several advantages provided by the step-like window implementation are considered.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"42 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":"132114946","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.555475
G. Saulnier, V.A. Alanzo Whyte, M. Medley
A system that uses orthogonal frequency division multiplexing (OFDM) as a spread spectrum modulation is introduced and its performance is evaluated in the presence of tone interference. Interference excision, in which some of the transform bins are removed in the detection process, is used in the receiver. The BER performance obtained using a number of block transforms is compared to that obtained using the modulated lapped transform (MLT) and it is shown that the MLT provides much better performance due to its ability to confine the interference energy to a few transform bins.
{"title":"An OFDM spread spectrum system using lapped transforms and partial band interference suppression","authors":"G. Saulnier, V.A. Alanzo Whyte, M. Medley","doi":"10.1109/DSPWS.1996.555475","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555475","url":null,"abstract":"A system that uses orthogonal frequency division multiplexing (OFDM) as a spread spectrum modulation is introduced and its performance is evaluated in the presence of tone interference. Interference excision, in which some of the transform bins are removed in the detection process, is used in the receiver. The BER performance obtained using a number of block transforms is compared to that obtained using the modulated lapped transform (MLT) and it is shown that the MLT provides much better performance due to its ability to confine the interference energy to a few transform bins.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"558 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114057822","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.555493
J. Kneip, P. Pirsch
A memory efficient implementation of the generalized Hough transform for line detection is presented. By using list based processing instead of a direct transform into Hough space and histogramming as the final evaluation step, a reduction of the required memory size by a factor greater than 5 is achieved for standard image parameters. Because the accessed data structures are fairly small and a high spatial locality is achieved, the implementation is especially suited for DSPs with on-chip caches. The scalar and parallel implementation of the list based transform is shown and performance results based on simulations are presented.
{"title":"Memory efficient list based Hough transform for programmable digital signal processors with on-chip caches","authors":"J. Kneip, P. Pirsch","doi":"10.1109/DSPWS.1996.555493","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555493","url":null,"abstract":"A memory efficient implementation of the generalized Hough transform for line detection is presented. By using list based processing instead of a direct transform into Hough space and histogramming as the final evaluation step, a reduction of the required memory size by a factor greater than 5 is achieved for standard image parameters. Because the accessed data structures are fairly small and a high spatial locality is achieved, the implementation is especially suited for DSPs with on-chip caches. The scalar and parallel implementation of the list based transform is shown and performance results based on simulations are presented.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"12 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114126801","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.555560
P. Grohan, S. Marcos
The paper revisits the problem of equalization with an IIR filter. The use of the discrete Kalman observer is adopted to perform the IIR equalization and to circumvent the minimum phase spectral factorization. A unified study of adaptive equalizers based on the Kalman observer is presented, a novel adaptive Kalman equalizer scheme is discussed and finally, a performance comparison is given by computer simulations.
{"title":"Structures and performances of several adaptive Kalman equalizers","authors":"P. Grohan, S. Marcos","doi":"10.1109/DSPWS.1996.555560","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555560","url":null,"abstract":"The paper revisits the problem of equalization with an IIR filter. The use of the discrete Kalman observer is adopted to perform the IIR equalization and to circumvent the minimum phase spectral factorization. A unified study of adaptive equalizers based on the Kalman observer is presented, a novel adaptive Kalman equalizer scheme is discussed and finally, a performance comparison is given by computer simulations.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"49 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":"124845417","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.555568
K. Kelber, M. Gg Otz, Wolfgang Schwarz
This paper deals with the generation of chaotic signals which have a uniform probability distribution up to nth-order. First a generator structure containing a static nonlinearity and a dynamical subsystem is deduced and the system characteristics are specified. Then conditions for the generation of continuous-value signals with nth-order uniform distribution are derived. For the special case of digital filter structures with chaotic behaviour the condition is simply that one specified parameter has to be an integer. Finally problems of continuous-value and discrete-value analysis and realisation are discussed. Some simulation results are provided.
{"title":"Generation of chaotic signals with n-dimensional uniform probability distribution by digital filter structures","authors":"K. Kelber, M. Gg Otz, Wolfgang Schwarz","doi":"10.1109/DSPWS.1996.555568","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555568","url":null,"abstract":"This paper deals with the generation of chaotic signals which have a uniform probability distribution up to nth-order. First a generator structure containing a static nonlinearity and a dynamical subsystem is deduced and the system characteristics are specified. Then conditions for the generation of continuous-value signals with nth-order uniform distribution are derived. For the special case of digital filter structures with chaotic behaviour the condition is simply that one specified parameter has to be an integer. Finally problems of continuous-value and discrete-value analysis and realisation are discussed. Some simulation results are provided.","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":"122041467","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.555534
Q. Liu, B. Champagne, K. Ho
The fast affine projection (FAP) has been proposed recently as a new adaptive filtering algorithm which possesses LMS like complexity but may achieve RLS like convergence. We investigate the use of FAP algorithms in subbands for acoustic echo cancellation (AEC). To this end, some modifications are first made on the FAP based on the consideration of the numerical stability. The modified FAP algorithm is then used in a complex adaptive subband filter structure for AEC. Advantages of the resulting subband FAP over the full-band NLMS scheme in terms of both complexity and performance are demonstrated by simulations.
{"title":"On the use of a modified fast affine projection algorithm in subbands for acoustic echo cancelation","authors":"Q. Liu, B. Champagne, K. Ho","doi":"10.1109/DSPWS.1996.555534","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555534","url":null,"abstract":"The fast affine projection (FAP) has been proposed recently as a new adaptive filtering algorithm which possesses LMS like complexity but may achieve RLS like convergence. We investigate the use of FAP algorithms in subbands for acoustic echo cancellation (AEC). To this end, some modifications are first made on the FAP based on the consideration of the numerical stability. The modified FAP algorithm is then used in a complex adaptive subband filter structure for AEC. Advantages of the resulting subband FAP over the full-band NLMS scheme in terms of both complexity and performance are demonstrated by simulations.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"25 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":"127862548","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.555575
G. Oien, N. Bertelsen, T. Eftestøl, J. H. Husøy
This paper discusses ECG rhythm classification using artificial neural networks (ANNs). We consider one 3-class problem where we distinguish between the normal sinus rhythm and two different abnormal rhythms, -and the practically very important "treat/no-treat" 2-class problem encountered e.g. when operating a semi-automatic defibrillation device. Autoregressive (AR) parameters, and samples of the signal's periodogram, are combined into feature vectors which are used as inputs to forward-connected multilayered perceptron ANNs. Training and testing is performed using signals from two different ECG data bases. The "best" net sizes and feature vector dimensions are decided upon by means of empirical tests. The results are compared with a previous method which also uses the AR model but which employs the learning vector quantization (LVQ) algorithm for the actual classification.
{"title":"ECG rhythm classification using artificial neural networks","authors":"G. Oien, N. Bertelsen, T. Eftestøl, J. H. Husøy","doi":"10.1109/DSPWS.1996.555575","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555575","url":null,"abstract":"This paper discusses ECG rhythm classification using artificial neural networks (ANNs). We consider one 3-class problem where we distinguish between the normal sinus rhythm and two different abnormal rhythms, -and the practically very important \"treat/no-treat\" 2-class problem encountered e.g. when operating a semi-automatic defibrillation device. Autoregressive (AR) parameters, and samples of the signal's periodogram, are combined into feature vectors which are used as inputs to forward-connected multilayered perceptron ANNs. Training and testing is performed using signals from two different ECG data bases. The \"best\" net sizes and feature vector dimensions are decided upon by means of empirical tests. The results are compared with a previous method which also uses the AR model but which employs the learning vector quantization (LVQ) algorithm for the actual classification.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"37 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":"126922465","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.555556
K. Al-Mashouq, A. Al-Obaid, S. Alshebeili
For severe intersymbol-interference (ISI) channels, a linear post-equalizer at the receiver causes noise enhancement which degrades the performance. To avoid such a problem we propose the use of adaptive pre-equalization at the transmitter. Based on the back-propagation algorithm used for multi-layer neural networks, we derive an adaptive algorithm to train the pre-equalizer. The simulation example presented shows that substantial power gain can be achieved with this adaptation technique. It is also shown how to extend the training algorithm in order to adapt the pre-equalizer and post-equalizer simultaneously.
{"title":"Adaptive pre-equalization using neural-like algorithm","authors":"K. Al-Mashouq, A. Al-Obaid, S. Alshebeili","doi":"10.1109/DSPWS.1996.555556","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555556","url":null,"abstract":"For severe intersymbol-interference (ISI) channels, a linear post-equalizer at the receiver causes noise enhancement which degrades the performance. To avoid such a problem we propose the use of adaptive pre-equalization at the transmitter. Based on the back-propagation algorithm used for multi-layer neural networks, we derive an adaptive algorithm to train the pre-equalizer. The simulation example presented shows that substantial power gain can be achieved with this adaptation technique. It is also shown how to extend the training algorithm in order to adapt the pre-equalizer and post-equalizer simultaneously.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"2 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":"114966580","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.555552
V. Pierson, P. Amblard
This paper deals with automatic recognition of time-frequency signatures. In particular, we are interested in linear structures in the time-frequency plane. These signatures are detected by their boundary in the time-frequency plane. Then, shapes are compared to a rectangular model using a distance evaluation on Fourier descriptors. The value of the distance allows the decision if the considered boundary is a linear signature or not. The performance of this method are evaluated on "linear chirps" by tracing the received operating characteristic (ROC) curves. Finally, our method is applied to the recognition of real "hydraulic noises" in underwater acoutics.
{"title":"Studying the performances of linear signature detector on a time-frequency representation","authors":"V. Pierson, P. Amblard","doi":"10.1109/DSPWS.1996.555552","DOIUrl":"https://doi.org/10.1109/DSPWS.1996.555552","url":null,"abstract":"This paper deals with automatic recognition of time-frequency signatures. In particular, we are interested in linear structures in the time-frequency plane. These signatures are detected by their boundary in the time-frequency plane. Then, shapes are compared to a rectangular model using a distance evaluation on Fourier descriptors. The value of the distance allows the decision if the considered boundary is a linear signature or not. The performance of this method are evaluated on \"linear chirps\" by tracing the received operating characteristic (ROC) curves. Finally, our method is applied to the recognition of real \"hydraulic noises\" in underwater acoutics.","PeriodicalId":131323,"journal":{"name":"1996 IEEE Digital Signal Processing Workshop Proceedings","volume":"4 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":"114994992","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
扫码关注我们
求助内容：
应助结果提醒方式：