2017 23rd Asia-Pacific Conference on Communications (APCC)最新文献_第2页

Hybrid precoding for multi-user mmWave systems based on MMSE criterion 基于MMSE准则的多用户毫米波系统混合预编码

2017 23rd Asia-Pacific Conference on Communications (APCC) Pub Date : 2017-12-01 DOI: 10.23919/APCC.2017.8303999

Jiaqi Cong, Xianchi Li, Y. Zhu

引用次数: 13

A multi-channel based passive detection strategy for high-speed moving target in the airspace under varying interference 一种基于多通道的变干扰空域高速运动目标被动检测策略

2017 23rd Asia-Pacific Conference on Communications (APCC) Pub Date : 2017-12-01 DOI: 10.23919/APCC.2017.8303990

Qin Chen, Junjie Li, Jiang Zhu, Chunyi Song, Zhiwei Xu

引用次数: 3

On the effectiveness of fils in IEEE 802.11ad wireless networks IEEE 802.11ad无线网络中文件的有效性研究

2017 23rd Asia-Pacific Conference on Communications (APCC) Pub Date : 2017-12-01 DOI: 10.23919/APCC.2017.8304047

Hiroki Kushida, Hiroshi Mano, M. Takai, Zhi Liu, S. Ishihara

引用次数: 5

Joint optimization method for user association and time/frequency-domain scheduling to maximize system throughput in heterogeneous networks 异构网络中用户关联与时频域调度的联合优化方法

2017 23rd Asia-Pacific Conference on Communications (APCC) Pub Date : 2017-12-01 DOI: 10.23919/APCC.2017.8304038

Yuto Wakai, K. Tateishi, K. Higuchi

