首页 > 最新文献

Journal of China Universities of Posts and Telecommunications最新文献

英文 中文
Lateral control of autonomous vehicles based on learning driver behavior via cloud model 基于云模型学习驾驶员行为的自动驾驶汽车横向控制
Q4 Computer Science Pub Date : 2017-04-01 DOI: 10.1016/S1005-8885(17)60194-8
Gao Hongbo , Xie Guotao , Liu Hongzhe , Zhang Xinyu , Li Deyi

In order to achieve the lateral control of the intelligent vehicle, use the bi-cognitive model based on cloud model and cloud reasoning, solve the decision problem of the qualitative and quantitative of the lateral control of the intelligent vehicle. Obtaining a number of experiment data by driving a vehicle, classify the data according to the concept of data and fix the input and output variables of the cloud controller, design the control rules of the cloud controller of intelligent vehicle, and clouded and fix the parameter of cloud controller: expectation, entropy and hyper entropy. In order to verify the effectiveness of the cloud controller, joint simulation platform based on Matlab/Simulink/CarSim is established. Experimental analysis shows that: driver's lateral controller based on cloud model is able to achieve tracking of the desired angle, and achieve good control effect, it also verifies that a series of mental activities such as feeling, cognition, calculation, decision and so on are fuzzy and uncertain.

为了实现智能汽车的横向控制,采用基于云模型和云推理的双认知模型,解决智能汽车横向控制的定性和定量决策问题。通过驾驶车辆获取大量实验数据,根据数据的概念对数据进行分类并固定云控制器的输入和输出变量,设计智能车辆云控制器的控制规则,并对云控制器的参数:期望值、熵和超熵进行模糊化和固定。为了验证云控制器的有效性,建立了基于Matlab/Simulink/CarSim的联合仿真平台。实验分析表明:基于云模型的驾驶员横向控制器能够实现对所需角度的跟踪,并取得良好的控制效果,同时验证了驾驶员的感觉、认知、计算、决策等一系列心理活动具有模糊性和不确定性。
{"title":"Lateral control of autonomous vehicles based on learning driver behavior via cloud model","authors":"Gao Hongbo ,&nbsp;Xie Guotao ,&nbsp;Liu Hongzhe ,&nbsp;Zhang Xinyu ,&nbsp;Li Deyi","doi":"10.1016/S1005-8885(17)60194-8","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60194-8","url":null,"abstract":"<div><p>In order to achieve the lateral control of the intelligent vehicle, use the bi-cognitive model based on cloud model and cloud reasoning, solve the decision problem of the qualitative and quantitative of the lateral control of the intelligent vehicle. Obtaining a number of experiment data by driving a vehicle, classify the data according to the concept of data and fix the input and output variables of the cloud controller, design the control rules of the cloud controller of intelligent vehicle, and clouded and fix the parameter of cloud controller: expectation, entropy and hyper entropy. In order to verify the effectiveness of the cloud controller, joint simulation platform based on Matlab/Simulink/CarSim is established. Experimental analysis shows that: driver's lateral controller based on cloud model is able to achieve tracking of the desired angle, and achieve good control effect, it also verifies that a series of mental activities such as feeling, cognition, calculation, decision and so on are fuzzy and uncertain.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 2","pages":"Pages 10-17"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60194-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72254025","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}
引用次数: 13
Length minimization of uniform linear antenna array for millimeter wave communications with maximum capacity 最大容量毫米波通信中均匀线性天线阵列的长度最小化
Q4 Computer Science Pub Date : 2017-04-01 DOI: 10.1016/S1005-8885(17)60204-8
Chen Ruirui, Zhang Hailin

