Pub Date : 2013-11-01DOI: 10.1109/ICAWST.2013.6765536
Chih-Hsiao Tsai, Yu-Jie Lin, Han-Ming Chang, Ying-Hong Wang
Wireless sensor networks (WSNs) are based on monitoring or managing the sensing area by using the location information with sensor nodes. These sensor nodes are sometimes random deployed, so they have to be aware to their location before starting their tasks. Most sensor nodes need hardware support or receive packets with location information to estimate their location, and this needs lots of time or costs, and may have a huge error. In this paper we present a localization mechanism in wireless sensor networks (MRN). This mechanism can cooperate with node localization algorithm and mobile reference node moving direction scheme. We use a mobile reference node with GPS to move to the whole environment, and we use RSSI and trilateration to estimate unknown nodes' location. We can obtain more unknown nodes location by mobile reference node moving scheme, and will decreases the energy consumption and average location error.
{"title":"Localization mechanism with mobile reference node in grid-based wireless sensor networks","authors":"Chih-Hsiao Tsai, Yu-Jie Lin, Han-Ming Chang, Ying-Hong Wang","doi":"10.1109/ICAWST.2013.6765536","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765536","url":null,"abstract":"Wireless sensor networks (WSNs) are based on monitoring or managing the sensing area by using the location information with sensor nodes. These sensor nodes are sometimes random deployed, so they have to be aware to their location before starting their tasks. Most sensor nodes need hardware support or receive packets with location information to estimate their location, and this needs lots of time or costs, and may have a huge error. In this paper we present a localization mechanism in wireless sensor networks (MRN). This mechanism can cooperate with node localization algorithm and mobile reference node moving direction scheme. We use a mobile reference node with GPS to move to the whole environment, and we use RSSI and trilateration to estimate unknown nodes' location. We can obtain more unknown nodes location by mobile reference node moving scheme, and will decreases the energy consumption and average location error.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":"6 1","pages":"747-753"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79077162","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 : 2013-11-01DOI: 10.1109/ICAWST.2013.6765453
N. Katayama, Keita Hidaka, A. Karashima, M. Nakao
In the hippocampus of rodents, rhythmic electroencephalographic (EEG) activity at 4-12 Hz (theta activity) is observed when the animal is running. Although it has been reported that the theta activity is modulated by various sensory stimuli, the contribution of the visual feedback has not fully understood. In this study, we analyzed the relationship between the locomotion speed and the hippocampal theta activity of freely behaving mice in a virtual environment. It was found that the frequency and the amplitude of the theta activity were correlated with the locomotion speed of the mouse in the virtual space as well as in the real open field. When the visual feedback was switched-off, the frequency and the amplitude of the theta activity were slightly decreased without changing the proportionality constant of the locomotion speed. These data indicate the contribution of the visual feedback to the hippocampal theta activity.
{"title":"Contribution of visual feedback to the hippocampal theta activity in mice","authors":"N. Katayama, Keita Hidaka, A. Karashima, M. Nakao","doi":"10.1109/ICAWST.2013.6765453","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765453","url":null,"abstract":"In the hippocampus of rodents, rhythmic electroencephalographic (EEG) activity at 4-12 Hz (theta activity) is observed when the animal is running. Although it has been reported that the theta activity is modulated by various sensory stimuli, the contribution of the visual feedback has not fully understood. In this study, we analyzed the relationship between the locomotion speed and the hippocampal theta activity of freely behaving mice in a virtual environment. It was found that the frequency and the amplitude of the theta activity were correlated with the locomotion speed of the mouse in the virtual space as well as in the real open field. When the visual feedback was switched-off, the frequency and the amplitude of the theta activity were slightly decreased without changing the proportionality constant of the locomotion speed. These data indicate the contribution of the visual feedback to the hippocampal theta activity.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":"99 1","pages":"306-308"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80577927","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 : 2013-11-01DOI: 10.1109/ICAWST.2013.6765526
Zhihao Shang, Wenbo Chen, Q. Ma, Bin Wu
Nowadays, the Internet is flooded with huge traffic, many applications have millions users, a single server is difficult to bear a large number of clients' access, so many application providers will put several servers as a computing unit to provide support for a specific application, usually people will use distributed computing, load balancing technology to complete the work. A typical load balancing technique is to use a dedicated load balancer to forward the client requests to different servers, this technique requires dedicated hardware support, the hardware is expensive, lacks of flexibility and is easy to become a single point failure. There will be a new solution for load balancing with OpenFlow proposed., this paper mainly studies dynamic load balancing technology in the OpenFlow environment, the Controller collected the server running status through the SNMP protocol, and calculated the aggregated load of the severs according to dynamic load balancing scheduling algorithm, the OpenFlow switch will forward the client's request to the server whose aggregated load is smallest, thus minimize the response time of the web server. In the OpenFlow network environment, using this method can brings high flexibility without additional equipment.
{"title":"Design and implementation of server cluster dynamic load balancing based on OpenFlow","authors":"Zhihao Shang, Wenbo Chen, Q. Ma, Bin Wu","doi":"10.1109/ICAWST.2013.6765526","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765526","url":null,"abstract":"Nowadays, the Internet is flooded with huge traffic, many applications have millions users, a single server is difficult to bear a large number of clients' access, so many application providers will put several servers as a computing unit to provide support for a specific application, usually people will use distributed computing, load balancing technology to complete the work. A typical load balancing technique is to use a dedicated load balancer to forward the client requests to different servers, this technique requires dedicated hardware support, the hardware is expensive, lacks of flexibility and is easy to become a single point failure. There will be a new solution for load balancing with OpenFlow proposed., this paper mainly studies dynamic load balancing technology in the OpenFlow environment, the Controller collected the server running status through the SNMP protocol, and calculated the aggregated load of the severs according to dynamic load balancing scheduling algorithm, the OpenFlow switch will forward the client's request to the server whose aggregated load is smallest, thus minimize the response time of the web server. In the OpenFlow network environment, using this method can brings high flexibility without additional equipment.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":"171 1","pages":"691-697"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85422193","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 : 2013-11-01DOI: 10.1109/ICAWST.2013.6765531
Wei-Chen Lin, Jiun-Jian Liaw, Chiung-Ta Wu
File Transfer Protocol is the most popular file transfer standard. This FTP can let a computer system connect to the internet via a communication network, and it can also access the system resources from the internet. File server is being downloaded now by TCP/IP protocol, while before it was downloaded by signal server. Due to the limited flow control, the old method could not use download time efficiently. In order to solve the flow control problem, some researchers came up with a distributed file transfer method that can share the document with other users, thus allowing the shortest transfer time using neighboring servers. Although the distributed file transfer can reduce the file transfer time, it was not concerned with the quality of the transfer between two servers, and was inappropriate for file segmentation and transfer, so the file transfer could not attain the optimal transfer efficacy. Based on our research, we propose a new method called Distributed Parallelized File Transfer Protocol (DPFTP). This method is based on Parallelized File Transfer Protocol (P-FTP) and is beneficial to multi-users, as it utilizes server loading and reduces the download time.
{"title":"The Modified parallelized file transfer protocol for multi-users","authors":"Wei-Chen Lin, Jiun-Jian Liaw, Chiung-Ta Wu","doi":"10.1109/ICAWST.2013.6765531","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765531","url":null,"abstract":"File Transfer Protocol is the most popular file transfer standard. This FTP can let a computer system connect to the internet via a communication network, and it can also access the system resources from the internet. File server is being downloaded now by TCP/IP protocol, while before it was downloaded by signal server. Due to the limited flow control, the old method could not use download time efficiently. In order to solve the flow control problem, some researchers came up with a distributed file transfer method that can share the document with other users, thus allowing the shortest transfer time using neighboring servers. Although the distributed file transfer can reduce the file transfer time, it was not concerned with the quality of the transfer between two servers, and was inappropriate for file segmentation and transfer, so the file transfer could not attain the optimal transfer efficacy. Based on our research, we propose a new method called Distributed Parallelized File Transfer Protocol (DPFTP). This method is based on Parallelized File Transfer Protocol (P-FTP) and is beneficial to multi-users, as it utilizes server loading and reduces the download time.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":"9 1","pages":"718-724"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78474942","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}
The shadows of pedestrians decrease the tracking performance dramatically in video surveillance. This paper presents a method of shadow removal to improve the accuracy of pedestrian detection and tracking in indoor environments. The proposed method can be divided into four steps: build a background model which can be automatically updated, extract moving objects region, eliminate moving objects shadows, classify and track pedestrians in moving objects region from which shadows have been eliminated. In this work, we propose a methodology using the foreground frames without shadows to detect and track the pedestrians across training datasets. Experimental results show that our approach is capable of dealing with shadows and detecting moving pedestrians in cluttered environment. It indicates that this proposal can improve the performance of indoor pedestrians tracking.
{"title":"Robust pedestrian detection and tracking with shadow removal in indoor environments","authors":"Yunbiao Chen, Hui Yang, Chenxiang Li, S. Pu, Jianyang Zhou, Lingxiang Zheng","doi":"10.1109/ICAWST.2013.6765508","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765508","url":null,"abstract":"The shadows of pedestrians decrease the tracking performance dramatically in video surveillance. This paper presents a method of shadow removal to improve the accuracy of pedestrian detection and tracking in indoor environments. The proposed method can be divided into four steps: build a background model which can be automatically updated, extract moving objects region, eliminate moving objects shadows, classify and track pedestrians in moving objects region from which shadows have been eliminated. In this work, we propose a methodology using the foreground frames without shadows to detect and track the pedestrians across training datasets. Experimental results show that our approach is capable of dealing with shadows and detecting moving pedestrians in cluttered environment. It indicates that this proposal can improve the performance of indoor pedestrians tracking.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":"6 1","pages":"590-596"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90098463","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 : 2013-11-01DOI: 10.1109/ICAWST.2013.6765530
Y. Sasamoto, Michael Cohen, J. Villegas
Interactive table-top interfaces are multimedia devices which allow sharing information visually and aurally among several users. Table-top interfaces for spatial sound environments are frequently investigated in the field of the human interfaces. Table-top interfaces are utilized as groupware and it is suitable for collaborative work, and it is convenient for a group working on theme related to sound systems. A representative of table-top musical instrument is the reacTable. In this paper, we present a way to control the position of multiple sounds in a spatial sound environment via a table-top interface. Sound localization is required to discriminate and recognize clearly sounds. We have been investigating musical table-top instruments which are capable of controlling multiple sound in spatial sound environments. One of the main features of this new developed system is that multiple users can control the spatialization of independently sounds in real-time. We verified changes of user recognition to multi-sound with a spatial sound environment.
{"title":"Controlling spatial sound with table-top interface","authors":"Y. Sasamoto, Michael Cohen, J. Villegas","doi":"10.1109/ICAWST.2013.6765530","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765530","url":null,"abstract":"Interactive table-top interfaces are multimedia devices which allow sharing information visually and aurally among several users. Table-top interfaces for spatial sound environments are frequently investigated in the field of the human interfaces. Table-top interfaces are utilized as groupware and it is suitable for collaborative work, and it is convenient for a group working on theme related to sound systems. A representative of table-top musical instrument is the reacTable. In this paper, we present a way to control the position of multiple sounds in a spatial sound environment via a table-top interface. Sound localization is required to discriminate and recognize clearly sounds. We have been investigating musical table-top instruments which are capable of controlling multiple sound in spatial sound environments. One of the main features of this new developed system is that multiple users can control the spatialization of independently sounds in real-time. We verified changes of user recognition to multi-sound with a spatial sound environment.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":"4 1","pages":"713-718"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85971076","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 : 2013-11-01DOI: 10.1109/ICAWST.2013.6765539
An-Na Kang, L. Barolli, Jae Dong Lee, J. Park, Hwa-Young Jeong
Learning system has increased to require various learning materials and very convenient system process for use by students. In the contents, recently, learning system and application with new technology such as cloud computing happens. However, in spite of increasing convenience for system use, many users (students) has no different in e-learning settings and their satisfaction for learning system. In this paper, we propose success model for learning system in cloud computing environment. And we make criteria and suggest what it is important factor in learning system.
{"title":"Information success model for learning system in cloud computing environment","authors":"An-Na Kang, L. Barolli, Jae Dong Lee, J. Park, Hwa-Young Jeong","doi":"10.1109/ICAWST.2013.6765539","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765539","url":null,"abstract":"Learning system has increased to require various learning materials and very convenient system process for use by students. In the contents, recently, learning system and application with new technology such as cloud computing happens. However, in spite of increasing convenience for system use, many users (students) has no different in e-learning settings and their satisfaction for learning system. In this paper, we propose success model for learning system in cloud computing environment. And we make criteria and suggest what it is important factor in learning system.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":"19 3 1","pages":"764-768"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81434853","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 : 2013-11-01DOI: 10.1109/ICAWST.2013.6765448
M. N. Salleh, M. Acar, N. D. Burns
This paper reports a computational method to develop silicon padding to be inserted into the low pressure areas of a custom designed pressure garment to obtain a more uniform pressure distribution. The padding was developed by using digital scanned data of patient body. The custom designed paddings and corresponding pressure garments are constructed for a number of subjects, and experimentally tested and verified by comparing the pressure measured using the customized pressure garment with and without padding. The results show that the custom made pressure garment paddings help to increase the pressure close to the specific design pressure in the low pressure regions, leading to a much more uniform pressure application to the whole of the affected body part, which in turn offers an advantage for the healing process and the prevention of the formation of scar tissue due to burn injury.
{"title":"Computer aided silicon padding design for burn injury","authors":"M. N. Salleh, M. Acar, N. D. Burns","doi":"10.1109/ICAWST.2013.6765448","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765448","url":null,"abstract":"This paper reports a computational method to develop silicon padding to be inserted into the low pressure areas of a custom designed pressure garment to obtain a more uniform pressure distribution. The padding was developed by using digital scanned data of patient body. The custom designed paddings and corresponding pressure garments are constructed for a number of subjects, and experimentally tested and verified by comparing the pressure measured using the customized pressure garment with and without padding. The results show that the custom made pressure garment paddings help to increase the pressure close to the specific design pressure in the low pressure regions, leading to a much more uniform pressure application to the whole of the affected body part, which in turn offers an advantage for the healing process and the prevention of the formation of scar tissue due to burn injury.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":"105 1","pages":"280-286"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83385011","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 : 2013-11-01DOI: 10.1109/ICAWST.2013.6765437
B. Kumara, Incheon Paik, Hiroki Ohashi, Y. Yaguchi
Web service clustering is an efficient approach to address some challenges in service computing area such as discovering and recommending. To cluster the Web services, we need to filter the similar services. Key operation of filtering process is measuring the similarity of services. There are several methods used in current similarity calculation approaches such as keyword, information retrieval, ontology and hybrid methods. However, these approaches do not consider the context when measuring the similarity. So these approaches failed to capture the semantic of terms, which exist under a certain domain. In this paper, we propose context aware similarity method, which uses search results from search engines and support vector machine. Then, we apply Associated Keyword Space (ASKS) algorithm which is effective for noisy data and projected results from a three-dimensional (3D) sphere to a two dimensional (2D) spherical surface for 2D visualization to filter the services. Experimental results show our filtering approach is able to filter services based on domain and plot the result on sphere. Also our approach performs better than the existing approaches. Further, our approach aids to search Web services by visualization of the service data on a spherical surface.
{"title":"Web service filtering and visualization with context aware similarity to bootstrap clustering","authors":"B. Kumara, Incheon Paik, Hiroki Ohashi, Y. Yaguchi","doi":"10.1109/ICAWST.2013.6765437","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765437","url":null,"abstract":"Web service clustering is an efficient approach to address some challenges in service computing area such as discovering and recommending. To cluster the Web services, we need to filter the similar services. Key operation of filtering process is measuring the similarity of services. There are several methods used in current similarity calculation approaches such as keyword, information retrieval, ontology and hybrid methods. However, these approaches do not consider the context when measuring the similarity. So these approaches failed to capture the semantic of terms, which exist under a certain domain. In this paper, we propose context aware similarity method, which uses search results from search engines and support vector machine. Then, we apply Associated Keyword Space (ASKS) algorithm which is effective for noisy data and projected results from a three-dimensional (3D) sphere to a two dimensional (2D) spherical surface for 2D visualization to filter the services. Experimental results show our filtering approach is able to filter services based on domain and plot the result on sphere. Also our approach performs better than the existing approaches. Further, our approach aids to search Web services by visualization of the service data on a spherical surface.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":"36 1","pages":"220-226"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88454044","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 : 2013-11-01DOI: 10.1109/ICAWST.2013.6765435
E. K. Bankas, K. Gbolagade
In this paper, we propose a new moduli set {22n+1 - 1, 22n;22n - l} with its associated reverse converter. The proposed reverse converter is based on Mixed Radix Conversion (MRC). In addition to parallelizing and optimizing the MRC algorithm, the resulting architecture is further simplified in order to obtain a reverse converter that utilizes only 2 levels of Carry Save Adders and three Carry Propagate Adders. The proposed converter is purely adder based and memoryless. Our proposal has a delay of (10n + 4)tfa + 2tmUx with an area cost of (12n + 2)FAs and (2n)H As, which when expressed in terms of HA is (22n + 4), where FA, HA, and tfa represent Full Adder, Half Adder, and delay of a Full Adder, respectively. The proposed scheme is compared with state of the art similar dynamic range converters. Theoretically speaking, our proposal achieves about 62.3% hardware reduction and about 2.13% speed improvement when compared with the reverse converter for {2n + 1,2n 1, 22n+1 - 3, 22n - 2}. Also, in comparison with the converter for {2n - 1, 2n - 1, 22n+1 - l}, the results indicate that, our proposal is about 17.05% faster, but requires about 7.83% more hardware resources. Further, the area time square (ΔT2) metric indicates that our proposed converter is 62.3% and 24.77% better than the state of the art reverse converters for {2n + 1,2n - 1, 22n+1 - 3, 22n - 2} and {2n - 1, 2n + 1, 22n, 22n+1 - l} respectively.
{"title":"A residue to binary converter for a balanced moduli set {22n+1 − 1, 22n, 22n − 1}","authors":"E. K. Bankas, K. Gbolagade","doi":"10.1109/ICAWST.2013.6765435","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765435","url":null,"abstract":"In this paper, we propose a new moduli set {2<sup>2n+1</sup> - 1, 2<sup>2n</sup>;2<sup>2n - l</sup>} with its associated reverse converter. The proposed reverse converter is based on Mixed Radix Conversion (MRC). In addition to parallelizing and optimizing the MRC algorithm, the resulting architecture is further simplified in order to obtain a reverse converter that utilizes only 2 levels of Carry Save Adders and three Carry Propagate Adders. The proposed converter is purely adder based and memoryless. Our proposal has a delay of (10n + 4)t<sub>fa</sub> + 2t<sub>mUx</sub> with an area cost of (12n + 2)FAs and (2n)H As, which when expressed in terms of HA is (22n + 4), where FA, HA, and t<sub>fa</sub> represent Full Adder, Half Adder, and delay of a Full Adder, respectively. The proposed scheme is compared with state of the art similar dynamic range converters. Theoretically speaking, our proposal achieves about 62.3% hardware reduction and about 2.13% speed improvement when compared with the reverse converter for {2<sup>n</sup> + 1,2<sup>n</sup> 1, 2<sup>2n+1</sup> - 3, 2<sup>2n</sup> - 2}. Also, in comparison with the converter for {2<sup>n</sup> - 1, 2<sup>n</sup> - 1, 2<sup>2n+1</sup> - l}, the results indicate that, our proposal is about 17.05% faster, but requires about 7.83% more hardware resources. Further, the area time square (Δ<sub>T</sub><sup>2</sup>) metric indicates that our proposed converter is 62.3% and 24.77% better than the state of the art reverse converters for {2<sup>n</sup> + 1,2<sup>n</sup> - 1, 2<sup>2n+1</sup> - 3, 2<sup>2n</sup> - 2} and {2<sup>n</sup> - 1, 2<sup>n</sup> + 1, 2<sup>2n</sup>, 2<sup>2n+1</sup> - l} respectively.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":"26 1","pages":"211-216"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73395286","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
扫码关注我们
求助内容：
应助结果提醒方式：