Improve the Usability of Polar Codes: Code Construction, Performance Enhancement and Configurable Hardware

Error-correcting codes (ECC) have been widely used for forward error correction (FEC) in modern communication systems to dramatically reduce the signal-to-noise ratio (SNR) needed to achieve a given bit error rate (BER). Newly invented polar codes have attracted much interest because of their capacity-achieving potential, efficient encoder and decoder implementation, and flexible architecture design space.This dissertation is aimed at improving the usability of polar codes by providing a practical code design method, new approaches to improve the performance of polar code, and a configurable hardware design that adapts to various specifications. State-of-the-art polar codes are used to achieve extremely low error rates. In this work, high-performance FPGA is used in prototyping polar decoders to catch rare-case errors for error-correcting performance verification and error analysis. To discover the polarization characteristics and error patterns of polar codes, an FPGA emulation platform for belief-propagation (BP) decoding is built by a semi-automated construction flow. The FPGA-based emulation achieves significant speedup in large-scale experiments involving trillions of data frames. The platform is a key enabler of this work. The frozen set selection of polar codes, known as bit selection, is critical to the error-correcting performance of polar codes. A simulation-based in-order bit selection method is developed to evaluate the error rate of each bit using Monte Carlo simulations. The frozen set is selected based on the bit reliability ranking. The resulting code construction exhibits up to 1 dB coding gain with respect to the conventional bit selection. To further improve the coding gain of BP decoder for low-error-rate applications, the decoding error mechanisms are studied and analyzed, and the errors are classified based on their distinct signatures. Error detection is enabled by low-cost CRC concatenation, and post-processing algorithms targeting at each type of the error is designed to mitigate the vast majority of the decoding errors. The post-processor incurs only a small implementation overhead, but it provides more than an order of magnitude improvement of the error-correcting performance. The regularity of the BP decoder structure offers many hardware architecture choices. Silicon area, power consumption, throughput and latency can be traded to reach the optimal design points for practical use cases. A comprehensive design space exploration reveals several practical architectures at different design points. The scalability of each architecture is also evaluated based on the implementation candidates. For dynamic communication channels, such as wireless channels in the upcoming 5G applications, multiple codes of different lengths and code rates are needed to t varying channel conditions. To minimize implementation cost, a universal decoder architecture is proposed to support multiple codes through hardware reuse. A 40nm length- and rate-configurable polar decoder ASIC is demonstrated to fit various communication environments and service requirements.PHDElectrical EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/140817/1/shuangsh_1.pd

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

ON TURBO CODES AND OTHER CONCATENATED SCHEMES IN COMMUNICATION SYSTEMS

The advent of turbo codes in 1993 represented a significant step towards realising the ultimate capacity limit of a communication channel, breaking the link that was binding very good performance with exponential decoder complexity. Turbo codes are parallel concatenated convolutional codes, decoded with a suboptimal iterative algorithm. The complexity of the iterative algorithm increases only linearly with block length, bringing previously unprecedented performance within practical limits.. This work is a further investigation of turbo codes and other concatenated schemes such as the multiple parallel concatenation and the serial concatenation. The analysis of these schemes has two important aspects, their performance under optimal decoding and the convergence of their iterative, suboptimal decoding algorithm. The connection between iterative decoding performance and the optimal decoding performance is analysed with the help of computer simulation by studying the iterative decoding error events. Methods for good performance interleaver design and code design are presented and analysed in the same way. The optimal decoding performance is further investigated by using a novel method to determine the weight spectra of turbo codes by using the turbo code tree representation, and the results are compared with the results of the iterative decoder. The method can also be used for the analysis of multiple parallel concatenated codes, but is impractical for the serial concatenated codes. Non-optimal, non-iterative decoding algorithms are presented and compared with the iterative algorithm. The convergence of the iterative algorithm is investigated by using the Cauchy criterion. Some insight into the performance of the concatenated schemes under iterative decoding is found by separating error events into convergent and non-convergent components. The sensitivity of convergence to the Eb/Ng operating point has been explored.SateUite Research Centre Department of Communication and Electronic Engineerin

