检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:马林华[1,2] 刘士平 胡星 黄天宇 徐彬 MA Linhua;LIU Shiping;HU Xing;HUANG Tianyu;XU Bin(Aeronautics and Astronautics Engineering College,Air Force Engineering University,Xi’an 710038,China;The State Key Laboratory of Integrated Services Networks,Xidian University,Xi’an 710071,China;Air Force Aviation University Primary Training Base,Harbin 150100,China)
机构地区:[1]空军工程大学航空工程学院,陕西西安710038 [2]西安电子科技大学综合业务网国家重点实验室,陕西西安710071 [3]空军航空大学初级训练基地,黑龙江哈尔滨150100
出 处:《通信学报》2018年第7期132-138,共7页Journal on Communications
基 金:国家自然科学基金资助项目(No.61472442);陕西省科技攻关基金资助项目(No.2017GY-049);航空科学基金资助项目(No.20155896025)~~
摘 要:为解决系统极化码在编码过程中因分步计算造成的时延和由循环迭代"异或"计算造成的计算复杂度,提出并定义了降维裂解策略,并由此提出了基于降维裂解策略的系统极化码并行编码算法,然后在AWGN信道下进行了仿真验证和计算复杂度分析。结果表明,与传统算法相比,所提算法编码增益略优或基本保持一致,但计算复杂度优化率最高可达80.92%,更适合于硬件实现与工程应用,具有一定的实用价值。In order to solve the delay caused by step-by-step calculation and the computational complexity caused by iterative“exclusive-or”computation during the encoding process,a dimensionality reduction strategy was proposed and defined.Based on this,system polarization code parallel coding algorithm for cracking strategy was proposed.Simulation and computational complexity analysis were carried out on AWGN channel.The results show that the coding gain of the above algorithm is slightly better than the traditional one or almost the same,but the computational complexity is up to 80.92%,which is more suitable for hardware implementation and engineering application.It is more suitable for hardware implementation and has a certain practical value.
关 键 词:极化码 系统极化码 并行编码 复杂度 裂解 误码率
分 类 号:TN911.22[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.127