Error-Correction Coding and Decoding: Bounds, Codes, Decoders, Analysis and Applications

Coding; Communications; Engineering; Networks; Information Theory; Algorithm

A STUDY OF LINEAR ERROR CORRECTING CODES

Since Shannon's ground-breaking work in 1948, there have been two main development streams of channel coding in approaching the limit of communication channels, namely classical coding theory which aims at designing codes with large minimum Hamming distance and probabilistic coding which places the emphasis on low complexity probabilistic decoding using long codes built from simple constituent codes. This work presents some further investigations in these two channel coding development streams. Low-density parity-check (LDPC) codes form a class of capacity-approaching codes with sparse parity-check matrix and low-complexity decoder Two novel methods of constructing algebraic binary LDPC codes are presented. These methods are based on the theory of cyclotomic cosets, idempotents and Mattson-Solomon polynomials, and are complementary to each other. The two methods generate in addition to some new cyclic iteratively decodable codes, the well-known Euclidean and projective geometry codes. Their extension to non binary fields is shown to be straightforward. These algebraic cyclic LDPC codes, for short block lengths, converge considerably well under iterative decoding. It is also shown that for some of these codes, maximum likelihood performance may be achieved by a modified belief propagation decoder which uses a different subset of 7^ codewords of the dual code for each iteration. Following a property of the revolving-door combination generator, multi-threaded minimum Hamming distance computation algorithms are developed. Using these algorithms, the previously unknown, minimum Hamming distance of the quadratic residue code for prime 199 has been evaluated. In addition, the highest minimum Hamming distance attainable by all binary cyclic codes of odd lengths from 129 to 189 has been determined, and as many as 901 new binary linear codes which have higher minimum Hamming distance than the previously considered best known linear code have been found. It is shown that by exploiting the structure of circulant matrices, the number of codewords required, to compute the minimum Hamming distance and the number of codewords of a given Hamming weight of binary double-circulant codes based on primes, may be reduced. A means of independently verifying the exhaustively computed number of codewords of a given Hamming weight of these double-circulant codes is developed and in coiyunction with this, it is proved that some published results are incorrect and the correct weight spectra are presented. Moreover, it is shown that it is possible to estimate the minimum Hamming distance of this family of prime-based double-circulant codes. It is shown that linear codes may be efficiently decoded using the incremental correlation Dorsch algorithm. By extending this algorithm, a list decoder is derived and a novel, CRC-less error detection mechanism that offers much better throughput and performance than the conventional ORG scheme is described. Using the same method it is shown that the performance of conventional CRC scheme may be considerably enhanced. Error detection is an integral part of an incremental redundancy communications system and it is shown that sequences of good error correction codes, suitable for use in incremental redundancy communications systems may be obtained using the Constructions X and XX. Examples are given and their performances presented in comparison to conventional CRC schemes

Quantum Error Correction via Codes over GF(4)

The problem of finding quantum error-correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are presented, as well as a table of upper and lower bounds on such codes of length up to 30 qubits.Comment: Latex, 46 pages. To appear in IEEE Transactions on Information Theory. Replaced Sept. 24, 1996, to correct a number of minor errors. Replaced Sept. 10, 1997. The second section has been completely rewritten, and should hopefully be much clearer. We have also added a new section discussing the developments of the past year. Finally, we again corrected a number of minor error

Versatile Error-Control Coding Systems

