DOG小波映射伸缩和平移的动力学分析

利用对映射的不动点分析和构造相应次数的迭代曲线,分析了由DOG小波窗口函数构造的一维全局光滑迭代映射的动力学特性.随着尺度伸缩和时间平移,映射不动点会发生数量上的增加或减少,产生稳定或不稳定交点、切点或零点.通过数值仿真得到了动力学行为图、参数分岔图和Lyapunov指数谱,研究和讨论了DOG小波映射的倍周期分岔、切分岔、边界危机分岔、周期窗以及不完全Feigenbaum树等非线性物理现象. 关键词： DOG小波映射 伸缩和平移 不动点 迭代曲线     

谷值V~2控制Boost变换器的精确建模与动力学分析

建立了谷值V2控制Boost变换器的离散迭代映射模型,在此基础上得到了输入电压、输出电容及其等效串联电阻(equivalent series resistance,ESR)变化时的分岔图,推导了不动点处的雅可比矩阵,利用特征值和最大Lyapunov指数对系统进行了稳定性分析,并验证了分岔图的正确性.重点研究了输入电压和输出电容及其ESR对谷值V2控制Boost变换器的动力学特性的影响.研究结果表明,输入电压增大时,变换器从周期1态经历1次倍周期分岔和边界碰撞分岔进入混沌状态;输出电容及其ESR具有相同的分岔路由,随着输出电容及其ESR的逐渐减小,变换器具有从周期1态经历周期2态、周期4态、周期8态、逐渐演变到混沌态的动力学行为.最后,用仿真和实验结果验证了本文理论分析的正确性.     

线性延时反馈Josephson结的Hopf分岔和混沌化

考虑线性延时反馈控制下电阻-电容分路的Josephson结,运用非线性动力学理论分析了受控系统平凡解的稳定性.理论分析表明,随着控制参数的改变,系统的稳定平凡解将会通过Hopf分岔失稳,并推导了发生Hopf分岔的临界参数条件.对不同参数条件下受控系统的动力学进行了数值分析.结果显示,系统由Hopf分岔产生的稳定周期解,将进一步通过对称破缺分岔和倍周期分岔通向混沌. 关键词： 约瑟夫森结 线性延时反馈 Hopf分岔 混沌     

基于滑动窗口子空间的混沌信号降噪算法

基于子空间投影理论，利用混沌信号特性，提出了一种基于滑动窗口子空间投影的混沌信号降噪算法，通过相空间重构和多次迭代运算，较好地解决了低信噪比下的混沌信号降噪问题。对算法的复杂性作了研究，并对重构维数、延迟时间、迭代次数等参数的选择进行了讨论。利用Lorenz模型进行仿真得到了比较好的效果，与传统算法相比，新算法具有降噪效果较好、局部特性损失较少、精度较高等优点。     

用常数周期脉冲方法控制耦合标准映象的混沌

将用常数周期脉冲方法控制保守系统的混沌运动的方法，用于控制高维系统耦合标准映象的混沌运动，计算了系统参数k=0.8和耦合常数β=0.04的有限时间李雅普诺夫指数，考察了不同系统参数和耦合常数下的有限时间李雅普诺夫指数随迭代次数的演化规律，从各次迭代的有限时间收敛区选择满足期望动力学特征的轨道片段，施加适当的脉冲强度找出其对应的周期不动点，从而得到期望的周期转道。     

延迟光反馈VCSEL的混沌动力学特性

根据延迟光反馈垂直腔面发射半导体激光器动力学模型,数值模拟了激光器的混沌动力学特性,分析了外腔长度和光反馈强度对激光器混沌动力学特性的影响.结果表明:外腔较短的激光器,经过混沌区后仍会回到锁频状态|外腔较长的激光器,经过混沌区后不是进入锁频状态而是回到周期1.取定激光器外腔长度为3.0 cm,使反馈强度由小增大,得到激光器由倍周期分岔进入混沌的过程,并在混沌区中出现周期12窗口.本文对混沌保密通信的实际应用具有一定的理论参考价值.     

输出电容时间常数对V~2控制Buck变换器的动力学特性的影响

