Pub Date : 2008-12-16DOI: 10.1109/ICCT.2008.4716235
Wei Lin, Shizhen Huang, G.-Q. Tong, Wei Lin
This paper give a design of a TD-SCDMA frequency synthesizer using multi-ring phase-locked loop, its output frequency has the very good precision and stability.The specific circuit is simulation using 0.5 um BICMOS technology and Cadence SpectreRF. The performance of whole frequency synthesizer is: its output frequency range is 2010 MHz - 2025 MHz, the frequency changing of stride is 200 KHz, the frequency locking time is smaller than 20 us, the power voltage is 3.3 V, the power consumption is 63.26 mW.
{"title":"TD-SCDMA system frequency synthesizer design","authors":"Wei Lin, Shizhen Huang, G.-Q. Tong, Wei Lin","doi":"10.1109/ICCT.2008.4716235","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716235","url":null,"abstract":"This paper give a design of a TD-SCDMA frequency synthesizer using multi-ring phase-locked loop, its output frequency has the very good precision and stability.The specific circuit is simulation using 0.5 um BICMOS technology and Cadence SpectreRF. The performance of whole frequency synthesizer is: its output frequency range is 2010 MHz - 2025 MHz, the frequency changing of stride is 200 KHz, the frequency locking time is smaller than 20 us, the power voltage is 3.3 V, the power consumption is 63.26 mW.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115311400","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-12-16DOI: 10.1109/ICCT.2008.4716280
Yang Juan, Yali Qin, Chen Shuyu, C. Xiaofei, H. Ren
We investigate the propagation dynamics of one dimensional partially coherent solitons in logarithmically saturable photorefractive media by using the coherent density theory, specially using this approach to study the self-trapping behavior of coherent beam. It is shown that the solitons can propagate stationary. Moreover, the other dynamics evolution of beam is discussed, that when the value of degree of coherence is departure from the set of the value of self-trapping, the beam continually expands and contracts. The evolution properties of coherent components that consist of partially coherent beams are also analyzed in detail.
{"title":"Notice of RetractionPropagation of partially coherent solitons in photorefractive crystal","authors":"Yang Juan, Yali Qin, Chen Shuyu, C. Xiaofei, H. Ren","doi":"10.1109/ICCT.2008.4716280","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716280","url":null,"abstract":"We investigate the propagation dynamics of one dimensional partially coherent solitons in logarithmically saturable photorefractive media by using the coherent density theory, specially using this approach to study the self-trapping behavior of coherent beam. It is shown that the solitons can propagate stationary. Moreover, the other dynamics evolution of beam is discussed, that when the value of degree of coherence is departure from the set of the value of self-trapping, the beam continually expands and contracts. The evolution properties of coherent components that consist of partially coherent beams are also analyzed in detail.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116854416","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-12-16DOI: 10.1109/ICCT.2008.4716152
Zhenying Sun, Yigang Wang, Lexiao Ye
In this paper, we present a system which uses laser pen for human-computer interaction in the projection display system. The system adds two additional hardware devices to original projection display system: camera and laser pen with functions of mouse buttons. The laser point on the projection screen is captured by the camera and its location is computed by coordinate conversion. The movement of cursor is controlled by the projection points of laser pen; the functioning keys of the mouse can be simulated by the functioning keys of the laser pen. Users can control the object on the projection screen by the laser pen just like normal mouse.
{"title":"Research on human-computer interaction with laser-pen in projection display","authors":"Zhenying Sun, Yigang Wang, Lexiao Ye","doi":"10.1109/ICCT.2008.4716152","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716152","url":null,"abstract":"In this paper, we present a system which uses laser pen for human-computer interaction in the projection display system. The system adds two additional hardware devices to original projection display system: camera and laser pen with functions of mouse buttons. The laser point on the projection screen is captured by the camera and its location is computed by coordinate conversion. The movement of cursor is controlled by the projection points of laser pen; the functioning keys of the mouse can be simulated by the functioning keys of the laser pen. Users can control the object on the projection screen by the laser pen just like normal mouse.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127276960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-12-16DOI: 10.1109/ICCT.2008.4716140
Ru Li, Rui-lin Yang, Da-wei Hu
This paper puts forward a session-based mobility management in MANET which in an efficient manner meets the requirements of rapid deployment of the network with auto-configuration but no need of manual intervention in disaster-rescue situations. A new system called MMAH, which eliminates the otherwise restrictions of mobility management of Mobile IP in MANET, promises more extensive applications of MANET.
{"title":"A designing of mobility management mechanism in MANET in disaster-rescue situations","authors":"Ru Li, Rui-lin Yang, Da-wei Hu","doi":"10.1109/ICCT.2008.4716140","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716140","url":null,"abstract":"This paper puts forward a session-based mobility management in MANET which in an efficient manner meets the requirements of rapid deployment of the network with auto-configuration but no need of manual intervention in disaster-rescue situations. A new system called MMAH, which eliminates the otherwise restrictions of mobility management of Mobile IP in MANET, promises more extensive applications of MANET.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125934541","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}
In traditional tracking systems, the mobiles report their locations periodically. With the number of the mobiles increasing, these methods result in high loss rate of packets and rapid depletion of the network energy. In practice, we observe that some mobiles are so close to each other that we are informed the same location from the localization algorithm. Thus it is necessary and possible to reduce message complexity through merging the location messages. By exploiting the Received Signal Strength (RSS), this paper proposes a human-Behavior based Mobile Clustering Mechanism (BMC) for Rf-based Person Tracking Systems. It constructs clusters according to the distance between mobiles and maintains clusters efficiently. In BMC, only the cluster-heads report locations periodically instead of each node, thereby decreasing the message complexity greatly. Signal interference will wobble the clusters in practical environment, so it degrades the performance of BMC dramatically. To address the issue, Signal Smoothness is developed. The simulation shows that BMC based location report outperforms traditional methods by 64% of message reduction on average in impartial testing scenes.
{"title":"Cluster-based location report for person tracking in wireless sensor networks","authors":"Yongkai Huo, Liusheng Huang, Hongli Xu, Ben-chong Xu","doi":"10.1109/ICCT.2008.4716135","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716135","url":null,"abstract":"In traditional tracking systems, the mobiles report their locations periodically. With the number of the mobiles increasing, these methods result in high loss rate of packets and rapid depletion of the network energy. In practice, we observe that some mobiles are so close to each other that we are informed the same location from the localization algorithm. Thus it is necessary and possible to reduce message complexity through merging the location messages. By exploiting the Received Signal Strength (RSS), this paper proposes a human-Behavior based Mobile Clustering Mechanism (BMC) for Rf-based Person Tracking Systems. It constructs clusters according to the distance between mobiles and maintains clusters efficiently. In BMC, only the cluster-heads report locations periodically instead of each node, thereby decreasing the message complexity greatly. Signal interference will wobble the clusters in practical environment, so it degrades the performance of BMC dramatically. To address the issue, Signal Smoothness is developed. The simulation shows that BMC based location report outperforms traditional methods by 64% of message reduction on average in impartial testing scenes.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129521368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-12-16DOI: 10.1109/ICCT.2008.4716137
Zhang Jianwu, Liu fengzhong, Zou Jingyuan, Sun Xiaoxi
Considering the high data rate of ultra-wideband (UWB) system, paper develops a ranging-aided quality-of-service (QoS) routing protocol. In this protocol, we introduce two QoS parameters: transfer bit rate and end-to-end delay. We optimize these two parameters to choose routing and change routing in time using UWB ranging. This protocol provides a steady routing for high data rate operation. This paper describes the process of route finding, route select and set up, and route maintain in detail, and simulate the performance of the protocol by OPENT. The result of simulation indicates that the protocol is better than the DSR protocol in throughput and average time delay.
{"title":"A ranging-aided QoS routing protocol of UWB ad hoc network","authors":"Zhang Jianwu, Liu fengzhong, Zou Jingyuan, Sun Xiaoxi","doi":"10.1109/ICCT.2008.4716137","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716137","url":null,"abstract":"Considering the high data rate of ultra-wideband (UWB) system, paper develops a ranging-aided quality-of-service (QoS) routing protocol. In this protocol, we introduce two QoS parameters: transfer bit rate and end-to-end delay. We optimize these two parameters to choose routing and change routing in time using UWB ranging. This protocol provides a steady routing for high data rate operation. This paper describes the process of route finding, route select and set up, and route maintain in detail, and simulate the performance of the protocol by OPENT. The result of simulation indicates that the protocol is better than the DSR protocol in throughput and average time delay.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128427065","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-12-16DOI: 10.1109/ICCT.2008.4716276
Chen Haiyan, Wang Feng-wen, Tian Naishuo, Lu Donghua
In the paper, we propose N-policy working vacation scheme cyclic polling system for WDM. This system consists of multi-queues (terminals) whose service rate is one of the fast speed and lower speed. The fast speed mode moves cyclically from queue to queue with N-policy. Using the decomposition approach, each queue is analyzed as a single server queue with N-policy working vacation which works at a different rate rather than completely stops during the vacation polling period. Using quasi birth and death chain and matrix geometric solution method, we give some performance parameters, such as the mean queue length and mean waiting time of packet and the mean throughput. Finally, we analyze the effect of the parameters on the mean waiting time and mean queue length through numerical examples.
{"title":"Study on N-policy working vacation polling system for WDM","authors":"Chen Haiyan, Wang Feng-wen, Tian Naishuo, Lu Donghua","doi":"10.1109/ICCT.2008.4716276","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716276","url":null,"abstract":"In the paper, we propose N-policy working vacation scheme cyclic polling system for WDM. This system consists of multi-queues (terminals) whose service rate is one of the fast speed and lower speed. The fast speed mode moves cyclically from queue to queue with N-policy. Using the decomposition approach, each queue is analyzed as a single server queue with N-policy working vacation which works at a different rate rather than completely stops during the vacation polling period. Using quasi birth and death chain and matrix geometric solution method, we give some performance parameters, such as the mean queue length and mean waiting time of packet and the mean throughput. Finally, we analyze the effect of the parameters on the mean waiting time and mean queue length through numerical examples.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128985779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-12-16DOI: 10.1109/ICCT.2008.4716150
Yunhong Li, Luo Siwen, Xusheng Xie
A series of information centre solutions are proposed based on the research of the characteristics of telecom information centre platform. The thesis analyzes and designs the structures and function of the information centre system. The system may be applied into the usage of China Telecom, and it would inspire us on the construction of China Telecom informatization in some degree.
{"title":"Research and design of the system architecture of the telecom information centre","authors":"Yunhong Li, Luo Siwen, Xusheng Xie","doi":"10.1109/ICCT.2008.4716150","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716150","url":null,"abstract":"A series of information centre solutions are proposed based on the research of the characteristics of telecom information centre platform. The thesis analyzes and designs the structures and function of the information centre system. The system may be applied into the usage of China Telecom, and it would inspire us on the construction of China Telecom informatization in some degree.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129063840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-12-16DOI: 10.1109/ICCT.2008.4716279
Xin Chen, Aidong Men
Low-density parity-check (LDPC) codes over finite fields GF(q) have a better performance than those of the binary low-density parity-check codes, at short and medium block lengths, but the decoder of GF(q)-LDPC has more complexity. In this paper, we present a new reduced-complexity belief propagation (BP) decoding algorithm for GF(q)-LDPC codes by analyzing the reliability of code symbols. Instead of update all the variable nodes during iteration, we just update variable nodes which are mostly to be in an error. The algorithm also shows a property to reduce the effects of oscillating on decoding. The simulations prove that we could improve performance and reduce complexity at the same time for short and medium GF(q)-LDPC codes.
{"title":"Reduced complexity and improved performance decoding algorithm for nonbinary LDPC codes over GF(q)","authors":"Xin Chen, Aidong Men","doi":"10.1109/ICCT.2008.4716279","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716279","url":null,"abstract":"Low-density parity-check (LDPC) codes over finite fields GF(q) have a better performance than those of the binary low-density parity-check codes, at short and medium block lengths, but the decoder of GF(q)-LDPC has more complexity. In this paper, we present a new reduced-complexity belief propagation (BP) decoding algorithm for GF(q)-LDPC codes by analyzing the reliability of code symbols. Instead of update all the variable nodes during iteration, we just update variable nodes which are mostly to be in an error. The algorithm also shows a property to reduce the effects of oscillating on decoding. The simulations prove that we could improve performance and reduce complexity at the same time for short and medium GF(q)-LDPC codes.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124657303","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2008-12-16DOI: 10.1109/ICCT.2008.4716134
Hai Jiang, Jing Liu, Jun Li, Zhongcheng Li
It is meritorious but hard to develop a scalable and manageable system to effectively distribute the large-scale multimedia contents. In this paper, an integrated hierarchical content distribution system is proposed, which utilizes the complementary advantages of both CDN (content delivery network) and P2P (peer-to-peer). The hybrid architecture and distribution operations are presented in detail. The clear performance benefits of our approach are shown with comparison of conventional CDN and P2P.
{"title":"A scalable system for large-scale multimedia distribution based on hybrid networks","authors":"Hai Jiang, Jing Liu, Jun Li, Zhongcheng Li","doi":"10.1109/ICCT.2008.4716134","DOIUrl":"https://doi.org/10.1109/ICCT.2008.4716134","url":null,"abstract":"It is meritorious but hard to develop a scalable and manageable system to effectively distribute the large-scale multimedia contents. In this paper, an integrated hierarchical content distribution system is proposed, which utilizes the complementary advantages of both CDN (content delivery network) and P2P (peer-to-peer). The hybrid architecture and distribution operations are presented in detail. The clear performance benefits of our approach are shown with comparison of conventional CDN and P2P.","PeriodicalId":259577,"journal":{"name":"2008 11th IEEE International Conference on Communication Technology","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124092064","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
扫码关注我们
求助内容：
应助结果提醒方式：