Spread spectrum-based video watermarking algorithms for copyright protection

Merged with duplicate record 10026.1/2263 on 14.03.2017 by CS (TIS)Digital technologies know an unprecedented expansion in the last years. The consumer can now benefit from hardware and software which was considered state-of-the-art several years ago. The advantages offered by the digital technologies are major but the same digital technology opens the door for unlimited piracy. Copying an analogue VCR tape was certainly possible and relatively easy, in spite of various forms of protection, but due to the analogue environment, the subsequent copies had an inherent loss in quality. This was a natural way of limiting the multiple copying of a video material. With digital technology, this barrier disappears, being possible to make as many copies as desired, without any loss in quality whatsoever. Digital watermarking is one of the best available tools for fighting this threat. The aim of the present work was to develop a digital watermarking system compliant with the recommendations drawn by the EBU, for video broadcast monitoring. Since the watermark can be inserted in either spatial domain or transform domain, this aspect was investigated and led to the conclusion that wavelet transform is one of the best solutions available. Since watermarking is not an easy task, especially considering the robustness under various attacks several techniques were employed in order to increase the capacity/robustness of the system: spread-spectrum and modulation techniques to cast the watermark, powerful error correction to protect the mark, human visual models to insert a robust mark and to ensure its invisibility. The combination of these methods led to a major improvement, but yet the system wasn't robust to several important geometrical attacks. In order to achieve this last milestone, the system uses two distinct watermarks: a spatial domain reference watermark and the main watermark embedded in the wavelet domain. By using this reference watermark and techniques specific to image registration, the system is able to determine the parameters of the attack and revert it. Once the attack was reverted, the main watermark is recovered. The final result is a high capacity, blind DWr-based video watermarking system, robust to a wide range of attacks.BBC Research & Developmen

Advanced constellation and demapper schemes for next generation digital terrestrial television broadcasting systems

206 p.Esta tesis presenta un nuevo tipo de constelaciones llamadas no uniformes. Estos esquemas presentan una eficacia de hasta 1,8 dB superior a las utilizadas en los últimos sistemas de comunicaciones de televisión digital terrestre y son extrapolables a cualquier otro sistema de comunicaciones (satélite, móvil, cable¿). Además, este trabajo contribuye al diseño de constelaciones con una nueva metodología que reduce el tiempo de optimización de días/horas (metodologías actuales) a horas/minutos con la misma eficiencia. Todas las constelaciones diseñadas se testean bajo una plataforma creada en esta tesis que simula el estándar de radiodifusión terrestre más avanzado hasta la fecha (ATSC 3.0) bajo condiciones reales de funcionamiento.Por otro lado, para disminuir la latencia de decodificación de estas constelaciones esta tesis propone dos técnicas de detección/demapeo. Una es para constelaciones no uniformes de dos dimensiones la cual disminuye hasta en un 99,7% la complejidad del demapeo sin empeorar el funcionamiento del sistema. La segunda técnica de detección se centra en las constelaciones no uniformes de una dimensión y presenta hasta un 87,5% de reducción de la complejidad del receptor sin pérdidas en el rendimiento.Por último, este trabajo expone un completo estado del arte sobre tipos de constelaciones, modelos de sistema, y diseño/demapeo de constelaciones. Este estudio es el primero realizado en este campo

The SoftPHY Abstraction: from Packets to Symbols in Wireless Network Design

