J. Montalvao F., J. Mota, B. Dorizzi, C. Cavalcante
{"title":"Reducing Bayes equalizer complexity: a new approach for clusters determination","authors":"J. Montalvao F., J. Mota, B. Dorizzi, C. Cavalcante","doi":"10.1109/ITS.1998.718431","DOIUrl":"https://doi.org/10.1109/ITS.1998.718431","url":null,"abstract":"A new strategy for channel equalization in digital communication is presented. In this approach, the clustering problem is treated analytically. We propose a systematic Bayesian classification using a Gaussian approximation of the probability density function for each cluster. The quality of the approximation depends on the number of clusters considered. We show analytically that we can obtain the Bayes equalizer performance if we use the maximum number of clusters and we can obtain the Wiener equalizer performance if we use only two clusters (binary signal case). Some computational simulations illustrate the power of the presented strategy.","PeriodicalId":205350,"journal":{"name":"ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124180802","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 algebraic multipulse search","authors":"M. A. Ramírez, M. Gerken","doi":"10.1109/ITS.1998.713122","DOIUrl":"https://doi.org/10.1109/ITS.1998.713122","url":null,"abstract":"A joint amplitude and position search is proposed for searching algebraic multipulse codebooks for CELP speech coding. It is implemented within the reference G.723.1 codec as an example. This joint search method is shown to reduce down to one-third the number of comparisons per subframe relative to the focused search over an extensive speech database. An efficient implementation of the joint search is derived which incorporates backward filtering of the residual target vector and precomputation of auto-correlation elements, bringing about a reduction in complexity of one third in comparison to the focused search. The joint search performs about one thirtieth as many comparisons as the full position search.","PeriodicalId":205350,"journal":{"name":"ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123625522","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}
R.A.N. De Oliveira, G. Protásio dos Santos Cavalcante, G. L. Siqueira
{"title":"Ray tracing model for mobile systems in a forested environment","authors":"R.A.N. De Oliveira, G. Protásio dos Santos Cavalcante, G. L. Siqueira","doi":"10.1109/ITS.1998.713137","DOIUrl":"https://doi.org/10.1109/ITS.1998.713137","url":null,"abstract":"A simple ray tracing model for a mobile station received field intensity in a forested environment is proposed. To validate the model a propagation measurement campaign was carried out where a mobile laboratory was driven through a route surrounded by forest. The results of this measurement campaign are compared with the proposed model to shown how well the model can predict the field intensity behavior. Results of field depolarization are also reported.","PeriodicalId":205350,"journal":{"name":"ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202)","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114522936","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 comparison between HMM and hybrid ANN-HMM-based systems for continuous speech recognition","authors":"C. Ynoguti, E. da silva Morais, F. Violaro","doi":"10.1109/ITS.1998.713105","DOIUrl":"https://doi.org/10.1109/ITS.1998.713105","url":null,"abstract":"The purpose of this paper is to compare the performance of two continuous speech recognition systems, one based on hidden Markov models (HMM) and the other based on hybrid artificial neural networks and hidden Markov models (ANN-HMM). The comparisons are in terms of recognition rate and in terms of computational complexity. Preliminary results points favorably to hybrid systems.","PeriodicalId":205350,"journal":{"name":"ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124039979","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":"Optimal detection and tracking of randomly moving targets","authors":"Marcel Bruno, Jose M Moura","doi":"10.1109/ITS.1998.713089","DOIUrl":"https://doi.org/10.1109/ITS.1998.713089","url":null,"abstract":"This paper considers optimal joint detection and tracking of targets that move randomly on finite grids. Detection decisions and target position estimates are based on raw radar measurements corrupted by noise which may have heavy tail statistics.","PeriodicalId":205350,"journal":{"name":"ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124093274","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":"Image coding with low blocking effects using discrete sine transform with axis rotation","authors":"E. Pelaes, Y. Iano","doi":"10.1109/ITS.1998.718461","DOIUrl":"https://doi.org/10.1109/ITS.1998.718461","url":null,"abstract":"The blocking effect is a problem that is always present in image coding by blocking transform. A simple method for image coding, with low blocking effect, using pre- and post-axis rotation and the discrete sine transform, is presented. The method was implemented, and the results obtained by simulation in the image coding are compared with image coding by DCT and LOT.","PeriodicalId":205350,"journal":{"name":"ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131989432","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":"Feature sets in continuous speech recognition for the Portuguese language","authors":"S. Dos Santos, A. Alcaim","doi":"10.1109/ITS.1998.713103","DOIUrl":"https://doi.org/10.1109/ITS.1998.713103","url":null,"abstract":"We evaluate the performance of different feature sets in continuous speech recognition systems for the Portuguese language. Results were obtained for the task of recognizing sequences of digits spoken in a fluent manner. We have investigated five parametric descriptions of speech, selected among the most-used ones in present continuous speech recognition systems. We show that the feature set providing the best results for the Portuguese language comprises 18 parameters, 15 derived from the PLP-cepstrum and 3 from the energy. In the speaker-independent mode, a word accuracy of 99.5% was obtained. The performance of a Mel-cepstrum-based set with 39 parameters was 99.3% word-accurate.","PeriodicalId":205350,"journal":{"name":"ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132214142","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":"Implementations of traffic control mechanisms for high-speed networks","authors":"C. Albuquerque, M. Faerman, O. Duarte","doi":"10.1109/ITS.1998.713113","DOIUrl":"https://doi.org/10.1109/ITS.1998.713113","url":null,"abstract":"This paper proposes a traffic policing mechanism for multimedia communication systems with quality of service guarantees, called slotted moving window (SMW). Moreover, it also presents efficient implementations of SMW and several other well-known traffic policing mechanisms, for comparison purposes. SMW's main feature is the capability to accurately control the mean cell rate in a cost-effective approach. In addition, SMW is characterized by low implementation complexity, low memory requirements and use of a single low-precision timer. Its key idea consists of the aggregation of arrival events in order to minimize processing and buffering requirements. The comparative analysis concentrates on the number of timers and their precision, the required memory, the processing time, the maximum burst duration and the violation probability. Finally, the results confirm the efficiency and low implementation complexity of both the leaky bucket and the slotted moving window mechanism.","PeriodicalId":205350,"journal":{"name":"ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133876291","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":"Structured least squares criterion for linear prediction","authors":"A. Lopes, R. Lemos","doi":"10.1109/ITS.1998.713091","DOIUrl":"https://doi.org/10.1109/ITS.1998.713091","url":null,"abstract":"Linear prediction is one of the most important tools in modern signal processing. This article is concerned with the optimization of the linear prediction coefficients through a least squares criterion taking into account the special structures of the associated data matrix. These structures are lost during the conventional least squares optimization. However better results can be achieved if they are preserved. We propose two procedures to this end and demonstrate that they are equivalent because they minimize the same objective function.","PeriodicalId":205350,"journal":{"name":"ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202)","volume":"10 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132433478","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 echo cancellation based on an orthogonal adaptive IIR realization","authors":"L. Salama, J. Cousseau","doi":"10.1109/ITS.1998.718432","DOIUrl":"https://doi.org/10.1109/ITS.1998.718432","url":null,"abstract":"Adaptive IIR filters have not been widely used in many areas because the updating algorithms and suitable representations (realizations) known in the literature do not cover different particularities of each application. We discuss both the utilization of a particular realization for the adaptive IIR filter and a special structural interpretation of the Steiglitz-McBride method for updating the coefficients. The main application emphasis is oriented towards echo cancellation applications but other areas of adaptive signal processing such as postcursor filters in decision feedback equalization can be included. The particular realization proposed is based on a generalized orthonormal family of functions that has the Laguerre functions and the Kautz functions as special cases. Except for the lattice realization, that is based on the properties of Szego orthonormal polynomials, no other adaptive IIR filter realization using orthonormal characteristics seems to be extensively studied in the literature. The chosen realization has several advantages relating mainly to suitable internal (coefficients and variables) normalization and robust numerical conditioning. The Steiglitz-McBride method is discussed mainly because it can avoid the local minima problem related to direct mean squared output error minimization. In this paper, we present some theoretical results related to the properties of a special orthonormal realization, suitable for echo cancellation, when used to minimize the mean square output error with the Steiglitz-McBride algorithm.","PeriodicalId":205350,"journal":{"name":"ITS'98 Proceedings. SBT/IEEE International Telecommunications Symposium (Cat. No.98EX202)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133715812","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}