Suiping Zhang, Rongrong Qian, Tao Peng, Ran Duan, Kuilin Chen
{"title":"High throughput turbo decoder design for GPP platform","authors":"Suiping Zhang, Rongrong Qian, Tao Peng, Ran Duan, Kuilin Chen","doi":"10.1109/ChinaCom.2012.6417597","DOIUrl":"https://doi.org/10.1109/ChinaCom.2012.6417597","url":null,"abstract":"The great development of general-purpose processor technology makes the GPP possess the efficiently massive data processing abilities. In the solution(s) of 3GPP LTE system based on GPP platform, Turbo decoding algorithms play a vital role for high decoding complexity. This paper presents the design and implementation of SIMD technique based parallel turbo decoder suitable for GPP architecture. We improve the throughput through a) adopting fix-point design, b) taking full advantage of SIMD technique, c) using multiple soft-input soft-output decoders that operate in parallel, d) introducing multi-core technique to parallelize workload across cores. With 4 threads, the throughput of our SIMD and multi-threading technology based turbo decoder for GPP platform achieves 150 Mbps which can meet the requirement of LTE system.","PeriodicalId":143739,"journal":{"name":"7th International Conference on Communications and Networking in China","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123515630","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}
{"title":"A hybrid overlay/underlay waveform for cognitive radio associated with fractional Fourier transform","authors":"Xiaocheng Song, Jun Shi, X. Sha","doi":"10.1109/ChinaCom.2012.6417457","DOIUrl":"https://doi.org/10.1109/ChinaCom.2012.6417457","url":null,"abstract":"Spectrum congestion problem is mainly caused by the inefficient spectrum usage. Cognitive radio (CR) and emerging soft decision CR (SDCR) have attracted wide interest as candidates to solve this problem. The former determines unused spectral regions and transmits overlay signals in these bands. The latter exploits both unused and occupied spectral regions simultaneously and dynamically adapts its spectra response according to time-varying environmental conditions. However, enabling waveforms of SDCR are sinusoidal signals and can not be separated from licensed signals completely. In this paper, we provide a novel waveform design method for CR based on the fractional Fourier transform. We first present a novel hybrid underlay/overlay waveform design method and then propose a system model for CR using the derived results. Moreover, theoretical analysis is also given. The validity of the theoretical derivations is demonstrated via simulations.","PeriodicalId":143739,"journal":{"name":"7th International Conference on Communications and Networking in China","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123615040","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}
{"title":"Utilizing visualization technology in medical education","authors":"Zong-Xian Yin, Sin-Yan Li","doi":"10.1109/ChinaCom.2012.6417565","DOIUrl":"https://doi.org/10.1109/ChinaCom.2012.6417565","url":null,"abstract":"Although existing bioinformatics databases such as KEGG (Kyoto Encyclopedia of Genes and Genomes) provide a wealth of information, they generally lack a user-friendly and interactive interface. As a result, they are of only limited use in the life sciences education field. Accordingly, the present study proposes a web service system for exploring the contents of the KEGG database in an intuitive and interactive manner. The two-dimensional KEGG pathways are transformed to a three-dimensional format, thereby improving the readability of the entries and annotations. The system supports two basic functions, namely an exhaustive search for all possible reaction paths between two specified genes in a biological pathway, and the identification of similar reaction sequences in different biological pathways.","PeriodicalId":143739,"journal":{"name":"7th International Conference on Communications and Networking in China","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123822603","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}
Yong Wang, Xiao-chun Yun, G. Xiong, Z. Li, Yao Yao
{"title":"Availability analysis of DNSSEC resolution and validation service","authors":"Yong Wang, Xiao-chun Yun, G. Xiong, Z. Li, Yao Yao","doi":"10.1109/ChinaCom.2012.6417444","DOIUrl":"https://doi.org/10.1109/ChinaCom.2012.6417444","url":null,"abstract":"Availability of DNSSEC resolution and validation service against man-in-the-middle attacks are analysed in this paper, and possible vulnerabilities are introduced and classified. Experiments show DNSSEC client is vulnerable because the attacks are always successful, but they are failed to recursive server, at the same time, attacks to recursive server will bring about numerous retries, and the number of retries depends on the number of root domain name servers, top-level servers and authority servers, and this can be exploited to launch denial of service attacks to recursive server. The results show the availability of DNSSEC service is poor against man-in-the-middle attacks. Conclusions are valuable to the optimization of DNSSEC recursive server application, as well as DNSSEC security analysis.","PeriodicalId":143739,"journal":{"name":"7th International Conference on Communications and Networking in China","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124905225","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}
{"title":"Feature selection for RFID tag identification","authors":"Debrup Banerjee, Jiang Li, J. Di, D. Thompson","doi":"10.1109/ChinaCom.2012.6417479","DOIUrl":"https://doi.org/10.1109/ChinaCom.2012.6417479","url":null,"abstract":"We present a multi-objective optimization (MOOP) based feature selection technique for radio frequency identification (RFID) where a tag is identified by matching a set of unique characteristics measured from the tag to previous stored copies in a database. The aim of this paper is to select the most effective characteristics for tag identification. Different application scenarios require different levels of security and demand different false match rate (FMR) and false non-match rate (FNMR). To handle those two conflicting objectives in feature selection, we formulated it as a MOOP problem that generates a set of best possible FMR and FNMR performances a system can achieve with different feature combinations. Experiment results show that the proposed technique can provide a broad view of the effectiveness of the system permitting a system designer to meet specific security requirements for a given application scenario.","PeriodicalId":143739,"journal":{"name":"7th International Conference on Communications and Networking in China","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126194810","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}
{"title":"An implementation of MIMO detection in TD-LTE based on General Purpose Processor","authors":"Li Zhou, He Zhiqiang, Duan Ran, He Lifeng","doi":"10.1109/CHINACOM.2012.6417595","DOIUrl":"https://doi.org/10.1109/CHINACOM.2012.6417595","url":null,"abstract":"This paper presents a method of implementing Multiple Input Multiple Output (MIMO) detection on General Purpose Processor (GPP) with Single Instruction Multiple Data (SIMD) instructions. In the receiver of Long Term Evolution (LTE) communication system MIMO detection plays a rather important role. How to reduce the processing latency of MIMO detection becomes increasingly significant. The advantages of GPP compared with programmable hardware provide us a considerable solution to cope with this problem. SIMD is another effective manner as it is able to increase the computing parallel degree. For each algorithm of MIMO detection, fixed-point operations which have higher parallel degree than floating-point operations may be a better choice to further reduce the process delay. Nevertheless, the performance attained by fixed-point is still a factor need to be considered while its latency is quite low.","PeriodicalId":143739,"journal":{"name":"7th International Conference on Communications and Networking in China","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123961007","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}
{"title":"BBU-RRH switching schemes for centralized RAN","authors":"S. Nanba, T. Warabino, S. Kaneko","doi":"10.1109/ChinaCom.2012.6417586","DOIUrl":"https://doi.org/10.1109/ChinaCom.2012.6417586","url":null,"abstract":"Mobile data traffic has been increasing at a rapid pace over the past few years due to the rise of both smartphones and tablets. Small cell deployments are one of the most effective ways to increase system capacity by improving the spatial reuse of radio resources for the explosive increase in traffic loads. However, it leads to be a large cost impact for operators. Centralized RAN (C-RAN) has been proposed, which has the potential ability to reduce network costs due to reductions in civil work and/or electricity costs at local base station sites by centralizing baseband units to the center side. Moreover, C-RAN can be expected to further reduce network costs using baseband unit (BBU) pooling functions in which the centralized BBU resources can be dynamically allocated to remote radio heads (RRHs) depending on traffic load. This paper proposes semi-static and adaptive BBU-RRH switching schemes for C-RAN and evaluates their effectiveness through simulations. Under conditions of 100 RRHs, here, a RRH is comparable to a cell, and traffic distribution with a typical traffic profile in office (business) area, we confirmed that the number of BBUs can be reduced by 26% and 47% for semi-static and adaptive schemes, respectively, compared with conventional cell deployment.","PeriodicalId":143739,"journal":{"name":"7th International Conference on Communications and Networking in China","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130069383","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}
{"title":"Adaptive Bayesian Compressed Sensing based localization in wireless networks","authors":"Yuan Zhang, Zhifeng Zhao, Honggang Zhang","doi":"10.1109/ChinaCom.2012.6417445","DOIUrl":"https://doi.org/10.1109/ChinaCom.2012.6417445","url":null,"abstract":"This paper exploits the most recent developments in sparsity approximation and Compressed Sensing (CS) to efficiently perform localization in wireless networks. Based on the spatial sparsity of the mobile devices distribution, a Bayesian Compressed Sensing (BCS) scheme has been put forward to perform accurate localization. Location estimation is carried out at a network central unit (CU) thus significantly alleviating the burden of mobile devices. Since the CU can observe correlated signals from different mobile devices, the proposed method utilizes the common structure of the received measurements in order to jointly estimate the locations precisely. Moreover, when the number of mobile devices changes, we increase or decrease the measurement number adaptively depending on “error bars” along with precedent reconstruction processes. Simulation shows that the proposed method, i.e. Adaptive Multi-task BCS Localization (AMBL), results in a better accuracy in terms of mean localization error compared with traditional localization schemes.","PeriodicalId":143739,"journal":{"name":"7th International Conference on Communications and Networking in China","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129985433","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}
{"title":"Study on AR4JA code in deep space fading channel","authors":"Hui Li, Jianan Gao, Mingchuan Yang, Gu Lv, Ming Li, Qing Guo","doi":"10.1109/ChinaCom.2012.6417466","DOIUrl":"https://doi.org/10.1109/ChinaCom.2012.6417466","url":null,"abstract":"Because of good systematicness of its parity check matrix, linear relationship between the minimum distance and code length, and inheritance of punching property of ARA(accumulate repeat accumulate) code, AR4JA (accumulate-repeat-4-jagged-accumulate) code is thought to be the most suitable error correction channel code for deep space reliable communication in the future. Given that the accurate channel model of deep communication environment is lacked, in the paper, the absorption, reflection or other uncertain effects of different kinds of particles in aerospace were described with Rician fading model. Then the performance of AR4JA code in deep space Rician fading channel with BP algorithm and Min-Sum algorithm were studied in the paper. Simulation results show that in Rician fading channel, compared with BP algorithm, Min-Sum algorithm declines decoding complexity with few gain loss, which is beneficial to realize miniaturization of deep space communication receiver. Through further analysis, relationship of iteration times of Min-Sum algorithm and SNR is also given for the better use of decoding AR4JA codes by Min-Sum algorithm.","PeriodicalId":143739,"journal":{"name":"7th International Conference on Communications and Networking in China","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128992403","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}
{"title":"Improving flash memory reliability with dynamic thresholds: Signal processing and coding schemes","authors":"W. Kang, Youguang Zhang, Mingbang Wang, Guoyan Li","doi":"10.1109/ChinaCom.2012.6417468","DOIUrl":"https://doi.org/10.1109/ChinaCom.2012.6417468","url":null,"abstract":"The storage reliability of the flash memory suffers from serious challenges due to various noises such as inter-cell coupling interference and retention process, especially as the device size continuously scales down and the number of cell state levels increases up. Since the threshold voltage distributions shift because of these noises, the conventional pre-defined fixed thresholds will cause misreading errors when read the data. Motivated by the unidirectional shift characteristic of the voltage distributions caused by inter-cell coupling interference and retention process, this paper proposed the concept of dynamic thresholds, including dynamic verification thresholds (DVTs) and dynamic read thresholds (DRTs) to improve the flash reliability. Moreover, based on the dynamic thresholds, we also presented a signal processing scheme with DVTs to compensate the inter-cell coupling interference, and introduced two coding schemes with DRTs for tolerating the retention process, which can also be generalized to asymmetric channels. Analyses and simulation results show that the raw bit error rate (BER) can be significantly reduced by using dynamic thresholds.","PeriodicalId":143739,"journal":{"name":"7th International Conference on Communications and Networking in China","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129010594","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}