Pub Date : 2009-09-01DOI: 10.1109/YCICT.2009.5382322
Yafei Cao, Dawei Wang, Sikun Li
Network-on-Chip mapping and the configuration of the communication parameters are critical process of the NoC design. They significantly influence the performance, area and power of the NoCs. We take the NoC mapping problem and the design of the communication parameters both into account. First, we formalize the problem of NoC mapping. Then we propose an analytical delay model based on wormhole switching. We heuristic map the application model to NoC topology under the constraints of communication delay and obtain the communication parameters automatically. Experiments show that our approach is more comprehensive than previous work and the time consumed by our approach is up to 30% of the reference work.
{"title":"A heuristic mapping approach for wormhole switching based Network-on-Chip","authors":"Yafei Cao, Dawei Wang, Sikun Li","doi":"10.1109/YCICT.2009.5382322","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382322","url":null,"abstract":"Network-on-Chip mapping and the configuration of the communication parameters are critical process of the NoC design. They significantly influence the performance, area and power of the NoCs. We take the NoC mapping problem and the design of the communication parameters both into account. First, we formalize the problem of NoC mapping. Then we propose an analytical delay model based on wormhole switching. We heuristic map the application model to NoC topology under the constraints of communication delay and obtain the communication parameters automatically. Experiments show that our approach is more comprehensive than previous work and the time consumed by our approach is up to 30% of the reference work.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130378563","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382365
Xinghui Dong, Junyu Dong, Liang Qu
In this paper, we introduce a simple approach for detecting enteromorpha based on statistical learning of image features using support vector machines (SVM). The approach first classifies an enteromorpha image into two classes: enteromorpha and background. Then it extracts features from those two classes and uses them for training the SVM model. Finally, the predicting process is carried out in a pixel by pixel manner using the learned model. The model uses saturation in NTSC color space or filtered images by Gabor filter as the input features while the output class label is treated as 1 or 2 (enteromorpha or background), which is assigned to the location that is being predicted. In fact, this application is only a two-class pattern classification problem. Experimental results show that the method can be effectively applied to detecting enteromorpha in aerial images.
{"title":"Enteromorpha detection in aerial images using support vector machines","authors":"Xinghui Dong, Junyu Dong, Liang Qu","doi":"10.1109/YCICT.2009.5382365","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382365","url":null,"abstract":"In this paper, we introduce a simple approach for detecting enteromorpha based on statistical learning of image features using support vector machines (SVM). The approach first classifies an enteromorpha image into two classes: enteromorpha and background. Then it extracts features from those two classes and uses them for training the SVM model. Finally, the predicting process is carried out in a pixel by pixel manner using the learned model. The model uses saturation in NTSC color space or filtered images by Gabor filter as the input features while the output class label is treated as 1 or 2 (enteromorpha or background), which is assigned to the location that is being predicted. In fact, this application is only a two-class pattern classification problem. Experimental results show that the method can be effectively applied to detecting enteromorpha in aerial images.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117207548","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382394
Lan Shao, Wenbo Wang, Li Wang, Yicheng Lin, Yuexing Peng
In this paper, an adaptive distributed space-time block code (ADSTBC) with linear decoding complexity is proposed. Within a group of candidate minimum-decoding-complexity quasi-orthogonal STBC (MDC-QO-STBC) codewords obtained by changing the row order of a basic one, the codeword that has minimum absolute value of interference between real symbols (IRS) in its equivalent channel correlation matrix is optimal and adopted by ADSTBC. In addition, for the optimal codeword's IRS absolute value is small enough to be ignored, linear decoding can achieve the performance of single complex symbol maximum-likelihood decoding, which is employed by MDC-QO-STBC, thus the decoding complexity is significantly reduced. The simulation results when the cooperative relays number is 4 and 3 both show the superiority of ASTBC over the normal DSTBC in the block error ratio performance and decoding complexity as well.
{"title":"Adaptive distributed space-time block code with linear decoding complexity","authors":"Lan Shao, Wenbo Wang, Li Wang, Yicheng Lin, Yuexing Peng","doi":"10.1109/YCICT.2009.5382394","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382394","url":null,"abstract":"In this paper, an adaptive distributed space-time block code (ADSTBC) with linear decoding complexity is proposed. Within a group of candidate minimum-decoding-complexity quasi-orthogonal STBC (MDC-QO-STBC) codewords obtained by changing the row order of a basic one, the codeword that has minimum absolute value of interference between real symbols (IRS) in its equivalent channel correlation matrix is optimal and adopted by ADSTBC. In addition, for the optimal codeword's IRS absolute value is small enough to be ignored, linear decoding can achieve the performance of single complex symbol maximum-likelihood decoding, which is employed by MDC-QO-STBC, thus the decoding complexity is significantly reduced. The simulation results when the cooperative relays number is 4 and 3 both show the superiority of ASTBC over the normal DSTBC in the block error ratio performance and decoding complexity as well.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128466743","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382348
Li Wang, Hua Jiang, Lan Shao, Yicheng Lin, Wenbo Wang
In this paper, we propose a fast sphere decoding (SD) algorithms for the STBCs whose symbols can be decoupled into several orthogonal groups. The orthogonality of the front levels and the last levels are both utilized, while all the former improved SD algorithms only consider the orthogonality of the last levels. By the proposed algorithm, weights calculation of the front and the last levels are respectively performed independently, thus the computational complexity is significantly reduced. As for the bit error ratio performance, it is not influenced at all. The simulation results show the advantage of our proposed fast SD in complexity economization over a former improved SD algorithm.
{"title":"A fast sphere decoding algorithm fully exploiting the orthogonality of STBC","authors":"Li Wang, Hua Jiang, Lan Shao, Yicheng Lin, Wenbo Wang","doi":"10.1109/YCICT.2009.5382348","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382348","url":null,"abstract":"In this paper, we propose a fast sphere decoding (SD) algorithms for the STBCs whose symbols can be decoupled into several orthogonal groups. The orthogonality of the front levels and the last levels are both utilized, while all the former improved SD algorithms only consider the orthogonality of the last levels. By the proposed algorithm, weights calculation of the front and the last levels are respectively performed independently, thus the computational complexity is significantly reduced. As for the bit error ratio performance, it is not influenced at all. The simulation results show the advantage of our proposed fast SD in complexity economization over a former improved SD algorithm.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134250686","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382346
S. S. Rizvi, Tae-Sun Chung
Sensor nodes collect data in normal and event-driven situations for monitoring environment and performing in-network computation. Such critical event-driven data deletes later carelessly due to context-less storage mechanisms. This causes data failure for network applications and loses support for reliable in-network computation. Therefore, for wireless sensor networks supporting sense, merge, store and send schemes, an efficient data organization technique is highly required. In this paper, we propose an advanced log structured external NAND flash memory based data management method called Varying Aggressive data Quality Access Reference (VAQAR) for data centric wireless sensor network applications. We focus particularly on critical data to provide long term sustainability and rapid availability for effective in-network computations. Experimental results show VAQAR an ideal memory management system software scheme proposing high performance for vital in-network data organization for wireless sensor network applications.
{"title":"VAQAR: Flash memory based long term in-network vital data sustainability and availability for data centric wireless sensor network applications","authors":"S. S. Rizvi, Tae-Sun Chung","doi":"10.1109/YCICT.2009.5382346","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382346","url":null,"abstract":"Sensor nodes collect data in normal and event-driven situations for monitoring environment and performing in-network computation. Such critical event-driven data deletes later carelessly due to context-less storage mechanisms. This causes data failure for network applications and loses support for reliable in-network computation. Therefore, for wireless sensor networks supporting sense, merge, store and send schemes, an efficient data organization technique is highly required. In this paper, we propose an advanced log structured external NAND flash memory based data management method called Varying Aggressive data Quality Access Reference (VAQAR) for data centric wireless sensor network applications. We focus particularly on critical data to provide long term sustainability and rapid availability for effective in-network computations. Experimental results show VAQAR an ideal memory management system software scheme proposing high performance for vital in-network data organization for wireless sensor network applications.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133974578","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382406
Zhihua Liu, Qixiang Ye, Lu Ke, Jianbin Jiao
A progressive region-merging algorithm for stereo matching is put forward in this paper. Firstly, the reference image is segmented by mean shift algorithm and the initial disparity maps are calculated using loopy belief propagation method. Secondly, we derive the reliable pixels through left-right consistent constraint. In addition, we present a new approach to exclude mismatch pixels in textureless regions, which will also reduce errors in the following region merging process. Finally, a progressive region-merging algorithm based on hierarchical clustering algorithm is put forward to merge neighboring regions and refine the plane parameters. Angle and distance are used together to measure whether the two planes are the same or not, which will reduce the calculation complexity. Experiments validate the proposed algorithm.
{"title":"A progressive region-merging algorithm for stereo matching","authors":"Zhihua Liu, Qixiang Ye, Lu Ke, Jianbin Jiao","doi":"10.1109/YCICT.2009.5382406","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382406","url":null,"abstract":"A progressive region-merging algorithm for stereo matching is put forward in this paper. Firstly, the reference image is segmented by mean shift algorithm and the initial disparity maps are calculated using loopy belief propagation method. Secondly, we derive the reliable pixels through left-right consistent constraint. In addition, we present a new approach to exclude mismatch pixels in textureless regions, which will also reduce errors in the following region merging process. Finally, a progressive region-merging algorithm based on hierarchical clustering algorithm is put forward to merge neighboring regions and refine the plane parameters. Angle and distance are used together to measure whether the two planes are the same or not, which will reduce the calculation complexity. Experiments validate the proposed algorithm.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121152475","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382333
Jianpeng Zhu, Jian Jin, Ying Wang
Emerging location-based application and sensor monitoring management system collect user's locations with limited power, which cannot report very accurate position values. An important query is the Continuous Nearest-Neighbor Query (CNNQ), which returns the closest mobile object given a query point over inaccurate location data collected from positioning devices. This paper proposes the Probabilistic Threshold filter and its pruning algorithm for CNNQ over imperfect data to utilize energy efficiently, which returns sets of objects that satisfy the query with probabilities higher than some threshold P. Probabilistic filter, Scenario analyzing and pruning algorithm employed here can handle CNNQ wisely to avoid computational and I/O expensive evaluation. The algorithm can be applied in Global Positioning System, Military Reconnaissance, Communication Technique, Traffic and Transportation Management etc.
{"title":"A probabilistic filter protocol for Continuous Nearest-Neighbor Query","authors":"Jianpeng Zhu, Jian Jin, Ying Wang","doi":"10.1109/YCICT.2009.5382333","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382333","url":null,"abstract":"Emerging location-based application and sensor monitoring management system collect user's locations with limited power, which cannot report very accurate position values. An important query is the Continuous Nearest-Neighbor Query (CNNQ), which returns the closest mobile object given a query point over inaccurate location data collected from positioning devices. This paper proposes the Probabilistic Threshold filter and its pruning algorithm for CNNQ over imperfect data to utilize energy efficiently, which returns sets of objects that satisfy the query with probabilities higher than some threshold P. Probabilistic filter, Scenario analyzing and pruning algorithm employed here can handle CNNQ wisely to avoid computational and I/O expensive evaluation. The algorithm can be applied in Global Positioning System, Military Reconnaissance, Communication Technique, Traffic and Transportation Management etc.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"51 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114322307","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382423
Qin Danyang, Wang Huihui, Wu Wei, Ma Lin, Sha Xuejun
Impact of nodes dynamically, randomly, frequently entering and leaving network on unreliable routing connection has been clearly described by a generalized routing reliability evaluating model according to measuring parameters of relative performance by studying on two-hop unit model presented in this paper. A new rate expression of node entering and leaving spindle region has been established by analyzing the two-hop unit model for MANET so as to obtain the closed solution of routing reliability. NS2-based simulating results validate the effectiveness and correctness. Routing reliability evaluating model proposed can be used to evaluate the reliability of communication link and can also be adopted to design MANET with given level of reliability.
{"title":"A generalized routing reliability evaluating model for manet","authors":"Qin Danyang, Wang Huihui, Wu Wei, Ma Lin, Sha Xuejun","doi":"10.1109/YCICT.2009.5382423","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382423","url":null,"abstract":"Impact of nodes dynamically, randomly, frequently entering and leaving network on unreliable routing connection has been clearly described by a generalized routing reliability evaluating model according to measuring parameters of relative performance by studying on two-hop unit model presented in this paper. A new rate expression of node entering and leaving spindle region has been established by analyzing the two-hop unit model for MANET so as to obtain the closed solution of routing reliability. NS2-based simulating results validate the effectiveness and correctness. Routing reliability evaluating model proposed can be used to evaluate the reliability of communication link and can also be adopted to design MANET with given level of reliability.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"6 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115344284","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382463
J. Mazierska
Novel low loss materials are needed to achieve miniaturization and further advances in wireless communications with precisely known microwave properties. Measurements of complex permittivity of low loss dielectric materials (especially anisotropic) in a wide range of temperatures still represent a challenging issue. Accuracy of surface resistance tests of superconducting materials can be low in some cases, and characterization of metamaterials is done only for one polarization and one incident angle, what is rather unsatisfactory. Accuracy of measurements is also determined by accuracy in determination of unloaded Qo-factor of test fixtures. Hence progress in microwave characterization of novel materials is also necessary. In this presentation a review of test resonators and a precise technique to measure the Qo-factor will be given. Also measurement results of complex permittivity of several low loss dielectrics and High Temperature superconducting materials will be shown.
{"title":"Microwave characterization of materials for telecommunication systems","authors":"J. Mazierska","doi":"10.1109/YCICT.2009.5382463","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382463","url":null,"abstract":"Novel low loss materials are needed to achieve miniaturization and further advances in wireless communications with precisely known microwave properties. Measurements of complex permittivity of low loss dielectric materials (especially anisotropic) in a wide range of temperatures still represent a challenging issue. Accuracy of surface resistance tests of superconducting materials can be low in some cases, and characterization of metamaterials is done only for one polarization and one incident angle, what is rather unsatisfactory. Accuracy of measurements is also determined by accuracy in determination of unloaded Qo-factor of test fixtures. Hence progress in microwave characterization of novel materials is also necessary. In this presentation a review of test resonators and a precise technique to measure the Qo-factor will be given. Also measurement results of complex permittivity of several low loss dielectrics and High Temperature superconducting materials will be shown.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124512276","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 : 2009-09-01DOI: 10.1109/YCICT.2009.5382375
Liu Zheng, Cai Jueping, Yao Lei, Du Ming
In this paper, we present a methodology for modeling, analysis and generation of NoC topology. Specially, our optimization framework of static and dynamic properties ensures core-to-core communication of the complete network. Our approach 1) fully exploits the regularity of standard topology and the flexibility of application-specific topology 2) generates a scalable network containing heterogeneous topologies, which raises the abstraction level of reuse from resources to subnets 3) satisfies NoC application. We evaluate and compare the performance of the topology generated utilizing our methodology with regular NoC topologies. Experimental results show the proposed design flow is efficient to provide superior performance for predefined requirements, and minimal cost function is achieved. In addition, we applied several multimedia applications as case studies.
{"title":"Application-aware generation and optimization for NoC topology","authors":"Liu Zheng, Cai Jueping, Yao Lei, Du Ming","doi":"10.1109/YCICT.2009.5382375","DOIUrl":"https://doi.org/10.1109/YCICT.2009.5382375","url":null,"abstract":"In this paper, we present a methodology for modeling, analysis and generation of NoC topology. Specially, our optimization framework of static and dynamic properties ensures core-to-core communication of the complete network. Our approach 1) fully exploits the regularity of standard topology and the flexibility of application-specific topology 2) generates a scalable network containing heterogeneous topologies, which raises the abstraction level of reuse from resources to subnets 3) satisfies NoC application. We evaluate and compare the performance of the topology generated utilizing our methodology with regular NoC topologies. Experimental results show the proposed design flow is efficient to provide superior performance for predefined requirements, and minimal cost function is achieved. In addition, we applied several multimedia applications as case studies.","PeriodicalId":138803,"journal":{"name":"2009 IEEE Youth Conference on Information, Computing and Telecommunication","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129948336","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
扫码关注我们
求助内容：
应助结果提醒方式：