Burst Errors Research Articles

Construction Technique and Evaluation of High Performance t-bit Burst Error Correcting Codes for Protecting MCUs

The occurrences of Multiple Cell Upset (MCU) are more liable to arise in modern memory systems with the continuous upgradation of microelectronics technology from micron to deep submicron scales. These MCUs are mainly induced due to radiations in memory systems. Error Correcting Codes (ECCs) with lower design complexity are generally preferred for the mitigation of MCUs. The major drawback of the existing ECC is requiring higher overheads as error correction capability increases. In this paper, authors have proposed a new class of high performance [Formula: see text]-bit Burst Error Correcting (BEC) codes. Parity check matrices ([Formula: see text]) have been proposed for 3-bit and 4-bit BEC codes with word lengths of 16-bit, 32-bit and 64-bit. Also a simplified decoding scheme has been introduced for these codes. The proposed codecs have been designed and implemented in FPGA and ASIC platforms. The proposed codecs are compact in area, faster in speed and efficient in power compared to existing related schemes. But these lower design constrains are achieved at the cost of increase in redundancy. So, the proposed codecs can be employed in applications where redundancy is not the only constrain for correcting [Formula: see text]-bit burst errors caused by MCUs.

Caching in Narrow-Band Burst-Error Channels via Meta Self-Supervision Learning

We consider a coordinated small-cell network in narrow-band deep fading channels, where the transmissions from small base-stations (SBSs) to users usually encounter burst errors. Each SBS has limited cache-capacity via which partial contents can be cached to avoid being fetched from remote cloud and hence reduce the transmission delay. However, due to deep fading, the content transmission may occur numerous burst errors. To solve this problem, in this letter, a meta-based self-supervision learning method is introduced to find the optimal cache policy for minimizing the burst errors. In contrast to the traditional methods, the proposed one has better performance and learning efficiency. More particularly, the proposed can determine much proper cache policy by just training with a few samples of average fading duration of each channel. We demonstrate the effectiveness of the proposed method by numerical simulations which indicate that the proposed meta-learning method is superior to common existing methods in combat of the burst-error problem regarding convergence time and accuracy.

Packet Loss Characterization Using Cross Layer Information and HMM for Wi-Fi Networks.

Packet loss is a major problem for wireless networks and has significant effects on the perceived quality of many internet services. Packet loss models are used to understand the behavior of packet losses caused by several reasons, e.g., interferences, coexistence, fading, collisions, and insufficient/excessive memory buffers. Among these, the Gilbert-Elliot (GE) model, based on a two-state Markov chain, is the most used model in communication networks. However, research has proven that the GE model is inadequate to represent the real behavior of packet losses in Wi-Fi networks. In this last category, variables of a single network layer are used, usually the physical one. In this article, we propose a new packet loss model for Wi-Fi that simultaneously considers the temporal behavior of losses and the variables that describe the state of the network. In addition, the model uses two important variables, the signal-to-noise ratio and the network occupation, which none of the packet loss models available for Wi-Fi networks simultaneously take into account. The proposed model uses the well-known Hidden Markov Model (HMM), which facilitates training and forecasting. At each state of HMM, the burst-length of losses is characterized using probability distributions. The model was evaluated by comparing computer simulation and real data samples for validation, and using the log-log complementary distribution of burst-length. We compared the proposed model with competing models through the analysis of mean square error (MSE) using a validation sample collected from a real network. Results demonstrated that the proposed model outperforms the currently available models for packet loss in Wi-Fi networks.

Robust Analog Beamforming for Periodic Broadcast V2V Communication

We generalize an existing low-cost analog signal processing concept that takes advantage of the periodicity of vehicle-to-vehicle broadcast service to the transmitter side. In particular, we propose to process multiple antennas using either an analog beamforming network (ABN) of phase shifters, or an antenna switching network (ASN) that periodically alternates between the available antennas, to transmit periodic messages to receivers that have an analog combining network (ACN) of phase shifters, which has been proposed in earlier work. To guarantee robustness, we aim to minimize the burst error probability for the worst receiving vehicular user, in a scenario of bad propagation condition that is modeled by a single dominant path between the communicating vehicles. In absence of any form of channel knowledge, we analytically derive the optimal parameters of both ABN and ASN. The ABN beamforming vector is found to be optimal for all users and not only for the worst receiving user. Further, we demonstrate that Alamouti scheme for the special case of two transmit antennas yields similar performance to ABN and ASN. At last, we show that the derived parameters of the two proposed transmission strategies are also optimal when hybrid ACN-maximal ratio combining is used at the receiver.

