Simplified decoding techniques for linear block codes

Error correcting codes are combinatorial objects, designed to enable reliable transmission of digital data over noisy channels. They are ubiquitously used in communication, data storage etc. Error correction allows reconstruction of the original data from received word. The classical decoding algorithms are constrained to output just one codeword. However, in the late 50’s researchers proposed a relaxed error correction model for potentially large error rates known as list decoding. The research presented in this thesis focuses on reducing the computational effort and enhancing the efficiency of decoding algorithms for several codes from algorithmic as well as architectural standpoint. The codes in consideration are linear block codes closely related to Reed Solomon (RS) codes. A high speed low complexity algorithm and architecture are presented for encoding and decoding RS codes based on evaluation. The implementation results show that the hardware resources and the total execution time are significantly reduced as compared to the classical decoder. The evaluation based encoding and decoding schemes are modified and extended for shortened RS codes and software implementation shows substantial reduction in memory footprint at the expense of latency. Hermitian codes can be seen as concatenated RS codes and are much longer than RS codes over the same aphabet. A fast, novel and efficient VLSI architecture for Hermitian codes is proposed based on interpolation decoding. The proposed architecture is proven to have better than Kötter’s decoder for high rate codes. The thesis work also explores a method of constructing optimal codes by computing the subfield subcodes of Generalized Toric (GT) codes that is a natural extension of RS codes over several dimensions. The polynomial generators or evaluation polynomials for subfield-subcodes of GT codes are identified based on which dimension and bound for the minimum distance are computed. The algebraic structure for the polynomials evaluating to subfield is used to simplify the list decoding algorithm for BCH codes. Finally, an efficient and novel approach is proposed for exploiting powerful codes having complex decoding but simple encoding scheme (comparable to RS codes) for multihop wireless sensor network (WSN) applications.

Simplified PRBMs of spatial compliant multi-beam modules for planar motion

PRBMs (pseudo-rigid-body models) have been becoming important engineering technologies/methods in the field of compliant mechanisms to simplify the design and analysis through the use of the knowledge body of rigid-body mechanisms coupling with springs. This article addresses the PRBMs of spatial multi-beam modules for planar motion, which are composed of three or more symmetrical wire/slender beams parallel to each other where the planar twisting DOF (degree of freedom) is assumed to be very small for specific applications/loading conditions. Simplified PRBMs are firstly proposed through replacing each beam in spatial multi-beam module with a rigid-body link plus two identical spherical joints at its two ends. The characteristics factor, bending stiffness and twisting stiffness for the spherical joint are determined. Load-displacement equations are then derived for a class of spatial multi-beam modules and general spatial multi-beam modules using the virtual work principle and kinematic relationships. Finally, nonlinear FEA (finite element analysis) is employed with comparisons with the PRBMs. The present PRBMs have shown the ability to predict the primary nonlinear constraint characteristics such as load-stiffening effect, cross-axis coupling in the two primary translational directions and buckling load.