Pub Date : 2006-03-20DOI: 10.1109/IEEEGCC.2006.5686197
J. J. Ahmed, Hadeel Adnan, Y. Xiaohu
In this paper, we describe the concatenation of Turbo/Convolutional codes with transmit and receive diversity schemes by using Space-Time Block Code. It is shown that, by using two transmit antennas and one/or two receive antenna, large coding gain for the bit error rate is achieved over the system without diversity. Simulation results show that, by using systems with transmit and receive diversity, high gain can be achieved with very low complexity. It turns out that at BER = 10-4, the gain of 9 dB can be achieved for system using STTD transmit diversity only (without using any channel codes) and 2 dB gain can be achieved over channel coding systems using hard-decision decoding with much lower complexity. The most important conclusion is that, using soft-decision decoding systems enhanced with transmit diversity can provide very high coding gain; e.g., in convolutional coded system using soft-decision Viterbi decoder, the coding gain is 12 dB over uncoded system and 5 dB over hard-decision decoding in flat fading channel, while the coding gain is about 13 dB for turbo coded systems using soft-decision decoding based on SOVA algorithm with transmit diversity and the coding gain is 15 dB if the decoder is based on Log-MAP algorithm. In systems using transmit and receive diversity, the coding gain is much higher, e.g., for convolutional-coded systems, the coding gain is 20 dB, while for turbo-coded systems using SOVA and Log-MAP algorithms, the coding gain are a little more than 20 dB and 21 dB, respectively.
{"title":"Soft-decision decoding of systems with Tx/Rx diversity","authors":"J. J. Ahmed, Hadeel Adnan, Y. Xiaohu","doi":"10.1109/IEEEGCC.2006.5686197","DOIUrl":"https://doi.org/10.1109/IEEEGCC.2006.5686197","url":null,"abstract":"In this paper, we describe the concatenation of Turbo/Convolutional codes with transmit and receive diversity schemes by using Space-Time Block Code. It is shown that, by using two transmit antennas and one/or two receive antenna, large coding gain for the bit error rate is achieved over the system without diversity. Simulation results show that, by using systems with transmit and receive diversity, high gain can be achieved with very low complexity. It turns out that at BER = 10-4, the gain of 9 dB can be achieved for system using STTD transmit diversity only (without using any channel codes) and 2 dB gain can be achieved over channel coding systems using hard-decision decoding with much lower complexity. The most important conclusion is that, using soft-decision decoding systems enhanced with transmit diversity can provide very high coding gain; e.g., in convolutional coded system using soft-decision Viterbi decoder, the coding gain is 12 dB over uncoded system and 5 dB over hard-decision decoding in flat fading channel, while the coding gain is about 13 dB for turbo coded systems using soft-decision decoding based on SOVA algorithm with transmit diversity and the coding gain is 15 dB if the decoder is based on Log-MAP algorithm. In systems using transmit and receive diversity, the coding gain is much higher, e.g., for convolutional-coded systems, the coding gain is 20 dB, while for turbo-coded systems using SOVA and Log-MAP algorithms, the coding gain are a little more than 20 dB and 21 dB, respectively.","PeriodicalId":433452,"journal":{"name":"2006 IEEE GCC Conference (GCC)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125118234","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-03-20DOI: 10.1109/IEEEGCC.2006.5686174
M. Boughazi, B. Boulebtateche, M. Bedda, N. Bonnet
In this paper, we propose an efficient direct method that estimates pure translation motion parameters in dynamic scenes. We develop an algorithm that computes, directly, phase information in Fourier domain. The computations are locally performed and limited to small patches of the image. The local measurement of motion parameters are then combined in a more global interpretation by using parametric images. We demonstrate the performance of our algorithm on synthetic and real image sequences and compare our results with those of two other algorithms based on the Hough transform and the inverse Fourier transform.
{"title":"A direct frequency-based phase algorithm for motion estimation","authors":"M. Boughazi, B. Boulebtateche, M. Bedda, N. Bonnet","doi":"10.1109/IEEEGCC.2006.5686174","DOIUrl":"https://doi.org/10.1109/IEEEGCC.2006.5686174","url":null,"abstract":"In this paper, we propose an efficient direct method that estimates pure translation motion parameters in dynamic scenes. We develop an algorithm that computes, directly, phase information in Fourier domain. The computations are locally performed and limited to small patches of the image. The local measurement of motion parameters are then combined in a more global interpretation by using parametric images. We demonstrate the performance of our algorithm on synthetic and real image sequences and compare our results with those of two other algorithms based on the Hough transform and the inverse Fourier transform.","PeriodicalId":433452,"journal":{"name":"2006 IEEE GCC Conference (GCC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128416549","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-03-20DOI: 10.1109/IEEEGCC.2006.5686191
Z. A. Mohamad, Z. O. Mazin, B. A. Baker
This paper presents an algorithm to solve the inverse kinematics problem for a complex wrist structure six degree of freedom (6DOF) robotic manipulator. The last three rotating axes do not intersect at one point and there are off axes in its coordinate frames. The proposed algorithm based on the rotation vector concept, which is also used to describe the orientation of manipulator end-effector. All the possible solutions of the inverse kinematics problem can be obtained by using the proposed algorithm which is tested practically on the MA2000 robotic manipulator.
{"title":"An algorithm to solve the inverse kinematics problem of a robotic manipulator based on rotation vectors","authors":"Z. A. Mohamad, Z. O. Mazin, B. A. Baker","doi":"10.1109/IEEEGCC.2006.5686191","DOIUrl":"https://doi.org/10.1109/IEEEGCC.2006.5686191","url":null,"abstract":"This paper presents an algorithm to solve the inverse kinematics problem for a complex wrist structure six degree of freedom (6DOF) robotic manipulator. The last three rotating axes do not intersect at one point and there are off axes in its coordinate frames. The proposed algorithm based on the rotation vector concept, which is also used to describe the orientation of manipulator end-effector. All the possible solutions of the inverse kinematics problem can be obtained by using the proposed algorithm which is tested practically on the MA2000 robotic manipulator.","PeriodicalId":433452,"journal":{"name":"2006 IEEE GCC Conference (GCC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123474698","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-03-20DOI: 10.1109/IEEEGCC.2006.5686176
M. Khalaj‐Amirhosseini
It is shown that the efficiency of an arbitrary previously designed interconnect can be increased using a suitable compensating circuit at its far end. A lossless lowpass circuit is considered for this purpose and its element values can be obtained by an optimization method. The proposed idea is evaluated using an example.
{"title":"Increasing the efficiency of interconnects using a compensating circuit","authors":"M. Khalaj‐Amirhosseini","doi":"10.1109/IEEEGCC.2006.5686176","DOIUrl":"https://doi.org/10.1109/IEEEGCC.2006.5686176","url":null,"abstract":"It is shown that the efficiency of an arbitrary previously designed interconnect can be increased using a suitable compensating circuit at its far end. A lossless lowpass circuit is considered for this purpose and its element values can be obtained by an optimization method. The proposed idea is evaluated using an example.","PeriodicalId":433452,"journal":{"name":"2006 IEEE GCC Conference (GCC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121760047","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-03-20DOI: 10.1109/IEEEGCC.2006.5686189
E. Hassan, H. Ragheb
The radiation patterns of perturbed two dimensional parabolic reflector fed by a slotted circular cylindrical waveguide for both the TE and the TM modes are examined. The analysis is carried out using Green's function second identity in conjunction with the Moment Method. Results show that the perturbed geometry achieves various degrees of improvements in most antenna's characteristics over the plain parabolic reflector.
{"title":"Effect of geometrical perturbation on the radiation pattern of parabolic reflector","authors":"E. Hassan, H. Ragheb","doi":"10.1109/IEEEGCC.2006.5686189","DOIUrl":"https://doi.org/10.1109/IEEEGCC.2006.5686189","url":null,"abstract":"The radiation patterns of perturbed two dimensional parabolic reflector fed by a slotted circular cylindrical waveguide for both the TE and the TM modes are examined. The analysis is carried out using Green's function second identity in conjunction with the Moment Method. Results show that the perturbed geometry achieves various degrees of improvements in most antenna's characteristics over the plain parabolic reflector.","PeriodicalId":433452,"journal":{"name":"2006 IEEE GCC Conference (GCC)","volume":"135 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129971644","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-03-20DOI: 10.1109/IEEEGCC.2006.5686178
A. Anand, R. Kiran
The dominant link state protocols like OSPF despite their advantages require the flooding of new information across the entire routing area after changes in any link state. With the growth of the network diameter or the frequency of link-state changes increases, the overhead in terms of bandwidth and processing cost, of flooding becomes prohibitive. Furthermore, such flooding over a large area will cause unnecessary overhead on the links, potentially creating many transient routing loops that can last for a long time. This limits the scalability of the routing protocols to large routing areas. To overcome such problems, we present in this paper an Optimized and Adaptive Link-State Protocol (OALP), a modification to the existing link-state routing protocol that does not require the state of each link to be flooded to the entire internetwork all the time, or to entire areas if we monitor the activity status of the nodes in the internetwork. Thus minimizing the amount of information distributed by link-state routing protocols. There are primarily two modes in which we devise the network to operate depending the activity levels of the incumbent nodes. Depending on the activity levels an optimized flooding procedure is provided which would greatly reduce the number of advertisements flowing through the network.
{"title":"Optimized and adaptive link state routing strategy","authors":"A. Anand, R. Kiran","doi":"10.1109/IEEEGCC.2006.5686178","DOIUrl":"https://doi.org/10.1109/IEEEGCC.2006.5686178","url":null,"abstract":"The dominant link state protocols like OSPF despite their advantages require the flooding of new information across the entire routing area after changes in any link state. With the growth of the network diameter or the frequency of link-state changes increases, the overhead in terms of bandwidth and processing cost, of flooding becomes prohibitive. Furthermore, such flooding over a large area will cause unnecessary overhead on the links, potentially creating many transient routing loops that can last for a long time. This limits the scalability of the routing protocols to large routing areas. To overcome such problems, we present in this paper an Optimized and Adaptive Link-State Protocol (OALP), a modification to the existing link-state routing protocol that does not require the state of each link to be flooded to the entire internetwork all the time, or to entire areas if we monitor the activity status of the nodes in the internetwork. Thus minimizing the amount of information distributed by link-state routing protocols. There are primarily two modes in which we devise the network to operate depending the activity levels of the incumbent nodes. Depending on the activity levels an optimized flooding procedure is provided which would greatly reduce the number of advertisements flowing through the network.","PeriodicalId":433452,"journal":{"name":"2006 IEEE GCC Conference (GCC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134138404","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-03-20DOI: 10.1109/IEEEGCC.2006.5686215
A. Mahmoud, T. Sheltami, M. Abu-Amara
Recent advances in embedded computing systems have led to the emergence of wireless sensor networks (SNETs), consisting of small, battery-powered “motes” with limited computation and radio communication capabilities. SNETs permit data gathering and computation to be deeply embedded in the physical environment. Large-scale ad hoc sensor networks (ASNET) can provide dynamic data query architecture to allow the medical specialists to monitor patients remotely via (PDAs) or cellular phones. A three-layered architecture is proposed where sensors, microcontrollers, and central server/handhelds occupy the lower, middle, and top layers, respectively. The implemented network distinguishes between periodic sensor readings and critical where higher priority is given for the latter. In this paper we implement 3 special cases for tracking and monitoring patients and doctors using SNETs. Finally, the performance of a large scale of our implementation has been tested by means of simulations.
{"title":"Wireless sensor network implementation for mobile patient","authors":"A. Mahmoud, T. Sheltami, M. Abu-Amara","doi":"10.1109/IEEEGCC.2006.5686215","DOIUrl":"https://doi.org/10.1109/IEEEGCC.2006.5686215","url":null,"abstract":"Recent advances in embedded computing systems have led to the emergence of wireless sensor networks (SNETs), consisting of small, battery-powered “motes” with limited computation and radio communication capabilities. SNETs permit data gathering and computation to be deeply embedded in the physical environment. Large-scale ad hoc sensor networks (ASNET) can provide dynamic data query architecture to allow the medical specialists to monitor patients remotely via (PDAs) or cellular phones. A three-layered architecture is proposed where sensors, microcontrollers, and central server/handhelds occupy the lower, middle, and top layers, respectively. The implemented network distinguishes between periodic sensor readings and critical where higher priority is given for the latter. In this paper we implement 3 special cases for tracking and monitoring patients and doctors using SNETs. Finally, the performance of a large scale of our implementation has been tested by means of simulations.","PeriodicalId":433452,"journal":{"name":"2006 IEEE GCC Conference (GCC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128829558","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-03-20DOI: 10.1109/IEEEGCC.2006.5686204
Ahmed Al-Zeyodi, A. Al-Qayedi
This paper demonstrates a personal search agent system which enables the users to personalise their search and hence to save their time and effort. The system uses its own ranking algorithm and provides two types of search: a direct search (via a local database) and an indirect search (via third party search engines). The system achieves search personalisation through an initial user interaction that decides on what search criteria should be considered more important than others. The system also attempts to learn the user behaviour through a user feedback mechanism. This mechanism can cause two search attempts with the same query to return two different results; because of changing the user preferences even though the search is run on the same data set. Issues regarding the setup, implementation and experimental results of the system are illustrated here.
{"title":"A personal search agent system","authors":"Ahmed Al-Zeyodi, A. Al-Qayedi","doi":"10.1109/IEEEGCC.2006.5686204","DOIUrl":"https://doi.org/10.1109/IEEEGCC.2006.5686204","url":null,"abstract":"This paper demonstrates a personal search agent system which enables the users to personalise their search and hence to save their time and effort. The system uses its own ranking algorithm and provides two types of search: a direct search (via a local database) and an indirect search (via third party search engines). The system achieves search personalisation through an initial user interaction that decides on what search criteria should be considered more important than others. The system also attempts to learn the user behaviour through a user feedback mechanism. This mechanism can cause two search attempts with the same query to return two different results; because of changing the user preferences even though the search is run on the same data set. Issues regarding the setup, implementation and experimental results of the system are illustrated here.","PeriodicalId":433452,"journal":{"name":"2006 IEEE GCC Conference (GCC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114781221","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-03-20DOI: 10.1109/IEEEGCC.2006.5686179
A. Djahbar, B. Mazari, N. Mansour
In this paper, a control strategy of scalar modulation with three intervals and vector control technique for matrix converter fed induction motor drive system is proposed. By applying this control strategy, we will be able to combine the advantages of matrix converter and the advantages of the vector control. Simulation results are shown to demonstrate the effectiveness of the proposed control scheme.
{"title":"High performance motor drive using matrix converter","authors":"A. Djahbar, B. Mazari, N. Mansour","doi":"10.1109/IEEEGCC.2006.5686179","DOIUrl":"https://doi.org/10.1109/IEEEGCC.2006.5686179","url":null,"abstract":"In this paper, a control strategy of scalar modulation with three intervals and vector control technique for matrix converter fed induction motor drive system is proposed. By applying this control strategy, we will be able to combine the advantages of matrix converter and the advantages of the vector control. Simulation results are shown to demonstrate the effectiveness of the proposed control scheme.","PeriodicalId":433452,"journal":{"name":"2006 IEEE GCC Conference (GCC)","volume":"315 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117121426","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-03-20DOI: 10.1109/IEEEGCC.2006.5686245
Ahmed Bentiba, Ahmed Mohmed, Jamal Zemerly
The aim of this project is to design and implement a Linux tool for Linux administrators using Java programming language. This tool is called JLAT, Java Linux Administration Tool. JLAT will be portable to any Linux/Unix Operating Systems. This tool will contain the most popular and frequently used commands used by the Administrators of Linux/Unix systems. It has Arabic, English and French interfaces and can be easily translated to other languages. This tool has been tested on Linux (Mandrake and Fedora 3 Red Hat) and on a commercial UNIX (Solaris 8) Operating systems. The JLAT has the advantages of having user friendly interfaces and it provides the system administrators with a centralized place for all administration tasks.
本项目的目的是使用Java编程语言为Linux管理员设计并实现一个Linux工具。这个工具叫做JLAT, Java Linux管理工具。JLAT可以移植到任何Linux/Unix操作系统。该工具将包含Linux/Unix系统管理员使用的最流行和最常用的命令。它有阿拉伯语，英语和法语界面，可以很容易地翻译成其他语言。这个工具已经在Linux (Mandrake和Fedora 3 Red Hat)和商业UNIX (Solaris 8)操作系统上进行了测试。JLAT具有用户友好界面的优点，它为系统管理员提供了一个集中的位置来处理所有管理任务。
{"title":"Java Linux Administration Tool","authors":"Ahmed Bentiba, Ahmed Mohmed, Jamal Zemerly","doi":"10.1109/IEEEGCC.2006.5686245","DOIUrl":"https://doi.org/10.1109/IEEEGCC.2006.5686245","url":null,"abstract":"The aim of this project is to design and implement a Linux tool for Linux administrators using Java programming language. This tool is called JLAT, Java Linux Administration Tool. JLAT will be portable to any Linux/Unix Operating Systems. This tool will contain the most popular and frequently used commands used by the Administrators of Linux/Unix systems. It has Arabic, English and French interfaces and can be easily translated to other languages. This tool has been tested on Linux (Mandrake and Fedora 3 Red Hat) and on a commercial UNIX (Solaris 8) Operating systems. The JLAT has the advantages of having user friendly interfaces and it provides the system administrators with a centralized place for all administration tasks.","PeriodicalId":433452,"journal":{"name":"2006 IEEE GCC Conference (GCC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121165433","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
扫码关注我们
求助内容：
应助结果提醒方式：