Yaqin Zhao, X. Zhong, Guanghui Ren, Shengyang He, Zhilu Wu
{"title":"Modified MMSE-OSIC Detection for Arbitrary-Order Orbital Angular Momentum Multiplexing System","authors":"Yaqin Zhao, X. Zhong, Guanghui Ren, Shengyang He, Zhilu Wu","doi":"10.1109/iccsn.2018.8488307","DOIUrl":"https://doi.org/10.1109/iccsn.2018.8488307","url":null,"abstract":"Arbitrary-order orbital angular momentum multiplexing (AOAMM) systems can increase the capacities of optical communications. In this paper, the symmetry of the mode transmission matrices of AOAMM systems is proven. According to this feature, a modified algorithm that performs bidirectional interference cancellations for AOAMM systems is proposed. The results show that the proposed algorithm outperforms the standard minimum mean squared error (MMSE) with ordered successive interference cancellation (OSIC) algorithm and approaches to the bit error rate of the MMSE-based sorted QR decomposition with $M$-algorithm, when the topological charge intervals are small in the region of low to moderate signal-to-noise ratios. The proposed algorithm makes the AOAMM systems available in practice.","PeriodicalId":243383,"journal":{"name":"2018 10th International Conference on Communication Software and Networks (ICCSN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129874108","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 Amplitude-phase Measurement Method of Phased Array Antenna Based on Self-Calibration RF Channel","authors":"Chen Tengbo, Zhang Lu, Du Hailong","doi":"10.1109/iccsn.2018.8488296","DOIUrl":"https://doi.org/10.1109/iccsn.2018.8488296","url":null,"abstract":"Caused by the amplitude-phase error of phased array antenna, the pattern performance unable to meet the optimum design results. Thus, the phase and amplitude of phased array antenna should be measured and calibrated. An measurement method of phased array antenna based on self-calibration RF channel is presented in this paper. First of all, the initial amplitude-phase is measured by self-calibration RF channel. Secondly, the modified value related to self-calibration RF channel is achieved by use of Mid-field receiving power calculation method. Finally, the actual amplitude and phase weighting factor of phased array antenna is obtained, based on calibration of the initial amplitude-phase with the modified value. The comparison of planar near-field measured results show that the proposed method is feasible and efficient.","PeriodicalId":243383,"journal":{"name":"2018 10th International Conference on Communication Software and Networks (ICCSN)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132327048","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":"The Design and Implementation of High-Speed Codec Based on FPGA","authors":"Weiji Ren, Hao Liu","doi":"10.1109/iccsn.2018.8488239","DOIUrl":"https://doi.org/10.1109/iccsn.2018.8488239","url":null,"abstract":"This article mainly proposes a high-speed encoding and decoding method for LDPC code on FPGA. This method converts a quasi-cyclic LDPC code into a block quasi-cyclic LDPC code, and uses a similar transformation to generate a corresponding generator matrix, thereby improving the parallelism of encoder and decoder and making them have high throughput. Finally, we implemented high-speed encoding and decoding on the FPGA chip of the Kintex7 system by using the CCSDS-recommended (8176, 7154) LDPC code, and these encoder and decoder achieve a throughput of 2.97 Gbps under the condition of 5 iterations.","PeriodicalId":243383,"journal":{"name":"2018 10th International Conference on Communication Software and Networks (ICCSN)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131000449","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":"Jamming Strategy Optimization for Dual-Channel ALOHA Network with Long Time Delay","authors":"Rong Shi, Yue Xiao","doi":"10.1109/iccsn.2018.8488223","DOIUrl":"https://doi.org/10.1109/iccsn.2018.8488223","url":null,"abstract":"The dual-channel ALOHA network with long time delay consisting of many cognitive radio terminals has particular dynamic characteristics. Its total throughput changes with the channel selection of terminals, because two channels have different attraction probabilities under the condition that the total packet arrival rate remains constant. We establish a group of differential equations for each channel’s network-adjusted arrival rate, and obtain the function relationship of total throughput with the total arrival rate. The influence of the different allocation ratio about jamming resources on each channel is analyzed under the condition that the jamming resources are kept constant. The optimal allocation ratio of jamming resources is obtained, and the total throughput is minimized for this network. The above theoretic analysis is verified by simulations. It not only puts forward a new way for effective jamming on dual-channel ALOHA network with long time delay, but also provides an important reference for the dynamic characteristics research for such networks.","PeriodicalId":243383,"journal":{"name":"2018 10th International Conference on Communication Software and Networks (ICCSN)","volume":"56 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126236325","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":"Database Structures for Accountable Flow-Net Logging","authors":"Daisuke Takahashi, Yang Xiao, Tieshan Li","doi":"10.1109/iccsn.2018.8488249","DOIUrl":"https://doi.org/10.1109/iccsn.2018.8488249","url":null,"abstract":"Computer and network accountability is to make every action in computers and networks accountable. In order to achieve accountability, we need to answer the following questions: what did it happen? When did it happen? Who did it? In order to achieve accountability, the first step is to record what exactly happened. Therefore, an accountable logging is needed and implemented in computers and networks. Our previous work proposed a novel accountable logging methodology called Flow-Net. However, how to storage the huge amount of Flow-net logs into databases is not clear. In this paper, we try to answer this question.","PeriodicalId":243383,"journal":{"name":"2018 10th International Conference on Communication Software and Networks (ICCSN)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126401177","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":"The Method to Recognize Linear Block Code Based on the Distribution of Code Weight","authors":"Wang Lei, Yizhou Ge, Zhao Fucai, Wang Yong","doi":"10.1109/ICCSN.2018.8488259","DOIUrl":"https://doi.org/10.1109/ICCSN.2018.8488259","url":null,"abstract":"The definition and matrix description of linear cyclic code is introduced in this paper first. Then the distribution of code weight is analyzed. The distance of code weight distribution is defined according to distance of vectors. The theoretic probability of code weight of random sequence is ratiocinated. The method to estimate code weight distribution of actual sequence is established. The code length and start are estimated by the distance between the code weight distribution and the check matrix and generation matrix are estimated by Gauss Elimination. The results of simulating experiment to different length code show that this method can recognize code with middle and short code length effectively when BER is 10−3.","PeriodicalId":243383,"journal":{"name":"2018 10th International Conference on Communication Software and Networks (ICCSN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122202277","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":"Infrastructure-Assisted Markov Prediction Routing Protocol for Urban Scenarios","authors":"Lin Lin, Binjie Hu, Yi-Chan Sun","doi":"10.1109/iccsn.2018.8488293","DOIUrl":"https://doi.org/10.1109/iccsn.2018.8488293","url":null,"abstract":"It has been recognized the benefits that utilizing fixed Road Side Units (RSUs) as routing complements to Vehicular Ad-hoc Network (VANET) can improve reliable end to end multi-hop communications. This paper presents Infrastructure-assisted Markov Prediction Routing Protocol (IAMPR) for urban VANET scenarios. IAMPR formulates corresponding routing algorithms for vehicles and RSUs in order to exploit the available heterogeneous network efficiently. Store-and-forward buffering, Markov chains predictor and duplicate transmission techniques are also adopted in the protocol aiming at local minimum problem cause by greedy forwarding strategy. To better evaluate the performance of IAMPR, we complete simulation in NS-3 simulator under a real world topology urban scenario. Simulation results show that our proposed protocol outperforms Greedy V2I2V and GPSR in terms of packet delivery ratio and end to end delay under varying vehicles densities and speeds.","PeriodicalId":243383,"journal":{"name":"2018 10th International Conference on Communication Software and Networks (ICCSN)","volume":"238 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114211405","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":"Decoding Quadratic Residue Codes Based on Bivariate Weak-Locator Polynomials","authors":"Chong-Dao Lee","doi":"10.1109/ICCSN.2018.8488261","DOIUrl":"https://doi.org/10.1109/ICCSN.2018.8488261","url":null,"abstract":"It is well known that quadratic residue codes are an important class of error-correcting codes with large minimum distance and one-half code rate. In this paper, the algebraic decoding of quadratic residue codes is described by using the bivariate weak-locator polynomials, which is a generalization of the univariate weak-locator polynomial. A practical method to generate the bivariate weak-locator polynomials for quadratic residue codes is provided. Experimental results show an example for decoding the quadruple-error-correcting binary quadratic residue code of length 41.","PeriodicalId":243383,"journal":{"name":"2018 10th International Conference on Communication Software and Networks (ICCSN)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131902679","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":"Technical Characteristics and Model of Blockchain","authors":"Yang Xinyi, Zhang Yi, Yulin He","doi":"10.1109/iccsn.2018.8488289","DOIUrl":"https://doi.org/10.1109/iccsn.2018.8488289","url":null,"abstract":"Blockchain technology is the underlying infrastructure and support technology to build trust of Bitcoin. It is not only an emerging technology that relies on pure mathematical method to create trust relationship in a distributed environment but also an innovative combination of hash algorithm, asymmetric cryptography, time stamp, consensus mechanism and many other technologies, with characteristics of decentralization, trustlessness, collective maintenance, reliable database, openness, security and untamperability, anonymity, verifiability and traceability, programmable and so on. This paper mainly introduces the technical characteristics and models of block chain, summarizes the development status and branch classification of Blockchain, and outlines the future application of Blockchain technology.","PeriodicalId":243383,"journal":{"name":"2018 10th International Conference on Communication Software and Networks (ICCSN)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115324010","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}
Lei Han, Shaohua An, Qingming Zhu, Ciyuan Qiu, Yikai Su
{"title":"GFDM-OFDM Hybrid Modulation Scheme for IM-DD Optical Communication Systems","authors":"Lei Han, Shaohua An, Qingming Zhu, Ciyuan Qiu, Yikai Su","doi":"10.1109/iccsn.2018.8488234","DOIUrl":"https://doi.org/10.1109/iccsn.2018.8488234","url":null,"abstract":"We propose and demonstrate a novel modulation scheme termed as generalized frequency division multiplexing - orthogonal frequency division multiplexing (GFDM-OFDM) for intensity-modulated direct-detection (IM-DD) optical communication systems. In our scheme, the low-frequency band is allocated to a GFDM signal to achieve a low peak-to-average power ratio (PAPR), while the high-frequency band is filled with an OFDM signal that is robust to frequency-domain variations. By this means, the PAPR of the whole signal can be reduced and the high-frequency fading effects induced by the electronic components can be mitigated, leading to an improved system performance. Simulation results show that our proposed GFDM-OFDM format outperforms OFDM and GFDM formats in terms of optical receiver sensitivity for both the back-to-back (BTB) and 10-km transmissions. The GFDM-OFDM signal achieves receiver sensitivity improvements of approximately 3.0 dB and 1.6 dB, compared to the OFDM and GFDM signals, respectively.","PeriodicalId":243383,"journal":{"name":"2018 10th International Conference on Communication Software and Networks (ICCSN)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123173057","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}