适合行列合并译码算法的LDPC码的构造

针对低密度奇偶校验(LDPC)码译码器使用行列合并(RCJ)译码算法时存在的流水线冲突问题,提出了一种构造适合行列合并译码算法的LDPC码的方法。该构造方法在渐进添边(PEG)构造算法的基础上,加入行运算顺序的约束条件,使得利用该算法构造的LDPC码在行运算顺序上相邻两行内的非零块不同时共用一列,从而避免了硬件布局布线冲突,减少了流水线延时,提高了译码速率。仿真结果表明,用这种方法构造的LDPC码与全球微波互联接入(WiMAX)标准给出的LDPC码的译码性能相当,而且有效地减少了译码迭代次数,降低了硬件实现复杂度,提高了LDPC译码器吞吐率。     

Improved parallel weighted bit-flipping decoding algorithm for LDPC codes

Aiming at seeking a low-complexity decoder with fast decoding convergence speed for short or medium low-density parity-check (LDPC) codes, an improved parallel weighted bit-flipping (IPWBF) algorithm, which is applied flexibly for two classes of codes is presented here. For LDPC codes with low column weight in their parity check matrix, both bootstrapping and loop detection procedures, described in the existing literature, are included in IPWBF. Furthermore, a novel delay-handling procedure is introduced to prevent the codeword bits of high reliability from being flipped too hastily. For large column weight finite geometry LDPC codes, only the delay-handling procedure is included in IPWBF to show its effectiveness. Extensive simulation results demonstrate that the proposed algorithm achieves a good tradeoff between performance and complexity.     

基于比特可靠性的LDPC码编译码算法

提出了一种基于比特可靠性的低密度奇偶校验(LDPC)码编码算法和一种加权置信传播(BP)译码算法.该编码算法首先利用蒙特卡罗仿真得到LDPC码各个比特节点的出错概率,然后用已知信息替换易出错比特节点进行编码;该译码算法根据比特节点可靠性的差异,在译码时为每个比特节点赋予相应的权值,以调整它们对译码的影响程度.仿真表明,新的编译码算法使得系统性能大大提高,同时加快了译码迭代收敛速度.     

Gradient projection decoding of LDPC codes and algorithmic variations

The current study proposes decoding algorithms for low density parity check codes (LDPC), which offer competitive performance-complexity trade-offs relative to some of the most efficient existing decoding techniques. Unlike existing low-complexity algorithms, which are essentially reduced complexity variations of the classical belief propagation algorithm, starting point in the developed algorithms is the gradient projections (GP) decoding technique, proposed by Kasparis and Evans (2007). The first part of this paper is concerned with the GP algorithm itself, and specifically with determining bounds on the step-size parameter, over which convergence is guaranteed. Consequently, the GP algorithm is reformulated as a message passing routine on a Tanner graph and this new formulation allows development of new low-complexity decoding routines. Simulation evaluations, performed mainly for geometry-based LDPC constructions, show that the new variations achieve similar performances and complexities per iteration to the state-of-the-art algorithms. However, the developed algorithms offer the implementation advantages that the memory-storage requirement is significantly reduced, and also that the performance and convergence speed can be finely traded-off by tuning the step-size parameter.     

Reducing the PAPR by utilisation of the LDPC code

Peak-to-average power ratio (PAPR) is a major drawback in most multi-carrier communication techniques such as orthogonal frequency division multiplex system (OFDM). OFDM consists of lots of independent modulated subcarriers, as a result the amplitude of such a signal can have very large values. These large peaks increase the amount of intermodulation distortion resulting in an increase in the error rate. The PAPR of an OFDM signal can be reduced in several ways: selective mapping, Golay sequences, cyclic coding, clipping and filtering, and multiple signal representation techniques. The authors have improved the performance of the OFDM system by using low-density parity-check (LDPC) codes as an alternative to turbo coding in mitigating the PAPR problem which has been used in the pervious works of the authors. The authors present the design for the proposed (LDPC) code technique that achieves good error correction performance and is used to lower the PAPR in a multiple-input multiple-output OFDM system. The simulation results show that 6-60- reduction in PAPR over current values in the literature can be achieved depending on the system type.     

大气光通信中Turbo码的最大后验概率译码

为了精确实现对空间物体的测量,提出了利用线激光、单CCD相机、小孔成像与激光面约束模型的激光线测量法。引进三维信息已知的标准阶梯块作为激光面约束的标定块;由计算机控制摄像头对实物连续拍摄和实时处理,提取激光线上的像素坐标;利用建立的模型将二维坐标转换成三维坐标,再以点云的形式重构出物体,实现三维自动测量。实践中检测系统测量精度可达到0.05mm。     

