In this paper we consider the problem of finding bounds on the size of lexicographic constant-weight equidistant codes over the alphabet of three, four and five elements with 2 ≤ w 【n ≤ 10. Computer search of lexic...In this paper we consider the problem of finding bounds on the size of lexicographic constant-weight equidistant codes over the alphabet of three, four and five elements with 2 ≤ w 【n ≤ 10. Computer search of lexicographic constant-weight equidistant codes is performed. Tables with bounds on the size of lexicographic constant-weight equidistant codes are presented.展开更多
Decoding by alternating direction method of multipliers(ADMM) is a promising linear programming decoder for low-density parity-check(LDPC) codes. In this paper, we propose a two-step scheme to lower the error floor of...Decoding by alternating direction method of multipliers(ADMM) is a promising linear programming decoder for low-density parity-check(LDPC) codes. In this paper, we propose a two-step scheme to lower the error floor of LDPC codes with ADMM penalized decoder.For the undetected errors that cannot be avoided at the decoder side, we modify the code structure slightly to eliminate low-weight code words. For the detected errors induced by small error-prone structures, we propose a post-processing method for the ADMM penalized decoder. Simulation results show that the error floor can be reduced significantly over three illustrated LDPC codes by the proposed two-step scheme.展开更多
The rate and distortion of Id-slice do not fit the globally linear relationship on a logarithmic scale. Lagrange multiplier selection methods based on the globally linear approximate relationship are neither efficient...The rate and distortion of Id-slice do not fit the globally linear relationship on a logarithmic scale. Lagrange multiplier selection methods based on the globally linear approximate relationship are neither efficient nor optimal for multi-view video coding (MVC). To improve the coding efficiency of MVC, a local curve fitting based Lagrange multiplier selection method is proposed in this paper, where Lagrange multipliers are selected according to the local slopes of the approximate curves. Experi-mental results showed that the proposed method improves the coding efficiency. Up to 2.5 dB gain was achieved at low bitrates.展开更多
针对现有抗噪声调频干扰相位编码波形设计算法存在计算复杂度高、难以满足实时处理需求的问题,本文提出了一种基于频域坐标下降的高效优化算法。首先,将时域联合优化目标函数转换至频域,建立相位编码波形的频域优化模型。该转换不仅有...针对现有抗噪声调频干扰相位编码波形设计算法存在计算复杂度高、难以满足实时处理需求的问题,本文提出了一种基于频域坐标下降的高效优化算法。首先,将时域联合优化目标函数转换至频域,建立相位编码波形的频域优化模型。该转换不仅有效规避了时域优化过程中大规模矩阵运算带来的高计算代价,还使得优化问题结构更为简洁,便于后续的算法设计。随后,在交替方向乘子法(Alternating Direction Method of Multipliers,ADMM)框架下引入频域坐标下降法(Frequency-domain Coordinate Descent Method,FCDM),形成了ADMMFCDM算法。该算法将复杂的高维优化问题分解为多个可独立并行处理的一维子问题,通过推导波形频域序列元素的闭式解,不仅大幅降低了单次迭代的计算量,还显著提升了全局优化效率。最后,本文引入快速傅里叶变换(Fast Fourier Transform,FFT)技术对ADMM-FCDM进行简化,得到了交替方向乘子法框架下结合快速傅里叶变换的频域坐标下降算法(Frequency-domain Coordinate Descent Method with Fast Fourier Transform under Alternating Direction Method of Multipliers Framework,ADMM-FFT-FCDM)。FFT的引入极大程度地降低了时域与频域之间变换所需的计算时间,进一步提升了算法的运算效率。仿真实验表明,较于现有算法,本文提出的ADMM-FFTFCDM算法在保证雷达抗干扰性能和探测性能的同时,运算速度获得显著提升。展开更多
介绍用于光纤通信的速率为2.5 G b/s的高速RS(255,239)译码器设计。对输入信号中可能出现的超出译码器纠错能力的误码可进行检测判断,保证了误码不扩散。对译码器中大量使用的有限域乘法器进行了优化设计,尤其对并行钱氏搜索电路中的乘...介绍用于光纤通信的速率为2.5 G b/s的高速RS(255,239)译码器设计。对输入信号中可能出现的超出译码器纠错能力的误码可进行检测判断,保证了误码不扩散。对译码器中大量使用的有限域乘法器进行了优化设计,尤其对并行钱氏搜索电路中的乘法器采用了按组优化设计方法,与直接实现方法相比,复杂度降低了45%。该RS译码器已用FPGA进行了功能验证,并用TSM C 0.18μm CM O S工艺实现,Synopsys综合后的仿真结果表明译码器电路时钟工作频率达到了330 MH z。展开更多
文摘In this paper we consider the problem of finding bounds on the size of lexicographic constant-weight equidistant codes over the alphabet of three, four and five elements with 2 ≤ w 【n ≤ 10. Computer search of lexicographic constant-weight equidistant codes is performed. Tables with bounds on the size of lexicographic constant-weight equidistant codes are presented.
基金supported in part by National Nature Science Foundation of China under Grant No.61471286,No.61271004the Fundamental Research Funds for the Central Universitiesthe open research fund of Key Laboratory of Information Coding and Transmission,Southwest Jiaotong University(No.2010-03)
文摘Decoding by alternating direction method of multipliers(ADMM) is a promising linear programming decoder for low-density parity-check(LDPC) codes. In this paper, we propose a two-step scheme to lower the error floor of LDPC codes with ADMM penalized decoder.For the undetected errors that cannot be avoided at the decoder side, we modify the code structure slightly to eliminate low-weight code words. For the detected errors induced by small error-prone structures, we propose a post-processing method for the ADMM penalized decoder. Simulation results show that the error floor can be reduced significantly over three illustrated LDPC codes by the proposed two-step scheme.
基金Project (Nos. 60505017 and 60534070) supported by the National Natural Science Foundation of China
文摘The rate and distortion of Id-slice do not fit the globally linear relationship on a logarithmic scale. Lagrange multiplier selection methods based on the globally linear approximate relationship are neither efficient nor optimal for multi-view video coding (MVC). To improve the coding efficiency of MVC, a local curve fitting based Lagrange multiplier selection method is proposed in this paper, where Lagrange multipliers are selected according to the local slopes of the approximate curves. Experi-mental results showed that the proposed method improves the coding efficiency. Up to 2.5 dB gain was achieved at low bitrates.
文摘针对具有星间链路(inter-satellite links,ISL)的低轨(low earth orbit,LEO)多卫星系统,提出了一种基于多卫星协作传输的和速率(sum rate,SR)最大化预编码算法.传统的预编码算法需要复杂的星上计算来得到数值解,这导致低轨卫星系统面临较大的计算开销和延迟问题.为解决上述关键问题,设计了一种基于交替方向乘子法(alternating direction method of multipliers,ADMM)的高吞吐量、低复杂度、具有闭式解的分布式预编码算法.该算法通过构建辅助变量和问题分解,将预编码设计问题转化为多个子问题并行求解,每个子问题仅有一个约束条件,并在每次迭代后仅通过星间链路交换设计的数据矩阵,从而有效实现分布式预编码.仿真结果表明,与典型的两步和速率最大化算法相比,所提出的算法可以实现更高的和速率,同时大幅降低计算复杂度.
文摘针对现有抗噪声调频干扰相位编码波形设计算法存在计算复杂度高、难以满足实时处理需求的问题,本文提出了一种基于频域坐标下降的高效优化算法。首先,将时域联合优化目标函数转换至频域,建立相位编码波形的频域优化模型。该转换不仅有效规避了时域优化过程中大规模矩阵运算带来的高计算代价,还使得优化问题结构更为简洁,便于后续的算法设计。随后,在交替方向乘子法(Alternating Direction Method of Multipliers,ADMM)框架下引入频域坐标下降法(Frequency-domain Coordinate Descent Method,FCDM),形成了ADMMFCDM算法。该算法将复杂的高维优化问题分解为多个可独立并行处理的一维子问题,通过推导波形频域序列元素的闭式解,不仅大幅降低了单次迭代的计算量,还显著提升了全局优化效率。最后,本文引入快速傅里叶变换(Fast Fourier Transform,FFT)技术对ADMM-FCDM进行简化,得到了交替方向乘子法框架下结合快速傅里叶变换的频域坐标下降算法(Frequency-domain Coordinate Descent Method with Fast Fourier Transform under Alternating Direction Method of Multipliers Framework,ADMM-FFT-FCDM)。FFT的引入极大程度地降低了时域与频域之间变换所需的计算时间,进一步提升了算法的运算效率。仿真实验表明,较于现有算法,本文提出的ADMM-FFTFCDM算法在保证雷达抗干扰性能和探测性能的同时,运算速度获得显著提升。
文摘介绍用于光纤通信的速率为2.5 G b/s的高速RS(255,239)译码器设计。对输入信号中可能出现的超出译码器纠错能力的误码可进行检测判断,保证了误码不扩散。对译码器中大量使用的有限域乘法器进行了优化设计,尤其对并行钱氏搜索电路中的乘法器采用了按组优化设计方法,与直接实现方法相比,复杂度降低了45%。该RS译码器已用FPGA进行了功能验证,并用TSM C 0.18μm CM O S工艺实现,Synopsys综合后的仿真结果表明译码器电路时钟工作频率达到了330 MH z。