{"title":"Joint optimization method for user association and time/frequency-domain scheduling to maximize system throughput in heterogeneous networks","authors":"Yuto Wakai, K. Tateishi, K. Higuchi","doi":"10.23919/APCC.2017.8304038","DOIUrl":"https://doi.org/10.23919/APCC.2017.8304038","url":null,"abstract":"This paper proposes a jointly optimized user association and time/frequency-domain scheduling method that maximizes the downlink system throughput defined based on (p, «)-proportional fairness. A previously reported user association method by members of our research group maximizes the downlink system throughput considering the base station (BS) distribution, user distribution, and the average channel conditions between each of the BSs and user terminals. However, the overall performance of the user association and subsequent time/frequency-domain scheduling conducted at each BS against the connected users taking into account the instantaneous channel variation due to multipath fading is not sufficient, although this approach can be actualized without relying on inter-BS cooperation. The proposed method assumes the centralized radio access network (C-RAN) architecture and achieves joint optimization of the user association and time/frequency-domain scheduling with regard to the achievable system throughput defined based on (p, «)-proportional fairness. Computer simulation results show that the proposed method significantly enhances the achievable system throughput compared to the user association method based on the average channel conditions, especially when the number of pico BSs is large and the system throughput prioritizes the fairness among users.","PeriodicalId":320208,"journal":{"name":"2017 23rd Asia-Pacific Conference on Communications (APCC)","volume":"244 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131487503","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}

引用次数: 0

Testbed verification of spectrum access opportunity detection in cognitive radio networks 认知无线电网络中频谱接入机会检测的试验台验证

2017 23rd Asia-Pacific Conference on Communications (APCC) Pub Date : 2017-12-01 DOI: 10.23919/APCC.2017.8304086

Jeemin Kim, Seung-Woo Ko, Han Cha, Seong-Lyun Kim

引用次数: 2

An accurate clock offset estimation method between two moving objects based on maximum likelihood estimation 一种基于极大似然估计的运动对象间时钟偏移的精确估计方法

2017 23rd Asia-Pacific Conference on Communications (APCC) Pub Date : 2017-12-01 DOI: 10.23919/APCC.2017.8303959

Kousuke Matsui, S. Hara

{"title":"An accurate clock offset estimation method between two moving objects based on maximum likelihood estimation","authors":"Kousuke Matsui, S. Hara","doi":"10.23919/APCC.2017.8303959","DOIUrl":"https://doi.org/10.23919/APCC.2017.8303959","url":null,"abstract":"We consider a problem of accurate clock offset estimation between two moving objects. To establish clock synchronization between objects, the principle of the Two Way Ranging (TWR) method has been commonly used in the Network Time Protocol (NTP), the IEEE 1588 standard and so on. In this paper, we first reveal that they do not perform accurately at all when two objects are in motion. Next, to solve the problem, we propose an accurate clock offset estimation method. In the proposed method, we utilize the location information on the two objects as well, and taking into consideration that the measured distance between them is not Gaussian-but Rician-distributed, we strictly derive the Maximum Likelihood estimation (ML) on the clock offset. Then, to reduce the computational complexity of the strict ML method, we introduce two approximated ML methods. In computer simulation, we show that the proposed method outperforms conventional methods, achieving the clock offset estimation accuracy of less than several tens of nanoseconds, which is required for current and future wireless communication tools among moving objects.","PeriodicalId":320208,"journal":{"name":"2017 23rd Asia-Pacific Conference on Communications (APCC)","volume":"12 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128817683","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}

引用次数: 1

Overview of visible light communications with emphasis on image sensor communications 可见光通信概述，重点是图像传感器通信

2017 23rd Asia-Pacific Conference on Communications (APCC) Pub Date : 2017-12-01 DOI: 10.23919/APCC.2017.8304093

T. Yamazato

引用次数: 6

On proactive attacks for coping with cooperative attacks in relay networks 中继网络中应对协同攻击的主动攻击研究

2017 23rd Asia-Pacific Conference on Communications (APCC) Pub Date : 2017-12-01 DOI: 10.23919/APCC.2017.8303981

Tung Pham Huu, Truong Xuan Quach, Hung Tran, H. Zepernick, L. Sibomana

引用次数: 4

Best-effort projection based attribute compression for 3D point cloud 基于最大努力投影的三维点云属性压缩

2017 23rd Asia-Pacific Conference on Communications (APCC) Pub Date : 2017-12-01 DOI: 10.23919/APCC.2017.8304078

Lanyi He, Wenjie Zhu, Yiling Xu

{"title":"Best-effort projection based attribute compression for 3D point cloud","authors":"Lanyi He, Wenjie Zhu, Yiling Xu","doi":"10.23919/APCC.2017.8304078","DOIUrl":"https://doi.org/10.23919/APCC.2017.8304078","url":null,"abstract":"According to the characteristics of exquisite presentation and rapid capture, 3D point cloud has been widely applied in immersive media industry. Aiming at vivid rendering of objects or dynamic scenarios, each point is associated with corresponding attributes like color, normal or intensity which induce massive data capacity. Consequently, efficient attribute compression methods are essential for effective immersive media transmission and consumption in the current media system. In this paper, we propose a best-effort projection based compression method for point cloud attributes. To take advantage of the well-developed 2D compression algorithm, regularized 3D point cloud is projected onto specified planes as different views while position information and related attributes are preserved. Joint depth- and color-dependent block-wise prediction has been utilized to further reduce the inter-view redundancy between projected 2D images. The experimental results have shown that the point cloud is successfully reconstructed via corresponding decoding process. Our method has presented strong competitiveness in both lossless and lossy compression of attributes of 3D point cloud.","PeriodicalId":320208,"journal":{"name":"2017 23rd Asia-Pacific Conference on Communications (APCC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115787995","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}

引用次数: 29

Adaptive package coding on unreliable memories for LDPC decoders in radiation environment 辐射环境下LDPC解码器不可靠存储器的自适应封装编码

2017 23rd Asia-Pacific Conference on Communications (APCC) Pub Date : 2017-12-01 DOI: 10.23919/APCC.2017.8303967

Guangjun Ge, L. Yin

{"title":"Adaptive package coding on unreliable memories for LDPC decoders in radiation environment","authors":"Guangjun Ge, L. Yin","doi":"10.23919/APCC.2017.8303967","DOIUrl":"https://doi.org/10.23919/APCC.2017.8303967","url":null,"abstract":"The commercial off-the-shelf technology, advanced by NASA, has driven the utilization of commercial components in aerospace, which results in severe fault problems for electronic systems. This paper considers the implementation of LDPC decoders on the unreliable memories, which introduce errors to the iterative messages. Firstly, LDPC decoders are typically implemented with the partially parallel architectures, where the messages are synchronously produced in groups. Based on this, we propose to put the messages into packages so as to permit an efficient coding on the package instead of the single message. Secondly, the sign bit of the message is shown to have the most influence on the decoding, while the least significant bit (LSB) is less important especially when the message has a large magnitude. Thus, by evaluating the magnitude level, we introduce an adaptive coding on the sign bits utilizing the LSBs. And we utilize a majority logic decision to achieve the evaluation, which makes the decoding execution more reliable. We develop a discrete density evolution to analyze the performances of various schemes, where the proposed scheme is shown to have a coding gain of 0.2 dB to the existing scheme, as well as a residual error that is nearly one order of magnitude lower. Moreover, the results of finite length codeword simulations are well matched with the density evolution analysis.","PeriodicalId":320208,"journal":{"name":"2017 23rd Asia-Pacific Conference on Communications (APCC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124563562","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}

引用次数: 0