Dual Coding Concatenation for Burst-Error Correction in Probabilistic Amplitude Shaping

We propose the use of dual coding concatenation for mitigation of post-shaping burst errors in probabilistic amplitude shaping (PAS) architectures. The proposed dual coding concatenation for PAS is a hybrid integration of conventional reverse concatenation and forward concatenation, i.e., post-shaping forward error correction (FEC) layer and pre-shaping FEC layer, respectively. A low-complexity architecture based on parallel Bose–Chaudhuri–Hocquenghem (BCH) codes is introduced for the pre-shaping FEC layer. Proposed dual coding concatenation can relax bit error rate (BER) requirement after post-shaping soft-decision (SD) FEC codes by an order of magnitude, resulting in a gain of up to 0.25 dB depending on the complexity of post-shaping FEC. Also, combined shaping and coding performance was analyzed based on sphere shaping and the impact of shaping length on coding performance was demonstrated.

Random Interleaving Pattern Identification From Interleaved Reed-Solomon Code Symbols

Random interleavers are widely employed in digital communication systems to combat channel fading and burst errors. In applications such as grant-free access by Internet of Things (IoT) devices, accurately identifying a specific irregular interleaving pattern within an interleaver period is vital to both terminal recognition and data recovery. In this work, we investigate effective approaches for random interleaving pattern identification in Reed-Solomon (RS) coded data streams. We first propose an algorithm of low computational complexity to detect positions of code symbols belonging to the same RS codeword group (RSCG) under modest bit error rate. We further develop another low-complexity algorithm to successfully identify random interleaving patterns for RS code symbols within each RS codeword under moderate to high error rate applications. Our theoretical analysis and simulation results corroborate to demonstrate the effectiveness of our algorithms.

A Long Short-Term Memory Network-Based Radio Resource Management for 5G Network

Nowadays, the Long-Term Evolution-Advanced system is widely used to provide 5G communication due to its improved network capacity and less delay during communication. The main issues in the 5G network are insufficient user resources and burst errors, because it creates losses in data transmission. In order to overcome this, an effective Radio Resource Management (RRM) is required to be developed in the 5G network. In this paper, the Long Short-Term Memory (LSTM) network is proposed to develop the radio resource management in the 5G network. The proposed LSTM-RRM is used for assigning an adequate power and bandwidth to the desired user equipment of the network. Moreover, the Grid Search Optimization (GSO) is used for identifying the optimal hyperparameter values for LSTM. In radio resource management, a request queue is used to avoid the unwanted resource allocation in the network. Moreover, the losses during transmission are minimized by using frequency interleaving and guard level insertion. The performance of the LSTM-RRM method has been analyzed in terms of throughput, outage percentage, dual connectivity, User Sum Rate (USR), Threshold Sum Rate (TSR), Outdoor Sum Rate (OSR), threshold guaranteed rate, indoor guaranteed rate, and outdoor guaranteed rate. The indoor guaranteed rate of LSTM-RRM for 1400 m of building distance improved up to 75.38% compared to the existing QOC-RRM.

Efficient Hardware Architectures and Implementations of Packet-Level Erasure Coding Schemes for High Data Rate Reliable Satellite Communications

Forward error correction coding schemes have been used extensively in order to provide continuous and reliable telemetry data transfer from satellites to ground stations and guarantee reliable communications even at low signal-to-noise ratio regimes, where burst errors are dominant. Nevertheless, conventional bit-level channel coding can fail to provide downlink reliability against long error bursts in future high data rate radio frequency and optical (laser) links, especially when automatic repeat queuing strategies are either problematic or impossible due to specific service delay constraints. Packet-level erasure coding has been considered by the Consultative Committee for Space Data Systems (CCSDS) in CCSDS 131.5-O-1 experimental specification for application in high data rate near-earth and deep-space communications, since it can protect against long error bursts as they may come along with the effect of scintillation outages or transmission errors. Implementations of packet-level encoding and decoding so far exist only in software, running on a general-purpose CPU. In this article, we introduce and compare analytical descriptions of packet-level encoding algorithms suitable for hardware implementations. Based on these algorithmic descriptions, we introduce, for the first time, architectures for hardware acceleration of these functions that allow integration on a high-speed on-board data-processing chain with very low footprint. We validate our hardware implementations and demonstrate the efficiency of the proposed architectures on a Xilinx KCU105 development board, which is built around the commercial equivalent of a space-grade field-programmable gate array device. Apart from offloading packet-level encoding from the on-board embedded processor, the proposed accelerators achieve a significant speedup (over 80 times), when compared with on-board software implementations, by porting on some of the most commonly used and state-of-the-art space-qualified embedded processors.

