{"title":"Super resolution matrix pencil algorithm for future fading prediction of mobile radio channels","authors":"A. A. Ali, A. Omar","doi":"10.1109/ISSPA.2005.1580254","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1580254","url":null,"abstract":"In this paper a new application for the Matrix Pencil algorithm for the mobile channel 1 prediction is introduced. The Doppler shifts and the amplitudes of the scattered components are determined using the Matrix Pencil algorithm and the channel is then extrapolated (predicted) in the future. The movement of the mobile is assumed to be linear over the distance of several wavelengths . Results for both synthetic and real measurements are used to show the prediction performance. Synthetic signal test experiments show that the proposed prediction scheme is more efficient in computation time than root-MUSIC and even better than ESPRIT.","PeriodicalId":385337,"journal":{"name":"Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124007900","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":"Computer aided long bone fracture detection","authors":"M. Donnelley, G. Knowles","doi":"10.1109/ISSPA.2005.1580224","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1580224","url":null,"abstract":"We have developed a method of automatically detecting fractures in long bones. While bone fractures are a relatively common occurence, their presence can often be missed during x-ray diagnosis, resulting in ineffective patient management. Detection of fractures in long bones is an important orthopaedic and radiologic problem, so we propose a computer aided detection system to help reduce the miss rate. Our fracture detection algorithm consists of a number of steps. The first is extraction of edges from the x-ray image using a non-linear anisotropic diffusion method - the affine morphological scale space - that smoothes the image without losing critical information about the boundary locations within the image. The second is a modified Hough transform with automatic peak detection, which is used to determine parameters for the straight lines that best approximate the edges of the long bones. A composite of the magnitude and direction of the gradient is then created using the calculated line parameters. This allows abnormal regions, including fractures, to be highlighted. Experiments on a library of images show that this method consistently detects mid-shaft long bone fractures.","PeriodicalId":385337,"journal":{"name":"Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129821470","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":"Joint Bayesian model selection and blind equalization of ISI channels","authors":"Zaifei Liu, A. Doucet","doi":"10.1109/ISSPA.2005.1580979","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1580979","url":null,"abstract":"We consider the problem of joint model selection and blind equalization of inter-symbol interference (ISI) channels. We adopt a Bayesian approach where nuisance parameters are considered random and integrated out. An efficient Markov chain Monte Carlo (MCMC) method is presented to perform Bayesian computation. The proposed algorithm overcomes the problem of delay ambiguity encountered by most existing MCMC algorithms. A simple Metropolis step is employed for model selection circumventing the need for reversible jump Markov chain Monte Carlo (RJMCMC). To the best of our knowledge, the problem of model selection in ISI channels is solved for the first time. The convergence behavior and the Bit Error Rate (BER) performance of our algorithm are demonstrated through computer simulations.","PeriodicalId":385337,"journal":{"name":"Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127275535","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 broadband arrays using convolution constraints","authors":"L. Godara, M. Jahromi","doi":"10.1109/ISSPA.2005.1580285","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1580285","url":null,"abstract":"Broadband antenna arrays are pre-steered to compensate for the misalignment between the sensors and the look direction. The process is difficult and may cause loss of performance. This paper discusses a set of linear constraints referred to as “convolution constraints” for broadband beam-forming which eliminates the need for presteering and evaluates the performance of the array processor using these constraints to show that these are easy to implement, suitable for existing adaptive weight update methods and do not add any extra computational demands as is the case for some existing methods. Using these constraints an array designer is able to specify the frequency response of an element space time domain beamformer in any direction over the band of interest without using steering delays.","PeriodicalId":385337,"journal":{"name":"Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005.","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126706296","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":"Robust detection of distributed CA-CFAR in presence of extraneous tagets and non-Gaussian clutter","authors":"Z. Messali, M. Sahmoudi, F. Soltani","doi":"10.1109/ISSPA.2005.1580996","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1580996","url":null,"abstract":"This paper deals with distributed CA-CFAR detection in presence of Gaussi an and non-Gaussian clutter. In Gaussian environment, we propose to apply a wavelet transform based on soft-thresholding in multisensor CA-CFAR systems employing parallel decision fu sion in both homogeneous and non homogeneous background in the sense of the Neyman-Pearson (N-P) test. In that context, we propose two approaches to combine the data from the different CA-CFAR detectors to achieve even better detection performance. In the non-Gaussian environment, we propose another preprocess ing approach, based on a non-linear compressing filter, to reduce the noise effect. The three proposed new methods are shown to provide better detection performance, especially in lower SNR and in the presence of extraneous targets and heavy-tailed noise_","PeriodicalId":385337,"journal":{"name":"Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123343278","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":"Contrast with reference a new approach to the blind equalization of MIMO channels","authors":"M. Taoufiki, A. Adib, D. Aboutajdine","doi":"10.1109/ISSPA.2005.1580986","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1580986","url":null,"abstract":"Contrast-based separation of sources have a number of advantages. Among others, they are optimal in presence of noise. In this work, we propose a new contrast by considering a so-called reference signal that allows not only to obtain the optimal numerical algorithm but also yields better performance in terms of variance of the estimated mixing filter. This contrast needs source kurtosis to have the same sign. Thus, it’s appropriate to multichannel blind deconvolution.","PeriodicalId":385337,"journal":{"name":"Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121544854","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 space time codes over nonlinear MIMO channels","authors":"Raymond Iyanda Sulyman, M. Ibnkahla","doi":"10.1109/ISSPA.2005.1580282","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1580282","url":null,"abstract":"This paper investigates the effects of Non-linear amplifications on the performance of space-time coding systems. Pairwise Error Probability (PWEP) and Bit Error Probability (BEP) performance of 16-states space-time codes employing 16-QAM signals over linear and nonlinear MIMO channels are presented. Performance degradation due to non-linear amplifications of the transmitted coded symbols are then evaluated. The results show that the performance degradation increase with increasing MIMO dimensions.","PeriodicalId":385337,"journal":{"name":"Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126040892","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":"Blind IIR channel identification using an iterative deterministic algorithm","authors":"Bao-Yun Wang, W. Zheng","doi":"10.1109/ISSPA.2005.1580291","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1580291","url":null,"abstract":"In blind channel identification the deterministic algorithms are often very attractive in the case of short data samples. In this paper, we propose an iterative blind identification algorithm for IIR channels. By employing the idea of decision feedback, we formulate more equations for the unknowns. Specifically, the estimates of the moving-average (MA) parameters and the input signal are used to obtain the estimate of the autoregressive (AR) parameters at the next iteration. In this way, the proposed algorithm is able to provide more accurate estimates. Computer simulations are conducted which demonstrate attractive performances of the proposed blind identification algorithm.","PeriodicalId":385337,"journal":{"name":"Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116622142","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}
B. A. Obeidat, M. Amin, Yimin D. Zhang, A. Hoorfar
{"title":"Sensor configuration in polarized antenna arrays","authors":"B. A. Obeidat, M. Amin, Yimin D. Zhang, A. Hoorfar","doi":"10.1109/ISSPA.2005.1580278","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1580278","url":null,"abstract":"Single- and dual-polarized array configurations are often used in imaging and radar applications. In this paper, spatio-polarimetric correlation are used as a framework to evaluate the direction finding performance of dierent receiver configurations employing double-feed dual-polarized array as well as arrays of single-feed single-polarized elements. The spatio-polarimetric correlation coecients are derived for several array reconfigurations and used to provide a configuration-based performance comparison based on spatial resolution and grating lobes.","PeriodicalId":385337,"journal":{"name":"Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123864263","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":"Mask constrained beam pattern synthesis for large arrays","authors":"H. Hoang, B. Vo, H. Tuan, T. T. Son","doi":"10.1109/ISSPA.2005.1580277","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1580277","url":null,"abstract":"Antenna array pattern synthesis with mask constraints can be formulated as a convex optimization problem with semiinfinite trigonometric polynomial constraints. The current approach uses a Linear Matrix Inequality (LMI) characterization of the semi-infinite constraints to convert the original problem into a semidefinite programming (SDP) problem. However, an important drawback of this approach is the large number of additional variables incurred in the equivalent SDP representation, which in turn prohibits its use in the design of large antenna arrays that arise in many modern applications. This paper presents an efficient method for the synthesis of large antenna arrays via a novel LMI characterization of semi-infinite constraints that only involves a minimal number of additional variables. Subsequently, the design of patterns for arrays with hundreds of elements can be easily achieved on a standard personal computer using existing SDP solvers.","PeriodicalId":385337,"journal":{"name":"Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005.","volume":"40 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114030550","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}