$NC research reported in this thesis is in the field of error-correcting codes, which has evolved as a very important branch of information theory. The main use of error-correcting codes is to increase the reliability of digital data transmitted through a noisy environment. There are, sometimes, alternative ways of increasing the reliability of data transmission, but coding methods are now competitive in cost and complexity in many cases because of recent advances in technology. The first two chapters of this thesis introduce the subject of error-correcting codes, review some of the published literature in this field and discuss the advan­tages of various coding techniques. After presenting linear block codes attention is from then on concentrated on cyclic codes, which is the subject of Chapter 3. The first part of Chapter 3 presents the mathemati­cal background necessary for the study of cyclic codes and examines existing methods of encoding and their practical implementation. In the second part of Chapter 3 various ways of decoding cyclic codes are studied and from these considerations, a general decoder for cyclic codes is devised and is presented in Chapter 4. Also, a review of the principal classes of cyclic codes is presented. Chapter 4 describes an experimental system constructed for measuring the performance of cyclic codes initially RC5GI5SCD by random errors and then by bursts of errors. Simulated channels are used both for random and burst errors. A computer simulation of the whole system was made in order to verify the accuracy of the experimental results obtained. Chapter 5 presents the various results obtained with the experimental system and by computer simulation, which allow a comparison of the efficiency of various cyclic codes to be made. Finally, Chapter 6 summarises and dis­cusses the main results of the research and suggests interesting points for future investigation in the area. The main objective of this research is to contribute towards the solution of a fairly wide range of problems arising in the design of efficient coding schemes for practical applications; i.e. a study of coding from an engineering point of view

The third post-Newtonian gravitational wave polarisations and associated spherical harmonic modes for inspiralling compact binaries in quasi-circular orbits

The gravitational waveform (GWF) generated by inspiralling compact binaries moving in quasi-circular orbits is computed at the third post-Newtonian (3PN) approximation to general relativity. Our motivation is two-fold: (i) To provide accurate templates for the data analysis of gravitational wave inspiral signals in laser interferometric detectors; (ii) To provide the associated spin-weighted spherical harmonic decomposition to facilitate comparison and match of the high post-Newtonian prediction for the inspiral waveform to the numerically-generated waveforms for the merger and ringdown. This extension of the GWF by half a PN order (with respect to previous work at 2.5PN order) is based on the algorithm of the multipolar post-Minkowskian formalism, and mandates the computation of the relations between the radiative, canonical and source multipole moments for general sources at 3PN order. We also obtain the 3PN extension of the source multipole moments in the case of compact binaries, and compute the contributions of hereditary terms (tails, tails-of-tails and memory integrals) up to 3PN order. The end results are given for both the complete plus and cross polarizations and the separate spin-weighted spherical harmonic modes.Comment: includes corrections to be published in an erratum; the changes are: in Eq (5.15b), -484/105 -> -188/35; in Eq (8.9g), 81127/10080 -> 1369/160; Eq (8.10g), -48239/5040 -> -2419/240; Eq (9.4b), -995/84 -> -353/2

Design and debugging of multi-step analog to digital converters