A hybrid soft bit flipping decoder algorithm for effective signal transmission and reception

The Euclidean geometry (EG) based low-density parity check (LDPC) codes are enciphered and deciphered in various modes. These algorithms have the back-and-forth between decoding delay, and power usage, device unpredictability resources, and error rate efficacy are all available with these methods. As a result, the goal of this paper is to develop a comprehensive method to describe both soft and burst error bits for optimal data transfer. As a result, for EG-LDPC codes, a hybrid soft bit flipping (HSBF) decoder is suggested, which decreases decoding complications while improving message data transfer. A simulation model is formed using Xilinx synthesis report to study decoding latency, hardware usage, and power usage. A HSBF decoder is used in this paper, which accepts a 64-bit coding sequence and assigns 64 Adjustable nodes to it. It checks all customizable cluster connections and quantifies adjustable node values and actions. As a consequence of the data collected, our simulation model demonstrates that the HSBF technique outperforms soft bit flipping (SBF) algorithms. As a result, the techniques are ideal for usage in intermediate applications and as well as in cyber security processing technologies, medical applications.

VQProtect: Lightweight Visual Quality Protection for Error-Prone Selectively Encrypted Video Streaming.

Mobile multimedia communication requires considerable resources such as bandwidth and efficiency to support Quality-of-Service (QoS) and user Quality-of-Experience (QoE). To increase the available bandwidth, 5G network designers have incorporated Cognitive Radio (CR), which can adjust communication parameters according to the needs of an application. The transmission errors occur in wireless networks, which, without remedial action, will result in degraded video quality. Secure transmission is also a challenge for such channels. Therefore, this paper’s innovative scheme “VQProtect” focuses on the visual quality protection of compressed videos by detecting and correcting channel errors while at the same time maintaining video end-to-end confidentiality so that the content remains unwatchable. For the purpose, a two-round secure process is implemented on selected syntax elements of the compressed H.264/AVC bitstreams. To uphold the visual quality of data affected by channel errors, a computationally efficient Forward Error Correction (FEC) method using Random Linear Block coding (with complexity of ) is implemented to correct the erroneous data bits, effectively eliminating the need for retransmission. Errors affecting an average of 7–10% of the video data bits were simulated with the Gilbert–Elliot model when experimental results demonstrated that 90% of the resulting channel errors were observed to be recoverable by correctly inferring the values of erroneous bits. The proposed solution’s effectiveness over selectively encrypted and error-prone video has been validated through a range of Video Quality Assessment (VQA) metrics.

Modeling Poisson Error Process on Wireless Channels

Burst error modeling has seen extensive research and progress over several decades evolving into ever more complex modeling techniques used today. This paper analyzed usefulness of the most prominent generative and descriptive (analytical) methods. Data containing error bits and packets from real wireless transmission has been used to obtain statistical information about error burst and gap behavior in the channel and various generative and descriptive modeling techniques were applied to model the error process with the goal of establishing advantages and disadvantages of each technique. Generative methods were represented by the commonly implemented Elliot’s model with parameters calculated using a generalized algebraic form and descriptive methods were represented by one of the most flexible exponentially shaped distributions with regard to parameterization and heavy-tailed function modeling - gamma distribution, and lastly a technique represented by Markov modulated Poisson process (MMPP-2) producing second-order hyper-exponentially distributed characteristics. Results of the experiments were highly in favor of Elliot’s and MMPP-2 model demonstrating possible application of MMPP-2 model in application to commonly observed exponentially-shaped error process on the wireless channel.

Noise Error Pattern Generation Based on Successive Addition-Subtraction for GRAND-MO

Guessing random additive noise decoding (GRAND) is a capacity-approaching universal algorithm. The GRAND Markov order (GRAND-MO) variant is effective to correct burst errors in a Markov chain modeled memory channel, and the core of GRAND-MO is to generate putative noise error patterns in MO effectively. For purpose of a uniform noise error pattern generation scheme of GRAND-MO, this letter proposes a successive addition-subtraction scheme to generate noise/zero error permutations for predefined MO parameters. Detailed procedures of the proposed scheme are presented, and its correctness is also proofed through theoretical derivation. By embedding the “1” and “0” bursts alternately, the proposed scheme can generate all noise error patterns in MO, which is helpful to improve the error correction capability of GRAND-MO decoders for flexible applications.

