Pub Date : 2006-12-01DOI: 10.1109/ISPACS.2006.364744
A. Trisanto, M. Yasser, Jianming Lu, T. Yahagi
This paper presents the fuzzy PID (FPID) controller using neural network (NN) for controlling the magnetic levitation system. Magnetic levitation systems are open loop unstable, uncertainly and inherently nonlinear systems. Consequently, controlling this kind of the system is very difficulty. The FPID controller is developed to provide nonlinear or linear control action that can improve performance of the controller in comparison with a conventional PID controller using only linear policy. Unfortunately, since FPID controller are nonlinear, it is more difficult to set the controller gains compared the linear PID controller. In this paper we propose a neural network to assist the FPID controller. The NN is added in parallel with FPID controller. The NN is used to compensate for inadequate FPID parameters and for stabilize the magnetic levitation system. The uniqueness our method is when the parameters of FPID are incorrect, then the NN takes over the controller, otherwise the NN does not operate. Online training and fast computing of the NN has been designed for that purposes. Finally, the experiment results showed the effectiveness of the proposed method
{"title":"Implementation of a Fuzzy PID Controller Using Neural Network on the Magnetic Levitation System","authors":"A. Trisanto, M. Yasser, Jianming Lu, T. Yahagi","doi":"10.1109/ISPACS.2006.364744","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364744","url":null,"abstract":"This paper presents the fuzzy PID (FPID) controller using neural network (NN) for controlling the magnetic levitation system. Magnetic levitation systems are open loop unstable, uncertainly and inherently nonlinear systems. Consequently, controlling this kind of the system is very difficulty. The FPID controller is developed to provide nonlinear or linear control action that can improve performance of the controller in comparison with a conventional PID controller using only linear policy. Unfortunately, since FPID controller are nonlinear, it is more difficult to set the controller gains compared the linear PID controller. In this paper we propose a neural network to assist the FPID controller. The NN is added in parallel with FPID controller. The NN is used to compensate for inadequate FPID parameters and for stabilize the magnetic levitation system. The uniqueness our method is when the parameters of FPID are incorrect, then the NN takes over the controller, otherwise the NN does not operate. Online training and fast computing of the NN has been designed for that purposes. Finally, the experiment results showed the effectiveness of the proposed method","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"321 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122621683","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-12-01DOI: 10.1109/ISPACS.2006.364834
Takanori Watanabe, K. Naito, K. Mori, Hideo Kobayashi
Ad-hoc network is an autonomous network that consists of only mobile terminals without an infrastructure such as base stations. The wireless LAN system with IEEE 802.11 standard is one of the candidate schemes to realize ad-hoc network. In IEEE 802.11, CSMA/CA (carrier sense multiple access with collision avoidance) is used as access control method. Moreover RTS/CTS (request to send/clear to send) mechanism is implemented to solve the hidden terminal problem. However it is well known that RTS/CTS mechanism causes the exposed terminal problem in which the communication route between terminals would be suppressed. In this paper, we clarify the effect of the exposed terminal problem to the ad-hoc networks. Moreover we propose a local alternative routing protocol method that prepares back up routes to avoid the temporary suppression of transmissions. Simulation results show that the proposed method can prevent the route reconstruction and improve the packet delivery ratio
Ad-hoc网络是一种仅由移动终端组成的自治网络，没有基站等基础设施。采用IEEE 802.11标准的无线局域网系统是实现自组织网络的备选方案之一。在IEEE 802.11中，使用CSMA/CA (carrier sense multiple access with collision avoidance)作为访问控制方法。此外，还实现了RTS/CTS(请求发送/清除发送)机制，解决了终端隐藏问题。然而，众所周知，RTS/CTS机制会导致终端暴露问题，终端之间的通信路由会受到抑制。本文阐明了终端暴露问题对自组织网络的影响。此外，我们还提出了一种本地备用路由协议方法，该方法准备备份路由以避免传输的临时抑制。仿真结果表明，该方法能够有效地防止路由重构，提高分组分发率
{"title":"Study of local alternative ad hoc routing protocol for the exposed terminal problem","authors":"Takanori Watanabe, K. Naito, K. Mori, Hideo Kobayashi","doi":"10.1109/ISPACS.2006.364834","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364834","url":null,"abstract":"Ad-hoc network is an autonomous network that consists of only mobile terminals without an infrastructure such as base stations. The wireless LAN system with IEEE 802.11 standard is one of the candidate schemes to realize ad-hoc network. In IEEE 802.11, CSMA/CA (carrier sense multiple access with collision avoidance) is used as access control method. Moreover RTS/CTS (request to send/clear to send) mechanism is implemented to solve the hidden terminal problem. However it is well known that RTS/CTS mechanism causes the exposed terminal problem in which the communication route between terminals would be suppressed. In this paper, we clarify the effect of the exposed terminal problem to the ad-hoc networks. Moreover we propose a local alternative routing protocol method that prepares back up routes to avoid the temporary suppression of transmissions. Simulation results show that the proposed method can prevent the route reconstruction and improve the packet delivery ratio","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131264014","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-12-01DOI: 10.1109/ISPACS.2006.364808
Arthur Segard, Frangois Verdier, David Declercq, Pascal Urardt
Low-density parity check codes (LDPC) are a class of channel decoding codes used in digital communications. Very high error correcting performances can be reached with such codes but they require both a great computing effort and randomly constructed decoding matrices. LDPC codes are used to perform the channel coding of the satellite television broadcast standard DVB-S2. This paper proposes a way to design massively parallel hardware architecture of DVB-S2 compliant LDPC decoders. It is based on a particular way to schedule all the algorithm's calculations. The proposed architecture speeds-up the decoding process, allowing the algorithm to converge faster with no significant performance loss. Moreover, a particular data update mechanism has been developed in order to avoid all data conflicts inherent to DVB-S2 matrices even for highly parallel implementations. This paper describes our hardware LDPC decoder architecture and its processing elements. Estimated silicon area of this decoder is 11 mm in ST 90 nm technology and the decoding throughput reaches 591 M bps at 300 MHz for rate 1/2 and code size of 64800
低密度奇偶校验码(LDPC)是一种用于数字通信的信道解码码。这种码可以达到很高的纠错性能，但需要大量的计算量和随机构造的译码矩阵。LDPC码用于执行卫星电视广播标准DVB-S2的信道编码。提出了一种适合DVB-S2标准的LDPC解码器的大规模并行硬件架构设计方法。它基于一种特殊的方式来安排所有算法的计算。所提出的架构加快了解码过程，使算法在没有显著性能损失的情况下更快地收敛。此外，为了避免DVB-S2矩阵固有的所有数据冲突，甚至对于高度并行的实现，也开发了一种特定的数据更新机制。本文介绍了我们的硬件LDPC解码器体系结构及其处理元件。在ST 90纳米技术下，该解码器的硅面积估计为11毫米，解码吞吐量在300 MHz下达到591 M bps，速率为1/2，代码大小为64800
{"title":"A DVB-S2 compliant LDPC decoder integrating the Horizontal Shuffle Scheduling","authors":"Arthur Segard, Frangois Verdier, David Declercq, Pascal Urardt","doi":"10.1109/ISPACS.2006.364808","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364808","url":null,"abstract":"Low-density parity check codes (LDPC) are a class of channel decoding codes used in digital communications. Very high error correcting performances can be reached with such codes but they require both a great computing effort and randomly constructed decoding matrices. LDPC codes are used to perform the channel coding of the satellite television broadcast standard DVB-S2. This paper proposes a way to design massively parallel hardware architecture of DVB-S2 compliant LDPC decoders. It is based on a particular way to schedule all the algorithm's calculations. The proposed architecture speeds-up the decoding process, allowing the algorithm to converge faster with no significant performance loss. Moreover, a particular data update mechanism has been developed in order to avoid all data conflicts inherent to DVB-S2 matrices even for highly parallel implementations. This paper describes our hardware LDPC decoder architecture and its processing elements. Estimated silicon area of this decoder is 11 mm in ST 90 nm technology and the decoding throughput reaches 591 M bps at 300 MHz for rate 1/2 and code size of 64800","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134052405","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-12-01DOI: 10.1109/ISPACS.2006.364882
Sung-Uk Jung, Jang-Hee Yoo
We propose a novel method of eye detection that is robust to obstacles such as the surrounding illumination, hair, glasses and etc. The obstacles above the face images are the constraints to detect eye position. These constraints affect the performance of face application systems such as face recognition, gaze tracking, and video indexing system. To overcome this problem, our method for eye detection consists of three steps. In preprocess, we apply SQI (self quotient image) to the face images to reduce illumination effect. Then, we extract the eye candidates by using the gradient descent which is simple and fast computing method. Finally, the classifier which has trained by using AdaBoost algorithm selects the eyes from all of the eye candidates. The usefulness of proposed method has been demonstrated in experiments with the eye detection performance
{"title":"Robust Eye Detection Using Self Quotient image","authors":"Sung-Uk Jung, Jang-Hee Yoo","doi":"10.1109/ISPACS.2006.364882","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364882","url":null,"abstract":"We propose a novel method of eye detection that is robust to obstacles such as the surrounding illumination, hair, glasses and etc. The obstacles above the face images are the constraints to detect eye position. These constraints affect the performance of face application systems such as face recognition, gaze tracking, and video indexing system. To overcome this problem, our method for eye detection consists of three steps. In preprocess, we apply SQI (self quotient image) to the face images to reduce illumination effect. Then, we extract the eye candidates by using the gradient descent which is simple and fast computing method. Finally, the classifier which has trained by using AdaBoost algorithm selects the eyes from all of the eye candidates. The usefulness of proposed method has been demonstrated in experiments with the eye detection performance","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133019316","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-12-01DOI: 10.1109/ISPACS.2006.364773
Shin'ichi Koike
This paper presents an adaptive filtering system where impulse noise is present at filter input. To study adverse, or favorable, effects of such impulse noise on adaptive filter performance, we develop transient and steady-state analysis of adaptive filters using the LMS algorithm (LMSA) and signed regressor LMS algorithm (SRA). Through analysis and experiment, we find that the SRA exhibits significantly higher robustness against the impulse noise than the LMSA. For the SRA, we find that mean square tap weight misalignment (MSTWM) decreases as the impulse noise variance increases, attaining a minimum before the filter diverges.
{"title":"Effects of Impulse Noise at Filter Input on Performance of Adaptive Filters Using the LMS and Signed Regressor LMS Algorithms","authors":"Shin'ichi Koike","doi":"10.1109/ISPACS.2006.364773","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364773","url":null,"abstract":"This paper presents an adaptive filtering system where impulse noise is present at filter input. To study adverse, or favorable, effects of such impulse noise on adaptive filter performance, we develop transient and steady-state analysis of adaptive filters using the LMS algorithm (LMSA) and signed regressor LMS algorithm (SRA). Through analysis and experiment, we find that the SRA exhibits significantly higher robustness against the impulse noise than the LMSA. For the SRA, we find that mean square tap weight misalignment (MSTWM) decreases as the impulse noise variance increases, attaining a minimum before the filter diverges.","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"309 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125032276","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}
A new biometrics authentication method for cellular phones which has an advantage of simple and natural operation is proposed. The proposed method authenticates owner using acceleration signals obtained by an acceleration sensor embedded in the cellular phones during his arm sweep action. When the owner wants to unlock its security, he just needs to grasp and shake his cellular phone. The proposed method verifies owner's acceleration signals by using a DP-matching algorithm which can adapt fluctuations caused by different grip. Simulation results show that the proposed method can achieve the best equal error rate 5.0% for 22 testers
{"title":"A Study on Biometric Authentication based on Arm Sweep Action with Acceleration Sensor","authors":"Fuminori Okumura, Akira Kubota, Y. Hatori, Kenji Matsuot, Masayuki Hashimotot, Atsushi Koiket","doi":"10.1109/ISPACS.2006.364871","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364871","url":null,"abstract":"A new biometrics authentication method for cellular phones which has an advantage of simple and natural operation is proposed. The proposed method authenticates owner using acceleration signals obtained by an acceleration sensor embedded in the cellular phones during his arm sweep action. When the owner wants to unlock its security, he just needs to grasp and shake his cellular phone. The proposed method verifies owner's acceleration signals by using a DP-matching algorithm which can adapt fluctuations caused by different grip. Simulation results show that the proposed method can achieve the best equal error rate 5.0% for 22 testers","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134163283","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-12-01DOI: 10.1109/ISPACS.2006.364701
J. Mar, You-Rong Lin, Ti-Han Lung, Ting han Wei
Following the DSRC vehicular communications IEEE802.11p physical layer standards, this paper presents the required computing time estimations of baseband processing modules on the DSP platform and uses this estimation to explain the decision of choosing to implement the 64 point IFFT/FFT module with the FPGA chip. The IFFT/FFT processing time of OFDM modulator/demodulator circuits in applications of DSRC vehicular communication system transceivers must be less than the symbol interval of 8 musec in order to satisfy the requirement of real-time DSRC communications. The 64-IFFT/FFT processing module presented in this paper uses a parallel processing structure of four butterfly circuit units, is capable of processing 16-bit digital signals, and completes 64-IFFT/FFT calculations in 5.33 musec (< 8 musec) with a 24 MHz FPGA chip. Ten short training symbols of the DSRC system are sent through the FPGA IFFT/FFT module to verify its functionality and performance
{"title":"Realization of OFDM Modulator and Demodulator for DSRC Vehicular Communication System Using FPGA Chip","authors":"J. Mar, You-Rong Lin, Ti-Han Lung, Ting han Wei","doi":"10.1109/ISPACS.2006.364701","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364701","url":null,"abstract":"Following the DSRC vehicular communications IEEE802.11p physical layer standards, this paper presents the required computing time estimations of baseband processing modules on the DSP platform and uses this estimation to explain the decision of choosing to implement the 64 point IFFT/FFT module with the FPGA chip. The IFFT/FFT processing time of OFDM modulator/demodulator circuits in applications of DSRC vehicular communication system transceivers must be less than the symbol interval of 8 musec in order to satisfy the requirement of real-time DSRC communications. The 64-IFFT/FFT processing module presented in this paper uses a parallel processing structure of four butterfly circuit units, is capable of processing 16-bit digital signals, and completes 64-IFFT/FFT calculations in 5.33 musec (< 8 musec) with a 24 MHz FPGA chip. Ten short training symbols of the DSRC system are sent through the FPGA IFFT/FFT module to verify its functionality and performance","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131831230","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-12-01DOI: 10.1109/ISPACS.2006.364860
M. Akhaee, S. Ghaemmaghami, N. Khademi
This paper presents a novel approach to audio signals watermarking in the wavelet or the Walsh transform domain. The idea is to embed watermark data in the coefficients of some scales of the transform domain. The overall bit rate of this method is about 90 bps. Due to low computational complexity of the suggested approach, particularly in the Walsh domain, this algorithm can be implemented in real time. Experimental results show robustness of the proposed method in low SNRs and also against some typical attacks, such as MP3 compression, echo, filtering, etc. Subjective evaluation confirms transparency of the watermarked audio signals
{"title":"A Novel Technique for Audio Signals Watermarking in the Wavelet and Walsh Transform Domains","authors":"M. Akhaee, S. Ghaemmaghami, N. Khademi","doi":"10.1109/ISPACS.2006.364860","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364860","url":null,"abstract":"This paper presents a novel approach to audio signals watermarking in the wavelet or the Walsh transform domain. The idea is to embed watermark data in the coefficients of some scales of the transform domain. The overall bit rate of this method is about 90 bps. Due to low computational complexity of the suggested approach, particularly in the Walsh domain, this algorithm can be implemented in real time. Experimental results show robustness of the proposed method in low SNRs and also against some typical attacks, such as MP3 compression, echo, filtering, etc. Subjective evaluation confirms transparency of the watermarked audio signals","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122356939","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-12-01DOI: 10.1109/ISPACS.2006.364713
Manabu Serata, Yutaka Hatakeyama, Kaoru Hirota
For automatic image annotation, a method based on rough sets with visual keys is proposed. Using rough set theory the method constructs decision rules about each visual key used for image indexing and about keywords from training set of already annotated images. Then target image is annotated according to constructed decision rules about visual keys which the target image is indexed by. The method is evaluated with training sets of 900 images and with test sets of 100 images on 1,000 manually annotated images in COREL database. Experiments show that recall rates tend to rise easily compared with precision rates on image retrieval with query-by-keywords
{"title":"Automatic Image Annotation based-on Rough Set Theory with Visual Keys","authors":"Manabu Serata, Yutaka Hatakeyama, Kaoru Hirota","doi":"10.1109/ISPACS.2006.364713","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364713","url":null,"abstract":"For automatic image annotation, a method based on rough sets with visual keys is proposed. Using rough set theory the method constructs decision rules about each visual key used for image indexing and about keywords from training set of already annotated images. Then target image is annotated according to constructed decision rules about visual keys which the target image is indexed by. The method is evaluated with training sets of 900 images and with test sets of 100 images on 1,000 manually annotated images in COREL database. Experiments show that recall rates tend to rise easily compared with precision rates on image retrieval with query-by-keywords","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114327342","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-12-01DOI: 10.1109/ISPACS.2006.364843
M. Shimizu, H. Nakada
RFIDs are an interesting approach to accessing anything through the network. The most commonly mentioned variant is the passive RFID, but it has several serious problems. This paper focuses on the "active" RFID to realize "ubiquitous communication". First, the principle of active tags is mentioned, and the problem of readout rate is considered. Several actual applications using active RFIDs are introduced
{"title":"The Practical Example Case of Active RFID","authors":"M. Shimizu, H. Nakada","doi":"10.1109/ISPACS.2006.364843","DOIUrl":"https://doi.org/10.1109/ISPACS.2006.364843","url":null,"abstract":"RFIDs are an interesting approach to accessing anything through the network. The most commonly mentioned variant is the passive RFID, but it has several serious problems. This paper focuses on the \"active\" RFID to realize \"ubiquitous communication\". First, the principle of active tags is mentioned, and the problem of readout rate is considered. Several actual applications using active RFIDs are introduced","PeriodicalId":178644,"journal":{"name":"2006 International Symposium on Intelligent Signal Processing and Communications","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116969048","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
扫码关注我们
求助内容：
应助结果提醒方式：