Engineering topics
Publications and source records attributed to Costello, Daniel J., Jr..
Progress made in the following areas is discussed: concatenated codes using bandwidth efficient Trellis inner codes; bounds on the minimum free Euclidean distance of bandwidth efficient Trellis inner codes; performance analysis of bandwidth Trellis codes on channels with phase jitter; construction of bandwidth efficient Trellis codes; and parity retransmission hybrid ARQ using convolutional codes.
A problem in designing semiconductor memories is to provide some measure of error control without requiring excessive coding overhead or decoding time. In LSI and VLSI technology, memories are often organized on a multiple bit (or byte) per chip basis. For example, some 256 K bit DRAM's are organized in 32 K x 8 bit-bytes. Byte-oriented codes such as Reed-Solomon (RS) codes can provide efficient low overhead error control for such memories. However, the standard iterative algorithm for decoding RS codes is too slow for these applications. The paper presents a special decoding technique for double-byte-error-correcting, triple-byte-error-detecting RS codes which is capable of high-speed operation. This technique is designed to find the error locations and the error values directly from the syndrome without having to use the iterative algorithm to find the error locator polynomial.
The performance of a concatenated coding scheme for error control in ARQ systems is analyzed for both random-noise and burst-noise channels. In particular, the probability of undetected error and the system throughput are calculated. In this scheme, the inner code is used for both error correction and error detection, and the outer code is used for error detection only. Interleaving/deinterleaving is assumed within the outer code. A retransmission is requested if either the inner code or the outer code detects the presence of errors. Various coding examples are considered. The results show that concatenated coding can provide extremely high system reliability (i.e., low probability of undetected error) and high system throughput.
The performance of bandwidth efficient trellis inner codes using two-dimensional MPSK signal constellations in a NASA concatenated coding is summarized. Work was also continued on trellis coded modulation using multi-dimensional signal sets. Achievable lower bounds on free distance trellis codes were proved and the existence of good trellis coded modulation (TCM) schemes were established for a variety of signal constellations. The performance of TCM schemes on fading channels is being investigated. Preliminary results indicate that bandwidth efficient trellis coding is feasible on such channels, but that the important design parameter is no longer the minimum free Euclidean distance.
During the period June 1, 1986 through November 30, 1986, progress was made in the following areas: undetected error probability and throughput analysis of a concatenated coding scheme; capacity and cutoff rate analysis of concatenated codes; concatenated codes using bandwidth efficient trellis inner codes; bounds on the minimum free Euclidean distance of bandwidth efficient trellis codes; and construction of multidimensional bandwidth efficient trellis codes for use as inner codes in a concatenated coding system.