建立了V2控制Buck变换器的二阶离散迭代映射模型,在其基础上绘制了输出电容及其等效串联电阻(equivalent series resistance,ESR)变化时的分岔图,研究了输出电容时间常数对V2控制Buck变换器的动力学特性的影响.研究结果表明,随着输出电容时间常数的逐渐减小,V2控制Buck变换器具有从稳定的连续导电模式(continuous conduction mode,CCM)周期1态逐渐演变到CCM周期2态、CCM周期4态、CCM周期8态、CCM混沌态、断续导电模式(discontinuous conduction mode,DCM)混沌态的动力学行为.推导了不动点处的雅可比矩阵,利用特征值和最大Lyapunov指数对系统进行了稳定性分析,并验证了分岔分析的正确性.最后,搭建了仿真和实验电路,用仿真和实验结果验证了文中理论分析的正确性.     

非线性动力系统分岔图中的暗线

基于非线性动力系统混沌运动的回归特性，构造了一种对分岔图中穿过混沌区的暗线进行研究的数值回归算法。运用该算法求得抛物线映射的暗线，并与通过暗线方程精确求得的暗线进行比较，验证了算法的有效性。对Brussel振子系统和分段线性单级齿轮动力系统的暗线进行了研究。通过对非线性动力系统分岔图中暗线的研究，由其切点可以得到嵌在混沌区中的周期窗口，由其交点可以得到混沌吸引子的激变点。研究结果表明该算法有助于分析系统的动力学行为和控制混沌运动。     

半周期延迟-非线性反馈控制混沌

提出了基于稳定性准则的半周期延迟-非线性反馈控制混沌的方法，即SC(stability criterion)半周期延迟非线性反馈控制法.通过对混沌系统的适当分离，得到一个特殊的非线性函数，并利用混沌输出信号与其半周期延迟信号的非线性函数之和，构造了连续反馈输入干扰.该方法继承了延迟反馈控制方法及稳定性准则控制方法的优点，实现了有效的自控制过程；并克服了延迟反馈方法的限制，能将嵌入混沌吸引子中的自对称直接不稳周期轨稳定.控制过程可随时开始，具有简便、灵活性.数值模拟结果显示了SC半周期延迟-非线性反馈方法控制的有效性. 关键词： 稳定性准则 混沌控制 半周期延迟 非线性反馈     

延迟-非线性反馈控制混沌

提出了基于稳定性准则的延迟非线性反馈控制混沌的方法，即SC延迟非线性反馈控制法. 通过对混沌系统的适当分离，得到一个特殊的非线性函数，并利用混沌输出信号与其延迟信号的非线性函数的差，构造了连续反馈输入干扰，以控制混沌轨到某一期望的不稳周期轨上. 该方法继承了延迟反馈控制方法的优点，实现了自-控制过程. 另外由于该方法基于线性系统的稳定性准则，保证了控制的有效性. 控制过程可随时开始，具有简便、灵活性. 给出耦合Duffing振子的例子，数值模拟结果显示了SC延迟反馈方法控制的有效性. 关键词： 稳定性准则 混沌控制 延迟反馈 干扰     

水声通信低复杂度最大似然联合均衡译码方法

现有Turbo均衡采用迭代联合均衡译码结构,这一迭代过程在信噪比高于某一门限后才能产生正向的迭代增益,当信道码间干扰较为严重或者采用高阶调制方式时,该信噪比门限较高;同时,现有Turbo均衡的性能还受限于其交织器长度,故当码块长度较短时,其性能并不理想。针对以上问题,提出了一种基于Spinal码的联合均衡译码方法。首先,该方法采用非迭代的最大似然联合均衡译码结构,有效避免了Turbo均衡迭代结构所带来的信噪比门限高问题;其次,该方法采用信息混合能力更强的Spinal码,有助于提高码块长度受限时的误码率性能;最后,该方法利用Spinal码可以有效增加相似信息序列间汉明距离的特点,将联合均衡译码时间复杂度降低为仅随信息序列长度与信道响应长度呈线性增长,解决了本方法难以实际应用于实时水声通信的难题。在抚仙湖湖试中,同样实现速率为3.34kbps数据通信,该方法的误码率优于Turbo均衡方法两个数量级以上。时变水声信道下的仿真以及湖试结果表明,该方法在码长受限的情况下仍在复杂水声信道中表现出更好性能,其所需的最低输入信噪比显著低于现有Turbo均衡方法。     