A line-based parallel memory for QCA implementation

Quantum-dot cellular automata (QCA) has been widely advocated as a new device architecture for nanotechnology. Using QCA, the innovative design of digital systems can be achieved by exploiting the so-called capability of processing-in-wire, i.e., signal manipulation proceeds at the same time as propagation. QCA systems require low power together with the potential for high density and regularity. These features make QCA an attractive technology for manufacturing memories in which the in-wire paradigm can be exploited for storage purposes. This paper proposes a novel parallel memory architecture for QCA implementation. This architecture is based on storing information on a QCA line by changing the direction of signal flow among three clocking zones. Timing of these zones requires two additional clocks to implement a four-step process for reading/writing data to the memory. Its operation has been verified by simulation. It is shown that the requirements for clocking, number of zones, as well as the underlying CMOS circuitry are significantly reduced compared with previous QCA parallel architectures.     

基于矩阵相似变换的并行流水线CRC实现

研究了通用并行化循环冗余校验(CRC)编码结构,分析了限制编码速度提高的主要原因,根据多项式理论推导了并行CRC编码的一般化方法.在此基础上,根据线性代数中的有理标准型理论对编码结构中的反馈运算矩阵进行相似变换,提出了CRC编码的高速流水线并行结构,并设计实现了多种不同并行度下的CRC编码器.设计结果表明,高速流水线并行CRC编码器结构相对于其他结构具有最优的编码速度和最优的时序特性,可以满足高速数据完整性校验的需求.     

Optimal code rates for the Lorentzian channel: Shannon codes and LDPC codes

We take an information-theoretic approach to obtaining optimal code rates for error-control codes on a magnetic storage channel approximated by the Lorentzian channel. Code rate optimality is in the sense of maximizing the information-theoretic user density along a track. To arrive at such results, we compute the achievable information rates for the Lorentzian channel as a function of signal-to-noise ratio and channel density, and then use these information rate calculations to obtain optimal code rates and maximal linear user densities. We call such (hypothetical) optimal codes "Shannon codes." We then examine optimal code rates on a Lorentzian channel assuming low-density parity-check (LDPC) codes instead of Shannon codes. We employ as our tool extrinsic information transfer (EXIT) charts, which provide a simple way of determining the capacity limit (or decoding threshold) for an LDPC code. We demonstrate that the optimal rates for LDPC codes coincide with those of Shannon codes and, more important, that LDPC codes are essentially capacity-achieving codes on the Lorentzian channel. Finally, we use the above results to estimate the optimal bit-aspect ratio, where optimality is in the sense of maximizing areal density.     

A new LDPC decoding algorithm aided by segmented cyclic redundancy checks for magnetic recording channels

We introduce a new low-density parity-check (LDPC) decoding algorithm that exploits the cyclic redundancy check (CRC) information of data segments. By using the error detection property of the CRC, we can successively decode data segments of a codeword corrupted by random errors and erasures. The key idea is that the messages from the variable nodes with correct checksum are fixed to deterministic log likelihood ratio values during LDPC iterative decoding. This approach improves the decoding speed and codeword error rate without significant modification of the LDPC decoding structure. Moreover, the CRC is also used for an early stopping criterion of LDPC decoding. Simulation results verify our claims.     

Random-iteration algorithm-based optical parallel architecture for fractal-image decoding by use of iterated-function system codes

An optical parallel architecture for the random-iteration algorithm to decode a fractal image by use of iterated-function system (IFS) codes is proposed. The code value is first converted into transmittance in film or a spatial light modulator in the optical part of the system. With an optical-to-electrical converter, electrical-to-optical converter, and some electronic circuits for addition and delay, we can perform the contractive affine transformation (CAT) denoted in IFS codes. In the proposed decoding architecture all CAT's generate points (image pixels) in parallel, and these points then are joined for display purposes. Therefore the decoding speed is improved greatly compared with existing serial-decoding architectures. In addition, an error and stability analysis that considers nonperfect elements is presented for the proposed optical system. Finally, simulation results are given to validate the proposed architecture.     

Unilateral contact problem for finite bodies - parallel implementation