With the fast advancement of CMOS fabrication technology, more and more signal-processing functions are implemented in the digital domain for a lower cost, lower power consumption, higher yield, and higher re-configurability. The trend of increasing integration level for integrated circuits has forced the A/D converter interface to reside on the same silicon in complex mixed-signal ICs containing mostly digital blocks for DSP and control. However, specifications of the converters in various applications emphasize high dynamic range and low spurious spectral performance. It is nontrivial to achieve this level of linearity in a monolithic environment where post-fabrication component trimming or calibration is cumbersome to implement for certain applications or/and for cost and manufacturability reasons. Additionally, as CMOS integrated circuits are accomplishing unprecedented integration levels, potential problems associated with device scaling – the short-channel effects – are also looming large as technology strides into the deep-submicron regime. The A/D conversion process involves sampling the applied analog input signal and quantizing it to its digital representation by comparing it to reference voltages before further signal processing in subsequent digital systems. Depending on how these functions are combined, different A/D converter architectures can be implemented with different requirements on each function. Practical realizations show the trend that to a first order, converter power is directly proportional to sampling rate. However, power dissipation required becomes nonlinear as the speed capabilities of a process technology are pushed to the limit. Pipeline and two-step/multi-step converters tend to be the most efficient at achieving a given resolution and sampling rate specification. This thesis is in a sense unique work as it covers the whole spectrum of design, test, debugging and calibration of multi-step A/D converters; it incorporates development of circuit techniques and algorithms to enhance the resolution and attainable sample rate of an A/D converter and to enhance testing and debugging potential to detect errors dynamically, to isolate and confine faults, and to recover and compensate for the errors continuously. The power proficiency for high resolution of multi-step converter by combining parallelism and calibration and exploiting low-voltage circuit techniques is demonstrated with a 1.8 V, 12-bit, 80 MS/s, 100 mW analog to-digital converter fabricated in five-metal layers 0.18-µm CMOS process. Lower power supply voltages significantly reduce noise margins and increase variations in process, device and design parameters. Consequently, it is steadily more difficult to control the fabrication process precisely enough to maintain uniformity. Microscopic particles present in the manufacturing environment and slight variations in the parameters of manufacturing steps can all lead to the geometrical and electrical properties of an IC to deviate from those generated at the end of the design process. Those defects can cause various types of malfunctioning, depending on the IC topology and the nature of the defect. To relive the burden placed on IC design and manufacturing originated with ever-increasing costs associated with testing and debugging of complex mixed-signal electronic systems, several circuit techniques and algorithms are developed and incorporated in proposed ATPG, DfT and BIST methodologies. Process variation cannot be solved by improving manufacturing tolerances; variability must be reduced by new device technology or managed by design in order for scaling to continue. Similarly, within-die performance variation also imposes new challenges for test methods. With the use of dedicated sensors, which exploit knowledge of the circuit structure and the specific defect mechanisms, the method described in this thesis facilitates early and fast identification of excessive process parameter variation effects. The expectation-maximization algorithm makes the estimation problem more tractable and also yields good estimates of the parameters for small sample sizes. To allow the test guidance with the information obtained through monitoring process variations implemented adjusted support vector machine classifier simultaneously minimize the empirical classification error and maximize the geometric margin. On a positive note, the use of digital enhancing calibration techniques reduces the need for expensive technologies with special fabrication steps. Indeed, the extra cost of digital processing is normally affordable as the use of submicron mixed signal technologies allows for efficient usage of silicon area even for relatively complex algorithms. Employed adaptive filtering algorithm for error estimation offers the small number of operations per iteration and does not require correlation function calculation nor matrix inversions. The presented foreground calibration algorithm does not need any dedicated test signal and does not require a part of the conversion time. It works continuously and with every signal applied to the A/D converter. The feasibility of the method for on-line and off-line debugging and calibration has been verified by experimental measurements from the silicon prototype fabricated in standard single poly, six metal 0.09-µm CMOS process

Scattering on compact body spacetimes

In this thesis we study the propagation of scalar and gravitational waves on compact body spacetimes. In particular, we consider spacetimes that model neutron stars, black holes, and other speculative exotic compact objects such as black holes with near horizon modifications. We focus on the behaviour of time-independent perturbations, and the scattering of plane waves. First, we consider scattering by a generic compact body. We recap the scattering theory for scalar and gravitational waves, using a metric perturbation formalism for the latter. We derive the scattering and absorption cross sections using the partial-wave approach, and discuss some approximations. The theory of this chapter is applied to specific examples in the remainder of the thesis. The next chapter is an investigation of scalar plane wave scattering by a constant density star. We compute the scattering cross section numerically, and discuss a semiclassical, high-frequency analysis, as well as a geometric optics approach. The semiclassical results are compared to the numerics, and used to gain some physical insight into the scattering cross section interference pattern. We then generalise to stellar models with a polytropic equation of state, and gravitational plane wave scattering. This entails solving the metric perturbation problem for the interior of a star, which we accomplish numerically. We also consider the near field scattering profile for a scalar wave, and the correspondence to ray scattering and the formation of a downstream cusp caustic. The following chapter concerns the scalar wave absorption spectrum of exotic compact objects, modelled as black holes with a partially reflective surface just above the event horizon. We discuss the systems natural modes of vibration, and derive low and high-frequency approximations for the absorption spectra. Finally, we apply complex angular momentum (CAM) techniques to the perturbed constant density stellar model. We compute Regge poles (CAM resonance modes) by numerically solving a four-term recurrence relation. The utility of the CAM method is demonstrated by reproducing the scattering cross sections calculated earlier using partial waves

Ultra Wideband Communications: from Analog to Digital