For uniform linear antenna array (ULA) based millimeter wave communications, the maximum capacity can be achieved by the optimal antenna separation product (ASP). However, due to the practical size limitation, it is necessary to decrease the ULA length. In this paper, an optimization problem is formulated to minimize the ULA length for millimeter wave communications with maximum capacity. We decompose the problem into two subproblems: length selection optimization and orientation deployment optimization. The optimal length selection can be obtained when the transmit and receive ULAs have equal length. By using the property of trigonometric function, we derive the optimal orientation deployment and study the influence of orientation deviation on ULA length. Simulation results are presented to validate the analyses.

对于基于均匀线性天线阵列(ULA)的毫米波通信,可以通过最优天线分离积(ASP)来实现最大容量。然而,由于实际尺寸的限制,有必要减小ULA的长度。本文提出了一个优化问题,以最小化具有最大容量的毫米波通信的ULA长度。我们将问题分解为两个子问题:长度选择优化和定向部署优化。当发射和接收ULA具有相等的长度时,可以获得最佳长度选择。利用三角函数的性质,推导了最优方位部署,并研究了方位偏差对ULA长度的影响。仿真结果对分析结果进行了验证。
{"title":"Length minimization of uniform linear antenna array for millimeter wave communications with maximum capacity","authors":"Chen Ruirui,&nbsp;Zhang Hailin","doi":"10.1016/S1005-8885(17)60204-8","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60204-8","url":null,"abstract":"<div><p>For uniform linear antenna array (ULA) based millimeter wave communications, the maximum capacity can be achieved by the optimal antenna separation product (ASP). However, due to the practical size limitation, it is necessary to decrease the ULA length. In this paper, an optimization problem is formulated to minimize the ULA length for millimeter wave communications with maximum capacity. We decompose the problem into two subproblems: length selection optimization and orientation deployment optimization. The optimal length selection can be obtained when the transmit and receive ULAs have equal length. By using the property of trigonometric function, we derive the optimal orientation deployment and study the influence of orientation deviation on ULA length. Simulation results are presented to validate the analyses.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 2","pages":"Pages 96-102"},"PeriodicalIF":0.0,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60204-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72214300","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
Global optimum encoding packet selection mechanism based on opportunistic network coding for wireless network retransmission 基于机会网络编码的无线网络重传全局最优编码分组选择机制
Q4 Computer Science Pub Date : 2017-02-01 DOI: 10.1016/S1005-8885(17)60187-0
Wang Lian , Peng Daiyuan , Liang Hongbin

Packet loss cannot be avoided in wireless network due to wireless transmission medium particularity, therefore improving retransmission efficiency is meaningful to wireless transmission. The current retransmission packet selection mechanisms based on opportunistic network coding (ONC) face low retransmission efficiency and high computational complexity problems. To these problems, an optimized encoding packet selection mechanism based on ONC in wireless network retransmission (OONCR) is proposed. This mechanism is based on mutual exclusion packets and decoding gain concepts, and makes full use of ONC advantages. The main contributions of this scheme are to control the algorithm complexity of the maximum encoding packets selection effectively, avoid the redundancy encoding packets due to the overlapping among encoding packets, and take the encoding packet local and global optimization problem into consideration. Retransmission efficiency is evaluated according to the computational complexity, the throughput, the retransmission redundancy ratio, and the number of average retransmission. Under the various conditions, the number of average retransmission of OONCR is mainly lower than that of other typical retransmission packet selection schemes. The average retransmission redundancy ratios of OONCR are lower about 5%∼40% compared with other typical schemes. Simultaneously the computational complexity of OONCR is comparatively lower than that of other typical schemes.