Burst Channel Error Reduction Based on Interleaving for Efficient High-Speed Wireless Communication

Recently, the demand for reliable and high-speed wireless communication has rapidly increased. Orthogonal frequency division multiplexing (OFDM) is a modulation scheme that is the newest competitor against other modulation schemes used for this purpose. OFDM is mostly used for wireless data transfer, although it may also be used for cable and fiber optic connections. However, in many applications, OFDM suffers from burst errors and high bit error rates. This paper presents the utilization of a helical interleaver with OFDM systems to efficiently handle burst channel errors and allow for Bit Error Rate (BER) reduction. The paper also presents a new interleaver, FRF, the initial letters of the authors’ names, for the same purpose. This newly proposed interleaver summarizes our previous experience with many recent interleavers. Fast Fourier transform OFDM (FFT-OFDM) and Discrete Wavelet Transform OFDM (DWT-OFDM) systems are used to test the efficiency of the suggested scheme in terms of burst channel error removal and BER reduction. Finally, the general complexity of the FRF interleaver is different from that of the helical interleaver in terms of hardware requirements. The performance of the proposed scheme was studied over different channel models. The obtained simulation results show a noticeable performance improvement over the conventional FFT-OFDM and the FFT-OFDM systems with the helical interleaver. Finally, the disadvantage of the proposed FRF interleaver is that it is more complex than the helical interleaver.

Codes with burst distance and periodical burst errors

Burst-b distance introduced by Wainberg and Wolf (1972) has been found to be useful for correction of multiple burst errors and multiple erasures. Villalba et al. (2016) have derived extended Reiger and Singleton bound for linear code with minimum burst-b distance db and then present a class of Maximum Distance Separable (MDS) codes (named as Cb code).In this paper, we derive an upper bound on db for any linear code and a lower bound on db for constant burst-b weight linear codes. We also present the existence of linear code with burst-b distance db−1 from code with burst distance db. The cardinality of a linear code and the connection of linearly independent columns of the parity check matrix of any MDS code with the distance db are also given. Further, we consider periodical burst error which is found in many communication channels and investigate periodical burst-detection and -correction capability of linear codes having distance db. Then, we do the same investigation for Cb and its dual code Cb⊥. Finally, we give decoding procedure for the code Cb in case of periodical burst errors.

New Generation Free-Space Optical Communication Systems With Advanced Optical Beam Stabilizer

In this paper, we introduce a novel concept and design of a full-duplex and all-optical FSO transceiver and evaluate its transmission performance in 200 m outdoor environment. Our transceiver enables a reliable fiber-to-fiber FSO link with intelligent lens-based optical-beam-stabilization (OBS) by utilizing miniaturized and cost-effective 3-axis voice-coil motors (VCMs) actuators. The VCM-based moving lens that is widely used in smartphone cameras for auto-focus and optical-image-stabilization is customized and optimized for our designed transceiver to expand the transmitter and receiver field-of-view, control both the transmitted and incident laser beam alignment, suppress the effects of random beam angle-of-arrival fluctuations induced by the atmospheric turbulence and pointing errors and maintain efficient direct coupling to the fiber core at the receiver. Unlike the 2-axis fast-steering-mirrors, the use of 3-axis VCM lenses can not only maintain the beam alignment, but also control the beam collimation and adjust the difference between the lens focal plane and projection plane for a higher fiber coupling efficiency. Using our developed FSO transceivers, we demonstrate an error-free transmission of the standard signals 10 GbE LAN and common public radio interface (LTE-CPRI) over 200 m links. We also performed a continuous 24-h transmission evaluation in a clear weather day, with only occasional burst errors were recorded and a total 24-h BER of 3 <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\times 10^{-10}$</tex-math></inline-formula> . The obtained results demonstrate the potential of our proposed FSO transceiver to ensure high-capacity communication links and facilitate the adoption of the FSO system as a viable candidate to address the main requirements of B5G/6G networks.

Communications Survival Strategies for Industrial Wireless Control

Industrial wireless control systems are mainly designed on the premise of time-sensitive ultra-reliable low-latency communications (URLLC). With the introduction of survival time to the quality of service requirements of such systems, the design paradigm has evolved from typical link reliability (i.e., minimizing packet error rate), to service availability, that is, minimizing the chance of burst errors, which can cause loss of communication for longer than survival time. In this article, we address the implications of this evolution and present a set of survival time strategies that are designed to guarantee end-to-end dependable industrial wireless control. To ensure service availability, transmissions are divided into normal and survival modes. The presented strategies include scheduling and link adaptation that are designed to target the differences between these modes of operation, traffic prioritization to enhance service availability for users in survival mode, and more efficient multi-node, multi-path, and multi-carrier communications techniques.