Ultrabreitband-Signale (Ultra Wideband [UWB]) können einen signifikanten Nutzen im Bereich drahtloser Kommunikationssysteme haben. Es sind jedoch noch einige Probleme offen, die durch Systemdesigner und Wissenschaftler gelöst werden müssen. Ein Funknetzsystem mit einer derart großen Bandbreite ist normalerweise auch durch eine große Anzahl an Mehrwegekomponenten mit jeweils verschiedenen Pfadamplituden gekennzeichnet. Daher ist es schwierig, die zeitlich verteilte Energie effektiv zu erfassen. Außerdem ist in vielen Fällen der naheliegende Ansatz, ein kohärenter Empfänger im Sinne eines signalangepassten Filters oder eines Korrelators, nicht unbedingt die beste Wahl. In der vorliegenden Arbeit wird dabei auf die bestehende Problematik und weitere Lösungsmöglichkeiten eingegangen. Im ersten Abschnitt geht es um „Impulse Radio UWB”-Systeme mit niedriger Datenrate. Bei diesen Systemen kommt ein inkohärenter Empfänger zum Einsatz. Inkohärente Signaldetektion stellt insofern einen vielversprechenden Ansatz dar, als das damit aufwandsgünstige und robuste Implementierungen möglich sind. Dies trifft vor allem in Anwendungsfällen wie den von drahtlosen Sensornetzen zu, wo preiswerte Geräte mit langer Batterielaufzeit nötigsind. Dies verringert den für die Kanalschätzung und die Synchronisation nötigen Aufwand, was jedoch auf Kosten der Leistungseffizienz geht und eine erhöhte Störempfindlichkeit gegenüber Interferenz (z.B. Interferenz durch mehrere Nutzer oder schmalbandige Interferenz) zur Folge hat. Um die Bitfehlerrate der oben genannten Verfahren zu bestimmen, wurde zunächst ein inkohärenter Combining-Verlust spezifiziert, welcher auftritt im Gegensatz zu kohärenter Detektion mit Maximum Ratio Multipath Combining. Dieser Verlust hängt von dem Produkt aus der Länge des Integrationsfensters und der Signalbandbreite ab. Um den Verlust durch inkohärentes Combining zu reduzieren und somit die Leistungseffizienz des Empfängers zu steigern, werden verbesserte Combining-Methoden für Mehrwegeempfang vorgeschlagen. Ein analoger Empfänger, bei dem der Hauptteil des Mehrwege-Combinings durch einen „Integrate and Dump”-Filter implementiert ist, wird für UWB-Systeme mit Zeit-Hopping gezeigt. Dabei wurde die Einsatzmöglichkeit von dünn besetzten Codes in solchen System diskutiert und bewertet. Des Weiteren wird eine Regel für die Code-Auswahl vorgestellt, welche die Stabilität des Systems gegen Mehrnutzer-Störungen sicherstellt und gleichzeitig den Verlust durch inkohärentes Combining verringert. Danach liegt der Fokus auf digitalen Lösungen bei inkohärenter Demodulation. Im Vergleich zum Analogempfänger besitzt ein Digitalempfänger einen Analog-Digital-Wandler im Zeitbereich gefolgt von einem digitalen Optimalfilter. Der digitale Optimalfilter dekodiert den Mehrfachzugriffscode kohärent und beschränkt das inkohärente Combining auf die empfangenen Mehrwegekomponenten im Digitalbereich. Es kommt ein schneller Analog-Digital-Wandler mit geringer Auflösung zum Einsatz, um einen vertretbaren Energieverbrauch zu gewährleisten. Diese Digitaltechnik macht den Einsatz langer Analogverzögerungen bei differentieller Demodulation unnötig und ermöglicht viele Arten der digitalen Signalverarbeitung. Im Vergleich zur Analogtechnik reduziert sie nicht nur den inkohärenten Combining-Verlust, sonder zeigt auch eine stärkere Resistenz gegenüber Störungen. Dabei werden die Auswirkungen der Auflösung und der Abtastrate der Analog-Digital-Umsetzung analysiert. Die Resultate zeigen, dass die verminderte Effizienz solcher Analog-Digital-Wandler gering ausfällt. Weiterhin zeigt sich, dass im Falle starker Mehrnutzerinterferenz sogar eine Verbesserung der Ergebnisse zu beobachten ist. Die vorgeschlagenen Design-Regeln spezifizieren die Anwendung der Analog-Digital-Wandler und die Auswahl der Systemparameter in Abhängigkeit der verwendeten Mehrfachzugriffscodes und der Modulationsart. Wir zeigen, wie unter Anwendung erweiterter Modulationsverfahren die Leistungseffizienz verbessert werden kann und schlagen ein Verfahren zur Unterdrückung schmalbandiger Störer vor, welches auf Soft Limiting aufbaut. Durch die Untersuchungen und Ergebnissen zeigt sich, dass inkohärente Empfänger in UWB-Kommunikationssystemen mit niedriger Datenrate ein großes Potential aufweisen. Außerdem wird die Auswahl der benutzbaren Bandbreite untersucht, um einen Kompromiss zwischen inkohärentem Combining-Verlust und Stabilität gegenüber langsamen Schwund zu erreichen. Dadurch wurde ein neues Konzept für UWB-Systeme erarbeitet: wahlweise kohärente oder inkohärente Empfänger, welche als UWB-Systeme Frequenz-Hopping nutzen. Der wesentliche Vorteil hiervon liegt darin, dass die Bandbreite im Basisband sich deutlich verringert. Mithin ermöglicht dies einfach zu realisierende digitale Signalverarbeitungstechnik mit kostengünstigen Analog-Digital-Wandlern. Dies stellt eine neue Epoche in der Forschung im Bereich drahtloser Sensorfunknetze dar. Der Schwerpunkt des zweiten Abschnitts stellt adaptiven Signalverarbeitung für hohe Datenraten mit „Direct Sequence”-UWB-Systemen in den Vordergrund. In solchen Systemen entstehen, wegen der großen Anzahl der empfangenen Mehrwegekomponenten, starke Inter- bzw. Intrasymbolinterferenzen. Außerdem kann die Funktionalität des Systems durch Mehrnutzerinterferenz und Schmalbandstörungen deutlich beeinflusst werden. Um sie zu eliminieren, wird die „Widely Linear”-Rangreduzierung benutzt. Dabei verbessert die Rangreduzierungsmethode das Konvergenzverhalten, besonders wenn der gegebene Vektor eine sehr große Anzahl an Abtastwerten beinhaltet (in Folge hoher einer Abtastrate). Zusätzlich kann das System durch die Anwendung der R-linearen Verarbeitung die Statistik zweiter Ordnung des nicht-zirkularen Signals vollständig ausnutzen, was sich in verbesserten Schätzergebnissen widerspiegelt. Allgemeine kann die Methode der „Widely Linear”-Rangreduzierung auch in andern Bereichen angewendet werden, z.B. in „Direct Sequence”-Codemultiplexverfahren (DS-CDMA), im MIMO-Bereich, im Global System for Mobile Communications (GSM) und beim Beamforming.The aim of this thesis is to investigate key issues encountered in the design of transmission schemes and receiving techniques for Ultra Wideband (UWB) communication systems. Based on different data rate applications, this work is divided into two parts, where energy efficient and robust physical layer solutions are proposed, respectively. Due to a huge bandwidth of UWB signals, a considerable amount of multipath arrivals with various path gains is resolvable at the receiver. For low data rate impulse radio UWB systems, suboptimal non-coherent detection is a simple way to effectively capture the multipath energy. Feasible techniques that increase the power efficiency and the interference robustness of non-coherent detection need to be investigated. For high data rate direct sequence UWB systems, a large number of multipath arrivals results in severe inter-/intra-symbol interference. Additionally, the system performance may also be deteriorated by multi-user interference and narrowband interference. It is necessary to develop advanced signal processing techniques at the receiver to suppress these interferences. Part I of this thesis deals with the co-design of signaling schemes and receiver architectures in low data rate impulse radio UWB systems based on non-coherent detection.● We analyze the bit error rate performance of non-coherent detection and characterize a non-coherent combining loss, i.e., a performance penalty with respect to coherent detection with maximum ratio multipath combining. The thorough analysis of this loss is very helpful for the design of transmission schemes and receive techniques innon-coherent UWB communication systems.● We propose to use optical orthogonal codes in a time hopping impulse radio UWB system based on an analog non-coherent receiver. The “analog” means that the major part of the multipath combining is implemented by an integrate and dump filter. The introduced semi-analytical method can help us to easily select the time hopping codes to ensure the robustness against the multi-user interference and meanwhile to alleviate the non-coherent combining loss.● The main contribution of Part I is the proposal of applying fully digital solutions in non-coherent detection. The proposed digital non-coherent receiver is based on a time domain analog-to-digital converter, which has a high speed but a very low resolution to maintain a reasonable power consumption. Compared to its analog counterpart, itnot only significantly reduces the non-coherent combining loss but also offers a higher interference robustness. In particular, the one-bit receiver can effectively suppress strong multi-user interference and is thus advantageous in separating simultaneously operating piconets.The fully digital solutions overcome the difficulty of implementing long analog delay lines and make differential UWB detection possible. They also facilitate the development of various digital signal processing techniques such as multi-user detection and non-coherent multipath combining methods as well as the use of advanced modulationschemes (e.g., M-ary Walsh modulation).● Furthermore, we present a novel impulse radio UWB system based on frequency hopping, where both coherent and non-coherent receivers can be adopted. The key advantage is that the baseband bandwidth can be considerably reduced (e.g., lower than 500 MHz), which enables low-complexity implementation of the fully digital solutions. It opens up various research activities in the application field of wireless sensor networks. Part II of this thesis proposes adaptive widely linear reduced-rank techniques to suppress interferences for high data rate direct sequence UWB systems, where second-order non-circular signals are used. The reduced-rank techniques are designed to improve the convergence performance and the interference robustness especially when the received vector contains a large number of samples (due to a high sampling rate in UWB systems). The widely linear processing takes full advantage of the second-order statistics of the non-circular signals and enhances the estimation performance. The generic widely linear reduced-rank concept also has a great potential in the applications of other systems such as Direct Sequence Code Division Multiple Access (DS-CDMA), Multiple Input Multiple Output (MIMO) system, and Global System for Mobile Communications (GSM), or in other areas such as beamforming