At ever-increasing rates, we are using wireless systems to communicatewith others and retrieve content of interest to us. Current wirelesstechnologies such as WiFi or Zigbee use forward error correction todrive bit error rates down when there are few interferingtransmissions. However, as more of us use wireless networks toretrieve increasingly rich content, interference increases inunpredictable ways. This results in errored bits, degradedthroughput, and eventually, an unusable network. We observe that thisis the result of higher layers working at the packet granularity,whereas they would benefit from a shift in perspective from wholepackets to individual symbols.From real-world experiments on a 31-node testbed of Zigbee andsoftware-defined radios, we find that often, not all of the bitsin corrupted packets share fate. Thus, today's wireless protocolsretransmit packets where only a small number of the constituent bitsin a packet are in error, wasting network resources. In thisdissertation, we will describe a physical layer that passesinformation about its confidence in each decoded symbol up to higherlayers. These SoftPHY hints have many applications, one ofwhich, more efficient link-layer retransmissions, we will describe indetail. PP-ARQ is a link-layer reliable retransmission protocolthat allows a receiver to compactly encode a request forretransmission of only the bits in a packet that are likely in error.Our experimental results show that PP-ARQ increases aggregate networkthroughput by a factor of approximately 2x under variousconditions. Finally, we will place our contributions in the contextof related work and discuss other uses of SoftPHY throughout thewireless networking stack

Resource allocation for cooperative broadcasting in W-CDMA networks

Imperial Users onl

Nanosatellite Store-and-Forward Communication Systems for Remote Data Collection Applications

