D. Hanson, R. Randall, R. Ford, J. Antoni, D. Thompson, T. Waters
{"title":"Blind system identification using cyclostationarity and the complex cepstrum","authors":"D. Hanson, R. Randall, R. Ford, J. Antoni, D. Thompson, T. Waters","doi":"10.1109/ISSPA.2005.1580292","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1580292","url":null,"abstract":"This paper presents a new technique for blind identification of MIMO systems excited by cyclostationary inputs with unique cyclic frequencies. The cyclic spectral density is determined, effectively reducing the system from a MIMO to a SIMO scenario, and curve fit in the cepstrum domain, which allows for the separation of the input and path effects. This technique is suitable for determining the in-service properties of passenger vehicles with internal combustion engines, and the resulting\u0000properties can be used to update finite element models. The effectiveness of the new technique is demonstrated on a mechanical system.","PeriodicalId":385337,"journal":{"name":"Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005.","volume":"6 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":"115395348","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":"Near-optimal uniqueword design in single-carrier block transmission systems","authors":"J. Coon, M. Sandell","doi":"10.1109/ISSPA.2005.1580256","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1580256","url":null,"abstract":"The problem of designing short sequences for nearoptimal training arises in single-carrier block transmission systems that use a unique word (UW) extension to facilitate frequency-domain equalization and channel estimation. Effectively, this problem involves constructing sequences of length Q ≤ N/2 that, when padded with zeros to make a length-N sequence, have good periodic autocorrelation properties and, thus, a (nearly) flat power spectrum. Using training sequences with a flat power spectrum allows each channel frequency response coefficient to be estimated with the same accuracy. In this paper, convex optimization theory is used to find near-optimal (in terms of channel estimation mean-square error) sequences with a constrained peak-to-average power ratio that can be used as UWs. The approach used here is a powerful method of solving optimization problems, and it is conjectured that this approach can be extended to similar problems in the field of communications.","PeriodicalId":385337,"journal":{"name":"Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005.","volume":"45 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":"125015236","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":"A fuzzy spectral clustering for lossless and multiresolution coding of hyperspectral images","authors":"K. Siala, A. Benazza-Benyahia","doi":"10.1109/ISSPA.2005.1580236","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1580236","url":null,"abstract":"In this paper, we propose a two-stage algorithm for hyperspectral image coding in a multiresolution way. The first stage consists in classifying the spectral components into separate clusters sharing similar characteristics. For this purpose, we have applied a fuzzy clustering algorithm which allows the clusters to have a flexible number of components. In the second stage, a vector lifting scheme is applied within each cluster in order to exploit simultaneously the spatial and spectral redundancies. A selective process is also applied to switch between inter-component and intracomponent coding of a given component. Experiments carried out on AVIRIS images indicate the outperformance of the proposed method w.r.t. the state-of-art coders.","PeriodicalId":385337,"journal":{"name":"Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005.","volume":"38 4 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":"126166051","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}
N. Linh-Trung, A. Aïssa-El-Bey, K. Abed-Meraim, A. Belouchrani
{"title":"Underdetermined blind source seperation of non-disjoint nonstationary sources in the time-frequency domain","authors":"N. Linh-Trung, A. Aïssa-El-Bey, K. Abed-Meraim, A. Belouchrani","doi":"10.1109/ISSPA.2005.1580192","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1580192","url":null,"abstract":"This paper considers the blind separation of nonstationary sources in the underdetermined case, in which we have more sources than sensors. A recently proposed algorithm applied time-frequency distributions (TFDs) to this problem and gave good separation performances in the case where sources were disjoint in the time-frequency (TF) plane. However, in the non-disjoint case, the method simply relied on the interpolation at the intersection TF points implicitly performed by a TF synthesis algorithm, instead of directly treating these points. In this paper, we propose a new algorithm that combines the abovementioned method with subspace projection in order to explicitly treat non-disjoint sources. Another contribution of this paper is the estimation of the mixing matrix in the underdetermined case.","PeriodicalId":385337,"journal":{"name":"Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005.","volume":"8 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":"122150812","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":"A symbolic representation of time series","authors":"Qiang Wang, V. Megalooikonomou, Guo Li","doi":"10.1109/ISSPA.2005.1581023","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1581023","url":null,"abstract":"Various representations have been proposed for time series to facilitate similarity searches and discovery of interesting patterns. Although the Euclidean distance and its variants have been most frequently used as similarity measures, they are relatively sensitive to noise and fail to provide meaningful information in many cases. Moreover, for time series with high dimensionality, the similarity calculation may be extremely inefficient. To solve this problem, we introduce a new method which gives a symbolic representation of the time series and can dramatically reduce its dimensionality. The method employs Vector Quantization to encode time series using symbols prior to performing similarity analysis. Due to the symbolic representation, we can apply string matching algorithms to calculate the similarities more efficiently and accurately. We propose a similarity measure that is based on the Longest Common Subsequence (LCSS) model. The experimental results on real and simulated data demonstrate the utility and efficiency of the proposed technique.","PeriodicalId":385337,"journal":{"name":"Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005.","volume":"32 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":"128665791","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":"Overlaid or time-multiplexed pilots for channel estimation in iterative MIMO receivers","authors":"M. Khalighi, L. Berriche, J. Hélard","doi":"10.1109/ISSPA.2005.1580980","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1580980","url":null,"abstract":"We consider the use of overlaid pilots for multiple input multiple output (MIMO) channel estimation in the context of single-user and single-carrier modulation. Imposing no loss in spectral efficiency, overlaid pilots are potentially of special interest, notably in relatively fast fading channels. However, when channel is to be estimated over short sequences, estimation errors can be important, due to the non-zero cross-correlation of data and pilot sequences. We show how these estimation errors limit the performance of the receiver, when iterative data detection and channel estimation is performed. Also, for the case of iterative detection at receiver, we compare the performances of the overlaid and the time-multiplexed pilot schemes.","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":"124628141","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":"A practical method for wireless channel reciprocity exploitation through relative calibration","authors":"M. Guillaud, D. Slock, R. Knopp","doi":"10.1109/ISSPA.2005.1580281","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1580281","url":null,"abstract":"We present a relative calibration method for a wireless TDD link, which, after a calibration phase involving feedback, lets the transmitter acquire knowledge of the downlink channel state from the uplink channel estimates, through proper modeling and estimation of the RF circuitry impulse responses. Contrarily to previous methods, relative calibration does not require specific calibration hardware. Experimental results confirm the validity of the proposed linear reciprocity model, and of the calibration approach.","PeriodicalId":385337,"journal":{"name":"Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005.","volume":"35 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":"124658265","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":"Smoothing parameter selection in nonparametric regression using an improved kullback information criterion","authors":"M. Bekara, B. Hafidi, G. Fleury","doi":"10.1109/ISSPA.2005.1581081","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1581081","url":null,"abstract":"Many different methods for constructing nonparametric estimates of a smooth regression function use a smoothing parameter to control the amount of smoothing performed on a given data set. In this paper, a method based on an improved version of Kullback Information Criterion (KIC), termed KICc1 is derived and implemented for selecting the appropriate smoothing parameter for any type of linear smoother. Monte Carlo simulations demonstrate that KICc1 , unlike the Generalized Cross Validation (GCV) method, has less tendency to undersmooth and exhibits low variability specially for low SNR. Also, it is very competitive with the plug-in method and performs well when this last fails. Furthermore, KICc1 slightly outperforms its analogue AICc1 based on the known Akaike Information criterion (AIC).","PeriodicalId":385337,"journal":{"name":"Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005.","volume":"21 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":"129433624","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":"Versatile on-chip read-out for compound-eye image sensor array","authors":"F. Boussaïd, Shoushun Chen, A. Bermak","doi":"10.1109/ISSPA.2005.1580262","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1580262","url":null,"abstract":"Compound-eye image sensors offer the possibility to fabricate ultra-thin (<0.5mm) image sensors, that integrate micro-optics, photo-sensing elements and processing-circuitry on a single chip. Modeled after the compound eye found in insects and in many other arthropods, the compound-eye sensor has the possibility to generate a high resolution image from the simultaneous acquisition of a mosaic of low resolution images. In this paper, we propose a versatile read-out strategy enabling to view the scene from only a subset of microlenses. We demonstrate that this feature is very attractive in terms of power consumption and read-out speed, especially when the intended application does not require high resolution imaging. Simulation results are presented to validate the functionality of the circuit, using AMI 0.35µm CMOS technology.","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":"126875846","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":"A novel alternative to diagonal loading for robust adaptive beamforming","authors":"S. Sirianunpiboon","doi":"10.1109/ISSPA.2005.1580280","DOIUrl":"https://doi.org/10.1109/ISSPA.2005.1580280","url":null,"abstract":"Diagonal loading has proved an effective way to improve the robustness of the optimum beamformer. However, the diagonal loading value must be properly chosen to achieve this. In this paper we propose a Bayesian beamformer for dealing with uncertainty in array configuration and source direction of arrival. We then introduce a method for forming robust beamfomers without the need for diag- onal loading. Furthermore, when diagonal loading is used we give a simple and effective technique for determining a good value for the loading. Simulations and experimental results show that both techniques exhibit similar perfor- mance on simulated and real data. In this paper we develop a number of ideas. We briefly present a Bayesian method for dealing with uncertainity in array configurations and source DOA. We show that when this method is applied to DOA uncertainty we ob- tain a power minimisation problem which is identical to the distributed source problem of (4). We then present a method for extracting robust beamformers from this prob- lem without the need for diagonal loading. This is the main result of this paper. Finally, for comparison, we briefly present a new method we have developed for de- termining diagonal loading values for the minimum power distortionless response (MPDR) beamformer, based on an iterative power estimate. The paper is organised as follows. In Section 2 we briefly review minimum power beamforming and the ba- sic approaches to making such beamformers robust to model mismatch. Section 3 introduces Bayesian beamforming with expected response constraints (ERC). In Section 4 we propose an approximate solution to this problem which avoids the need for diagonal loading. We compare this technique with a new method we have developed for de- termining diagonal loading values based on an iterative power estimate; this techique is summarised in Section 5. A comparison using both simulation and experimental re- sults is shown in Section 6.","PeriodicalId":385337,"journal":{"name":"Proceedings of the Eighth International Symposium on Signal Processing and Its Applications, 2005.","volume":"23 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":"122237282","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}