{"title":"Optimal multiple window time-frequency analysis of locally stationary processes","authors":"M. Hansson, P. Wahlberg","doi":"10.5281/ZENODO.38234","DOIUrl":"https://doi.org/10.5281/ZENODO.38234","url":null,"abstract":"This paper investigates the multiple windows of the mean squared error optimal time-frequency kernel for estimation of the Wigner-Ville spectrum. The kernel is optimal for a certain locally stationary process where the covariance function is determined by two one-dimensional Gaussian functions. The multiple windows are obtained as the eigenvectors of the rotated time-lag estimation kernel. The spectrograms from the different windows are weighted with the eigenvalues and the resulting multiple window spectrogram is an estimate of the optimal smoothed Wigner-Ville spectrum.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116499480","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 super-exponential methods for deflationary blind equalization of static systems","authors":"M. Kawamoto, K. Kohno, Y. Inouye","doi":"10.5281/ZENODO.38273","DOIUrl":"https://doi.org/10.5281/ZENODO.38273","url":null,"abstract":"The so called “super-exponential” methods (SEM's) are attractive methods for solving blind signal processing problems. The conventional SEM's, however, have such a drawback that they are very affected by Gaussian noise. To overcome this drawback, we propose a new SEM. While the conventional SEM's use the second-and higher-order cumulants of observations, the proposed SEM uses only the higher-order cumulants of observations. Because higher-order cumulants are not affected by Gaussian noise, the proposed SEM is robust to Gaussian noise, which is referred to as a robust super-exponential method (RSEM). To show the validity of the proposed RSEM, some simulation results are presented.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132303534","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":"Fractionally spaced linear MMSE turbo equalization","authors":"R. Otnes","doi":"10.5281/ZENODO.38444","DOIUrl":"https://doi.org/10.5281/ZENODO.38444","url":null,"abstract":"We extend previous work on linear MMSE (minimum mean square error) SISO (soft-in/soft-out) equalizers for turbo equalization to the case of fractional sampling of the received signal. We present a time-recursive algorithm also for this case. Special attention is paid to the influence of the receiver filter preceeding the sampler.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128335411","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}
M. A. Ferrer-Ballester, J. B. Alonso, S. David, C. Travieso-González
{"title":"Parameterization methodology for 2D shape classification by hidden Markov models","authors":"M. A. Ferrer-Ballester, J. B. Alonso, S. David, C. Travieso-González","doi":"10.5281/ZENODO.38490","DOIUrl":"https://doi.org/10.5281/ZENODO.38490","url":null,"abstract":"In computer vision, two-dimensional shape classification is a complex and well known topic, often basic for three-dimensional object recognition. Among different classification methods, this paper is focus on those that describe the 2D shape by means of a sequence of d-dimensional vectors which feeds a left to right hidden Markov model (HMM) recogniser. We propose a methodology for featuring the 2D shape with a sequence of vectors that take advantage of the HMM ability to spot the times when the infrequent vectors of the input sequence of vectors occur. This propierty is deduced by the repetition of the same HMM state during the moments in which the infrequent vectors is repeated. These HMM states are called by us synchronism states. The synchronization between the HMM and the input sequence of vectors can be improved thanks to adding an index component to the vectors. We show the recognition rate improvement of our proposal on selected applications.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123522523","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":"Analytical derivation of EXIT charts for simple block codes and for LDPC codes using information combining","authors":"I. Land, P. Hoeher, J. Huber","doi":"10.5281/ZENODO.38205","DOIUrl":"https://doi.org/10.5281/ZENODO.38205","url":null,"abstract":"The extrinsic information transfer (EXIT) chart describes the input-output behavior of a decoder by means of the mapping from a-priori information and channel information to extrinsic information. In this paper, we consider single parity check and repetition codes over binary-input symmetric memoryless channels. Using the concept of information combining, we derive bounds on the extrinsic information for these codes, which depend only on the a-priori information and on the channel information, but not on the channel models. The bounds are applied to the EXIT charts of these codes and to the EXIT charts of low-density parity-check codes.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123522926","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":"Stochastic simulation and parameter estimation of first order chemical reactions","authors":"K. D. Cock, Xueying Zhang, M. Bugallo, P. Djurić","doi":"10.5281/ZENODO.38668","DOIUrl":"https://doi.org/10.5281/ZENODO.38668","url":null,"abstract":"In this paper, we present fast stochastic simulation methods for the class of first order chemical reactions. The methods are based on the exact distributions for the number of molecules or their Gaussian approximations. Furthermore, using the adopted models, we develop parameter estimation methods for the reaction rates. Although we only discuss two basic reactions, the single channel and reversible first order reactions, the obtained results can be applied to more complex cases.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123795704","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":"Baseline spectrum estimation using half-quadratic minimization","authors":"V. Mazet, D. Brie, J. Idier","doi":"10.5281/ZENODO.38472","DOIUrl":"https://doi.org/10.5281/ZENODO.38472","url":null,"abstract":"In this paper, we propose a method to estimate the spectrum baseline. Basically, it consists in finding a low-order polynomial that minimizes the non-quadratic cost function. The optimization problem is solved using half-quadratic minimization. Two different cost functions are considered: firstly, the hyperbolic function which can be minimized using the algorithm ARTUR; secondly, the asymmetric truncated quadratic, which is minimized with the algorithm LEGEND. The latter gives the best results. This can be attributed to its asymmetric shape and its constant part for high positive values, making it better adapted to the problem than the hyperbolic function. The performances of these approaches are illustrated both on a real and simulated spectra and the choice of the hyperparameters is also discussed.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130403639","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":"Extracting the channel allocation information in a spectrum pooling system using cyclic feature detection","authors":"Mengüç Öner, F. Jondral","doi":"10.5281/ZENODO.38485","DOIUrl":"https://doi.org/10.5281/ZENODO.38485","url":null,"abstract":"Spectrum pooling is a resource sharing strategy, which allows a license owner to share a sporadically used part of his licensed spectrum with a renter system, until he needs it himself. For a frictionless operation of a spectrum pooling system, the license owner has to have the absolute priority to access the shared spectrum. This means, the renter system has to monitor the channel and extract the channel allocation information (CAI), i.e. it has to detect, which parts of the shared spectrum the owner system accesses to, in order to immediately vacate the frequency bands being required by the license owner and to gain access to the frequency bands, which the license owner has stopped using. This paper proposes using cyclic feature detection for the extraction of the CAI in a specific spectrum pooling scenario, where the license owner is a GSM network and the spectrum renter is an OFDM based WLAN system.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129144549","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":"Automatic SQNR determination in non-linear and non-recursive fixed-point systems","authors":"D. Ménard, R. Rocher, P. Scalart, O. Sentieys","doi":"10.5281/ZENODO.38366","DOIUrl":"https://doi.org/10.5281/ZENODO.38366","url":null,"abstract":"Most of the digital signal processing applications are implemented in embedded systems which are based on fixed-point arithmetic. The reduction of the time-to-market requires the automation of the fixed-point specification determination. The accuracy evaluation is one of the most important stage of this process. In this paper, a new methodology for evaluating the quality of non-recursive and non-linear systems is presented. The fixed-point specification accuracy is automatically determined through the computation of the Signal-to-Quantization-Noise-Ratio (SQNR) expression. The theoretical approach used for computing the output noise power is detailed and the methodology developed for automating the accuracy evaluation is presented. Then, the quality of our estimation is evaluated through different experiments.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127823541","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":"Very low bit rate (VLBR) speech coding around 500 bits/sec","authors":"M. Padellini, F. Capman, G. Baudoin","doi":"10.5281/ZENODO.38454","DOIUrl":"https://doi.org/10.5281/ZENODO.38454","url":null,"abstract":"New solutions to Very Low Bit Rate speech coding have been recently proposed based on speech recognition and speech synthesis technologies, [1,2,3,4,5,7,8]. In the continuation of the work described in [8], this paper presents a complete encoding scheme around 500 bits/sec. The proposed solution is based on automatic recognition of elementary acoustical units using HMM modelling. An unsupervised training phase is used to build the HMM models and the codebook of synthesis units. The decoded speech is then obtained by concatenating the corresponding synthesis units based on a HNM-like decomposition of speech. A new unit selection process is proposed integrating some prosody constraints. Through this approach, the size of the synthesis codebook is independent of the targeted bit rate. A complete description of the unit selection process and of the associated prosody modelling is given, together with the quantisation scheme of the overall set of encoded parameters.","PeriodicalId":347658,"journal":{"name":"2004 12th European Signal Processing Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128066135","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}