A computationally efficient soft-output detector with lattice-reduction （LR） for the multiple-input multiple-output （MIMO） systems is proposed. In the proposed scheme, the sorted QR de- composition is applied on t...A computationally efficient soft-output detector with lattice-reduction （LR） for the multiple-input multiple-output （MIMO） systems is proposed. In the proposed scheme, the sorted QR de- composition is applied on the lattice-reduced equivalent channel to obtain the tree structure. With the aid of the boundary control, the stack algorithm searches a small part of the whole search tree to generate a handful of candidate lists in the reduced lattice. The proposed soft-output algorithm achieves near-optimal perfor- mance in a coded MIMO system and the associated computational complexity is substantially lower than that of previously proposed methods.展开更多
当前美国国家标准与技术研究院(National Institute of Standards and Technology,NIST)对后量子密码(Post-Quantum Cryptography,PQC)标准化方案的评估已进入第四轮,位翻转密钥封装(Bit Flipping Key Encapsulation,BIKE)协议是目前被...当前美国国家标准与技术研究院(National Institute of Standards and Technology,NIST)对后量子密码(Post-Quantum Cryptography,PQC)标准化方案的评估已进入第四轮,位翻转密钥封装(Bit Flipping Key Encapsulation,BIKE)协议是目前被评估的四个候选方案之一.在BIKE的密钥生成算法中,多项式乘法作为众多密码系统中特别耗时的操作之一,耗费了大量的时间和面积资源.针对此问题,本文设计了一种基于Karatsuba算法(Karatsuba Algorithm,KA)的无交叠多项式乘法器,可高效实现万级比特位宽的多项式乘法,具有低时延、高性能和面积小的特点.同时,本文将该优化乘法器应用于BIKE密钥生成算法中,并基于现场可编程门阵列(Field Programmable Gate Array,FPGA)对其进行硬件架构实现,改进了原有的紧凑多项式乘法和多项式求逆算法.本文提出的乘法器通过采用不同的操作数位宽,可适应对面积和延时的不同需求.与BIKE原本的设计相比,改进的设计使密钥生成模块的延时减小了36.54%,面积延迟积(Area Delay Production,ADP)减小了10.4%.展开更多
Attribute reduction in the rough set theory is an important feature selection method, but finding a minimum attribute reduction has been proven to be a non-deterministic polynomial （NP）-hard problem. Therefore, it i...Attribute reduction in the rough set theory is an important feature selection method, but finding a minimum attribute reduction has been proven to be a non-deterministic polynomial （NP）-hard problem. Therefore, it is necessary to investigate some fast and effective approximate algorithms. A novel and enhanced quantum-inspired shuffled frog leaping based minimum attribute reduction algorithm （QSFLAR） is proposed. Evolutionary frogs are represented by multi-state quantum bits, and both quantum rotation gate and quantum mutation operators are used to exploit the mechanisms of frog population diversity and convergence to the global optimum. The decomposed attribute subsets are co-evolved by the elitist frogs with a quantum-inspired shuffled frog leaping algorithm. The experimental results validate the better feasibility and effectiveness of QSFLAR, comparing with some representa- tive algorithms. Therefore, QSFLAR can be considered as a more competitive algorithm on the efficiency and accuracy for minimum attribute reduction.展开更多
随着4 bit S盒在轻量级密码算法中的广泛应用,如何捕获这些4 bit S盒输入及输出的代数关系成为了目前的研究热点之一。根据S盒的输入及输出关系,提出了n bit S盒的非线性回路代数关系的通用求解算法。针对4 bit S盒设计了高效的非线性...随着4 bit S盒在轻量级密码算法中的广泛应用,如何捕获这些4 bit S盒输入及输出的代数关系成为了目前的研究热点之一。根据S盒的输入及输出关系,提出了n bit S盒的非线性回路代数关系的通用求解算法。针对4 bit S盒设计了高效的非线性回路代数关系求解算法,并对国际公认的16类最优4 bit S盒及多个著名的轻量级密码算法中的S盒进行了测试分析。同时,还对上述轻量级密码算法中S盒所属等价类进行了检测。研究结果表明:16类S盒代表元中只有3类不存在二次回路代数关系;同属等价类S盒可能会有不同的二次回路代数关系;MANTIS、PRIDE、Marvin等轻量级算法的S盒存在多个二次回路代数关系。即这些包含低次回路代数关系的S盒存在潜在的安全缺陷。展开更多
为降低电磁干扰对信号传输的影响,分析了应答器上行链路信号传输过程及其易遭受干扰信号的特点,设计了基于符号最小均方误差(least mean square,LMS)算法的自适应解调方法。为在硬件平台中实现该解调方法,通过仿真计算,确定LMS算法的自...为降低电磁干扰对信号传输的影响,分析了应答器上行链路信号传输过程及其易遭受干扰信号的特点,设计了基于符号最小均方误差(least mean square,LMS)算法的自适应解调方法。为在硬件平台中实现该解调方法,通过仿真计算,确定LMS算法的自适应算法中间变量变化范围,使用截位操作完成权值系数的更新,设置均衡器长度、步长因子、中值滤波系数分别为1、1/64、16,可在不占用过多硬件资源情况下获得良好的解调性能。解调算法在现场可编程门阵列(field programmable gata array,FPGA)上予以验证,实验表明,当信噪比为6 dB时,FPGA中自适应解调误码率为0.000001,在信噪比大于等于6 dB时,实测误码率与仿真分析误码率基本一致;FPGA自适应解调方法在列车不同速度等级下误码率均小于10^(-6)。展开更多
文摘A computationally efficient soft-output detector with lattice-reduction （LR） for the multiple-input multiple-output （MIMO） systems is proposed. In the proposed scheme, the sorted QR de- composition is applied on the lattice-reduced equivalent channel to obtain the tree structure. With the aid of the boundary control, the stack algorithm searches a small part of the whole search tree to generate a handful of candidate lists in the reduced lattice. The proposed soft-output algorithm achieves near-optimal perfor- mance in a coded MIMO system and the associated computational complexity is substantially lower than that of previously proposed methods.
基金supported by the National Natural Science Foundation of China(6113900261171132)+4 种基金the Funding of Jiangsu Innovation Program for Graduate Education(CXZZ11 0219)the Natural Science Foundation of Jiangsu Education Department(12KJB520013)the Applying Study Foundation of Nantong(BK2011062)the Open Project Program of State Key Laboratory for Novel Software Technology,Nanjing University(KFKT2012B28)the Natural Science Pre-Research Foundation of Nantong University(12ZY016)
文摘Attribute reduction in the rough set theory is an important feature selection method, but finding a minimum attribute reduction has been proven to be a non-deterministic polynomial （NP）-hard problem. Therefore, it is necessary to investigate some fast and effective approximate algorithms. A novel and enhanced quantum-inspired shuffled frog leaping based minimum attribute reduction algorithm （QSFLAR） is proposed. Evolutionary frogs are represented by multi-state quantum bits, and both quantum rotation gate and quantum mutation operators are used to exploit the mechanisms of frog population diversity and convergence to the global optimum. The decomposed attribute subsets are co-evolved by the elitist frogs with a quantum-inspired shuffled frog leaping algorithm. The experimental results validate the better feasibility and effectiveness of QSFLAR, comparing with some representa- tive algorithms. Therefore, QSFLAR can be considered as a more competitive algorithm on the efficiency and accuracy for minimum attribute reduction.
文摘随着4 bit S盒在轻量级密码算法中的广泛应用,如何捕获这些4 bit S盒输入及输出的代数关系成为了目前的研究热点之一。根据S盒的输入及输出关系,提出了n bit S盒的非线性回路代数关系的通用求解算法。针对4 bit S盒设计了高效的非线性回路代数关系求解算法,并对国际公认的16类最优4 bit S盒及多个著名的轻量级密码算法中的S盒进行了测试分析。同时,还对上述轻量级密码算法中S盒所属等价类进行了检测。研究结果表明:16类S盒代表元中只有3类不存在二次回路代数关系;同属等价类S盒可能会有不同的二次回路代数关系;MANTIS、PRIDE、Marvin等轻量级算法的S盒存在多个二次回路代数关系。即这些包含低次回路代数关系的S盒存在潜在的安全缺陷。
