Pub Date : 2006-02-27DOI: 10.1109/CONIELECOMP.2006.51
Daniel Campos, L. G. Guerrero-Ojeda, V. Aquino, José Miguel David Báez-López
A software that calculates satellite indoor loss path for three different systems of mobile satellite communications is presented. The systems are GLOBALSTAR , IRIDIUM and a third option for a GENERAL system in which the user have the possibility of change some parameters of the calculations. The user can choose from 5 different indoor propagation models. The software was developed using Visual Basic.
{"title":"Satellite-Indoor Mobile Communications Path Propagation Losses","authors":"Daniel Campos, L. G. Guerrero-Ojeda, V. Aquino, José Miguel David Báez-López","doi":"10.1109/CONIELECOMP.2006.51","DOIUrl":"https://doi.org/10.1109/CONIELECOMP.2006.51","url":null,"abstract":"A software that calculates satellite indoor loss path for three different systems of mobile satellite communications is presented. The systems are GLOBALSTAR , IRIDIUM and a third option for a GENERAL system in which the user have the possibility of change some parameters of the calculations. The user can choose from 5 different indoor propagation models. The software was developed using Visual Basic.","PeriodicalId":371526,"journal":{"name":"16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115325267","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}
Pub Date : 2006-02-27DOI: 10.1109/CONIELECOMP.2006.30
A. Perez-Loyola, R. Rosas-Romero
In this paper, we present a generalized optimal stable all-pass digital filter design algorithm that supports (1) arbitrary phase response specifications, (2) a corrective system designed to make the phase delay of a magnitude-filter substantially constant over a desired frequency range, (3) estimation of the delay .. of the best performed equalizer, (4) stability, and (5) wavelet-based non-uniform sampling of the phase response of the magnitude-filter whose delay is to be equalized.
{"title":"Estimation of All-Pass Transfer Functions for Delay Equalization based on Least-Squares Minimization","authors":"A. Perez-Loyola, R. Rosas-Romero","doi":"10.1109/CONIELECOMP.2006.30","DOIUrl":"https://doi.org/10.1109/CONIELECOMP.2006.30","url":null,"abstract":"In this paper, we present a generalized optimal stable all-pass digital filter design algorithm that supports (1) arbitrary phase response specifications, (2) a corrective system designed to make the phase delay of a magnitude-filter substantially constant over a desired frequency range, (3) estimation of the delay .. of the best performed equalizer, (4) stability, and (5) wavelet-based non-uniform sampling of the phase response of the magnitude-filter whose delay is to be equalized.","PeriodicalId":371526,"journal":{"name":"16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115692300","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}
Pub Date : 2006-02-27DOI: 10.1109/CONIELECOMP.2006.49
R. Salles, E. A. Santos
This work studies the implementation of Proportional Differentiated Services (PDS) under a routing perspective. Network nodes are simply modeled as priority queuing systems so that there is no need to use special scheduling algorithms on routers to enforce PDS. Instead, the routing function is the one responsible to distribute trafic loads in such a way to achieve PDS goals. Our proposal is based on standard Dijkstra 's algorithms and simulation results conJim a good peformance of our approach.
{"title":"Realizing Proportional DiffServ through the Routing Function","authors":"R. Salles, E. A. Santos","doi":"10.1109/CONIELECOMP.2006.49","DOIUrl":"https://doi.org/10.1109/CONIELECOMP.2006.49","url":null,"abstract":"This work studies the implementation of Proportional Differentiated Services (PDS) under a routing perspective. Network nodes are simply modeled as priority queuing systems so that there is no need to use special scheduling algorithms on routers to enforce PDS. Instead, the routing function is the one responsible to distribute trafic loads in such a way to achieve PDS goals. Our proposal is based on standard Dijkstra 's algorithms and simulation results conJim a good peformance of our approach.","PeriodicalId":371526,"journal":{"name":"16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123437787","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}
Pub Date : 2006-02-27DOI: 10.1109/CONIELECOMP.2006.27
M. Bazdresch, G. Rodriguez-Guisantes
In this paper, we propose and compare three algorithms based on Bell Labs’ vertical space-time codes (V-BLAST) and examine their block error rate and their algorithmic complexity for different combinations of block length and number of antennas. Of special interest are two algorithms that use least-squares techniques, specifically the QR decomposition, to substantially lower the complexity of the original V-BLAST. We present the algorithms in detail as well as simulation results and experimental results based on a high-performance digital signal processor. We show that the algorithm of choice depends on the number of antennas in the system, the block length L, and on whether the application at hand requires low-error rates or low-complexity.
{"title":"Decoding Vertical Space-Time Codes with Least-Squares Techniques","authors":"M. Bazdresch, G. Rodriguez-Guisantes","doi":"10.1109/CONIELECOMP.2006.27","DOIUrl":"https://doi.org/10.1109/CONIELECOMP.2006.27","url":null,"abstract":"In this paper, we propose and compare three algorithms based on Bell Labs’ vertical space-time codes (V-BLAST) and examine their block error rate and their algorithmic complexity for different combinations of block length and number of antennas. Of special interest are two algorithms that use least-squares techniques, specifically the QR decomposition, to substantially lower the complexity of the original V-BLAST. We present the algorithms in detail as well as simulation results and experimental results based on a high-performance digital signal processor. We show that the algorithm of choice depends on the number of antennas in the system, the block length L, and on whether the application at hand requires low-error rates or low-complexity.","PeriodicalId":371526,"journal":{"name":"16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125923500","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}
Pub Date : 2006-02-27DOI: 10.1109/CONIELECOMP.2006.57
María Beatríz Bernábe Loranca, R. Boone, R. Aguirre, J. E. Espinosa, Juan Oliveto, Gustavo Lafuente, L. Olsina
This work starts with results obtained in [4] where quality attributes to be considered in operative web projects were analyzed and evaluated, mainly for the "Functionality and Content" feature of sites and applications of electronic commerce (e-commerce). The evaluation process applied to sites from the studies of 2000 and 2004 [2,4] produced a concentrated binary matrix, which has been processed in previous works [3] with multivariate approaches that in turn have provided useful information that allowed the identification of a precise relationship between attributes. Aiming to obtain a group of quality attributes where it is possible to identify inter-relations or common features between the variables that compose each class, the binary table from the previous study has been revisited, and has been processed with statistical cluster analysis. Ultimately, hypothesis tests are proposed to infer the behavior of the population of Argentinean e-commerce sites.
{"title":"Study for Classification of Quality Attributes in Argentinean ECommerce Sites","authors":"María Beatríz Bernábe Loranca, R. Boone, R. Aguirre, J. E. Espinosa, Juan Oliveto, Gustavo Lafuente, L. Olsina","doi":"10.1109/CONIELECOMP.2006.57","DOIUrl":"https://doi.org/10.1109/CONIELECOMP.2006.57","url":null,"abstract":"This work starts with results obtained in [4] where quality attributes to be considered in operative web projects were analyzed and evaluated, mainly for the \"Functionality and Content\" feature of sites and applications of electronic commerce (e-commerce). The evaluation process applied to sites from the studies of 2000 and 2004 [2,4] produced a concentrated binary matrix, which has been processed in previous works [3] with multivariate approaches that in turn have provided useful information that allowed the identification of a precise relationship between attributes. Aiming to obtain a group of quality attributes where it is possible to identify inter-relations or common features between the variables that compose each class, the binary table from the previous study has been revisited, and has been processed with statistical cluster analysis. Ultimately, hypothesis tests are proposed to infer the behavior of the population of Argentinean e-commerce sites.","PeriodicalId":371526,"journal":{"name":"16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133422167","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}
Pub Date : 2006-02-27DOI: 10.1109/CONIELECOMP.2006.37
J. Pacheco, D. T. Román
Internet traffic shows variability in all time scales, which in turn shows statistical self-similarity. This selfsimilar behaviour has significant implications for QoS since it increments the total delay and packet loss rate. Therefore, we need to test for the degree of selfsimilarity and use this information for control purposes. For achieving the above-mentioned, the use of traces consisting of several thousands of points and hours of measurement are used. However, there are not enough studies about the number of points required to get an accurate estimation of the Hurst exponent. In this article, we study the local and cumulative behaviour of many real and synthetic self-similar traces. This is done for trying to infer the number of points required for Hurst parameter estimation and for checking dependence of Hurst exponents. We show that local analysis presents self-similarity, and the Hurst exponent tends to be stable in the cumulative case.
{"title":"Local and Cumulative Analysis of Self-similar Traffic Traces","authors":"J. Pacheco, D. T. Román","doi":"10.1109/CONIELECOMP.2006.37","DOIUrl":"https://doi.org/10.1109/CONIELECOMP.2006.37","url":null,"abstract":"Internet traffic shows variability in all time scales, which in turn shows statistical self-similarity. This selfsimilar behaviour has significant implications for QoS since it increments the total delay and packet loss rate. Therefore, we need to test for the degree of selfsimilarity and use this information for control purposes. For achieving the above-mentioned, the use of traces consisting of several thousands of points and hours of measurement are used. However, there are not enough studies about the number of points required to get an accurate estimation of the Hurst exponent. In this article, we study the local and cumulative behaviour of many real and synthetic self-similar traces. This is done for trying to infer the number of points required for Hurst parameter estimation and for checking dependence of Hurst exponents. We show that local analysis presents self-similarity, and the Hurst exponent tends to be stable in the cumulative case.","PeriodicalId":371526,"journal":{"name":"16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127863739","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}
Pub Date : 2006-02-27DOI: 10.1109/CONIELECOMP.2006.15
Andres Rivera-Ricardez, José Mariano Fernández Nava, P. B. Sánchez
In this paper, the analysis and simulation results of three kinds of single-stage power factor correctors (PFC) are presented. These PFC are based on the typical boost, buck-boost, and Cuk DC-DC converters. In order to achieve a near unity power factor, the PFC is operated in discontinuous current mode. A complete mathematical analysis for boost PFC is presented. Only the most important equations are presented for the other ones. The paper includes a comparison of voltage and current stresses at the switch for each PFC. Additionally, simulation results are presented to complete the work.
{"title":"Analysis and Simulation of Single-Stage Power Factor Correction Structures Based on DC-DC Converters","authors":"Andres Rivera-Ricardez, José Mariano Fernández Nava, P. B. Sánchez","doi":"10.1109/CONIELECOMP.2006.15","DOIUrl":"https://doi.org/10.1109/CONIELECOMP.2006.15","url":null,"abstract":"In this paper, the analysis and simulation results of three kinds of single-stage power factor correctors (PFC) are presented. These PFC are based on the typical boost, buck-boost, and Cuk DC-DC converters. In order to achieve a near unity power factor, the PFC is operated in discontinuous current mode. A complete mathematical analysis for boost PFC is presented. Only the most important equations are presented for the other ones. The paper includes a comparison of voltage and current stresses at the switch for each PFC. Additionally, simulation results are presented to complete the work.","PeriodicalId":371526,"journal":{"name":"16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117177092","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}
Pub Date : 2006-02-27DOI: 10.1109/CONIELECOMP.2006.6
Diana M. Selfa, Maya Carrillo, Ma. del Rocio Boone Rojas
MVC architecture has had wide acceptance for corporation software development. It plans to divide the system in three different layers that are in charge of interface control logic and data access, this facilitates the maintenance and evolution of systems according to the independence of the present classes in each layer. With the purpose of illustrating a successful application built under MVC, in this work we introduce different phases of analysis, design and implementation of a database and web application using UML. As central component of the application, it has a database made up by fifteen relations and a user interface supported by seventeen web pages.
{"title":"A Database and Web Application Based on MVC Architecture","authors":"Diana M. Selfa, Maya Carrillo, Ma. del Rocio Boone Rojas","doi":"10.1109/CONIELECOMP.2006.6","DOIUrl":"https://doi.org/10.1109/CONIELECOMP.2006.6","url":null,"abstract":"MVC architecture has had wide acceptance for corporation software development. It plans to divide the system in three different layers that are in charge of interface control logic and data access, this facilitates the maintenance and evolution of systems according to the independence of the present classes in each layer. With the purpose of illustrating a successful application built under MVC, in this work we introduce different phases of analysis, design and implementation of a database and web application using UML. As central component of the application, it has a database made up by fifteen relations and a user interface supported by seventeen web pages.","PeriodicalId":371526,"journal":{"name":"16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)","volume":"32 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123800158","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}
Pub Date : 2006-02-27DOI: 10.1109/CONIELECOMP.2006.48
Shweta N. Shah, N. Mansouri, A. Núñez-Aldana
Interconnect lengths have become a dominant factor in the design of integrated circuits. The parasitics associated with interconnects account for a significant part of the noise, delay and power associated with a signal. The estimation of interconnect lengths prior to placement helps in determining the performance of the circuit early in the design phase. Such estimations can provide circuit optimizations by re-ordering of logic blocks and thus reduce iterations between layout and synthesis. This paper presents a methodology to estimate the individual interconnect lengths in digital ICs, prior to layout. Estimations are from gate level netlist, and properties of a standard cell library. Various layouts have been studied to observe typical placement and routing patterns and these have been incorporated into our estimation methodology. Results obtained from the implementation of the methodology presented were compared with detailed routing wire lengths obtained after actual synthesis of the gate level netlist.
{"title":"Pre-Layout Estimation of Interconnect Lengths for Digital Integrated Circuits","authors":"Shweta N. Shah, N. Mansouri, A. Núñez-Aldana","doi":"10.1109/CONIELECOMP.2006.48","DOIUrl":"https://doi.org/10.1109/CONIELECOMP.2006.48","url":null,"abstract":"Interconnect lengths have become a dominant factor in the design of integrated circuits. The parasitics associated with interconnects account for a significant part of the noise, delay and power associated with a signal. The estimation of interconnect lengths prior to placement helps in determining the performance of the circuit early in the design phase. Such estimations can provide circuit optimizations by re-ordering of logic blocks and thus reduce iterations between layout and synthesis. This paper presents a methodology to estimate the individual interconnect lengths in digital ICs, prior to layout. Estimations are from gate level netlist, and properties of a standard cell library. Various layouts have been studied to observe typical placement and routing patterns and these have been incorporated into our estimation methodology. Results obtained from the implementation of the methodology presented were compared with detailed routing wire lengths obtained after actual synthesis of the gate level netlist.","PeriodicalId":371526,"journal":{"name":"16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128364382","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}
Pub Date : 2006-02-27DOI: 10.1109/CONIELECOMP.2006.44
J. Medina, L. García-Santander, M. Retamal, Rosa Figueroa Iturrieta
This paper presents the new method based on Genetic Algorithm (GA) to find the optimal route of the main communication line with multi-pair copper cable. The chromosomes representation used was the integer number. The objective function considered a minimization cost of generates routes keeping the minimum cost per subscriber value. The proposed method was proven with a real demand of subscribers located in a defined area using two tests, with or without Demand Factor (DF). The results obtained when applying the proposed method with or without DF allow us to conclude that the method is efficient and it gives coherent results according to the characteristics of the analyzed nets.
{"title":"Optimal Route in Distribution of Telecommunications Networks Based on Genetic Algorithm with Integer Chromosomes, a Practical Application","authors":"J. Medina, L. García-Santander, M. Retamal, Rosa Figueroa Iturrieta","doi":"10.1109/CONIELECOMP.2006.44","DOIUrl":"https://doi.org/10.1109/CONIELECOMP.2006.44","url":null,"abstract":"This paper presents the new method based on Genetic Algorithm (GA) to find the optimal route of the main communication line with multi-pair copper cable. The chromosomes representation used was the integer number. The objective function considered a minimization cost of generates routes keeping the minimum cost per subscriber value. The proposed method was proven with a real demand of subscribers located in a defined area using two tests, with or without Demand Factor (DF). The results obtained when applying the proposed method with or without DF allow us to conclude that the method is efficient and it gives coherent results according to the characteristics of the analyzed nets.","PeriodicalId":371526,"journal":{"name":"16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130511356","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：