Power Integral Points on Elliptic Curves

This thesis looks at some of the modern approaches towards the solution of Diophantine equations, and utilizes them to display the nonexistence of perfect powers occurring in certain types of sequences. In particular we look at the denominator divisibility sequences (Bn) formed by Mordell elliptic curves ED : y2 = x3+D. For the curve-point pair (E−2, P), where E−2 : y2 = x3 −2, and P = (3, 5) is a nontorsion point, we prove that no term Bn is a perfect 5th power, and we give the explicit bound p � 137 for any term in the associated elliptic denominator sequence to be a perfect power Bn = Zpn for 1 < n < 113762879. We then look at obtaining upper bounds on p for the seventy-two rank 1 Mordell curves in the range |D| < 200 to possess a pth perfect power. This is done by consideration of the finite number of rational and irrational newforms corresponding to an also finite number of levels of these newforms: in thirty cases we give a bound via examination of both the rational and irrational cases, and for the remaining forty-two cases our bound is merely for the rational case due to computational limitations

Optimal control of an internal combustion engine and transmission system

The control of an internal-combustion engine such that it will produce its required output, with a minimum consumption of fuel, even in the presence of random load disturbances, has become a necessary requirement for future prime-mover and vehicular applications. This thesis is concerned with an attempt to produce a practical scheme to meet that requirement from a study of several methods of achieving optimal engine regulation and a method of obtaining optimal start-up. An attempt was made first to identify the response of the engine-transmission-load combination with a mathematical model obtained by the use of computers. The servo-mechanism associated with the throttle was identified also, and then a complete state-variable description of the system was obtained. Next an automatic gear-changing scheme was designed and implemented. With the availability of this practical system an optimal control function was generated then to implement optimal start-up. The optimal function was calculated by solving the associated multi-point boundary value problem by means of technique of quasi-linearisation. To subject the system to random loads an artificial road was simulated, and a scheme was devised to vary the dynamometer loading in response to this 'road' signal. The remainder of the thesis is concerned with a study of several different methods of obtaining optimal or sub-optimal schemes of regulation and with comparisons of experimental results and the results from associated theoretical computer studies. Many suggestions for further investigations are contained in the final chapter