A numerical solution of the three dimensional frictionless contact problem and its data parallel implementation on the Connection Machine system CM-2 is presented. The numerical solution is obtained by means of boundary element discretization of a variational inequality and related extremum principle; the associated Green's function is approximated by means of standard direct boundary element procedure. A numerical method is applicable to any kind of geometry of the contacting bodies under arbitrary loading. The example presented illustrate a distinct ability of the method to capture the influence of the shape and the size of a body on the contact area and the pressure acting in it. It has been demonstrated that the symmetry properties of the Green's operator hold only asymptotically for the discretized problem.     

水声通信多通道最大似然联合均衡译码方法

水平阵是水声通信中常见的阵列接收形式,但垂直阵也有重要的应用场合。文章提出了一种适用于垂直阵的水声通信多通道最大似然联合均衡译码方法,相比现有仅在信道均衡中叠加各通道信号的多通道判决反馈均衡方法(Multichannel Decision Feedback Equalizer, M-DFE),该方法利用最大似然准则,在一体化联合均衡译码过程中融合空间多通道接收信息,将空间增益直接用于抵抗水声信道多途衰落和译码纠错,有效提升了水声通信的性能。仿真结果表明,在误码率同样达到10^-3的条件下,该方法所需信噪比相比M-DFE方法可下降2 dB。海上实验结果显示,在多种信道条件下,该方法实现正确译码的通信速率是M-DFE方法的1.25倍以上。     

Optoelectronic parallel watershed implementation for segmentation of magnetic resonance brain images

An optoelectronic implementation for the morphological watershed transform is proposed. Fiber-optic programmable logic arrays are used in the implementation because of their high fan factors at high clock speeds. Image segmentation is one of the main applications of the watershed transform. Based on the optoelectronic implementation, an algorithm for the segmentation of axial magnetic resonance (MR) head images to extract information on brain matter is presented. Simulation results for the different steps of the segmentation process are presented.     

Multistage decoding for an internally coded fibre-optic time-hopping/optical code division multiple access communication system

A multistage decoder for the internally convolutionally coded fibre-optic time-hopping code division multiple access system recently introduced is considered. In this system, the decoder consists of several stages. The first stage is implemented using one of the single-user decoders introduced. The following stages are maximum likelihood (ML) decoders each of which use the decisions made by the previous stage. The performance of the proposed decoder is evaluated by a Monte Carlo simulation. Numerical results show that a multistage decoder with only two stages greatly outperforms the single-stage decoder with negligible increase in complexity. The authors also derive the Chernoff bound for the ML decoder with known interference, which is the ultimate performance of the multistage decoder.     

Optimization of multichannel parallel joint transform correlator for accelerated pattern recognition

The multibeam parallel joint transform correlator for optical pattern recognition, which was recently proposed by the authors [Appl. Opt. 37, 5408 (1998)], can increase parallelism without accumulating zero-order background level at the first Fourier transform plane. To evaluate the throughput capability, an experimental trial was made, achieving a 67-ms recognition rate per face per channel, which is limited by the response of the optically addressed liquid-crystal spatial light modulator. A general design theory is developed for dense packing of the optical channels for a given spatial light modulator resolution, considering the bandwidth requirement of the target image. Then the condition for submillisecond throughput with state-of-the-art device technology is discussed.     

Extended scattering-matrix method for efficient full parallel implementation of rigorous coupled-wave analysis

An extended and refined scattering-matrix method is proposed for the efficient full parallel implementation of rigorous coupled-wave analysis of multilayer structures. The total electromagnetic field distribution in the rigorous coupled-wave analysis is represented by the linear combination of the eigenmodes with their own coupling coefficients. In the proposed scheme, a refined recursion relation of the coupling coefficients of the eigenmodes is defined for complete parallel computation of the electromagnetic field distributions within multilayer structures.     

A synergistic analysis of joint JIT-TQM implementation

Both JIT and TQM have provided significant paradigm shifts in management philosophy to improve organizational effectiveness in today's competitive and ever-changing world market. Yet empirical studies correlating JIT, TQM and operational performance are still underdeveloped. Using a sample of 379 US computer and electronics companies, this study attempts to analyse the workforce practices and synergistic benefits of joint JIT-TQM implementation by comparing four groups of companies based on their implementation status of JIT and TQM.     

初相未知信号联合检测与估计的序贯实现

在未知参数的充分统计量和再生概率密度函数的基础上，引入了联合检测与估计的序贯算法，给出了算法的实现框图，并将该算法应用于高斯噪声中初相位未知信号的联合检测与估计当中，仿真实验表明，新算法较传统算法有一定的性能改善。