Due to compact design, cost-effectiveness and shorter development time, a nanosatellite constellation is seen as a viable space-based data-relay asset to collect data from remote places that are rather impractical to be linked by terrestrial means. While nanosatellites have these advantages, they have more inherent technical limitations because of limited space for subsystems and payloads. Nanosatellite S&F communication systems are notably challenging in this respect due to requirements on antennas, transceivers, and signal processing. Although nanosatellites can be scaled up for better resources and capabilities, smaller platforms (i.e., ≤6U CubeSat) tend to be used for cost-effectiveness and lower risk. This thesis dealt with the problem of designing a nanosatellite S&F communication system for delay-tolerant remote data collection applications considering: (a) technical constraints in hardware, processing capabilities, energy budget and space in both the nanosatellite and ground sensor terminal (GST) sides; (b) physical communication layer characteristics and constraints such as limited available bandwidth, LEO channel Doppler, attenuation and fading/shadowing effects, low transmit power and data rate, and multi-user interference among asynchronously transmitting terminals. We designed, developed, and operated an amateur radio payload with S&F communication and APRS-DP capabilities, and performed a post-launch communication failure investigation. We also investigated suitability of E-SSA protocol for IoT/M2M terminals to nanosatellite communication by analyzing performance and energy efficiency metrics. The thesis comprises nine chapters. Chapter 1 describes the research background, problem, objectives, state of research, potential contributions of this thesis, and a gist of methodology detailed in later chapters. Chapter 2 and 3 provide an extensive literature review. Chapter 2 reviews the previous research works on using nanosatellites for S&F communication for remote data collection, and the previous nanosatellite S&F missions. Such research works and nanosatellite missions were undertaken primarily in the context of non-commercial/civil applications. Then, Chapter 2 surveys the recent commercial nanosatellite IoT/M2M players and examines their proposed systems in terms of satellite platform, constellation design, communication technology, targeted applications, requirements, and performance. Chapter 3 presents a literature review on communication system architecture, physical layer and random-access schemes, protocols, and technologies relevant to satellite IoT/M2M systems. In the context of IoT/M2M applications, the constraints in energy budget, transmit power and available bandwidth limit the system’s capacity in terms of amount of data that can be received and number of GSTs that can be supported. In both nanosatellite and GST sides, there are stringent limitations in hardware complexity, processing capabilities and energy budget. Addressing these challenges requires a simple, spectrally and energy efficient asynchronous random-access communication protocol. This research investigated using the enhanced spread spectrum Aloha (E-SSA) protocol for satellite IoT/M2M uplink (terminal to satellite) communication and analyzed its performance and suitability for the said application. Chapter 4 discusses the BIRDS-2 CubeSat S&F remote data collection system, payload design, development, tests, and integration with the BIRDS-2 CubeSats. Chapter 5 discusses the investigation on communication design issues of BIRDS-2 CubeSat S&F payload, tackling both the methodology and findings of investigation. It is noted that there are only a few satellites that have carried an APRS-DP payload but even some of these failed due to communication, power, or software issues. In BIRDS-2 Project, considering tight constraints in a 1U CubeSat equipped with other subsystems and payloads, we developed a S&F/APRS-DP payload and integrated it with each of the three 1U CubeSats of participating countries. After launching the CubeSats from the ISS, several amateur operators confirmed reception downlink beacon messages, but full two-way communication failed due to uplink communication failure. Thus, this research not only studied the design and development of a S&F/APRS-DP payload suitable for a CubeSat platform, but also systematically investigated the causes of communication failure by on-orbit observation results and ground-based tests. We found that uplink failure was caused by two design problems that were overlooked during development, namely, the poor antenna performance and increased payload receiver noise floor due to satellite-radiated EMI coupled to the antenna. Chapter 6 first describes the enhanced spread spectrum Aloha (E-SSA) based nanosatellite IoT/M2M communication model implemented in Matlab and derives the mathematical definitions of packet loss rate (PLR), throughput (THR) and energy efficiency (EE) metrics. Then, it tackles the formulated baseband signal processing algorithm for E-SSA, including packet detection, channel estimation, demodulation and decoding. Chapter 7 presents the simulation results and discussion for Chapter 6. Chapter 8 tackles the S&F nanosatellite constellation design for global coverage and presents the results and findings. Chapter 9 describes the laboratory setups for validating the E-SSA protocol and then presents the findings. Finally, Chapter 9 also gives the summary, conclusions, and recommendations. Simulation results showed that for E-SSA protocol with the formulated algorithm, THR, PLR and EE metrics are more sensitive to MAC load G, received power variation σLN and Eb/N0, due to imperfect detection and channel estimation. With loose power control (σLN=3dB), at Eb/N0=14 dB, the system can be operated up to a maximum load of 1.3 bps/Hz, achieving a maximum THR of 1.25 bps/Hz with PLR<0.03. Without power control (σLN=6dB,9dB), at Eb/N0=14 dB, maximum load is also 1.3 bps/Hz, but achievable THR is lower than ~1 bps/Hz and PLR values can be as high as ~0.23. Worse PLR results are attributed to misdetection of lower power packets and demodulation/decoding errors. Both are caused by the combined effects of MUI, channel estimation errors, imperfect interference cancellation residue power, and noise. The PLR and THR can be improved by operating with higher Eb/N0 at the expense of lower energy efficiency. Then, laboratory validation experiments using a SDR-based platform confirmed that with G=0.1, Eb/N0=14dB, σLN=6dB, the formulated algorithm for E-SSA protocol can still work even with inaccurate oscillator (±2 ppm) at GSTs, obtaining experimental PLR result of 0.0650 compared to simulation result of 0.0352. However, this requires lowering the detection thresholds and takes significantly longer processing time. For the S&F nanosatellite constellation design, it was found that to achieve the target percent coverage time (PCT) of more than 95% across all latitudes, a 9x10 Hybrid constellation or a 10x10 Walker Delta constellation would be required.九州工業大学博士学位論文 学位記番号：工博甲第506号 学位授与年月日：令和2年9月25日1: Introduction|2: Nanosatellite S&F Research, Missions and Applications|3: Satellite S&F Communication Systems and Protocols|4: BIRDS-2 CubeSat S&F Data Collection System, Payload Design and Development|5: Investigation on Communication Design Issues of BIRDS-2 CubeSat APRS-DP/S&F Payload, Results and Discussion|6: E-SSA-based Nanosatellite IoT/M2M Communication System Model and Signal Processing Algorithm|7: Simulation Results and Discussion for E-SSA-based Nanosatellite IoT/M2M Communication System|8: Nanosatellite Constellation for Global Coverage|9: Experimental Laboratory Validation for E-SSA Protocol, Research Summary, Conclusions and Recommendations九州工業大学令和2年