由于无线传输介质的特殊性,在无线网络中无法避免丢包,因此提高重发效率对无线传输具有重要意义。当前基于机会网络编码(ONC)的重传分组选择机制面临着低重传效率和高计算复杂度的问题。针对这些问题,提出了一种在无线网络重传(OONCR)中基于ONC的优化编码分组选择机制。该机制基于互斥包和解码增益概念,充分利用了ONC的优势。该方案的主要贡献是有效地控制了最大编码包选择的算法复杂度,避免了编码包之间重叠导致的冗余编码包,并考虑了编码包的局部和全局优化问题。根据计算复杂度、吞吐量、重传冗余率和平均重传次数来评估重传效率。在各种条件下,OONCR的平均重传次数主要低于其他典型的重传分组选择方案。OONCR的平均重传冗余率比其他典型方案低5%~40%。同时,OONCR的计算复杂度相对低于其他典型方案。
{"title":"Global optimum encoding packet selection mechanism based on opportunistic network coding for wireless network retransmission","authors":"Wang Lian ,&nbsp;Peng Daiyuan ,&nbsp;Liang Hongbin","doi":"10.1016/S1005-8885(17)60187-0","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60187-0","url":null,"abstract":"<div><p>Packet loss cannot be avoided in wireless network due to wireless transmission medium particularity, therefore improving retransmission efficiency is meaningful to wireless transmission. The current retransmission packet selection mechanisms based on opportunistic network coding (ONC) face low retransmission efficiency and high computational complexity problems. To these problems, an optimized encoding packet selection mechanism based on ONC in wireless network retransmission (OONCR) is proposed. This mechanism is based on mutual exclusion packets and decoding gain concepts, and makes full use of ONC advantages. The main contributions of this scheme are to control the algorithm complexity of the maximum encoding packets selection effectively, avoid the redundancy encoding packets due to the overlapping among encoding packets, and take the encoding packet local and global optimization problem into consideration. Retransmission efficiency is evaluated according to the computational complexity, the throughput, the retransmission redundancy ratio, and the number of average retransmission. Under the various conditions, the number of average retransmission of OONCR is mainly lower than that of other typical retransmission packet selection schemes. The average retransmission redundancy ratios of OONCR are lower about 5%∼40% compared with other typical schemes. Simultaneously the computational complexity of OONCR is comparatively lower than that of other typical schemes.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 1","pages":"Pages 47-59"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60187-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72265947","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
Transmission strategies for wireless powered MIMO relay systems 无线供电MIMO中继系统的传输策略
Q4 Computer Science Pub Date : 2017-02-01 DOI: 10.1016/S1005-8885(17)60181-X
Wu Fahui , Xiao Lin , Yang Dingcheng , Laurie Cuthbert

This paper studies a multiple input multiple output (MIMO) simultaneous wireless information and power transfer (SWIPT) relay system, in which the source node (SN) send information and energy simultaneously to the relay node (RN), and the RN forward the received signal to the destination node (DN) powered by harvested energy. In particular, we consider two SWIPT receiver designs, namely power splitting (PS) and antenna switching (AS) in the relay system. For each design, iterative algorithms based on convex optimization technique are proposed to maximize the system rate. Furthermore, in order to strike a balance between computational complexity and system performance, based on the AS scheme, we propose a low complexity optimization method for PS scheme where a suboptimal PS ratio is given. Numerical results are provided to evaluate the performance of the proposed algorithm for MIMO SWIPT relay systems. It is shown that the performance of the proposed suboptimal method approaches that of the optimal PS scheme.

本文研究了一种多输入多输出(MIMO)同时无线信息和功率传输(SWIPT)中继系统,其中源节点(SN)同时向中继节点(RN)发送信息和能量,中继节点将接收到的信号转发到由收获的能量供电的目的节点(DN)。特别地,我们考虑了两种SWIPT接收机设计,即中继系统中的功率分配(PS)和天线切换(AS)。对于每种设计,都提出了基于凸优化技术的迭代算法,以最大化系统速率。此外,为了在计算复杂度和系统性能之间取得平衡,我们在AS方案的基础上,提出了一种低复杂度的PS方案优化方法,其中给出了次优的PS比。数值结果用于评估所提出的算法在MIMO SWIPT中继系统中的性能。结果表明,所提出的次优方法的性能接近最优PS方案的性能。
{"title":"Transmission strategies for wireless powered MIMO relay systems","authors":"Wu Fahui ,&nbsp;Xiao Lin ,&nbsp;Yang Dingcheng ,&nbsp;Laurie Cuthbert","doi":"10.1016/S1005-8885(17)60181-X","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60181-X","url":null,"abstract":"<div><p>This paper studies a multiple input multiple output (MIMO) simultaneous wireless information and power transfer (SWIPT) relay system, in which the source node (SN) send information and energy simultaneously to the relay node (RN), and the RN forward the received signal to the destination node (DN) powered by harvested energy. In particular, we consider two SWIPT receiver designs, namely power splitting (PS) and antenna switching (AS) in the relay system. For each design, iterative algorithms based on convex optimization technique are proposed to maximize the system rate. Furthermore, in order to strike a balance between computational complexity and system performance, based on the AS scheme, we propose a low complexity optimization method for PS scheme where a suboptimal PS ratio is given. Numerical results are provided to evaluate the performance of the proposed algorithm for MIMO SWIPT relay systems. It is shown that the performance of the proposed suboptimal method approaches that of the optimal PS scheme.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 1","pages":"Pages 1-10"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60181-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72228584","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
Novel physical probe configurations in a multi-probe based 3D MIMO OTA setup 基于多探针的3D MIMO OTA设置中的新型物理探针配置
Q4 Computer Science Pub Date : 2017-02-01 DOI: 10.1016/S1005-8885(17)60188-2
Wang Weimin, Li Muyuan, Liu Yuan'an, Wu Yongle, Li Shulan

In this paper, channel spatial characteristics which mainly depend on the spatial correlation are selected as the significant factors in over-the-air (OTA) testing for multiple input multiple output (MIMO) devices. The multi-probe anechoic chamber method, a promising candidate of the MIMO OTA testing methods, can reproduce the multipath environments in a controllable manner. A novel physical configuration based on the variation of relative positions of probes in a MIMO OTA setup is put forward to obtain better spatial characteristics. Two physical configurations are presented to make a comparison with the typical configuration in this paper. The simulation results show that by making a proper probe configuration, good channel simulation accuracy can be achieved. Meanwhile, in order to get better performance of emulating channel spatial characteristics, probes in the first and the last probe rings should be placed symmetrically in three dimensional (3D) physical probe configuration.

本文选择主要取决于空间相关性的信道空间特性作为多输入多输出(MIMO)设备空中(OTA)测试的重要因素。多探头电波暗室法是MIMO OTA测试方法的一种很有前途的候选方法,可以以可控的方式再现多径环境。为了获得更好的空间特性,提出了一种基于MIMO OTA设置中探针相对位置变化的新型物理配置。本文给出了两种物理配置,并与典型配置进行了比较。仿真结果表明,通过适当的探头配置,可以获得良好的通道仿真精度。同时,为了获得更好的模拟通道空间特性的性能,第一个和最后一个探针环中的探针应在三维(3D)物理探针配置中对称放置。
{"title":"Novel physical probe configurations in a multi-probe based 3D MIMO OTA setup","authors":"Wang Weimin,&nbsp;Li Muyuan,&nbsp;Liu Yuan'an,&nbsp;Wu Yongle,&nbsp;Li Shulan","doi":"10.1016/S1005-8885(17)60188-2","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60188-2","url":null,"abstract":"<div><p>In this paper, channel spatial characteristics which mainly depend on the spatial correlation are selected as the significant factors in over-the-air (OTA) testing for multiple input multiple output (MIMO) devices. The multi-probe anechoic chamber method, a promising candidate of the MIMO OTA testing methods, can reproduce the multipath environments in a controllable manner. A novel physical configuration based on the variation of relative positions of probes in a MIMO OTA setup is put forward to obtain better spatial characteristics. Two physical configurations are presented to make a comparison with the typical configuration in this paper. The simulation results show that by making a proper probe configuration, good channel simulation accuracy can be achieved. Meanwhile, in order to get better performance of emulating channel spatial characteristics, probes in the first and the last probe rings should be placed symmetrically in three dimensional (3D) physical probe configuration.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 1","pages":"Pages 60-66"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60188-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72228586","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}
引用次数: 2
Reduced-complexity MPA decoder based on multi-level dynamic input thresholds 基于多级动态输入阈值的降低复杂度MPA解码器
Q4 Computer Science Pub Date : 2017-02-01 DOI: 10.1016/S1005-8885(17)60186-9
Tan Wei, Zhao Xingcheng, Liu Yuxiang, Gu Shaoxiang, Feng Wenjiang

As a key technology of the fifth generation (5G) wireless communications, sparse code multiple access (SCMA) system has quite high frequency utilization, but its message passing algorithm (MPA) decoder still has high time complexity. By the aid of the proposed multi-level dynamic threshold, the complexity of the MPA decoding can be greatly reduced with little error performance loss. In order to reduce a great deal of insignificant computational amounts of message update, we compare the multi-level symbols probability products with optimized multi-level thresholds step by step before they are used for message update calculation. The dynamic threshold configuration refers to the three factors: the level of input symbol probabilities, signal noise ratio (SNR) and the number of iterations. Especially, in the joint iterative MPA-Turbo decoding procedure, since most encoded bits have good convergence, the input thresholds can avoid more unnecessary computational overhead of message update and reduce the decoding time more significantly. The simulation results show that the proposed multi-level dynamic thresholds considerably reduce the decoding delay in both additive white Gaussian noise (AWGN) channel and frequency selective fading channel.

作为第五代(5G)无线通信的关键技术,稀疏码多址(SCMA)系统具有较高的频率利用率,但其消息传递算法(MPA)解码器仍具有较高的时间复杂度。借助于所提出的多级动态阈值,MPA解码的复杂度可以大大降低,同时误差性能损失很小。为了减少大量不重要的消息更新计算量,我们在将多级符号概率积与优化的多级阈值进行消息更新计算之前,将它们逐步进行比较。动态阈值配置涉及三个因素:输入符号概率水平、信噪比(SNR)和迭代次数。特别是在联合迭代MPA-Turbo解码过程中,由于大多数编码比特具有良好的收敛性,因此输入阈值可以避免更多不必要的消息更新计算开销,并更显著地减少解码时间。仿真结果表明,在加性高斯白噪声(AWGN)信道和频率选择性衰落信道中,所提出的多级动态阈值都显著降低了解码延迟。
{"title":"Reduced-complexity MPA decoder based on multi-level dynamic input thresholds","authors":"Tan Wei,&nbsp;Zhao Xingcheng,&nbsp;Liu Yuxiang,&nbsp;Gu Shaoxiang,&nbsp;Feng Wenjiang","doi":"10.1016/S1005-8885(17)60186-9","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60186-9","url":null,"abstract":"<div><p>As a key technology of the fifth generation (5G) wireless communications, sparse code multiple access (SCMA) system has quite high frequency utilization, but its message passing algorithm (MPA) decoder still has high time complexity. By the aid of the proposed multi-level dynamic threshold, the complexity of the MPA decoding can be greatly reduced with little error performance loss. In order to reduce a great deal of insignificant computational amounts of message update, we compare the multi-level symbols probability products with optimized multi-level thresholds step by step before they are used for message update calculation. The dynamic threshold configuration refers to the three factors: the level of input symbol probabilities, signal noise ratio (SNR) and the number of iterations. Especially, in the joint iterative MPA-Turbo decoding procedure, since most encoded bits have good convergence, the input thresholds can avoid more unnecessary computational overhead of message update and reduce the decoding time more significantly. The simulation results show that the proposed multi-level dynamic thresholds considerably reduce the decoding delay in both additive white Gaussian noise (AWGN) channel and frequency selective fading channel.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 1","pages":"Pages 40-46"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60186-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72228937","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
Design of a reconfigurable transcendental function generator 一种可重构超越函数发生器的设计
Q4 Computer Science Pub Date : 2017-02-01 DOI: 10.1016/S1005-8885(17)60192-4
Jiang Lin , Lü Qing , Xie Xiaoyan , Shan Rui , Deng Junyong

In order to take into account the computing efficiency and flexibility of calculating transcendental functions, this paper proposes one kind of reconfigurable transcendental function generator. The generator is of a reconfigurable array structure composed of 30 processing elements (PEs). The coordinate rotational digital computer (CORDIC) algorithm is implemented on this structure. Different functions, such as sine, cosine, inverse tangent, logarithmic, etc., can be calculated based on the structure by reconfiguring the functions of PEs. The functional simulation and field programmable gate array (FPGA) verification show that the proposed method obtains great flexibility with acceptable performance.

为了考虑计算超越函数的效率和灵活性,本文提出了一种可重构的超越函数生成器。该发生器是由30个处理元件(PE)组成的可重新配置的阵列结构。在此结构上实现了坐标旋转数字计算机(CORDIC)算法。通过重新配置PE的函数,可以根据结构计算不同的函数,如正弦、余弦、反正切、对数等。功能仿真和现场可编程门阵列(FPGA)验证表明,该方法具有良好的灵活性和可接受的性能。
{"title":"Design of a reconfigurable transcendental function generator","authors":"Jiang Lin ,&nbsp;Lü Qing ,&nbsp;Xie Xiaoyan ,&nbsp;Shan Rui ,&nbsp;Deng Junyong","doi":"10.1016/S1005-8885(17)60192-4","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60192-4","url":null,"abstract":"<div><p>In order to take into account the computing efficiency and flexibility of calculating transcendental functions, this paper proposes one kind of reconfigurable transcendental function generator. The generator is of a reconfigurable array structure composed of 30 processing elements (PEs). The coordinate rotational digital computer (CORDIC) algorithm is implemented on this structure. Different functions, such as sine, cosine, inverse tangent, logarithmic, etc., can be calculated based on the structure by reconfiguring the functions of PEs. The functional simulation and field programmable gate array (FPGA) verification show that the proposed method obtains great flexibility with acceptable performance.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 1","pages":"Pages 96-102"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60192-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72265948","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
Low complexity asymptotically unitary algorithm for hybrid beamforming in mmWave communication systems 毫米波通信系统中混合波束形成的低复杂度渐近酉算法
Q4 Computer Science Pub Date : 2017-02-01 DOI: 10.1016/S1005-8885(17)60183-3
Li Xiaohui , Meng Meimei , Lin Yingchao , Hei Yongqiang

In millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems, because of the high hardware cost and high power consumption, the traditional fully digital beamforming (DBF) cannot be implemented easily. Meanwhile, analog beamforming which is implemented with phase shifters has high availability but suffers poor performance. Considering the advantages of above two, a potential solution is to design an appropriate hybrid analog and digital beamforming structure, where the available iterative optimization algorithm can get performance close to fully digital processing, but solving this sparse optimization problem faces with a high computational complexity. The key challenge of seeking out hybrid beamforming (HBF) matrices lies in leveraging the trade-off between the spectral efficiency performance and the computational complexity. In this paper, we propose an asymptotically unitary hybrid precoding (AUHP) algorithm based on antenna array response (AAR) properties to solve the HBF optimization problem. Firstly, we get the optimal orthogonal analog and digital beamforming matrices relying on the channel's path gain in absolute value by taking into account that the AAR matrices are asymptotically unitary. Then, an improved simultaneously orthogonal matching pursuit (SOMP) algorithm based on recursion is adopted to refine the hybrid combining. Numerical results demonstrate that our proposed AUHP algorithm enables a lower computational complexity with negligible spectral efficiency performance degradation.

在毫米波(mmWave)大规模多输入多输出(MIMO)系统中,由于硬件成本高、功耗高,传统的全数字波束形成(DBF)无法轻易实现。同时,用移相器实现的模拟波束成形具有高可用性,但性能较差。考虑到以上两者的优点,一种潜在的解决方案是设计一种合适的模拟和数字混合波束形成结构,其中可用的迭代优化算法可以获得接近全数字处理的性能,但解决这种稀疏优化问题面临着高计算复杂度。寻找混合波束成形(HBF)矩阵的关键挑战在于利用频谱效率性能和计算复杂性之间的权衡。本文提出了一种基于天线阵列响应(AAR)特性的渐近酉混合预编码(AUHP)算法来解决HBF优化问题。首先,考虑到AAR矩阵是渐近酉的,我们得到了依赖于信道路径增益绝对值的最优正交模拟和数字波束形成矩阵。然后,采用一种改进的基于递归的同时正交匹配追踪(SOMP)算法来细化混合组合。数值结果表明,我们提出的AUHP算法能够降低计算复杂度,同时频谱效率性能下降可以忽略不计。
{"title":"Low complexity asymptotically unitary algorithm for hybrid beamforming in mmWave communication systems","authors":"Li Xiaohui ,&nbsp;Meng Meimei ,&nbsp;Lin Yingchao ,&nbsp;Hei Yongqiang","doi":"10.1016/S1005-8885(17)60183-3","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60183-3","url":null,"abstract":"<div><p>In millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems, because of the high hardware cost and high power consumption, the traditional fully digital beamforming (DBF) cannot be implemented easily. Meanwhile, analog beamforming which is implemented with phase shifters has high availability but suffers poor performance. Considering the advantages of above two, a potential solution is to design an appropriate hybrid analog and digital beamforming structure, where the available iterative optimization algorithm can get performance close to fully digital processing, but solving this sparse optimization problem faces with a high computational complexity. The key challenge of seeking out hybrid beamforming (HBF) matrices lies in leveraging the trade-off between the spectral efficiency performance and the computational complexity. In this paper, we propose an asymptotically unitary hybrid precoding (AUHP) algorithm based on antenna array response (AAR) properties to solve the HBF optimization problem. Firstly, we get the optimal orthogonal analog and digital beamforming matrices relying on the channel's path gain in absolute value by taking into account that the AAR matrices are asymptotically unitary. Then, an improved simultaneously orthogonal matching pursuit (SOMP) algorithm based on recursion is adopted to refine the hybrid combining. Numerical results demonstrate that our proposed AUHP algorithm enables a lower computational complexity with negligible spectral efficiency performance degradation.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 1","pages":"Pages 18-25"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60183-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72228940","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}
引用次数: 5
Delay-aware downlink beamforming with discrete rate adaptation for green cloud radio access network 基于离散速率自适应的绿色云无线接入网延迟感知下行链路波束形成
Q4 Computer Science Pub Date : 2017-02-01 DOI: 10.1016/S1005-8885(17)60184-5
Yu Zhi, Wang Ke, Ji Hong

With the popularity of variety delay-sensitive services, how to guarantee the delay requirements for mobile users (MUs) is a great challenge for downlink beamformer design in green cloud radio access networks (C-RANs). In this paper, we consider the problem of the delay-aware downlink beamforming with discrete rate adaptation to minimize the power consumption of C-RANs. We address the problem via a mixed integer nonlinear program (MINLP), and then reformulate the MINLP problem as a mixed integer second-order cone program (MI-SOCP), which is a convex program when the integer variables are relaxed as continuous ones. Based on this formulation, a deflation algorithm, whose computational complexity is polynomial, is proposed to derive the suboptimal solution. The simulation results are presented to validate the effectiveness of our proposed algorithm.

随着各种延迟敏感服务的普及,如何保证移动用户(MU)的延迟要求是绿云无线接入网(C-RAN)下行链路波束形成器设计的一大挑战。在本文中,我们考虑了具有离散速率自适应的延迟感知下行链路波束形成问题,以最小化C-RAN的功耗。我们通过混合整数非线性规划(MINLP)来解决这个问题,然后将MINLP问题重新表述为混合整数二阶锥规划(MI-SOCP),这是一个当整数变量松弛为连续变量时的凸规划。在此基础上,提出了一种计算复杂度为多项式的通货紧缩算法来推导次优解。仿真结果验证了该算法的有效性。
{"title":"Delay-aware downlink beamforming with discrete rate adaptation for green cloud radio access network","authors":"Yu Zhi,&nbsp;Wang Ke,&nbsp;Ji Hong","doi":"10.1016/S1005-8885(17)60184-5","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60184-5","url":null,"abstract":"<div><p>With the popularity of variety delay-sensitive services, how to guarantee the delay requirements for mobile users (MUs) is a great challenge for downlink beamformer design in green cloud radio access networks (C-RANs). In this paper, we consider the problem of the delay-aware downlink beamforming with discrete rate adaptation to minimize the power consumption of C-RANs. We address the problem via a mixed integer nonlinear program (MINLP), and then reformulate the MINLP problem as a mixed integer second-order cone program (MI-SOCP), which is a convex program when the integer variables are relaxed as continuous ones. Based on this formulation, a deflation algorithm, whose computational complexity is polynomial, is proposed to derive the suboptimal solution. The simulation results are presented to validate the effectiveness of our proposed algorithm.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 1","pages":"Pages 26-34"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60184-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72228939","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}
引用次数: 2
Probability stopping criterion for analog decoding of LDPC codes LDPC码模拟译码的概率停止准则
Q4 Computer Science Pub Date : 2017-02-01 DOI: 10.1016/S1005-8885(17)60185-7
Zheng Hao , Zhang Shuyi , Li Lintao , Gao Yuan , Shao Liwei

To detect uncorrectable frames and terminate the decoding procedure early, a probability stopping criterion for iterative analog decoding of low density parity check (LDPC) codes is proposed in this paper. By using probabilities of satisfied checks to detect uncorrectable frames and terminate decoding, the proposed criterion could be applied to analog decoders without much structure modifications. Simulation results show that the proposed criterion can reduce the average number of iterations and achieve a better balance in bit error ratio (BER) performance and decoding complexity than other stopping criteria using extrinsic information.

为了检测不可校正帧并提前终止解码过程,本文提出了一种低密度奇偶校验码迭代模拟解码的概率停止准则。通过使用满足检查的概率来检测不可校正的帧并终止解码,所提出的准则可以应用于模拟解码器,而不需要太多的结构修改。仿真结果表明,与其他使用外部信息的停止准则相比,该准则可以减少平均迭代次数,并在误码率(BER)性能和解码复杂度方面实现更好的平衡。
{"title":"Probability stopping criterion for analog decoding of LDPC codes","authors":"Zheng Hao ,&nbsp;Zhang Shuyi ,&nbsp;Li Lintao ,&nbsp;Gao Yuan ,&nbsp;Shao Liwei","doi":"10.1016/S1005-8885(17)60185-7","DOIUrl":"https://doi.org/10.1016/S1005-8885(17)60185-7","url":null,"abstract":"<div><p>To detect uncorrectable frames and terminate the decoding procedure early, a probability stopping criterion for iterative analog decoding of low density parity check (LDPC) codes is proposed in this paper. By using probabilities of satisfied checks to detect uncorrectable frames and terminate decoding, the proposed criterion could be applied to analog decoders without much structure modifications. Simulation results show that the proposed criterion can reduce the average number of iterations and achieve a better balance in bit error ratio (BER) performance and decoding complexity than other stopping criteria using extrinsic information.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"24 1","pages":"Pages 35-39"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(17)60185-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72228587","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}
引用次数: 3
期刊
Journal of China Universities of Posts and Telecommunications
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1