Pub Date : 2007-12-04DOI: 10.1109/ISCIT.2007.4391980
Haipeng Zhang, Lifei Jiang, Lingling Sun, Wenjun Li, Lei Zhou, Boxing Hua, Liyan Xu, Mi Lin
In this paper a novel structural silicon on insulator (SOI) LDMOS with trench gate and field plate and trench drain (TGFPTD) is firstly proposed. The proposed TGFPTD SOI LDMOS is mainly characterized of a vertical channel and channel current spreading area, a lateral drift region, a field-stopping doped area, a trench drain as well as nearly the most homogenous current flowing through the drift region. Therefore it is convinced that the proposed TGFPTD SOI LDMOS cell is featured of much lower on-resistance, lower on-state voltage drop and power dissipation, higher breakdown voltage and higher switching speed than those of conventional SOI LDMOS. Simulated results obtained with TCAD tools indicate that the proposed TGFPTD SOI LDMOS cell could be realized to some extent in advanced CMOS technologies and is characterized of low on-state voltage drop, low on-state static resistor and high off-state breakdown voltage.
本文首次提出了一种具有沟槽栅极和场极板沟槽漏极结构的新型绝缘子硅(SOI) LDMOS (TGFPTD)。所提出的TGFPTD SOI LDMOS主要具有垂直沟道和沟道电流扩展区、横向漂移区、停场掺杂区、沟槽漏极以及几乎最均匀的电流流过漂移区。因此，可以确信TGFPTD SOI LDMOS电池具有比传统SOI LDMOS更低的导通电阻、更低的导通压降和功耗、更高的击穿电压和更高的开关速度。TCAD仿真结果表明，TGFPTD SOI LDMOS电池具有低导通压降、低导通静态电阻和高导通击穿电压的特点，在一定程度上可以在先进的CMOS技术中实现。
{"title":"A novel SOI LDMOS with a Trench Gate and Field Plate and Trench Drain for RF applications","authors":"Haipeng Zhang, Lifei Jiang, Lingling Sun, Wenjun Li, Lei Zhou, Boxing Hua, Liyan Xu, Mi Lin","doi":"10.1109/ISCIT.2007.4391980","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4391980","url":null,"abstract":"In this paper a novel structural silicon on insulator (SOI) LDMOS with trench gate and field plate and trench drain (TGFPTD) is firstly proposed. The proposed TGFPTD SOI LDMOS is mainly characterized of a vertical channel and channel current spreading area, a lateral drift region, a field-stopping doped area, a trench drain as well as nearly the most homogenous current flowing through the drift region. Therefore it is convinced that the proposed TGFPTD SOI LDMOS cell is featured of much lower on-resistance, lower on-state voltage drop and power dissipation, higher breakdown voltage and higher switching speed than those of conventional SOI LDMOS. Simulated results obtained with TCAD tools indicate that the proposed TGFPTD SOI LDMOS cell could be realized to some extent in advanced CMOS technologies and is characterized of low on-state voltage drop, low on-state static resistor and high off-state breakdown voltage.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121966667","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 : 2007-12-04DOI: 10.1109/ISCIT.2007.4392051
Ranran Zhang, Aimin Yang, G. Xie, Yuan'an Liu, B. Tang
This paper investigates the optimal bit and power allocation to minimize transmission power under system bit error rate (BER) and transmission rate requirements for multiple-input multiple-output (MIMO) systems with imperfect channel state information (CSI). A robust greedy algorithm is proposed and proved to be the optimal robust bit and power allocation by simulation. Simulation results also show that the proposed robust algorithm has steady BER performance, and can satisfy the system BER requirement when the CSI error increases, while the non-robust greedy algorithm can not.
{"title":"Optimal robust bit and power allocation for MIMO systems","authors":"Ranran Zhang, Aimin Yang, G. Xie, Yuan'an Liu, B. Tang","doi":"10.1109/ISCIT.2007.4392051","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4392051","url":null,"abstract":"This paper investigates the optimal bit and power allocation to minimize transmission power under system bit error rate (BER) and transmission rate requirements for multiple-input multiple-output (MIMO) systems with imperfect channel state information (CSI). A robust greedy algorithm is proposed and proved to be the optimal robust bit and power allocation by simulation. Simulation results also show that the proposed robust algorithm has steady BER performance, and can satisfy the system BER requirement when the CSI error increases, while the non-robust greedy algorithm can not.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128402436","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 : 2007-12-04DOI: 10.1109/ISCIT.2007.4392150
Yi Wang, Hairong Chen, Xinyu Yang, Deyun Zhang
Node clustering is an effective technique to mitigate the topology changes in mobile ad hoc networks (MANET) because nodes are dynamic in nature due to the mobility of nodes. Many clustering algorithms, in which MANET is usually assumed to be homogeneous, have been proposed. However, a homogeneous MANET suffers from poor scalability. Recent research has demonstrated its performance bottleneck both theoretically and through simulation experiments and testbed measurement. In this paper, a design methodology is presented, named weight based adaptive clustering for large scale heterogeneous MANET (WACHM), in order to build a large scale hierarchical MANET using heterogeneous nodes to construct different layers. Four critical issues are addressed. First the optimal number of CHs is analyzed in theory. Then the optimal hops via simulations are obtained. Finally the dependency probability and the link stability are defined. In cluster head election, we take into account the degree-difference, battery power, average link stability and dependency probability for electing cluster heads from advanced nodes. At last, four scenarios of cluster maintenance are proposed and solved. Simulation results show that WACHM achieve good scalability and demonstrate the superior performance of WACHM.
{"title":"WACHM: Weight based adaptive clustering for large scale heterogeneous MANET","authors":"Yi Wang, Hairong Chen, Xinyu Yang, Deyun Zhang","doi":"10.1109/ISCIT.2007.4392150","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4392150","url":null,"abstract":"Node clustering is an effective technique to mitigate the topology changes in mobile ad hoc networks (MANET) because nodes are dynamic in nature due to the mobility of nodes. Many clustering algorithms, in which MANET is usually assumed to be homogeneous, have been proposed. However, a homogeneous MANET suffers from poor scalability. Recent research has demonstrated its performance bottleneck both theoretically and through simulation experiments and testbed measurement. In this paper, a design methodology is presented, named weight based adaptive clustering for large scale heterogeneous MANET (WACHM), in order to build a large scale hierarchical MANET using heterogeneous nodes to construct different layers. Four critical issues are addressed. First the optimal number of CHs is analyzed in theory. Then the optimal hops via simulations are obtained. Finally the dependency probability and the link stability are defined. In cluster head election, we take into account the degree-difference, battery power, average link stability and dependency probability for electing cluster heads from advanced nodes. At last, four scenarios of cluster maintenance are proposed and solved. Simulation results show that WACHM achieve good scalability and demonstrate the superior performance of WACHM.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129335165","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 : 2007-12-04DOI: 10.1109/ISCIT.2007.4392099
Julien Clément, Kwan-Wu Chin
This paper studies the characteristics of border gateway protocol (BGP) routes. In particular, it identifies autonomous systems (ASs) that appear frequently in path vectors. In addition, it analyzes path vector lengths. Finally, it investigates the prevalence of inflated paths, commonly used by ASs for traffic engineering purposes.
{"title":"On the characteristics of BGP routes","authors":"Julien Clément, Kwan-Wu Chin","doi":"10.1109/ISCIT.2007.4392099","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4392099","url":null,"abstract":"This paper studies the characteristics of border gateway protocol (BGP) routes. In particular, it identifies autonomous systems (ASs) that appear frequently in path vectors. In addition, it analyzes path vector lengths. Finally, it investigates the prevalence of inflated paths, commonly used by ASs for traffic engineering purposes.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130395821","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 : 2007-12-04DOI: 10.1109/ISCIT.2007.4392132
HuiYao Zhang, M. Bialkowski, G. Einicke, J. Homer
Most of the routing protocols designed for ad hoc networks assume that IEEE 802.11b is used for lowest-layer communications. In IEEE 802.11 ad hoc mode, the DCF is the basic medium access protocol. In this paper we consider voice calls over mobile ad hoc network based on 802.11b MAC. A new routing metric for searching a stable routing in ad hoc network based on an extended AODV protocol is proposed. The simulation results presented in this work show that the new protocol can improve performance of VoIP over ad hoc network as compared to standard AODV protocol.
大多数为自组织网络设计的路由协议都假定IEEE 802.11b用于最低层通信。在IEEE 802.11 ad hoc模式中，DCF是基本的介质访问协议。本文以基于802.11b MAC的移动自组网语音呼叫为研究对象，提出了一种新的基于扩展AODV协议的自组网稳定路由度量。仿真结果表明，与标准的AODV协议相比，新协议可以提高ad hoc网络上VoIP的性能。
{"title":"An extended AODV protocol for VoIP application in mobile ad hoc network","authors":"HuiYao Zhang, M. Bialkowski, G. Einicke, J. Homer","doi":"10.1109/ISCIT.2007.4392132","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4392132","url":null,"abstract":"Most of the routing protocols designed for ad hoc networks assume that IEEE 802.11b is used for lowest-layer communications. In IEEE 802.11 ad hoc mode, the DCF is the basic medium access protocol. In this paper we consider voice calls over mobile ad hoc network based on 802.11b MAC. A new routing metric for searching a stable routing in ad hoc network based on an extended AODV protocol is proposed. The simulation results presented in this work show that the new protocol can improve performance of VoIP over ad hoc network as compared to standard AODV protocol.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130662958","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 : 2007-12-04DOI: 10.1109/ISCIT.2007.4392036
O. Sugihara, T. Kaino
Recent development of polymer optical waveguides toward the next generation fiber to the home (FTTH) systems will be discussed. Simple fabrication and evaluation techniques of multi-mode polymer optical waveguides are proposed and demonstrated.
{"title":"Simple fabrication and evaluation of multi-mode polymer optical waveguides for next generation FTTH systems","authors":"O. Sugihara, T. Kaino","doi":"10.1109/ISCIT.2007.4392036","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4392036","url":null,"abstract":"Recent development of polymer optical waveguides toward the next generation fiber to the home (FTTH) systems will be discussed. Simple fabrication and evaluation techniques of multi-mode polymer optical waveguides are proposed and demonstrated.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123860294","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 : 2007-12-04DOI: 10.1109/ISCIT.2007.4392244
Yasuo Hatano, K. Miyazaki, T. Kaneko
This paper proposes an efficient encryption method for a group communication in which parts of a ciphertext are decrypted selectively by a recipient's private key. Sensitive information, e.g., personal information, in a message is browsed by several users should be disclosed only to authorized users even if any user can read the other parts of the message. The simplest way to do this is by encrypting a message for each recipient independently. This simple approach, however, is not efficient because the increase of the ciphertext size depends on the number of recipients. The proposed method uses an RSA accumulator to calculate shared keys and uses a randomness re-using encryption scheme (RR-MRES) to encrypt a message. Thanks to the quasi-commutativity of RSA accumulators, and the efficiency of RR-MRESs, the proposed method reduces the ciphertext size needed for selective disclosure.
{"title":"A study on encryption method in group communication using RSA accumulator","authors":"Yasuo Hatano, K. Miyazaki, T. Kaneko","doi":"10.1109/ISCIT.2007.4392244","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4392244","url":null,"abstract":"This paper proposes an efficient encryption method for a group communication in which parts of a ciphertext are decrypted selectively by a recipient's private key. Sensitive information, e.g., personal information, in a message is browsed by several users should be disclosed only to authorized users even if any user can read the other parts of the message. The simplest way to do this is by encrypting a message for each recipient independently. This simple approach, however, is not efficient because the increase of the ciphertext size depends on the number of recipients. The proposed method uses an RSA accumulator to calculate shared keys and uses a randomness re-using encryption scheme (RR-MRES) to encrypt a message. Thanks to the quasi-commutativity of RSA accumulators, and the efficiency of RR-MRESs, the proposed method reduces the ciphertext size needed for selective disclosure.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126452741","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 : 2007-12-04DOI: 10.1109/ISCIT.2007.4392178
Fu Bo, Chuangbai Xiao
The H.264/AVC video coding standard can achieve considerably higher coding efficiency compared with previous standards. Unfortunately, such excellent coding efficiency comes with extremely high complex computations. In order to reduce computational complexity of H.264 and broaden its application domain, this paper proposes a novel fast intermode decision algorithm. This algorithm includes early SKIP mode detection and unnecessary RDO computation exclusion. Experimental results show that our algorithm can averagely reduce 71% encoding time and 1.94% bitrate compared with the reference software JM11.0 only with 0.0875dB PSNR loss.
{"title":"A novel fast intermode decision algorithm with rate-distortion optimization for H.264/AVC","authors":"Fu Bo, Chuangbai Xiao","doi":"10.1109/ISCIT.2007.4392178","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4392178","url":null,"abstract":"The H.264/AVC video coding standard can achieve considerably higher coding efficiency compared with previous standards. Unfortunately, such excellent coding efficiency comes with extremely high complex computations. In order to reduce computational complexity of H.264 and broaden its application domain, this paper proposes a novel fast intermode decision algorithm. This algorithm includes early SKIP mode detection and unnecessary RDO computation exclusion. Experimental results show that our algorithm can averagely reduce 71% encoding time and 1.94% bitrate compared with the reference software JM11.0 only with 0.0875dB PSNR loss.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126456056","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 : 2007-12-04DOI: 10.1109/ISCIT.2007.4392162
G. Xie, Xiong Fang, Aimin Yang, Yuan'an Liu
We have investigated channel estimation with robust pilot symbol and spatial correlation information. Uncorrelative MIMO channel estimation based on ML criterion and pilot design scheme is given in this paper. Since spatial correlation cannot be avoided in real MIMO systems, we present new channel estimation which can make the best of spatial correlation information. The theoretic analysis and simulation results prove that our presented algorithm outperform traditional channel estimation algorithm.
{"title":"Channel estimation with pilot symbol and spatial correlation information","authors":"G. Xie, Xiong Fang, Aimin Yang, Yuan'an Liu","doi":"10.1109/ISCIT.2007.4392162","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4392162","url":null,"abstract":"We have investigated channel estimation with robust pilot symbol and spatial correlation information. Uncorrelative MIMO channel estimation based on ML criterion and pilot design scheme is given in this paper. Since spatial correlation cannot be avoided in real MIMO systems, we present new channel estimation which can make the best of spatial correlation information. The theoretic analysis and simulation results prove that our presented algorithm outperform traditional channel estimation algorithm.","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128151850","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 : 2007-12-04DOI: 10.1109/ISCIT.2007.4392064
Wenjuan Pan, Yong Yao, Zhijing Liu, Weiyao Huang
This paper presents a novel audio classification algorithm, which combines the rule-based with model-based method in an efficient way. First, the threshold-based method is performed over each audio clip for preclassification, with three typical features utilized and majority rule applied. Next, a weighted frame-based Support Vector Machine (SVM) is presented for further classification, using a new feature Mel-ICA as classification feature and preclassification results as weights. Finally, the experimental results have shown that the presented algorithm achieved effective audio classification, with accuracy rate increased greatly, and the new Mel-ICA was more suitable for classification than traditional mel-frequency cepstral coefficients (MFCCs).
{"title":"Audio classification in a weighted SVM","authors":"Wenjuan Pan, Yong Yao, Zhijing Liu, Weiyao Huang","doi":"10.1109/ISCIT.2007.4392064","DOIUrl":"https://doi.org/10.1109/ISCIT.2007.4392064","url":null,"abstract":"This paper presents a novel audio classification algorithm, which combines the rule-based with model-based method in an efficient way. First, the threshold-based method is performed over each audio clip for preclassification, with three typical features utilized and majority rule applied. Next, a weighted frame-based Support Vector Machine (SVM) is presented for further classification, using a new feature Mel-ICA as classification feature and preclassification results as weights. Finally, the experimental results have shown that the presented algorithm achieved effective audio classification, with accuracy rate increased greatly, and the new Mel-ICA was more suitable for classification than traditional mel-frequency cepstral coefficients (MFCCs).","PeriodicalId":331439,"journal":{"name":"2007 International Symposium on Communications and Information Technologies","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125604701","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
扫码关注我们
求助内容：
应助结果提醒方式：