Pub Date : 2011-10-13DOI: 10.1109/TSP.2011.6043771
J. Rozhon, M. Voznák
This paper deals with new proposal of a speech quality monitoring tool based on the perceptual evaluation of speech quality in accordance with ITU-T P.862 and its application in a research project investigating an impact of meteorological conditions on the speech quality in a GSM network. Every time we make a call using the GSM network the speech quality differs. This is mainly caused by the numerous factors influencing the wireless communication between the user's cell phone and the GSM base station such as weather, user's current speed or location. The latter two aspects have been thoroughly measured and discussed, therefore almost anyone can determine with ease what the attenuation of the signal is for example in the building or how the signal is distorted due to the switching between base stations caused by the user's movement. On the other hand the correlation between speech quality in the GSM network and the current weather situation has not yet been measured nor estimated. This paper tries to deal with this gap and presents one of the possible solutions to perform speech quality measurement in the GSM network using open source Asterisk PBX.
{"title":"Development of a speech quality monitoring tool based on ITU-T P.862","authors":"J. Rozhon, M. Voznák","doi":"10.1109/TSP.2011.6043771","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043771","url":null,"abstract":"This paper deals with new proposal of a speech quality monitoring tool based on the perceptual evaluation of speech quality in accordance with ITU-T P.862 and its application in a research project investigating an impact of meteorological conditions on the speech quality in a GSM network. Every time we make a call using the GSM network the speech quality differs. This is mainly caused by the numerous factors influencing the wireless communication between the user's cell phone and the GSM base station such as weather, user's current speed or location. The latter two aspects have been thoroughly measured and discussed, therefore almost anyone can determine with ease what the attenuation of the signal is for example in the building or how the signal is distorted due to the switching between base stations caused by the user's movement. On the other hand the correlation between speech quality in the GSM network and the current weather situation has not yet been measured nor estimated. This paper tries to deal with this gap and presents one of the possible solutions to perform speech quality measurement in the GSM network using open source Asterisk PBX.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"225 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115560345","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 : 2011-10-13DOI: 10.1109/TSP.2011.6043742
P. Mlynek, J. Misurec, M. Koutny, O. Dostál
The article deals with the delay of medical data in queues, caused by a bottleneck in the network. Primarily it focuses on the mathematical basis for defining the entrance traffic based on exponential distribution in the Network simulator and next it describes the possibility of calculating the delay from the trace file. Another alternative for the entrance traffic is also loading the input data from a file. In the simulation part a model of input medical imaging data is implemented, and simulations are performed on a network with a bottleneck, when the delay is measurement for different combinations of active input medical imaging sources.
{"title":"Medical traffic modeling for delay measurement in bottleneck network","authors":"P. Mlynek, J. Misurec, M. Koutny, O. Dostál","doi":"10.1109/TSP.2011.6043742","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043742","url":null,"abstract":"The article deals with the delay of medical data in queues, caused by a bottleneck in the network. Primarily it focuses on the mathematical basis for defining the entrance traffic based on exponential distribution in the Network simulator and next it describes the possibility of calculating the delay from the trace file. Another alternative for the entrance traffic is also loading the input data from a file. In the simulation part a model of input medical imaging data is implemented, and simulations are performed on a network with a bottleneck, when the delay is measurement for different combinations of active input medical imaging sources.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114900640","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 : 2011-10-13DOI: 10.1109/TSP.2011.6043680
Merve Abide Demir, A. Özen
A novel variable step size constant modulus algorithm (VSS-CMA) based on autocorrelation of error signal has been proposed to improve the weakness of previous VSS-CMAs for application to blind equalization in this paper. Computer simulations have been performed to illustrate the performance of the proposed method in frequency selective Rayleigh fading channels. The obtained simulation results using WiMAX (IEEE 802.16–2004) radio standard have demonstrated that the proposed VSS-CMA algorithm has considerably better performance than conventional CMA, normalized CMA (N-CMA) and the other VSS-CMA algorithms.
{"title":"A novel variable step size constant modulus algorithm based on autocorrelation of error signal for blind equalization","authors":"Merve Abide Demir, A. Özen","doi":"10.1109/TSP.2011.6043680","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043680","url":null,"abstract":"A novel variable step size constant modulus algorithm (VSS-CMA) based on autocorrelation of error signal has been proposed to improve the weakness of previous VSS-CMAs for application to blind equalization in this paper. Computer simulations have been performed to illustrate the performance of the proposed method in frequency selective Rayleigh fading channels. The obtained simulation results using WiMAX (IEEE 802.16–2004) radio standard have demonstrated that the proposed VSS-CMA algorithm has considerably better performance than conventional CMA, normalized CMA (N-CMA) and the other VSS-CMA algorithms.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129442302","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 : 2011-10-13DOI: 10.1109/TSP.2011.6043661
P. Cika, M. Zukal, M. Sebela
License plate detection and recognition is one of the most important aspects of applying computer techniques towards intelligent transportation systems. Detecting the accurate location of a license plate from a vehicle image is the most crucial step of a license plate detection system. This paper describes a proposing of a new region-based license plate detection method based on a symbol analysis. Throughout the detection and recognition the original image is filtered, transformed to gray-scale image and thresholded. In the next step the best candidates of regions are selected. The whole system was tested on fifty different cars with various license plates. The indication rate of success recognition is eighty eight percent.
{"title":"Vehicle license plate detection and recognition using symbol analysis","authors":"P. Cika, M. Zukal, M. Sebela","doi":"10.1109/TSP.2011.6043661","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043661","url":null,"abstract":"License plate detection and recognition is one of the most important aspects of applying computer techniques towards intelligent transportation systems. Detecting the accurate location of a license plate from a vehicle image is the most crucial step of a license plate detection system. This paper describes a proposing of a new region-based license plate detection method based on a symbol analysis. Throughout the detection and recognition the original image is filtered, transformed to gray-scale image and thresholded. In the next step the best candidates of regions are selected. The whole system was tested on fifty different cars with various license plates. The indication rate of success recognition is eighty eight percent.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129319241","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 : 2011-10-13DOI: 10.1109/TSP.2011.6043769
S. B. Rakas, M. Stojanović
This paper addresses the problem of service specification and mapping across providers, supposing centralized approach, via the third party agent that manages negotiation process in a group of domains. A general structure of the service specification form is suggested. It contains technical parameters related with a particular service request. Based on such general form, we further propose, implement and evaluate an efficient algorithm for service class selection. The algorithm selects the most appropriate class for each domain by determining the closest conformance between the required and offered service level.
{"title":"An efficient QoS mapping algorithm in multi-provider networks","authors":"S. B. Rakas, M. Stojanović","doi":"10.1109/TSP.2011.6043769","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043769","url":null,"abstract":"This paper addresses the problem of service specification and mapping across providers, supposing centralized approach, via the third party agent that manages negotiation process in a group of domains. A general structure of the service specification form is suggested. It contains technical parameters related with a particular service request. Based on such general form, we further propose, implement and evaluate an efficient algorithm for service class selection. The algorithm selects the most appropriate class for each domain by determining the closest conformance between the required and offered service level.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127447565","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 : 2011-10-13DOI: 10.1109/TSP.2011.6043737
Ondrej Krajsa, Lucie Fojtova
In recent years, more and more network applications appear to require an accurate knowledge of the Internet station geographical positions in order to operate properly. Real geo-position could play a part in many location-based applications. A typical example is the requirement by the web server owners to be able to find out their websites visitors' geographical position more accurately, than the national level. Thus, the underlying geolocation algorithms are being developed. Most of them use the RTT (round-trip-time) values measurement, whose results are then mapped onto geographical distances. This paper deals with the dependence of RTT on the geographic distance. All the measurements needed for dependence determination took place in a dynamically growing Planetlab network, which tries to simulate real Internet environment. The result of this work is a set of RTT values measured in real IP networks and their brief analysis.
{"title":"RTT measurement and its dependence on the real geographical distance","authors":"Ondrej Krajsa, Lucie Fojtova","doi":"10.1109/TSP.2011.6043737","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043737","url":null,"abstract":"In recent years, more and more network applications appear to require an accurate knowledge of the Internet station geographical positions in order to operate properly. Real geo-position could play a part in many location-based applications. A typical example is the requirement by the web server owners to be able to find out their websites visitors' geographical position more accurately, than the national level. Thus, the underlying geolocation algorithms are being developed. Most of them use the RTT (round-trip-time) values measurement, whose results are then mapped onto geographical distances. This paper deals with the dependence of RTT on the geographic distance. All the measurements needed for dependence determination took place in a dynamically growing Planetlab network, which tries to simulate real Internet environment. The result of this work is a set of RTT values measured in real IP networks and their brief analysis.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130769184","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 : 2011-10-13DOI: 10.1109/TSP.2011.6043766
S. Aleksic, K. Aziz
We present architecture of a large optical packet/burst switch comprising a number of smaller switching fabrics that are interconnected by internal fiber links. The switching fabrics are based on the broadcast-and-select architecture, while the internal interconnection network is a full mesh. An extensive study on physical and switch performance has been performed and results concerning scalability, packet/burst loss rate and throughput for four scheduling algorithms are shown.
{"title":"Large optical packet/burst switch with internal fiber interconnections","authors":"S. Aleksic, K. Aziz","doi":"10.1109/TSP.2011.6043766","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043766","url":null,"abstract":"We present architecture of a large optical packet/burst switch comprising a number of smaller switching fabrics that are interconnected by internal fiber links. The switching fabrics are based on the broadcast-and-select architecture, while the internal interconnection network is a full mesh. An extensive study on physical and switch performance has been performed and results concerning scalability, packet/burst loss rate and throughput for four scheduling algorithms are shown.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132168280","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 : 2011-10-13DOI: 10.1109/TSP.2011.6043694
A. Campeanu, J. Gal
A new Kalman carrier synchronization algorithm is developed for high-order QAM modulated signals which shows fast acquisition times and good frequency tracking performances. The proposed solution relies on a decision directed extended Kalman filter combined with a lock detector which determines the status of the synchronization process, modifying consequently the filter parameters. Simulation results show that, compared to the performance of a basic Kalman synchronization system, a tenfold improvement or better is achieved in terms of acquisition speed, while keeping a low residual phase noise.
{"title":"High-order QAM fast carrier synchronization by an adaptive decision-directed EKF algorithm","authors":"A. Campeanu, J. Gal","doi":"10.1109/TSP.2011.6043694","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043694","url":null,"abstract":"A new Kalman carrier synchronization algorithm is developed for high-order QAM modulated signals which shows fast acquisition times and good frequency tracking performances. The proposed solution relies on a decision directed extended Kalman filter combined with a lock detector which determines the status of the synchronization process, modifying consequently the filter parameters. Simulation results show that, compared to the performance of a basic Kalman synchronization system, a tenfold improvement or better is achieved in terms of acquisition speed, while keeping a low residual phase noise.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123794109","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 : 2011-10-13DOI: 10.1109/TSP.2011.6043760
H. Balta, M. Kovaci, Alexandria Isar, M. Nafornita, M. Balta
This paper presents the results obtained in a second algorithmic step of the design of Duo Binary Turbo Codes (DBTCs). The design as a whole is based on an exhaustive search on the code-interleaver pairs having as selection criterion the convergence of the iterative decoding process. The first step of this search establishes a hierarchy of the recursive systematic duo-binary convolutional (RSDBC) codes with memory 2, 3, 4 and 5. The second step consists in searching the interlevears set individually for each of the best codes found previously. In this paper the obtained results for the 16-state DBTCs are presented. The permutations considered in this paper correspond at two of the most efficient types of interleavers: Almost Regular Permutations (ARP) and Quadratic Polynomial Permutations (QPP). The Bit and the Frame Error Rate (BER/FER) performances obtained in this paper with the best code-interleaver pairs are superior to those already reported in literature.
{"title":"ARP and QPP interleaves selection based on the convergence of iterative decoding process for the construction of 16-state Duo Binary Turbo Codes","authors":"H. Balta, M. Kovaci, Alexandria Isar, M. Nafornita, M. Balta","doi":"10.1109/TSP.2011.6043760","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043760","url":null,"abstract":"This paper presents the results obtained in a second algorithmic step of the design of Duo Binary Turbo Codes (DBTCs). The design as a whole is based on an exhaustive search on the code-interleaver pairs having as selection criterion the convergence of the iterative decoding process. The first step of this search establishes a hierarchy of the recursive systematic duo-binary convolutional (RSDBC) codes with memory 2, 3, 4 and 5. The second step consists in searching the interlevears set individually for each of the best codes found previously. In this paper the obtained results for the 16-state DBTCs are presented. The permutations considered in this paper correspond at two of the most efficient types of interleavers: Almost Regular Permutations (ARP) and Quadratic Polynomial Permutations (QPP). The Bit and the Frame Error Rate (BER/FER) performances obtained in this paper with the best code-interleaver pairs are superior to those already reported in literature.","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"257 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121268307","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 : 2011-10-13DOI: 10.1109/TSP.2011.6043780
Shuhei Terada, Yusuke Enomoto, D. Hanawa, K. Oguchi
ICT and MEMS technology are becoming mature enough to raise interest in wearable sensors for creating various sensor-based services. This paper introduces a gait authentication method, a kind of biometric authentication, based on wearable sensors. Gait movement is both unique and unavoidable in everyday life. The pattern of acceleration values created by walking differs from one person to another. Therefore, we expect various new services can be created based on the gait data obtained by wearable sensors on a daily basis. We capture gait data from a wearable sensor and analyze personal gait characteristics on the basis of the data obtained. Each subject placed a wearable sensor on the ankle of the right foot. We propose and evaluate an authentication algorithm. The authentication algorithm must converge on the attributes that allow for reliable discrimination. Therefore, our authentication algorithm uses the traveling acceleration at the swing phase. Results confirm that setting the threshold value to 1700 yielded EER of 20%
{"title":"Performance of gait authentication using an acceleration sensor","authors":"Shuhei Terada, Yusuke Enomoto, D. Hanawa, K. Oguchi","doi":"10.1109/TSP.2011.6043780","DOIUrl":"https://doi.org/10.1109/TSP.2011.6043780","url":null,"abstract":"ICT and MEMS technology are becoming mature enough to raise interest in wearable sensors for creating various sensor-based services. This paper introduces a gait authentication method, a kind of biometric authentication, based on wearable sensors. Gait movement is both unique and unavoidable in everyday life. The pattern of acceleration values created by walking differs from one person to another. Therefore, we expect various new services can be created based on the gait data obtained by wearable sensors on a daily basis. We capture gait data from a wearable sensor and analyze personal gait characteristics on the basis of the data obtained. Each subject placed a wearable sensor on the ankle of the right foot. We propose and evaluate an authentication algorithm. The authentication algorithm must converge on the attributes that allow for reliable discrimination. Therefore, our authentication algorithm uses the traveling acceleration at the swing phase. Results confirm that setting the threshold value to 1700 yielded EER of 20%","PeriodicalId":341695,"journal":{"name":"2011 34th International Conference on Telecommunications and Signal Processing (TSP)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114601439","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
扫码关注我们
求助内容：
应助结果提醒方式：