Pub Date : 2008-04-07DOI: 10.1109/ICTTA.2008.4530240
S. Hussain, Y. Louét
High peak to average power ratio (PAPR) is a main area of concern in multi-carrier signals like orthogonal frequency division multiplexing (OFDM) modulated signals and substantial work has already been done on OFDM PAPR problem. Very little work has yet been done on software radio (SWR) signal's PAPR problem. The fact that SWR system is a combination of different standards, where each standard consists of multi-carrier signals makes SWR signal extremely power fluctuating and causes high PAPR. PAPR analysis of multi-carrier (MC)-GMSK, MC-QPSK and OFDM is carried out which are the modulation techniques for GSM, UMTS and WLAN standards respectively. It is revealed that each standard's signal follows Central limit theorem and thus has Gaussian distribution. SWR signal is then formed using these standards which also has Gaussian distribution. This result is important as it proves OFDM to be a special case of SWR system regarding PAPR issue as they both share the same PAPR distribution. And thus making already developed OFDM PAPR reduction techniques applicable to SWR signals.
{"title":"Peak to Average Power Ratio Analysis of Multi-carrier and Multi-standard Signals in Software Radio Context","authors":"S. Hussain, Y. Louét","doi":"10.1109/ICTTA.2008.4530240","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4530240","url":null,"abstract":"High peak to average power ratio (PAPR) is a main area of concern in multi-carrier signals like orthogonal frequency division multiplexing (OFDM) modulated signals and substantial work has already been done on OFDM PAPR problem. Very little work has yet been done on software radio (SWR) signal's PAPR problem. The fact that SWR system is a combination of different standards, where each standard consists of multi-carrier signals makes SWR signal extremely power fluctuating and causes high PAPR. PAPR analysis of multi-carrier (MC)-GMSK, MC-QPSK and OFDM is carried out which are the modulation techniques for GSM, UMTS and WLAN standards respectively. It is revealed that each standard's signal follows Central limit theorem and thus has Gaussian distribution. SWR signal is then formed using these standards which also has Gaussian distribution. This result is important as it proves OFDM to be a special case of SWR system regarding PAPR issue as they both share the same PAPR distribution. And thus making already developed OFDM PAPR reduction techniques applicable to SWR signals.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124361032","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 : 2008-04-07DOI: 10.1109/ICTTA.2008.4530166
M. Baldi, F. Chiaraluce, E. Zanaj
We consider a particular class of ad-hoc sensor networks, in which information must be exchanged among nodes in order the value at each node to converge to the average of the sensed quantity. Several algorithms have been proposed to accomplish this task, based on the gossip principle. Gossip is an epidemic protocol, in which nodes iteratively contact one or more neighbors in order to spread their own information throughout the network. Such algorithms have been already investigated from the theoretical viewpoint, but scarcely assessed in practical scenarios. We consider the model of a real network, with the position of each node chosen at random on a two-dimensional map, and apply different kinds of averaging algorithms in such practical case. We assess their performance through numerical simulations, and compare them in terms of convergence speed and complexity.
{"title":"Comparison of Averaging Algorithms for Wireless Sensor Networks","authors":"M. Baldi, F. Chiaraluce, E. Zanaj","doi":"10.1109/ICTTA.2008.4530166","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4530166","url":null,"abstract":"We consider a particular class of ad-hoc sensor networks, in which information must be exchanged among nodes in order the value at each node to converge to the average of the sensed quantity. Several algorithms have been proposed to accomplish this task, based on the gossip principle. Gossip is an epidemic protocol, in which nodes iteratively contact one or more neighbors in order to spread their own information throughout the network. Such algorithms have been already investigated from the theoretical viewpoint, but scarcely assessed in practical scenarios. We consider the model of a real network, with the position of each node chosen at random on a two-dimensional map, and apply different kinds of averaging algorithms in such practical case. We assess their performance through numerical simulations, and compare them in terms of convergence speed and complexity.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124477217","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 : 2008-04-07DOI: 10.1109/ICTTA.2008.4530094
C. Perrine, C. Chatellier, Shan Wang, Christian Olivier
This paper presents a joint source channel coding designed for video transmission application. The aim is to improve the visual quality of the reconstructed video even when transmission errors occur while keeping the processing as simple as possible. The BER excepted is higher than 10-4. This coding is based on an association of a wavelet transform (WT) and a vector quantization (VQ) optimally mapped on a QAM-M modulation. The whole of the transmission chain is jointly exploited in order to make it well-adapted to the complex and low data rate channel.
{"title":"A joint source channel coding strategy for video transmission","authors":"C. Perrine, C. Chatellier, Shan Wang, Christian Olivier","doi":"10.1109/ICTTA.2008.4530094","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4530094","url":null,"abstract":"This paper presents a joint source channel coding designed for video transmission application. The aim is to improve the visual quality of the reconstructed video even when transmission errors occur while keeping the processing as simple as possible. The BER excepted is higher than 10-4. This coding is based on an association of a wavelet transform (WT) and a vector quantization (VQ) optimally mapped on a QAM-M modulation. The whole of the transmission chain is jointly exploited in order to make it well-adapted to the complex and low data rate channel.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125645382","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 : 2008-04-07DOI: 10.1109/ICTTA.2008.4529959
S. Taghipour, M. Meybodi, A. Taghipour
The Global Positioning System is the most popular choice for positioning in car navigation systems. But in real life, the various noise sources affecting the signals and the instrumentation used by the positioning system, along with the map inaccuracies, result in the estimated position not necessarily being overlaid onto the road network. The process of mapping the output from the positioning system on to the road network is called map matching. In a recent study, a map matching algorithms that work based on weight factor has been verified then a new map matching algorithm based on is proposed. The proposed algorithm is a modified version of one of the topological map matching algorithms called Quddus's algorithm In order to show the effectiveness of the proposed algorithm, it is tested on the city map Arak and then the result is compared with the result obtained for Quddus's algorithm. In this paper, Correct mapping the output from GPS on the road network parameters is our purpose. The input to the system comes from Gps receiver (Gpsmap 76CS) and Arak map database. In this paper, the results show that the proposed algorithms can be effectively used to map matching.
{"title":"An Algorithm for Map Matching For Car Navigation System","authors":"S. Taghipour, M. Meybodi, A. Taghipour","doi":"10.1109/ICTTA.2008.4529959","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4529959","url":null,"abstract":"The Global Positioning System is the most popular choice for positioning in car navigation systems. But in real life, the various noise sources affecting the signals and the instrumentation used by the positioning system, along with the map inaccuracies, result in the estimated position not necessarily being overlaid onto the road network. The process of mapping the output from the positioning system on to the road network is called map matching. In a recent study, a map matching algorithms that work based on weight factor has been verified then a new map matching algorithm based on is proposed. The proposed algorithm is a modified version of one of the topological map matching algorithms called Quddus's algorithm In order to show the effectiveness of the proposed algorithm, it is tested on the city map Arak and then the result is compared with the result obtained for Quddus's algorithm. In this paper, Correct mapping the output from GPS on the road network parameters is our purpose. The input to the system comes from Gps receiver (Gpsmap 76CS) and Arak map database. In this paper, the results show that the proposed algorithms can be effectively used to map matching.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131365570","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 : 2008-04-07DOI: 10.1109/ICTTA.2008.4530102
Azze-eddine Maredj, T. Nourreddine, Madjid Sadallah, Z. Alimazighi
In the multimedia documents authoring systems the management of spatial and temporal inter-objects relations is the most delicate task. Spatial relations management refers to the appropriate means to express relations between the document objects and guarantee their consistency. Usually it is represented by spatial model which performances depend on its expressivity degree, on its positioning precision and on the ability to express a desired overlap. One of the most important factor that affects performances is the distance associated to the relations. To enhance the expressivity and precision degrees and to allow the specification of desired overlap, we introduce, in this paper, the flexible distance concept.
{"title":"A flexible distance for the spatial placement in a multimedia document","authors":"Azze-eddine Maredj, T. Nourreddine, Madjid Sadallah, Z. Alimazighi","doi":"10.1109/ICTTA.2008.4530102","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4530102","url":null,"abstract":"In the multimedia documents authoring systems the management of spatial and temporal inter-objects relations is the most delicate task. Spatial relations management refers to the appropriate means to express relations between the document objects and guarantee their consistency. Usually it is represented by spatial model which performances depend on its expressivity degree, on its positioning precision and on the ability to express a desired overlap. One of the most important factor that affects performances is the distance associated to the relations. To enhance the expressivity and precision degrees and to allow the specification of desired overlap, we introduce, in this paper, the flexible distance concept.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130111743","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 : 2008-04-07DOI: 10.1109/ICTTA.2008.4530268
MuhammadSalman Yousuf, Syed Z. Rizvi, Mustafa El-Shafei
Following up on our previous work, power line communications: An Overview - Part I, we discuss the standards involved in PLC technology and name the established standards. We then concentrate on the HomePlug standard in detail. Our prime focus is on these standards: HomePlug 1.0 and HomePlug AV as these have become the basis for the world's most widely deployed PLC systems. An overview of the HomePlug standards is presented which discusses the technology in the Physical and MAC layers. It also discusses the QoS issues and compares the performance of HomePlug AV with HomePlug 1.0.
{"title":"Power Line Communications: An Overview - Part II","authors":"MuhammadSalman Yousuf, Syed Z. Rizvi, Mustafa El-Shafei","doi":"10.1109/ICTTA.2008.4530268","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4530268","url":null,"abstract":"Following up on our previous work, power line communications: An Overview - Part I, we discuss the standards involved in PLC technology and name the established standards. We then concentrate on the HomePlug standard in detail. Our prime focus is on these standards: HomePlug 1.0 and HomePlug AV as these have become the basis for the world's most widely deployed PLC systems. An overview of the HomePlug standards is presented which discusses the technology in the Physical and MAC layers. It also discusses the QoS issues and compares the performance of HomePlug AV with HomePlug 1.0.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130267423","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 : 2008-04-07DOI: 10.1109/ICTTA.2008.4530123
M. Dabbah, S. Dlay, W. L. Woo
Without sufficient protection during the entire authentication procedure, biometrics cannot supersede traditional authentication methods. In this paper a new method of cancellable biometric transformation is presented. Random finite spaces are utilized to map the original facial biometrics into a secure domain, in which authentication can be accurately performed using PCA. Each face is mapped up using independent random spaces to generate a secure (cancellable) template. Replacing the previous random spaces results in a new cancellable template, this is issued from the same original image. Evaluation has shown significant accuracy and security improvements. Genuine and impostor distributions separation has been improved by 203.78%, leading to a 99.94% success rate, which also means that the error rate has been improved by 99.53%. The cancellable templates do not carry any visual information.
{"title":"PCA Authentication of Facial Biometric in the Secure Randomized Mapping Domain","authors":"M. Dabbah, S. Dlay, W. L. Woo","doi":"10.1109/ICTTA.2008.4530123","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4530123","url":null,"abstract":"Without sufficient protection during the entire authentication procedure, biometrics cannot supersede traditional authentication methods. In this paper a new method of cancellable biometric transformation is presented. Random finite spaces are utilized to map the original facial biometrics into a secure domain, in which authentication can be accurately performed using PCA. Each face is mapped up using independent random spaces to generate a secure (cancellable) template. Replacing the previous random spaces results in a new cancellable template, this is issued from the same original image. Evaluation has shown significant accuracy and security improvements. Genuine and impostor distributions separation has been improved by 203.78%, leading to a 99.94% success rate, which also means that the error rate has been improved by 99.53%. The cancellable templates do not carry any visual information.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134139234","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 : 2008-04-07DOI: 10.1109/ICTTA.2008.4530049
Bin Gao, W. L. Woo, S. Dlay
This paper proposes a novel technique for separating single channel recording of speech mixture using a hybrid of maximum likelihood and maximum a posteriori estimators. In addition, the new algorithm proposes a new approach that accounts for the time structure of the source signals by encoding them into a set of basis filters that are characteristically the most significant. Real time testing of the new algorithm has been conducted and the obtained results are very encouraging.
{"title":"Single Channel Blind Source Separation using the Best Characteristic Basis","authors":"Bin Gao, W. L. Woo, S. Dlay","doi":"10.1109/ICTTA.2008.4530049","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4530049","url":null,"abstract":"This paper proposes a novel technique for separating single channel recording of speech mixture using a hybrid of maximum likelihood and maximum a posteriori estimators. In addition, the new algorithm proposes a new approach that accounts for the time structure of the source signals by encoding them into a set of basis filters that are characteristically the most significant. Real time testing of the new algorithm has been conducted and the obtained results are very encouraging.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134354901","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 : 2008-04-07DOI: 10.1109/ICTTA.2008.4529972
R. Shahin, L. Barakat, S. Mahmoud, M. Alkassar
This paper presents an approach to dynamically assemble a whole course from the existing learning objects. An individual course is generated to meet particular learning goals and is adapted to the students' previous knowledge and preferences. The presentation of the course content is done according to a proper instructional theory. A SCORM content package is generated for the course to enable delivering it by any learning management system compatible with the SCORM standard.
{"title":"Dynamic Generation of Adaptive Courses","authors":"R. Shahin, L. Barakat, S. Mahmoud, M. Alkassar","doi":"10.1109/ICTTA.2008.4529972","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4529972","url":null,"abstract":"This paper presents an approach to dynamically assemble a whole course from the existing learning objects. An individual course is generated to meet particular learning goals and is adapted to the students' previous knowledge and preferences. The presentation of the course content is done according to a proper instructional theory. A SCORM content package is generated for the course to enable delivering it by any learning management system compatible with the SCORM standard.","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134408850","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 : 2008-04-07DOI: 10.1109/ICTTA.2008.4530111
Ayman Alfalou, Mona Farhat, Ali Mansour
Biometric security systems such as Retina scanner, fingerprint and face recognition among others are the most recently developed security systems. The latest systems can be found in various situations (police checkpoints, airport facilities, ... ). As they become widely used and requested, an increasing number of researchers are working in this field. In this paper, we propose a new Biometric Recognition method based on Independent Component Analysis technique "ICA".
{"title":"Independent Component Analysis Based Approach to Biometric Recognition","authors":"Ayman Alfalou, Mona Farhat, Ali Mansour","doi":"10.1109/ICTTA.2008.4530111","DOIUrl":"https://doi.org/10.1109/ICTTA.2008.4530111","url":null,"abstract":"Biometric security systems such as Retina scanner, fingerprint and face recognition among others are the most recently developed security systems. The latest systems can be found in various situations (police checkpoints, airport facilities, ... ). As they become widely used and requested, an increasing number of researchers are working in this field. In this paper, we propose a new Biometric Recognition method based on Independent Component Analysis technique \"ICA\".","PeriodicalId":330215,"journal":{"name":"2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications","volume":"48 13","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131605087","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
扫码关注我们
求助内容：
应助结果提醒方式：