Pub Date : 2012-12-01DOI: 10.1109/ICCITECHN.2012.6509792
M. M. Elahi, Muhammad Amin, Md. R. Miah
The discovery of arsenic contamination of groundwater in many nations including Bangladesh shows that this is a global problem. Because of the delayed health effects, poor reporting, and low levels of awareness in some communities, the extent of the adverse health problems caused by arsenic in drinking-water is at alarming level in Bangladesh. Also, allocating resources such as tube wells efficiently and effectively to mitigate arsenic hazard is a challenging task in Bangladesh. To allocate resources based on different arsenic hazard parameters, we have developed a Decision Support System that enables the user to observe the effect of allocation policy both in tabular and spatial format using statistical models. We have also developed an algorithm for optimal allocation of resources. Finally, we have analyzed and demonstrated the efficacy of our algorithm graphically.
{"title":"An optimal resource distribution method for arsenic mitigation in Bangladesh","authors":"M. M. Elahi, Muhammad Amin, Md. R. Miah","doi":"10.1109/ICCITECHN.2012.6509792","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509792","url":null,"abstract":"The discovery of arsenic contamination of groundwater in many nations including Bangladesh shows that this is a global problem. Because of the delayed health effects, poor reporting, and low levels of awareness in some communities, the extent of the adverse health problems caused by arsenic in drinking-water is at alarming level in Bangladesh. Also, allocating resources such as tube wells efficiently and effectively to mitigate arsenic hazard is a challenging task in Bangladesh. To allocate resources based on different arsenic hazard parameters, we have developed a Decision Support System that enables the user to observe the effect of allocation policy both in tabular and spatial format using statistical models. We have also developed an algorithm for optimal allocation of resources. Finally, we have analyzed and demonstrated the efficacy of our algorithm graphically.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124775226","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 : 2012-12-01DOI: 10.1109/ICCITECHN.2012.6509747
Khan Mohammad Irteza, Sheikh Mohammad Masudul Ahsan, Razib Chandra Deb
In this paper we proposed a recognition system for hand gesture in 3D environment by using only a single camera. For calculating the relative motion towards the camera, generally a depth sensing device is needed. In order to remove that, we proposed an approach of using the change of the area of the hand in input image. Using skin color; we detect the hand from the input image sequences and then we process the data for feature extraction. Three features are proposed for effectively recognize the gesture by our system. These are orientation, area and angle of the palm. As we proposed our system for dynamic gesture, Hidden Markov Model is utilized to recognize the gesture. In our lab environment our proposed system shows very promising result and we were able to achieve about 80.67% recognition rate on average. The system that we proposed will not only help to recognize the gesture of hand accurately but also lessen the cost for implementing this kind of system because of using minimal number of hardware.
{"title":"Recognition of hand gesture using hidden Markov model","authors":"Khan Mohammad Irteza, Sheikh Mohammad Masudul Ahsan, Razib Chandra Deb","doi":"10.1109/ICCITECHN.2012.6509747","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509747","url":null,"abstract":"In this paper we proposed a recognition system for hand gesture in 3D environment by using only a single camera. For calculating the relative motion towards the camera, generally a depth sensing device is needed. In order to remove that, we proposed an approach of using the change of the area of the hand in input image. Using skin color; we detect the hand from the input image sequences and then we process the data for feature extraction. Three features are proposed for effectively recognize the gesture by our system. These are orientation, area and angle of the palm. As we proposed our system for dynamic gesture, Hidden Markov Model is utilized to recognize the gesture. In our lab environment our proposed system shows very promising result and we were able to achieve about 80.67% recognition rate on average. The system that we proposed will not only help to recognize the gesture of hand accurately but also lessen the cost for implementing this kind of system because of using minimal number of hardware.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124505773","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 : 2012-12-01DOI: 10.1109/ICCITECHN.2012.6509735
Md. Olioul Islam
Steganography is one of the arts and sciences of securing or hiding secret information in some cover media. In the present study, a new steganography technique is developed to hide large data in Bitmap image using stream builder and parity checker. This method uses the concept of odd and even parity for embedding and extracting of secret message. This method is an improvement of Least Significant Bit (LSB) method for hiding information in images. The proposed method can hide large data in a single Bitmap image retaining the advantages and discarding the disadvantages of the LSB method.
{"title":"A high embedding capacity image steganography using stream builder and parity checker","authors":"Md. Olioul Islam","doi":"10.1109/ICCITECHN.2012.6509735","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509735","url":null,"abstract":"Steganography is one of the arts and sciences of securing or hiding secret information in some cover media. In the present study, a new steganography technique is developed to hide large data in Bitmap image using stream builder and parity checker. This method uses the concept of odd and even parity for embedding and extracting of secret message. This method is an improvement of Least Significant Bit (LSB) method for hiding information in images. The proposed method can hide large data in a single Bitmap image retaining the advantages and discarding the disadvantages of the LSB method.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132746124","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 : 2012-12-01DOI: 10.1109/ICCITECHN.2012.6509730
Dilara Khatun, M. Shahjahan
There exists various types of antennas for various purposes, but the interest in this area is increasing day by day. There have been ever growing demands for antenna designs that possess the highly desirable properties: compact size, low profile, multi-band, wide bandwidth, high gain, improved SWR etc. Fractal antennas can be used to meet these demands. This paper represents the analysis and design of multiband square Koch fractal dipole antenna, where it is shown that as the iterations are increased, the band of frequencies also increase. The designed antenna has operating frequencies for first iteration are of 496 MHz and 1430 MHz, and for second iteration are of 460 MHz, 1248 MHz, 1926 MHz and 4390 MHz with acceptable bandwidth, which has useful applications in UHF/SHF. The radiation characteristics, SWR, reflection-coefficient, input impedance and gain of the proposed antenna are described with 4NEC2 Software package. Here, the antenna is placed in the XY-plane for the first iteration and in YZ-plane for the second iteration.
{"title":"Multiband fractal square Koch antenna design for UHF/SHF application","authors":"Dilara Khatun, M. Shahjahan","doi":"10.1109/ICCITECHN.2012.6509730","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509730","url":null,"abstract":"There exists various types of antennas for various purposes, but the interest in this area is increasing day by day. There have been ever growing demands for antenna designs that possess the highly desirable properties: compact size, low profile, multi-band, wide bandwidth, high gain, improved SWR etc. Fractal antennas can be used to meet these demands. This paper represents the analysis and design of multiband square Koch fractal dipole antenna, where it is shown that as the iterations are increased, the band of frequencies also increase. The designed antenna has operating frequencies for first iteration are of 496 MHz and 1430 MHz, and for second iteration are of 460 MHz, 1248 MHz, 1926 MHz and 4390 MHz with acceptable bandwidth, which has useful applications in UHF/SHF. The radiation characteristics, SWR, reflection-coefficient, input impedance and gain of the proposed antenna are described with 4NEC2 Software package. Here, the antenna is placed in the XY-plane for the first iteration and in YZ-plane for the second iteration.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115738158","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 : 2012-12-01DOI: 10.1109/ICCITECHN.2012.6509803
S. M. Ismail, A B M Saadmaan Rahman, Farha Tamanna Islam
Power dissipation minimization is one of the prime concerns in recent VLSI design. As chip size is shrinking and many other micro-electronics reliabilities are developing gradually, low power design of any system has become priority. Computer system consists of sequential circuits mostly and that is why efficient low power design of various sequential circuits is very important. In this paper, we have proposed a low power design scheme of Johnson Counter using clock gating system. Doing some power analysis in SPICE, it is considered that our proposed system has lower power dissipation and simpler interconnections compared to the conventional design.
{"title":"Low power design of Johnson Counter using clock gating","authors":"S. M. Ismail, A B M Saadmaan Rahman, Farha Tamanna Islam","doi":"10.1109/ICCITECHN.2012.6509803","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509803","url":null,"abstract":"Power dissipation minimization is one of the prime concerns in recent VLSI design. As chip size is shrinking and many other micro-electronics reliabilities are developing gradually, low power design of any system has become priority. Computer system consists of sequential circuits mostly and that is why efficient low power design of various sequential circuits is very important. In this paper, we have proposed a low power design scheme of Johnson Counter using clock gating system. Doing some power analysis in SPICE, it is considered that our proposed system has lower power dissipation and simpler interconnections compared to the conventional design.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123968966","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 : 2012-12-01DOI: 10.1109/ICCITECHN.2012.6509705
M. Rabbi
In this paper, we investigate the Channel Impulse Response (CIR) estimation in an Orthogonal Frequency Division Multiple Access (OFDMA) uplink using a tracking based Basis Expansion Modeling (BEM) algorithm. By introducing a new tracking term in the BEM coefficients that gives the rate of change of the coefficients, the algorithm is particularly suitable for high mobility application. Specifically, the algorithm estimates the BEM coefficients for each OFDMA block in an iterative manner based on using a new objective function that takes into consideration first order variations in the coefficients of the current and adjacent blocks.
{"title":"A tracking based BEM algorithm for OFDMA channel estimation in high Doppler spread","authors":"M. Rabbi","doi":"10.1109/ICCITECHN.2012.6509705","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509705","url":null,"abstract":"In this paper, we investigate the Channel Impulse Response (CIR) estimation in an Orthogonal Frequency Division Multiple Access (OFDMA) uplink using a tracking based Basis Expansion Modeling (BEM) algorithm. By introducing a new tracking term in the BEM coefficients that gives the rate of change of the coefficients, the algorithm is particularly suitable for high mobility application. Specifically, the algorithm estimates the BEM coefficients for each OFDMA block in an iterative manner based on using a new objective function that takes into consideration first order variations in the coefficients of the current and adjacent blocks.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125364517","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 : 2012-12-01DOI: 10.1109/ICCITECHN.2012.6509731
M. I. H. Chowdhury, F. Alam
Bangladesh has achieved a tremendous growth in the telecommunication sector recently in spite of various deficiencies regarding socio-economic infrastructure. Following a number of years of huge development in this sector, each and every parts of Bangladesh is now under cellular coverage and the teledensity is expected to reach at maximum satisfactory level soon. This success motivates us towards a more reliable & transparent economic infrastructure through the use of cellular services and intelligent software systems. This paper proposes multilayer network-supported framework which completely eliminates the need and use of paper notes for all kinds of economic transactions. However, the proposed framework is not a threat at all to the present financial institutions and their fundamental mechanisms. Rather, it would be more transparent and free of corruptions as reliable and efficient monitoring of transactions will be possible by respective authorities. This proposed framework will handle all kinds of transactions by electronic means e.g. Push Pull services offering Short Message Service(SMS), road-side booths containing a web interface. Under this distributed system, each and every entity of the entire economic infrastructure will makes it flexible, robust, secure and lawful. The satisfactory experimental results on a small case scenario supports its potential possibilities in real-world implementation.
{"title":"A multilayer network-supporting universal electronic cash transaction framework","authors":"M. I. H. Chowdhury, F. Alam","doi":"10.1109/ICCITECHN.2012.6509731","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509731","url":null,"abstract":"Bangladesh has achieved a tremendous growth in the telecommunication sector recently in spite of various deficiencies regarding socio-economic infrastructure. Following a number of years of huge development in this sector, each and every parts of Bangladesh is now under cellular coverage and the teledensity is expected to reach at maximum satisfactory level soon. This success motivates us towards a more reliable & transparent economic infrastructure through the use of cellular services and intelligent software systems. This paper proposes multilayer network-supported framework which completely eliminates the need and use of paper notes for all kinds of economic transactions. However, the proposed framework is not a threat at all to the present financial institutions and their fundamental mechanisms. Rather, it would be more transparent and free of corruptions as reliable and efficient monitoring of transactions will be possible by respective authorities. This proposed framework will handle all kinds of transactions by electronic means e.g. Push Pull services offering Short Message Service(SMS), road-side booths containing a web interface. Under this distributed system, each and every entity of the entire economic infrastructure will makes it flexible, robust, secure and lawful. The satisfactory experimental results on a small case scenario supports its potential possibilities in real-world implementation.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115314851","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 : 2012-12-01DOI: 10.1109/ICCITECHN.2012.6509751
Abu Reyan Ahmed, Md. Mazharul Islam, M. S. Rahman
An acyclic coloring of a graph G is a coloring of the vertices of G, where no two adjacent vertices of G receive the same color and no cycle of G contains vertices of only two colors. An acyclic k-coloring of a graph G is an acyclic coloring of G using k colors. In this paper we show the necessary and sufficient condition of acyclic coloring of a complete k-partite graph. Then we derive the minimum number of colors for acyclic coloring of such graphs. We also show that a complete k-partite graph G having n1, n2,…, nk vertices in its Ρ1,Ρ2,…, Pk partition respectively is acyclically (2k − 1)-colorable using ∑i≠j, i, j≤k ninj + nmax + (k−1) − ∑k−1i=0 (k−i)ni+1 division vertices, where nmax = max(n1, n2,…, nk). Finally we show that there is an infinite number of cubic planar graphs which are acyclically 3-colorable.
{"title":"On acyclic colorings of graphs","authors":"Abu Reyan Ahmed, Md. Mazharul Islam, M. S. Rahman","doi":"10.1109/ICCITECHN.2012.6509751","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509751","url":null,"abstract":"An acyclic coloring of a graph G is a coloring of the vertices of G, where no two adjacent vertices of G receive the same color and no cycle of G contains vertices of only two colors. An acyclic k-coloring of a graph G is an acyclic coloring of G using k colors. In this paper we show the necessary and sufficient condition of acyclic coloring of a complete k-partite graph. Then we derive the minimum number of colors for acyclic coloring of such graphs. We also show that a complete k-partite graph G having n<inf>1</inf>, n<inf>2</inf>,…, n<inf>k</inf> vertices in its Ρ<inf>1</inf>,Ρ<inf>2</inf>,…, P<inf>k</inf> partition respectively is acyclically (2k − 1)-colorable using ∑<inf>i≠j, i, j≤k</inf> n<inf>i</inf>n<inf>j</inf> + n<inf>max</inf> + (k−1) − ∑<sup>k−1</sup><inf>i=0</inf> (k−i)n<inf>i+1</inf> division vertices, where n<inf>max</inf> = max(n<inf>1</inf>, n<inf>2</inf>,…, n<inf>k</inf>). Finally we show that there is an infinite number of cubic planar graphs which are acyclically 3-colorable.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115438620","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 : 2012-12-01DOI: 10.1109/ICCITECHN.2012.6509711
P. Barua
Power consumption is one of the major threads in CMOS technology. International technology road-map for semiconductors (ITRS) [1] reports that leakage power dissipation may come to dominate total power consumption. Although Leakage power was negligible at 0.18μ technology and above, in nano scale technology, but when the technology is decreases these leakage powers are the top most concern for VLSI circuit designer. As the technology feature size shrink static power consumption dominant the dynamic power exponentially and this static power consumption is known as a sub-threshold leakage. Sub-threshold leakage is a leakage that is arises by creating a weak inversion channel between drain to source. However, tunneling current through gate oxide insulator, channel punch through current and gate current due to hot-carrier injection are also responsible for semiconductor power consumption. Although gate-oxide thickness will be reduced as the technology decreases in nano scale, but this reduction causes sub-threshold leakage. So, there were several method was proposed to tackle the leakage. However, every proposed method has some trade-offs between power, delay and area, in this paper novel common vdd and gnd technique is proposed to overcome the semiconductor leakage and this technique has excellent tradeoffs between power, delay and area, moreover this method will be new weapon for low power VLSI circuit designer.
功耗是CMOS技术的主要问题之一。国际半导体技术路线图(International technology roadmap for semiconductors, ITRS)[1]报告称，泄漏功耗可能会主导总功耗。虽然泄漏功率在0.18μ技术及以上时可以忽略不计，但在纳米尺度技术中，当技术被降低时，这些泄漏功率是VLSI电路设计者最关心的问题。随着技术特征尺寸的缩小，静态功耗以指数方式主导动态功耗，这种静态功耗被称为亚阈值泄漏。亚阈值泄漏是通过在漏极到源极之间创建一个弱反转通道而产生的泄漏。然而，通过栅极氧化物绝缘体的隧穿电流、通道冲穿电流和由于热载子注入引起的栅极电流也是半导体功耗的主要原因。虽然栅极氧化物厚度会随着技术在纳米尺度上的减小而减小，但这种减小会导致亚阈值泄漏。因此，提出了几种解决泄漏的方法。然而，每一种提出的方法都有一定的功耗、延迟和面积的权衡，本文提出了一种新的通用vdd和gnd技术来克服半导体泄漏，该技术具有良好的功耗、延迟和面积的权衡，并且该方法将成为低功耗VLSI电路设计者的新武器。
{"title":"A novel architecture for nanometer scale low power VLSI design","authors":"P. Barua","doi":"10.1109/ICCITECHN.2012.6509711","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509711","url":null,"abstract":"Power consumption is one of the major threads in CMOS technology. International technology road-map for semiconductors (ITRS) [1] reports that leakage power dissipation may come to dominate total power consumption. Although Leakage power was negligible at 0.18μ technology and above, in nano scale technology, but when the technology is decreases these leakage powers are the top most concern for VLSI circuit designer. As the technology feature size shrink static power consumption dominant the dynamic power exponentially and this static power consumption is known as a sub-threshold leakage. Sub-threshold leakage is a leakage that is arises by creating a weak inversion channel between drain to source. However, tunneling current through gate oxide insulator, channel punch through current and gate current due to hot-carrier injection are also responsible for semiconductor power consumption. Although gate-oxide thickness will be reduced as the technology decreases in nano scale, but this reduction causes sub-threshold leakage. So, there were several method was proposed to tackle the leakage. However, every proposed method has some trade-offs between power, delay and area, in this paper novel common vdd and gnd technique is proposed to overcome the semiconductor leakage and this technique has excellent tradeoffs between power, delay and area, moreover this method will be new weapon for low power VLSI circuit designer.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126200175","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 : 2012-12-01DOI: 10.1109/ICCITECHN.2012.6509769
Md. Atiqur Rahman Khan, Abir Ahmed, M. R. Islam
A simple prototype wireless power transfer (WPT) system has been proposed and practically implemented to explore the possibility of cell phone battery recharging using WPT technique. In the proposed system, radio frequency approach has been utilized employing a FM transmitter and receiver. Our preliminary experimental results demonstrate that the cell phone battery can be recharged wirelessly by FM transmission and reception technique for which at least 1.25 mW signal strength is required at the receiver for the proposed system.
{"title":"Wireless power transfer: An application to cell phone battery recharging","authors":"Md. Atiqur Rahman Khan, Abir Ahmed, M. R. Islam","doi":"10.1109/ICCITECHN.2012.6509769","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2012.6509769","url":null,"abstract":"A simple prototype wireless power transfer (WPT) system has been proposed and practically implemented to explore the possibility of cell phone battery recharging using WPT technique. In the proposed system, radio frequency approach has been utilized employing a FM transmitter and receiver. Our preliminary experimental results demonstrate that the cell phone battery can be recharged wirelessly by FM transmission and reception technique for which at least 1.25 mW signal strength is required at the receiver for the proposed system.","PeriodicalId":127060,"journal":{"name":"2012 15th International Conference on Computer and Information Technology (ICCIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123414843","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
扫码关注我们
求助内容：
应助结果提醒方式：