Phased burst error-correcting array codes

Various aspects of single-phased burst-error-correcting array codes are explored. These codes are composed of two-dimensional arrays with row and column parities with a diagonally cyclic readout order; they are capable of correcting a single burst error along one diagonal. Optimal codeword sizes are found to have dimensions n1×n2 such that n2 is the smallest prime number larger than n1. These codes are capable of reaching the Singleton bound. A new type of error, approximate errors, is defined; in q-ary applications, these errors cause data to be slightly corrupted and therefore still close to the true data level. Phased burst array codes can be tailored to correct these codes with even higher rates than befor

Channels with block interference

A new class of channel models with memory is presented in order to study various kinds of interference phenomena. It is shown, among other things, that when all other parameters are held fixed, channel capacity C is an increasing function of the memory length, while the cutoff rate R0 generally is a decreasing function. Calculations with various explicit coding schemes indicate that C is better than R0 as a performance measure for these channel models. As a partial resolution of this C versus R0 paradox, the conjecture is offered that R0 is more properly a measure of coding delay rather than of coding complexity

A study of digital holographic filters generation. Phase 2: Digital data communication system, volume 1

An empirical study of the performance of the Viterbi decoders in bursty channels was carried out and an improved algebraic decoder for nonsystematic codes was developed. The hybrid algorithm was simulated for the (2,1), k = 7 code on a computer using 20 channels having various error statistics, ranging from pure random error to pure bursty channels. The hybrid system outperformed both the algebraic and the Viterbi decoders in every case, except the 1% random error channel where the Viterbi decoder had one bit less decoding error

Forward Error Correction in Memoryless Optical Modulation

The unprecedented growth in demand for digital media has led to an all-time high in society’s demand for information. This demand will in all likelihood continue to grow as technology such as 3D television service, on-demand video and peer-to-peer networking continue to become more common place. The large amount of information required is currently transmitted optically using a wavelength division multiplexing (WDM) network structure. The need to increase the capacity of the existing WDM network infrastructure efficiently is essential to continue to provide new high bandwidth services to end-users, while at the same time minimizing network providers’ costs. In WDM systems the key to reducing the cost per transported information bit is to effectively share all optical components. These components must operate within the same wavelength limited window; therefore it is necessary to place the WDM channels as close together as possible. At the same time, the correct modulation format must be selected in order to create flexible, cost-effective, high-capacity optical networks. This thesis presents a detailed comparison of Differential Quadrature Phase Shift Keying (DQPSK) to other modulation formats. This comparison is implemented through a series of simulations in which the bit error rate of various modulation formats are compared both with and without the presence of forward error correction techniques. Based off of these simulation results, the top performing modulation formats are placed into a multiplexed simulation to assess their overall robustness in the face of multiple filtering impairments