Error Correcting Strategy for High Speed and High Density Reliable Flash Memories

This paper presents a method to reduce area overhead and timing impact due to the implementation of standard single symbol correcting codes for Flash memories. It is based on a manipulation of the parity check matrix which defining the code, which allows us to minimize the matrix weight and the maximum row weight. We will then introduce an analysis of the code correction ability and efficiency. Furthermore, we will show that a minimal increase in the redundancy with respect to the standard case allows a further considerable reduction of the impact on memory access time and area overhed due to the error correction circuitry.     

实测数据的机载斜视SAR成像算法

距离-多普勒(R-D)算法是SAR成像中较为普遍的一种成像方法,被广泛应用在各个方面的SAR成像工作中。由于成像处理中常采用分段处理、分段校正的方法,雷达斜视时会在距离徙动的校正中造成各段交界处的跳跃现象,对成像带来不便。文中结合机载SAR斜视的实测数据,讨论了在原有的R-D算法基础上的一种改进方案,即在时域校正线性距离走动并频域校正距离弯曲,有效地避免了这种跳跃现象,使成像效果得到明显改善。     

Turbo码的性能分析及其应用

纠错编码技术作为改善数字通信可靠性的一种有效手段,在数字通信的各个领域中获得极为广泛的应用,其主要分为卷积码、分组码。Turbo码是并行级联递归系统卷积码。他在接近Shannon限的低信噪比下能获得较低的误码率。因为其优越的性能,现在已经被许多通信系统所采用。就近年来的研究热点纠错编码Turbo码进行分析,旨在阐明Turbo码的基本原理和各参数对Turbo码纠错性能的影响以及在无线通信系统中的应用。     

基于IEEE1451接口的智能网络传感器设计

提出一种基于IEEE1451.2和IEEE1451.4相结合网络传感器的接口,有效地解决了固定通道数的数据采集系统,频繁进行热插拔情况下统一接口设计的问题.所有传感器能以任何组合插入任何一个或多个数据采集通道.设计了基于IEEE1451.2的TEDS,最后详细介绍了以Pt100为变换器的温度传感器的校正引擎的设计.实验证明,该校正方法能提高测量精度0.1～0.4℃     

基于线性分组码的(k,n)门限方案的研究

首先探讨了纠错码与（k，n）门限方案间的内在联系，然后分析了（n，k）MDS码用于构造（k，n）门限方案的充要条件及具体方法；给出了纠错码门限方案的几个重要定理和构造（k，n）门限方案的方法。     

On Goppa Codes and Weierstrass Gaps at Several Points

We generalize results of Homma and Kim [J. Pure Appl. Algebra Vol. 162, (2001), pp. 273–290] concerning an improvement on the Goppa bound on the minimum distance of certain Goppa codes.This paper was written while the second author was visiting The University of Valladolid (Dpto. Algebra, Geometría y Topología; Fac. de Ciencias) supported by the Grant SB2000-0225 from the Secretaria de Estado de Educacíon y Universidades del Ministerio de Educacíon, Cultura y Deportes de España.     

A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem

Maximization of submodular functions on a ground set is a NP-hard combinatorial optimization problem. Data correcting algorithms are among the several algorithms suggested for solving this problem exactly and approximately. From the point of view of Hasse diagrams data correcting algorithms use information belonging to only one level in the Hasse diagram adjacent to the level of the solution at hand. In this paper, we propose a data correcting algorithm that looks at multiple levels of the Hasse diagram and hence makes the data correcting algorithm more efficient. Our computations with quadratic cost partition problems show that this multilevel search effects a 8- to 10-fold reduction in computation times, so that some of the dense quadratic partition problem instances of size 500, currently considered as some of the most difficult problems and far beyond the capabilities of current exact methods, are solvable on a personal computer working at 300 MHz within 10 min.     

基于Matlab的纠错码性能测试仿真

给出纠错码性能测试仿真的一般方法，重点研究其信道差错序列的产生，然后利用Matlab实现卷积码编码及其Viterbi译码的性能测试仿真。     

菲涅尔区修正圆柱面天线的聚焦场特性

在圆柱面上进行一维菲涅尔区相位修正结构设计,可以构成一类新型的点源馈电透镜天线。该文用辅助源法导出该透镜天线对任意斜入射平面波形成的聚焦场分布,分析了其聚焦性能及偏轴扫描特性。     

Analysis and performance evaluation of new coding options for space telecommand links ‐ Part I: AWGN channels

We investigate and compare, over the additive white Gaussian noise channel, different options for updating the error correcting code currently used in space mission telecommand links. Besides some more consolidated proposals, using low‐density parity‐check codes, we characterize and assess the performance of alternative schemes, based on parallel turbo codes and soft‐decision decoded Bose‐Chaudhuri‐Hocquenghem (BCH) codes. The analysis considers relevant metrics like the codeword error rate, the frame error rate, and the undetected frame error rate. The considered codes include binary and non‐binary low‐density parity‐check codes, parallel turbo codes and extended BCH codes, with different decoding algorithms. The complexity of the various schemes and possible limits for their application are considered and discussed. Several numerical examples are provided. International Journal of Satellite Communications and Networking. Copyright © 2014 John Wiley & Sons, Ltd.