基于Turbo码的量子高斯密钥分发的数据协调

为了使加密系统中两个合法用户Alice和Bob从量子信道传送的相关的高斯连续变量X和y中获取出密钥,通过一个理想公共授权信道传送部分信息进而从不一致的X和y中得到一致的二进制密钥,这一过程称为协调.本文在样条纠错(Sliced Error Correction,SEC)和多级编码/多路译码(Multi Level coding/Multi Stage Decoding,MLC/MSD)方案的基础上,构建了一套以Turbo纠错码为基础的连续变量量子密钥分发系统的反向数据协调方案.提出了以Turbo码的校验比特流为协调信息的Slepian-Wolf编译码方案.仿真结果表明可在信道信噪比7 dB以上实现20000个连续变量序列的协调.     

Acceleration target detection based on LFM radar

In radar systems, the echo signal caused by an accelerated target can be similarly considered as linear frequency modulation (LFM) signal. In high signal-to-noise ratio (SNR), discrete polynomial-phase transform (DPT) algorithm can be used to detect the echo signal, as it has low computation complexity and high real-time performance. However, in low SNR, the DPT algorithm has a large mean square error of the rate of frequency modulation and a low detection probability. In order to detect LFM signal in low SNR, this paper proposes a detection method, segment discrete polynomial-phase transform (SDPT), which means, at first, dividing the whole echo pulses into several segments with same duration in time domain, and then, using coherent accumulation method of DFT to segments, at last, processing this signal with DPT in intra-segment. In the case of a large number of segments, the SDPT can improve the output SNR. In addition, in a certain SNR, to the target signal with big sampling interval, large acceleration and less segments, this paper proposes an algorithm to detect the LFM signal generated from the combination of an improved DPT (IDPT) and fractional Fourier transform (FRFT). The output SNR of this algorithm is connected with the length of time delay. In the simulation, when the length of the time delay is 0.2 N, the output SNR is 2.5 dB more than that which results from directly using DPT. Finally, the detection performance and algorithm complexity of the proposed algorithm were analyzed, and the simulated and measured data verify the effectiveness of the algorithm.     

Implementation of LT codes based on chaos

Fountain codes provide an efficient way to transfer information over erasure channels like the Internet. LT codes are the first codes fully realizing the digital fountain concept. They are asymptotically optimal rateless erasure codes with highly efficient encoding and decoding algorithms. In theory, for each encoding symbol of LT codes, its degree is randomly chosen according to a predetermined degree distribution, and its neighbours used to generate that encoding symbol are chosen uniformly at random. Practical implementation of LT codes usually realizes the randomness through pseudo-randomness number generator like linear congruential method. This paper applies the pseudo-randomness of chaotic sequence in the implementation of LT codes. Two Kent chaotic maps are used to determine the degree and neighbour（s） of each encoding symbol. It is shown that the implemented LT codes based on chaos perform better than the LT codes implemented by the traditional pseudo-randomness number generator.     

Construction of Exponent matrix compatible for multiple lifting sizes for 5G New Radio

Rate-compatible non binary LDPC codes are used as coding scheme for data transmission in fifth generation new radio. In this paper, we have presented a method for construction of exponent matrix. We first discuss about the types of the cycles and analyze the cycles that are responsible for the degradation of the error performance of the LDPC codes. At low SNR and higher code rates the occurrence of errors will be high, as the parity bits are less at higher code rates. This becomes a challenge while constructing the exponent matrix. In order to fulfill the challenge, we propose a simple and practical algorithm to construct the exponent matrix. The constructed matrix can be used for various code rates and information lengths. The constructed matrix is based on second lifting size set of 5G standard. Simulation results show that the proposed algorithm is effective and exhibits that the constructed LDPC codes can even perform well at low SNR and at higher code rate.     

一种ZF与SP结合的BLAST译码算法

