Pub Date : 1900-01-01DOI: 10.1109/ISSPA.2001.949835
CheeWe Ng, A. Chandrakasan
Channel equalization is a required function in many high speed communication systems. As a result of the high performance requirements and complexity, adaptive equalization filters require significant power. These filters are often implemented in hardware rather than software on a DSP. A power scalable adaptive equalizer is presented where the power scales with the required precision through the use of dynamic tap length and bit precision. Using these techniques, a power reduction from 20.4 mW in a fixed length and bit precision filter to a minimum of 6.4 mW is demonstrated.
{"title":"Design of a power-scalable digital least-means-square adaptive filter","authors":"CheeWe Ng, A. Chandrakasan","doi":"10.1109/ISSPA.2001.949835","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.949835","url":null,"abstract":"Channel equalization is a required function in many high speed communication systems. As a result of the high performance requirements and complexity, adaptive equalization filters require significant power. These filters are often implemented in hardware rather than software on a DSP. A power scalable adaptive equalizer is presented where the power scales with the required precision through the use of dynamic tap length and bit precision. Using these techniques, a power reduction from 20.4 mW in a fixed length and bit precision filter to a minimum of 6.4 mW is demonstrated.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114205993","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.949831
Senjian An, Y. Hua
This paper deals with blind system identification of FIR MIMO (finite impulse response and multi input multi output) channels driven by colored signals. Based on second order statistics, a novel technique of blind identification is developed for irreducible MIMO channels. It requires a weaker condition on the input power spectra than some existing blind system identification methods and the computation is also reduced.
{"title":"Blind signal separation and blind system identification of irreducible MIMO channels","authors":"Senjian An, Y. Hua","doi":"10.1109/ISSPA.2001.949831","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.949831","url":null,"abstract":"This paper deals with blind system identification of FIR MIMO (finite impulse response and multi input multi output) channels driven by colored signals. Based on second order statistics, a novel technique of blind identification is developed for irreducible MIMO channels. It requires a weaker condition on the input power spectra than some existing blind system identification methods and the computation is also reduced.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"165 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114334433","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.950230
N. Noor, O. M. Rijal, O. Badar, P. Thon
As a measure of quality for wire bonding, the degree of formation of intermetallics between gold ball and aluminium bond pad was estimated. A digital colour circle image of the surface of the gold ball that was attached to the bond pad was obtained. The resultant image had to be modelled by a three component mixture model proposed by Noor, Rijal, Badar and Thon, (see IEEE TENCON 2000, Kuala Lumpur, p.1299-1304, September 2000), but was shown to be a bad fit. We show that digitizing the polygon image in grey level resulted in a simpler image histogram, which could be model by a two-component mixture model. As an additional method of determining cut-off points between the 'humps' in the mixture model, line profiles of the image were studied.
评价了金球与铝键合垫之间金属间化合物的形成程度，作为金属键合质量的衡量指标。获得了附着在键合垫上的金球表面的数字彩色圆图像。生成的图像必须由Noor, Rijal, Badar和Thon提出的三组分混合模型建模(参见IEEE TENCON 2000, Kuala Lumpur, p.1299-1304, 2000年9月)，但被证明是不合适的。结果表明，在灰度级上对多边形图像进行数字化处理，可以得到更简单的图像直方图，该直方图可以用双分量混合模型来建模。作为确定混合模型中“驼峰”之间截止点的附加方法，研究了图像的线轮廓。
{"title":"A mixture distribution for the wire bonding image","authors":"N. Noor, O. M. Rijal, O. Badar, P. Thon","doi":"10.1109/ISSPA.2001.950230","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.950230","url":null,"abstract":"As a measure of quality for wire bonding, the degree of formation of intermetallics between gold ball and aluminium bond pad was estimated. A digital colour circle image of the surface of the gold ball that was attached to the bond pad was obtained. The resultant image had to be modelled by a three component mixture model proposed by Noor, Rijal, Badar and Thon, (see IEEE TENCON 2000, Kuala Lumpur, p.1299-1304, September 2000), but was shown to be a bad fit. We show that digitizing the polygon image in grey level resulted in a simpler image histogram, which could be model by a two-component mixture model. As an additional method of determining cut-off points between the 'humps' in the mixture model, line profiles of the image were studied.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"722 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115906435","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.950213
W. J. Williams, Selin Aviyente
This paper outlines means of combining spectrograms formed using specially designed windows. Previous work has shown that one can decompose any time-frequency distribution (TFD) in Cohen's class into a weighted sum of spectrograms. This is accomplished by decomposing the kernel of the distribution in terms of an orthogonal set of analysis windows. The spectrograms obtained using these analysis windows are then linearly combined with proper weights to form the desired TFD. The goal is a full and effective basis for representing TFD. Successful application of this theory offers very fast computation of TFD, since very few analysis windows may be needed and fast, recursive spectrogram algorithms can be used.
{"title":"Spectrogram decompositions of time-frequency distributions","authors":"W. J. Williams, Selin Aviyente","doi":"10.1109/ISSPA.2001.950213","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.950213","url":null,"abstract":"This paper outlines means of combining spectrograms formed using specially designed windows. Previous work has shown that one can decompose any time-frequency distribution (TFD) in Cohen's class into a weighted sum of spectrograms. This is accomplished by decomposing the kernel of the distribution in terms of an orthogonal set of analysis windows. The spectrograms obtained using these analysis windows are then linearly combined with proper weights to form the desired TFD. The goal is a full and effective basis for representing TFD. Successful application of this theory offers very fast computation of TFD, since very few analysis windows may be needed and fast, recursive spectrogram algorithms can be used.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124025011","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.949765
Xiaokai Bai, Gang Li
It is known that any Schur polynomial can be characterized with a set of lattice partial correlation coefficients {k/sub i/} with |k/sub i/| < 1, /spl forall/i and this mapping is one-to-one. In this paper, based on the lattice structure we propose an alternative parametrization. It is important to notice that this parametrization is complete and compact, corresponds to the entire stable transfer function space and that any such parametrized transfer function is differentiable.
{"title":"A new parametrization to the design of recursive digital filter","authors":"Xiaokai Bai, Gang Li","doi":"10.1109/ISSPA.2001.949765","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.949765","url":null,"abstract":"It is known that any Schur polynomial can be characterized with a set of lattice partial correlation coefficients {k/sub i/} with |k/sub i/| < 1, /spl forall/i and this mapping is one-to-one. In this paper, based on the lattice structure we propose an alternative parametrization. It is important to notice that this parametrization is complete and compact, corresponds to the entire stable transfer function space and that any such parametrized transfer function is differentiable.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124330388","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.949795
M. Ratnam
Fringe patterns are usually analyzed using a predefined window due to the difficulty associated with finding their edges. This is because the fringes usually have minimum intensities similar to that of the background and therefore it is difficult to determine where a fringe starts and ends. This paper presents an automatic technique for detecting the edges of a noisy fringe pattern with various noise levels. The technique uses classical morphological operators and a simple binary edge detector. The relationship between background noise and threshold for the binarization was determined from simulated fringe patterns.
{"title":"Automatic edge detection in noisy fringe patterns","authors":"M. Ratnam","doi":"10.1109/ISSPA.2001.949795","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.949795","url":null,"abstract":"Fringe patterns are usually analyzed using a predefined window due to the difficulty associated with finding their edges. This is because the fringes usually have minimum intensities similar to that of the background and therefore it is difficult to determine where a fringe starts and ends. This paper presents an automatic technique for detecting the edges of a noisy fringe pattern with various noise levels. The technique uses classical morphological operators and a simple binary edge detector. The relationship between background noise and threshold for the binarization was determined from simulated fringe patterns.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122900782","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.950217
Daniel Landström, N. Petersson, Per Ödling, P. Börjesson
We address time synchronization in an OFDM system and present an ML estimator that also is unbiased for dispersive channels. The estimator uses the redundancy introduced by the cyclic prefix and knowledge of the channel. Previously presented estimators based on the cyclic prefix are either biased or have high complexity for this environment. We show that with proper choice of signal model, the complexity can be reduced considerably while maintaining the performance. Part of the novelty lies in the proper decomposition of correlation matrices that appear in the ML estimator. The new estimator structure consists of a linear filter, followed by an auto-correlating filterbank and a maximization.
{"title":"OFDM frame synchronization for dispersive channels","authors":"Daniel Landström, N. Petersson, Per Ödling, P. Börjesson","doi":"10.1109/ISSPA.2001.950217","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.950217","url":null,"abstract":"We address time synchronization in an OFDM system and present an ML estimator that also is unbiased for dispersive channels. The estimator uses the redundancy introduced by the cyclic prefix and knowledge of the channel. Previously presented estimators based on the cyclic prefix are either biased or have high complexity for this environment. We show that with proper choice of signal model, the complexity can be reduced considerably while maintaining the performance. Part of the novelty lies in the proper decomposition of correlation matrices that appear in the ML estimator. The new estimator structure consists of a linear filter, followed by an auto-correlating filterbank and a maximization.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128699344","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.949815
S. Popeseu
Many authors have developed methods for automatic recognition and classification of signal patterns based on wavelet transforms and wavelet theory. However so far a method to find the wavelet family that best fits a particular class of signals is yet not evolved. We present a new method based on a combination of wavelet analysis and the training method used in the field of artificial neural networks. We define a training process applied to a family of wavelets and intended to optimise the pattern detection and location capabilities when applied to a particular class of signals. We also demonstrate how this method is used to detect and localise the interictal epileptic spikes within human EEG bio-signals.
{"title":"Training the children wavelets to recognise waveforms within non-stationary signals","authors":"S. Popeseu","doi":"10.1109/ISSPA.2001.949815","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.949815","url":null,"abstract":"Many authors have developed methods for automatic recognition and classification of signal patterns based on wavelet transforms and wavelet theory. However so far a method to find the wavelet family that best fits a particular class of signals is yet not evolved. We present a new method based on a combination of wavelet analysis and the training method used in the field of artificial neural networks. We define a training process applied to a family of wavelets and intended to optimise the pattern detection and location capabilities when applied to a particular class of signals. We also demonstrate how this method is used to detect and localise the interictal epileptic spikes within human EEG bio-signals.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129842004","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.950196
Md. Imamul Hassan Bhuiyan, Md. Kamrul Hasan, M. Haque, N. Hammadi
A dynamically constructive neural network (DCNN) is proposed for still image compression. The main feature of the proposed dynamical construction is its robustness to input-to-hidden and hidden-to-output link failure. A wavelet transform based sub-image block classification technique is also proposed for partitioning training images into image clusters. Each cluster is used as a training set for training a particular DCNN. This ensures the generalization capability of DCNNs. Computer simulation results demonstrate superiority of the proposed scheme in terms of peak signal to noise ratio and robustness as compared to that of other recent methods.
{"title":"A robust method for still image compression using dynamically constructive neural network","authors":"Md. Imamul Hassan Bhuiyan, Md. Kamrul Hasan, M. Haque, N. Hammadi","doi":"10.1109/ISSPA.2001.950196","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.950196","url":null,"abstract":"A dynamically constructive neural network (DCNN) is proposed for still image compression. The main feature of the proposed dynamical construction is its robustness to input-to-hidden and hidden-to-output link failure. A wavelet transform based sub-image block classification technique is also proposed for partitioning training images into image clusters. Each cluster is used as a training set for training a particular DCNN. This ensures the generalization capability of DCNNs. Computer simulation results demonstrate superiority of the proposed scheme in terms of peak signal to noise ratio and robustness as compared to that of other recent methods.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121175088","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 : 1900-01-01DOI: 10.1109/ISSPA.2001.949772
R. Iordache, I. Tabus, Azeddine Beghdadi
For image transmission over noisy channels, the VQ paradigm is a strong competitor. We propose a post-processing scheme that is able to improve the perceptual quality of the VQ reconstructed image, for various types of noisy channels, when it is combined with an appropriate index assignment. For binary symmetric channels, we use the index assignment resulting from the Linde, Buzo and Gray (1980) LBG design of the codebook, which ensures a low channel distortion. For the more challenging case of memory channels we consider index assignments specifically designed. We show that a significant perceptual improvement can be achieved with our post-processing scheme both for memoryless and memory channels.
{"title":"Median-based post-processing for VQ image transmission over noisy channels","authors":"R. Iordache, I. Tabus, Azeddine Beghdadi","doi":"10.1109/ISSPA.2001.949772","DOIUrl":"https://doi.org/10.1109/ISSPA.2001.949772","url":null,"abstract":"For image transmission over noisy channels, the VQ paradigm is a strong competitor. We propose a post-processing scheme that is able to improve the perceptual quality of the VQ reconstructed image, for various types of noisy channels, when it is combined with an appropriate index assignment. For binary symmetric channels, we use the index assignment resulting from the Linde, Buzo and Gray (1980) LBG design of the codebook, which ensures a low channel distortion. For the more challenging case of memory channels we consider index assignments specifically designed. We show that a significant perceptual improvement can be achieved with our post-processing scheme both for memoryless and memory channels.","PeriodicalId":236050,"journal":{"name":"Proceedings of the Sixth International Symposium on Signal Processing and its Applications (Cat.No.01EX467)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125697616","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
扫码关注我们
求助内容：
应助结果提醒方式：