{"title":"Low complexity robust linear transceiver design for MIMO interference channel","authors":"Geng Xuan, Li Conggai, Liu Feng","doi":"10.1016/S1005-8885(16)60073-0","DOIUrl":"https://doi.org/10.1016/S1005-8885(16)60073-0","url":null,"abstract":"<div><p>This paper focuses on the linear transceiver design for multiple input multiple output (MIMO) interference channel (IC), in which a bounded channel error model is assumed. Two optimization problems are formulated as minimizing maximum per-user mean square error (MSE) and sum MSE with the per-transmitter power constraint. Since these optimization problems are not jointly convex on their variable matrices, the transmitter and receiver can be optimized alternately respectively. For each matrix, an approximated approach is presented where the upper bound of constraint is derived so that it has less semidefinite, thus the problem can be viewed as second-order-cone programming (SOCP) and gets less computational complexity. Compared with the conventional S-procedure method, the proposed approach achieves similar performance, but reduces the complexity significantly, especially for the system with large scale number of antennas.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"23 6","pages":"Pages 76-81"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(16)60073-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72232228","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":"Textual-geographical-social aware point-of-interest recommendation","authors":"Ren Xingyi, Song Meina, E Haihong, Song Junde","doi":"10.1016/S1005-8885(16)60066-3","DOIUrl":"https://doi.org/10.1016/S1005-8885(16)60066-3","url":null,"abstract":"<div><p>The rapid development of location-based social networks (LBSNs) has provided an unprecedented opportunity for better location-based services through point-of-interest (POI) recommendation. POI recommendation is personalized, location-aware, and context depended. However, extreme sparsity of user-POI matrix creates a severe challenge. In this paper we propose a textual-geographical-social aware probabilistic matrix factorization method for POI recommendation. Our model is textual-geographical-social aware probabilistic matrix factorization called TGS-PMF, it exploits textual information, geographical information, social information, and incorporates these factors effectively. First, we exploit an aggregated latent Dirichlet allocation (LDA) model to learn the interest topics of users and infer the interest POIs by mining textual information associated with POIs and generate interest relevance score. Second, we propose a kernel estimation method with an adaptive bandwidth to model the geographical correlations and generate geographical relevance score. Third, we build social relevance through the power-law distribution of user social relations to generate social relevance score. Then, our exploit probabilistic matrix factorization model (PMF) to integrate the interest, geographical, social relevance scores for POI recommendation. Finally, we implement experiments on a real LBSN check-in dataset. Experimental results show that TGS-PMF achieves significantly superior recommendation quality compared to other state-of-the-art POI recommendation techniques.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"23 6","pages":"Pages 24-33, 67"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(16)60066-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72232224","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":"VoIP transmission mechanism based on TCP","authors":"Shuang Kai, Guan Zhe, Meng Chunzhi","doi":"10.1016/S1005-8885(16)60075-4","DOIUrl":"https://doi.org/10.1016/S1005-8885(16)60075-4","url":null,"abstract":"<div><p>As the widespread employment of firewalls on the Internet, user datagram protocol (UDP) based voice over Internet protocol (VoIP) system will be unable to transmit voice data. This paper proposed a novel method to transmit voice data based on transmission control protocol (TCP). The method adopts a disorder TCP transmission strategy, which allows discontinuous data packets in TCP queues read by application layer directly without waiting for the retransmission of lost data packets. A byte stream data boundary identification algorithm based on consistent overhead byte stuffing algorithm is designed to efficiently identify complete voice data packets from disordered TCP packets arrived so as to transmit the data to the audio processing module timely. Then, by implementing the prototype system and testing, we verified that the proposed algorithm can solve the high time delay, jitter and discontinuity problems in standard TCP protocol when transmitting voice data packets, which caused by its error control and retransmission mechanism. We proved that the method proposed in this paper is effective and practical.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"23 6","pages":"Pages 90-96"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(16)60075-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72232230","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}
Hu Zhangfang, Xin Wei, Luo Yuan, Hu Yinping, Zhou Yongxin
{"title":"Design of a modified circular-cut multiband fractal antenna","authors":"Hu Zhangfang, Xin Wei, Luo Yuan, Hu Yinping, Zhou Yongxin","doi":"10.1016/S1005-8885(16)60072-9","DOIUrl":"https://doi.org/10.1016/S1005-8885(16)60072-9","url":null,"abstract":"<div><p>This paper presents a modified circular-cut multiband fractal antenna with good radiation patterns designed for digital cellular system (DCS), personal communication system (PCS), 2.4/5.2/5.8 GHz wireless local area networks (WLAN) and 2.5/3.5/5.5 GHz worldwide interoperability for microwave access (WiMAX) applications simultaneously. Originally, the modified circular monopole antenna is designed to resonate at around 2.1 GHz and 3.6 GHz. After subtracting the circular iterative tree fractal structure, it can produce three other resonances at around 5.6 GHz, 6.47 GHz and 7.89 GHz. Besides, as the number of iterations increases, not only do the new frequency bands appear (it demonstrates the good self-similarity property of the proposed antenna), but also the operating bands shift from high frequency to low frequency (it shows the well space filling property). Furthermore, the proposed antenna owns a compact structure, which can achieve the 5.28 dBi of relative high gain. And the measured results are basically accordant to simulated results, which proves the effectiveness of the proposed antenna.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"23 6","pages":"Pages 68-75"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(16)60072-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72232227","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":"Coverage analysis of cache-enabled small cell networks with stochastic geometry methods","authors":"Zhang Qi, Teng Yinglei, Liu Mengting, Song Mei","doi":"10.1016/S1005-8885(16)60068-7","DOIUrl":"https://doi.org/10.1016/S1005-8885(16)60068-7","url":null,"abstract":"<div><p>Caching popular content in the storage of small cells is deemed as an efficient way to decrease latency, offload backhaul and satisfy user's demands. In order to investigate the performance of cache-enabled small cell networks, coverage probability is studied in both single-point transmission and cooperative multipoint (CoMP) transmission scenarios. Meanwhile, the caching distribution modeled as Zipf and uniform distribution are both considered. Assuming that small base stations (SBSs) are distributed as a homogeneous Poisson point process (HPPP), the closed-form expressions of coverage probability are derived in different transmission cases. Simulation results show that CoMP transmission achieves a higher coverage probability than that of single-point transmission. Furthermore, Zipf distribution-based caching is more preferable than uniform distribution-based caching in terms of coverage probability.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"23 6","pages":"Pages 41-46"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(16)60068-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72232222","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":"Joint load balancing and interference coordination in multi-antenna heterogeneous networks","authors":"Zhu Wenfeng, Qiu Ling, Chen Zheng, Liang Xiaowen","doi":"10.1016/S1005-8885(16)60067-5","DOIUrl":"https://doi.org/10.1016/S1005-8885(16)60067-5","url":null,"abstract":"<div><p>In heterogeneous networks (HetNets), it is desirable to offload users from macro cells to small cells to achieve load balancing. However, the offloaded users suffer a strong inter-tier interference. To guarantee the performance of the offloaded users, the interference from macro cells should be carefully managed. In this paper, we jointly optimize load balancing and interference coordination in multi-antenna HetNets. Different from previous works, instead of almost blank subframes (ABS) on which the macro cells waste time resource, the macro cells suppress the interference to the offloaded users by zero-forcing beamforming (ZFBF) on interference nulling subframes (INS). Considering user association cannot be conduct frequently, we derive the long-term throughput of users over Rayleigh fading channels while previous works focused on instantaneous rate. From the perspective of the spectrum efficiency and user fairness, we formulate a long-term network-wide utility maximization problem. By decomposing the problem into two subproblems, we propose an efficient joint load balancing and interference coordination strategy. Simulation results show that our proposal can achieve good system performance gains over counterparts in term of the network utility, cell edge throughput and average throughput.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"23 6","pages":"Pages 34-40"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(16)60067-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72232223","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":"Construction of compressed sensing matrixes based on the singular pseudo-symplectic space over finite fields","authors":"Gao You, Tong Fenghua, Zhang Xiaojuan","doi":"10.1016/S1005-8885(16)60074-2","DOIUrl":"https://doi.org/10.1016/S1005-8885(16)60074-2","url":null,"abstract":"<div><p>Compressed sensing (CS) provides a new approach to acquire data as a sampling technique and makes it sure that a sparse signal can be reconstructed from few measurements. The construction of compressed matrixes is a central problem in compressed sensing. This paper provides a construction of deterministic CS matrixes, which are also disjunct and inclusive matrixes, from singular pseudo-symplectic space over finite fields of characteristic 2. Our construction is superior to DeVore's construction under some conditions and can be used to reconstruct sparse signals through an efficient algorithm.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"23 6","pages":"Pages 82-89"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(16)60074-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72232229","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":"Performance analysis of frequency synchronization in MIMO-OFDM systems with ST/MRC scheme","authors":"Han Daoqi, Zhang Jianhua, Yu Hao, Liu Mengmeng","doi":"10.1016/S1005-8885(16)60052-3","DOIUrl":"https://doi.org/10.1016/S1005-8885(16)60052-3","url":null,"abstract":"<div><p>In this paper, the performance of frequency synchronization in a multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) system is analyzed for the purpose of carrier frequency offset (CFO) estimation and compensation. Specifically, a joint transmit antenna selection (ST) and receive maximum ratio combining (MRC) (ST/MRC) method is adopted, that is, only one transmit antenna with the highest channel power is selected while MRC is used at the receiver to maximize the sum of frequency synchronization metric. The mean square error (MSE) closed-form expressions of CFO estimation are derived for several antenna configurations. Simulations in both flat and multipath fading channels validate the theoretical analysis.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"23 5","pages":"Pages 10-14, 39"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(16)60052-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72232726","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}
Li Linghui, Du Junping, Liang Meiyu, Ren Nan, Fan Dan
{"title":"Video super-resolution reconstruction based on deep convolutional neural network and spatio-temporal similarity","authors":"Li Linghui, Du Junping, Liang Meiyu, Ren Nan, Fan Dan","doi":"10.1016/S1005-8885(16)60060-2","DOIUrl":"https://doi.org/10.1016/S1005-8885(16)60060-2","url":null,"abstract":"<div><p>Existing learning-based super-resolution (SR) reconstruction algorithms are mainly designed for single image, which ignore the spatio-temporal relationship between video frames. Aiming at applying the advantages of learning-based algorithms to video SR field, a novel video SR reconstruction algorithm based on deep convolutional neural network (CNN) and spatio-temporal similarity (STCNN-SR) was proposed in this paper. It is a deep learning method for video SR reconstruction, which considers not only the mapping relationship among associated low-resolution (LR) and high-resolution (HR) image blocks, but also the spatio-temporal non-local complementary and redundant information between adjacent low-resolution video frames. The reconstruction speed can be improved obviously with the pre-trained end-to-end reconstructed coefficients. Moreover, the performance of video SR will be further improved by the optimization process with spatio-temporal similarity. Experimental results demonstrated that the proposed algorithm achieves a competitive SR quality on both subjective and objective evaluations, when compared to other state-of-the-art algorithms.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"23 5","pages":"Pages 68-81"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(16)60060-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72232722","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":"Modeling and analysis of epidemic spreading on community network with node's birth and death","authors":"Li Chanchan , Jiang Guoping","doi":"10.1016/S1005-8885(16)60061-4","DOIUrl":"https://doi.org/10.1016/S1005-8885(16)60061-4","url":null,"abstract":"<div><p>In this paper, a modified susceptible infected susceptible (SIS) epidemic model is proposed on community structure networks considering birth and death of node. For the existence of node's death would change the topology of global network, the characteristic of network with death rate is discussed. Then we study the epidemiology behavior based on the mean-field theory and derive the relationships between epidemic threshold and other parameters, such as modularity coefficient, birth rate and death rates (caused by disease or other reasons). In addition, the stability of endemic equilibrium is analyzed. Theoretical analysis and simulations show that the epidemic threshold increases with the increase of two kinds of death rates, while it decreases with the increase of the modularity coefficient and network size.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"23 5","pages":"Pages 82-87, 96"},"PeriodicalIF":0.0,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(16)60061-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72232721","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}