多输入多输出虽能显著增加信道容量,但译码复杂度与精度一直是亟待解决的核心问题之一。将现有的贝尔实验室分层空时码检测迫零算法与球形译码算法充分结合,重点考察无线多输入多输出信道基本特征即信道条件数与信噪比,提出了一种自适应的贝尔实验室分层空时码解码算法,在保证误比特率性能的条件下,降低了系统的译码复杂度;为无线通信的长期演进研究奠定了良好基础。     

List Decoding of Arıkan’s PAC Codes

Polar coding gives rise to the first explicit family of codes that provably achieve capacity with efficient encoding and decoding for a wide range of channels. However, its performance at short blocklengths under standard successive cancellation decoding is far from optimal. A well-known way to improve the performance of polar codes at short blocklengths is CRC precoding followed by successive-cancellation list decoding. This approach, along with various refinements thereof, has largely remained the state of the art in polar coding since it was introduced in 2011. Recently, Arıkan presented a new polar coding scheme, which he called polarization-adjusted convolutional (PAC) codes. At short blocklengths, such codes offer a dramatic improvement in performance as compared to CRC-aided list decoding of conventional polar codes. PAC codes are based primarily upon the following main ideas: replacing CRC codes with convolutional precoding (under appropriate rate profiling) and replacing list decoding by sequential decoding. One of our primary goals in this paper is to answer the following question: is sequential decoding essential for the superior performance of PAC codes? We show that similar performance can be achieved using list decoding when the list size L is moderately large (say, L⩾128). List decoding has distinct advantages over sequential decoding in certain scenarios, such as low-SNR regimes or situations where the worst-case complexity/latency is the primary constraint. Another objective is to provide some insights into the remarkable performance of PAC codes. We first observe that both sequential decoding and list decoding of PAC codes closely match ML decoding thereof. We then estimate the number of low weight codewords in PAC codes, and use these estimates to approximate the union bound on their performance. These results indicate that PAC codes are superior to both polar codes and Reed–Muller codes. We also consider random time-varying convolutional precoding for PAC codes, and observe that this scheme achieves the same superior performance with constraint length as low as ν=2.     

Turbo codes: the phase transition

Turbo codes are a very efficient method for communicating reliably through a noisy channel. There is no theoretical understanding of their effectiveness. In reference [1] they are mapped onto a class of disordered spin models. The analytical calculations concerning these models are reported here. We prove the existence of a no-error phase and compute its local stability threshold. As a byproduct, we gain some insight into the dynamics of the decoding algorithm. Received 14 March 2000     

强散射过程中基于奇异值分解的光学传输矩阵优化方法

通过测量散射介质的传输矩阵能够控制光在此介质中的传输,但目前没有通过优化传输矩阵(即搜索介质本征传输矩阵)来提高光传输效率的研究.通过测量介质的传输矩阵进行奇异值分解与背景滤波,初步优化了传输矩阵后,提出通过遗传算法再次优化传输矩阵,实现了进一步优化传输矩阵,提高了聚焦效率和信噪比.所提方法为可见光在生物组织中的成像提供了一种新的思路和方法.     

Joint Early Stopping Criterions for Protograph LDPC Codes-Based JSCC System in Images Transmission

In this paper, a joint early stopping criterion based on cross entropy (CE), named joint CE criterion, is presented for double-protograph low-density parity-check (DP-LDPC) codes-based joint source-channel coding (JSCC) systems in images transmission to reduce the decoding complexity and decrease the decoding delay. The proposed early stopping criterion adopts the CE from the output likelihood ratios (LLRs) of the joint decoder. Moreover, a special phenomenon named asymmetry oscillation-like convergence (AOLC) in the changing process of CE is uncovered in the source decoder and channel decoder of this system meanwhile, and the proposed joint CE criterion can reduce the impact from the AOLC phenomenon. Comparing to the counterparts, the results show that the joint CE criterion can perform well in the decoding complexity and decoding latency in the low–moderate signal-to-noise ratio (SNR) region and achieve performance improvement in the high SNR region with appropriate parameters, which also demonstrates that this system with joint CE is a low-latency and low-power system.