{"title":"Genetic algorithm implementation of multi-user detection in SDMA-OFDM systems","authors":"Mohammed Alansi, I. Elshafiey, A. Al-Sanie","doi":"10.1109/ISSPIT.2011.6151580","DOIUrl":"https://doi.org/10.1109/ISSPIT.2011.6151580","url":null,"abstract":"Number of supported users in the orthogonal frequency division multiplexing (OFDM) systems can be increased considerably using powerful multi-user detector (MUD) combined with space division multiple access (SDMA) techniques. This paper presents the results of implementing MUD in SDMA-OFDM systems based on an advanced genetic-algorithm (GA) optimization tool. The hardware implementation is performed using Field Programmable Gate array (FPGA) devices which allow the real time performance of the proposed tool. Results show that the GA scheme enhances the performance and provides BER near to that attained using maximum likelihood (ML) detector at considerably lower computation complexity. Investigation of the GA population size is presented and FPGA implementation is described based on the shared memory approach.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134457034","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":"Cooperative regions for cooperative MTCM systems","authors":"Priyanki Thakore, A. Stefanov","doi":"10.1109/ISSPIT.2011.6151617","DOIUrl":"https://doi.org/10.1109/ISSPIT.2011.6151617","url":null,"abstract":"In a wireless network, collaboration among terminals represents an efficient way to improve the system's performance. In this paper, we focus on a cooperative multiple trellis coded modulation (MTCM) system. The channels are modeled as frequency non-selective and quasi-static Rayleigh fading. Rather than making the assumption that a partner/relay is already known, the paper examines the issue of a partner/relay selection in a wireless network and investigates the cooperative regions for the 4 state, 8 state and 16 state 8-PSK 2-TCM codes introduced in [3]. In particular, we investigate the conditions for which cooperation is beneficial for individual terminals, as well as the scenarios when cooperation benefits both cooperating MTCM partners. The theoretical results are verified through numerical examples.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114290535","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}
H. Saruwatari, N. Hirata, Toshiyuki Hatta, Ryo Wakisaka, K. Shikano, T. Takatani
{"title":"Semi-blind speech extraction for robot using visual information and noise statistics","authors":"H. Saruwatari, N. Hirata, Toshiyuki Hatta, Ryo Wakisaka, K. Shikano, T. Takatani","doi":"10.1109/ISSPIT.2011.6151571","DOIUrl":"https://doi.org/10.1109/ISSPIT.2011.6151571","url":null,"abstract":"In this paper, speech recognition accuracy improvement is addressed for ICA-based multichannel noise reduction in spoken-dialogue robot. First, a new permutation solving method using a probability statistics model is proposed for realistic sound mixtures consisting of point-source speech and diffuse noise. Next, to achieve high recognition accuracy for the early utterance of the target speaker, we introduce a new rapid ICA initialization method combining robot video information and a prestored initial separation filter bank. From this image information, an ICA initial filter fitted to the user's direction can be used to save the user's first utterance. The experimental results show that the proposed approaches can markedly improve the word recognition accuracy.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116045827","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":"Validation of Support Vector Regression in deriving aerosol optical thickness maps at 1 km2 spatial resolution from satellite observations","authors":"Thi Nhat Thanh Nguyen, S. Mantovani, P. Campalani","doi":"10.1109/ISSPIT.2011.6151623","DOIUrl":"https://doi.org/10.1109/ISSPIT.2011.6151623","url":null,"abstract":"As a result of great improvements in satellite technologies, satellite-based observations have provided possibilities to monitor air pollution at the global scale with moderate quality in comparison with ground truth measurement. In tradition, the inversion process that derives atmospheric parameters from satellite-based data is replied on simulated physics models of matter interactions. Recently, the usage of machine learning techniques in this field has been investigated and presented competitive results to the physical approach. In this paper, we present validation of Support Vector Regression (SVR) technique in estimating Aerosol Optical Thickness (AOT), one of the most important atmospheric variables, from satellite observations at 1×1 km2 of spatial resolution. Validation by different European countries is carried out on a large amount of datasets collected in three years, which aims at investigating prediction quality of SVR data models built up on discrete and sparse data around ground measurement sites on continuous data domain presented by maps. The validation results obtained from 172 datasets showed good performance of SVR over most of the 31 countries that were considered.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123016809","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":"Enhanced fuzzy-based models for ROI extraction in medical images","authors":"Y. El-Sonbaty, S. Youssef, Karma M. Fathalla","doi":"10.1007/978-3-642-27183-0_4","DOIUrl":"https://doi.org/10.1007/978-3-642-27183-0_4","url":null,"abstract":"","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129854652","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 source separation of nondisjoint sources in the time-frequency domain with model-based determination of source contribution","authors":"Jalil Taghia, Timo Gerkmann, A. Leijon","doi":"10.1109/ISSPIT.2011.6151573","DOIUrl":"https://doi.org/10.1109/ISSPIT.2011.6151573","url":null,"abstract":"While most blind source separation (BSS) algorithms rely on the assumption that at most one source is dominant at each time-frequency (TF) point, recently, two BSS approaches, [1], [2], have been proposed that allow multiple active sources at time-frequency (TF) points under certain assumptions. In both algorithms, the active sources in every single TF point are found by an exhaustive search through an optimization procedure which is computationally expensive. In this work, we address this limitation and avoid the exhaustive search by determining the source contribution in every TF point. The source contributions are expressed by a set of posterior probabilities. Hereby, we propose a model-based blind source separation algorithm that allows sources to be nondisjoint in the TF domain while being computationally more tractable. The proposed BSS approach is shown to be robust with respect to different reverberation times and microphone spacings.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128670219","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}
Bingyin Xia, C. Bao, Yan Liang, Xuan Zhou, Yu-wen He, Ru-wei Li
{"title":"Compressed domain speech enhancement based on the joint modification of codebook gains","authors":"Bingyin Xia, C. Bao, Yan Liang, Xuan Zhou, Yu-wen He, Ru-wei Li","doi":"10.1109/ISSPIT.2011.6151561","DOIUrl":"https://doi.org/10.1109/ISSPIT.2011.6151561","url":null,"abstract":"A compressed domain speech enhancement method based on the joint modification of adaptive and algebraic codebook gains for the codec of ITU-T G.722.2 is proposed in this paper. First the power of excitation signal corresponding to the noise is estimated by the method of minimum statistics. Then the decision-directed approach is used to get an estimate of the a priori SNR. And the algebraic codebook gain is modified by multiplying a Wiener-type modification factor. In order to solve the problem of power loss in voiced segment, the modified adaptive codebook gain is got by keeping the power of the modified excitation signal equal to the scaled version of the noisy one. The result of performance evaluation under ITU-T G.160 shows that, in comparison with the method that only modifies the algebraic codebook gain, the proposed method could provide larger amount of noise reduction in both white and colored noise with smaller attenuation on the speech level, and the objective speech quality is improved evidently.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122549303","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":"An approximate polynomial matrix eigenvalue decomposition algorithm for para-Hermitian matrices","authors":"Soydan Redif, Stephan Weiss, J. McWhirter","doi":"10.1109/ISSPIT.2011.6151599","DOIUrl":"https://doi.org/10.1109/ISSPIT.2011.6151599","url":null,"abstract":"In this paper, we propose an algorithm for computing an approximate polynomial matrix eigenvalue decomposition (PEVD). The PEVD of a para-Hermitian matrix yields a factorisation into a polynomial matrix product consisting of a spectrally majorised diagonal matrix that is pre- and post-multiplied by paraunitary (PU) matrices. All current PEVD algorithms, such as the second order sequential best rotation (SBR2) algorithm, perform a factorisation whereby diagonalisation and spectral majorisation are only achieved in approximation. The purpose of this paper is to present a new iterative approach which constitutes a “Householder-like” version of SBR2 and is akin to Tkacenko's approximate EVD (AEVD); however, unlike the AEVD, the proposed method carries out the diagonalisation successively by applying arbitrary-degree, finite impulse response PU matrices. We show an application of our algorithm to the design of signal-adapted PU filter banks for subband coding. Simulation results for the proposed approach show very close agreement with the behaviour of the infinite order principal component filter banks and demonstrate its superiority compared to state-of-the-art algorithms in terms of strong decorrelation and spectral majorisation.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122444908","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":"Efficient computation of prolate spheroidal wave functions in radio astronomical source modeling","authors":"P. Noorishad, S. Yatawatta","doi":"10.1109/ISSPIT.2011.6151582","DOIUrl":"https://doi.org/10.1109/ISSPIT.2011.6151582","url":null,"abstract":"The application of orthonormal basis functions such as Prolate Spheroidal Wave Functions (PSWF) for accurate source modeling in radio astronomy has been comprehensively studied. They are of great importance for high fidelity, high dynamic range imaging with new radio telescopes as well as conventional ones. But the construction of PSWF is computationally expensive compared to other closed form basis functions. In this paper, we suggest a solution to reduce its computational cost by more efficient construction of the matrix kernel which relates the image domain to visibility (or Fourier) domain. Radio astronomical images are mostly represented using a regular grid of rectangular pixels. This is required for efficient storage and display purposes and moreover, comes naturally as a by product of the Fast Fourier Transform (FFT) in imaging. We propose the use of Delaunay triangulation as opposed to regular gridding of an image for a finer selection of the region of interest (signal support) during the PSWF kernel construction. We show that the computational efficiency improves without loss of information. Once the PSWF basis is constructed using the irregular grid, we revert back to the regular grid by interpolation and thereafter, conventional imaging techniques can be applied.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126425644","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}
William Chapman, S. Ranka, S. Sahni, M. Schmalz, U. Majumder
{"title":"Parallel processing techniques for the processing of synthetic aperture radar data on GPUs","authors":"William Chapman, S. Ranka, S. Sahni, M. Schmalz, U. Majumder","doi":"10.1109/ISSPIT.2010.5711769","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711769","url":null,"abstract":"This paper presents a design for parallel processing of synthetic aperture radar (SAR) data using one or more Graphics Processing Units (GPUs). Our design supports real-time reconstruction of a two-dimensional image from a matrix of echo pulses and their corresponding response values. Key to our design is a dual partitioning scheme that divides the output image into tiles and divides the input matrix into sets of pulses. Pairs comprised of an image tile and a pulse set are distributed to thread blocks in a GPU, thus facilitating parallel computation. Memory access latency is masked by the GPU's low-latency thread scheduling. Our performance analysis quantifies latency as a function of the input and output parameters. Experimental results were generated with an nVidia Tesla C2050 GPU having maximum throughput of 1030 Gflop/s. Our design achieves peak throughput of 293 Gflop/s, which scales well for output image sizes from 2,048 × 2,048 pixels to 4,096 × 4,096 pixels. Higher throughput can be obtained by distributing the pulse matrix across multiple GPUs and combining the results at a host device.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"146 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":"116951179","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}