OPCoSA: an Optimized Product Code for space applications

The integrated circuit shrinkage increases the probability and the number of errors in memories due to the increase in the sensitivity to electromagnetic radiation. Critical application systems employ Error Correction Codes (ECC) to mitigate memory faults. This work introduces the Optimized Product Code for Space Applications (OPCoSA), an ECC that optimizes its original version called PCoSA, reducing 16-redundancy bits and keeping high error correction capacity. We evaluated the optimized ECC through tests with 36 specific error patterns, burst errors, and exhaustive analysis. Additionally, we compared the synthesis results in hardware, reliability, and redundancy to four other ECCs dedicated to the space application. Tests have shown that OPCoSA corrects all 36 error patterns and 100% of cases for up to four burst errors; besides, it has correction rates of 100%, 100%, 95.4%, and 78.9% for exhaustive errors of dimension one to four, respectively.

Performance Analysis of Error Control Codes for Underwater Wireless Acoustic Communication

In underwater acoustic communication, the information transmitted from 1 sensor node to another is corrupted due to errors persuaded by the noisy channel and other issues. To reduce the bit error rate, it is essential to propose suitable error regulator structure. In this paper, we simulate the performance analysis of Orthogonal Frequency Division Multiplexing Interleaver Division Multiple Access Multiple Input Multiple Output scheme with different channel codes to improve bit error rate performance. Bit error rate and consumed power are measured by communicating arbitrarily generated information through AWGN network. From the simulation results and assessment of the 2 divergent channel coding, 2 interleavers and 3 modulation techniques. We conclude that turbo codes with random interleaver and binary phase shift keying are best suitable to improve reliability performance for underwater wireless acoustic communication. To reduce the burst error in underwater acostic communication we propose an hybrid approach IDMA OFDM MIMO. BER performance is improved upto 10−6.&#x0D; HIGHLIGHTS&#x0D; &#x0D; In underwater acoustic communication to reduce bit error rate, we simulate the performance analysis of Orthogonal Frequency Division Multiplexing Interleaver Division Multiple Access Multiple Input Multiple Output scheme&#x0D; We propose a hybrid approach with 2 divergent channel coding, 2 interleavers and 3 modulation techniques&#x0D; Finally, we observe from simulation results that turbo code with binary phase shift keying and random interleaving improves bit error rate performance&#x0D; &#x0D; GRAPHICAL ABSTRACT

InPhase: Phase-based Ranging and Localization

Ranging and subsequent localization have become more and more critical in today’s factories and logistics. Tracking goods precisely enables just-in-time manufacturing processes. We present the InPhase system for ranging and localization applications. It employs narrowband 2.4 GHz IEEE 802.15.4 radio transceivers to acquire the radio channel’s phase response. In comparison, most other systems employ time-of-flight schemes with Ultra Wideband transceivers. Our software can be used with existing wireless sensor network hardware, providing ranging and localization for existing devices at no extra cost. The introduced Complex-valued Distance Estimation algorithm evaluates the phase response to compute the distance between two radio devices. We achieve high ranging accuracy and precision with a mean absolute error of 0.149 m and a standard deviation of 0.104 m. We show that our algorithm is resilient against noise and burst errors from the phase-data acquisition. Further, we present a localization algorithm based on a particle filter implementation. It achieves a mean absolute error of 0.95 m in a realistic 3D live tracking scenario.

A Survey on High-Throughput Non-Binary LDPC Decoders: ASIC, FPGA, and GPU Architectures

Non-binary low-density parity-check (NB-LDPC) codes show higher error-correcting performance than binary low-density parity-check (LDPC) codes when the codeword length is moderate and/or the channel has bursts of errors. The need for high-speed decoders for future digital communications led to the investigation of optimized NB-LDPC decoding algorithms and efficient implementations that target high throughput and low energy consumption levels. We carried out a comprehensive survey of existing NB-LDPC decoding hardware that targets the optimization of these parameters. Even though existing NB-LDPC decoders are optimized with respect to computational complexity and memory requirements, they still lag behind their binary counterparts in terms of throughput, power and area optimization. This study contributes to an overall understanding of the state-of-the-art on application-specific integrated-circuit (ASIC), field-programmable gate array (FPGA) and graphics processing units (GPU) based systems, and highlights the current challenges that still have to be overcome on the path to more efficient NB-LDPC decoder architectures.