Using discrete optimization algorithms to find minimum energy configurations of slender cantilever beams with non-convex energy functions

This paper deals with a new solution technique for approximately solving certain variational problems in elasticity by using discrete optimization techniques that were originally used in information theory. This allows us to easily and approximately solve large deformation buckling problems for slender cantilever beams (including post-buckling behavior) as well as problems where the strain energy function is non-convex.The core idea is to quantize or discretize the variables describing the possible configurations of the body. This, when combined with the fact that the variational problem has an inherent Markov structure allows us to use computationally efficient search techniques based on dynamic programming (equivalent to finding the shortest path in a weighted directed graph) to find optimal solutions within the quantized state space. The results can be used in two ways: (1) directly as a fast approximate solution to the variational problem (2) As a means for finding very good (nearly minimum energy) initial configurations for application of conventional minimization techniques, which might otherwise fail because of a poor starting configurations which are far from the global minimum. We demonstrate both these uses in the paper.     

Partial permutation decoding for the first-order Reed-Muller codes

Partial permutation decoding is shown to apply to the first-order Reed-Muller codes R(1,m), where m>4 by finding s-PD-sets for these codes for 2≤s≤4.     

基于IP核的Viterbi译码器实现

Viterbi译码器在通信系统中应用非常普遍,针对采用DSP只能进行相对较低速率的Viterbi译码的问题,人们开始采用FPGA实现高速率Viterbi译码。本文首先简单描述了Viterbi译码的基本过程,接着根据Viterbi译码器IP核的特点,分别详细介绍了并行结构、混合结构和基于混合结构的增信删余3种Viterbi译码器IP核的主要性能和使用方法,并通过应用实例给出了译码器IP核的性能仿真。     

一种新的准正交空时分组码的设计

ABBA码是一种可用于3个以上发射天线系统的准正交空时分组码,该方案虽然可以实现全速率传输,但是其译码复杂度高。针对上述缺点提出了一种基于星座旋转的能够实现满分集增益、全速率传输的准正交空时分组码,给出了接收端最大似然译码的独立译码方案,简化了译码过程,降低了译码复杂度,仿真结果表明其误码性能与ABBA码相比得到了较大的改善。     

基于FPGA的SFBC码译码算法实现

在分析空频分组码（SFBC）编译码算法的基础上,重点研究了译码算法的工程实现方法。为解决SFBC码译码器现场可编程门阵列（FPGA）实现时的复杂性高、占用资源多的问题,提出了一种基于FPGA的优化译码器结构和实现方案,有效减少了资源占有量,提高了处理速度,并在Xilinx的xc4vlx80芯片上实现了SFBC码译码器,通过时序仿真结果验证了译码结构的有效性和实用性。     

基于BM算法的RS（18,10）译码的软件实现和性能分析

使用MATLAB软件设计了GF（2^8）上的加法、乘法、求逆运算模块,并以这些模块为基础,编写了RS（18,10）的采用串行的时域Berlekamp-Massye（BM）算法、钱搜索算法、forney算法的译码的软件实现。各个算法模块均采用硬件可以容易实现的算法,为硬件开发验证和调试提供了强有力的辅助手段,并对该码进行了性能分析。     

Improved QO-STBC for three and four transmit antennas

A new quasi-orthogonal space-time block code (QO-STBC) based on ABBA code with lower decoding complexity and higher bit error statistics (BER) performance was proposed by U.Park recently,which can obtain full transmission rate and full diversity.In this article,the authors proposed an improved U.Park scheme based on rotational ABBA code.For eliminating the interference terms resulting from neighboring signals during signal detection,two different matrixes are used.And independent decoding can be realized when maximum-likelihood decoding at the receiver is used.Simulation results demonstrate that the BER performance is improved dramatically without increasing the decoding complexity compared with U.Park scheme.     

Opportunistic decoding of unequal erasure protected scalable coded source

In this paper,we propose an opportunistic decoding method to enhance the reconstruction of unequal erasure protected scalable coded source.This method explores some non-channel-decodable symbols of the received packets by opportunistically utilizing the structure information of joint source-channel coding scheme.As a result,a longer prefix of source coded stream may be obtained to enhance the reconstruction of scalable coded source.Experiment results indicate that opportunistic decoding at the receiver can ...     

无线中继网络编码的最优化解码方案

网络编码技术在无线通信系统中的应用能够显著的提高通信系统的干扰性从而降低误码率并且提高数据传输率。主要研究了两个用户、两个中继、一个基站组成的无线通信系统,当两个用户同时输出相互独立的信息时,基站的最优解码方案。首先分析了在基站采用独立硬判决解码和联合软判决解码两种解码方案,然后通过数据仿真方法比较了采用两种解码方案时基站接收误码率,最后在理论上推导出联合软判决解码方案的误码率边界曲线并得到最优化的解码方案。     

A Dynamic Programming Algorithm for the Fused Lasso and L 0-Segmentation

We propose a dynamic programming algorithm for the one-dimensional Fused Lasso Signal Approximator (FLSA). The proposed algorithm has a linear running time in the worst case. A similar approach is developed for the task of least squares segmentation, and simulations indicate substantial performance improvement over existing algorithms. Examples of R and C implementations are provided in the online Supplementary materials, posted on the journal web site.