Search Results (28)

The enhanced Loran (eLoran) system, a critical terrestrial backup for the Global Satellite Navigation System (GNSS), traditionally utilizes a Reed-Solomon (RS) code for its data communication, which presents limitations in error performance, particularly due to its decoding method. This paper introduces a significant advancement by proposing the replacement of the conventional RS code with a 128-ary polar code, which is designed to maintain compatibility with the established 128-ary Pulse Position Modulation (PPM) scheme integral to eLoran’s positioning function. A Soft–Soft (SS) demodulation method, based on a correlation receiver, is developed to provide the requisite soft information for the effective Successive Cancellation List (SCL) decoding of the 128-ary polar code. Comprehensive simulations demonstrate that the proposed 128-ary polar code with SS demodulation achieves a substantial error performance improvement, yielding an approximate 9.3 dB gain at the 0.01 FER level over the RS code in eLoran data communication with EPD-MD demodulation. Additionally, the proposed scheme improves data transmission efficiency—either reducing transmission duration by 2/3 or increasing message bit number by 250% for comparable error performance—without impacting the system’s primary positioning capabilities. Full article

Satellite Internet is the key to integrated air–space–ground communication, while the design of waveforms with high spectrum efficiency is an intrinsic requirement for high-speed data transmission in satellite Internet. Time-domain synchronous orthogonal frequency division multiplexing (TDS-OFDM) technology can significantly improve spectrum utilization efficiency by using PN sequences instead of traditional CP cyclic prefixes. However, it also leads to time-domain aliasing between PN sequences and data symbols, posing a serious challenge to channel estimation. To solve this problem, a compressive sensing-based coding iterative channel estimation method for the TDS-OFDM system is proposed in this paper. This method innovatively combines compressive sensing channel estimation technology with the Reed–Solomon low-density parity-check cascade coding (RS-LDPC) scheme, and achieves performance improvements as follows: (1) Construct the iterative optimization mechanism for the compressive sensing algorithm and equalization feedback loop. (2) RS-LDPC cascaded coding is employed to enhance the anti-interference and error correction capability of system. (3) Design the recoding link of error-corrected data to improve the accuracy of sensing matrix. The simulation results demonstrate that compared with conventional methods, the proposed method can obviously converge on the mean squared errors (MSEs) of channel estimation and significantly reduce the bit error rate (BER) of the system. Full article

This study focuses on a 4FSK-modulated ultraviolet (UV) communication system, introducing an innovative symbol-level maximum likelihood decoding approach based on Poisson statistics. A forward error correction (FEC) coding mechanism is integrated to enhance system robustness. Through Monte Carlo simulations, the proposed decoding scheme and the error correction performances of Reed–Solomon (RS) and Low-Density Parity-Check (LDPC) codes are evaluated in UV channels. Both RS and LDPC codes significantly improve the Bit Error Rate (BER), with LDPC codes achieving superior gains under low SNR conditions. Hardware implementation and field tests validate the decoding algorithm and LDPC-optimized 4FSK system. Under non-line-of-sight (NLOS) conditions (10–45° transmit elevation angle), stable 60 m communication with BER < 10⁻³ is achieved. In line-of-sight (LOS) scenarios, the system demonstrates 900 m range with BER < 10⁻³, highlighting practical applicability in challenging atmospheric environments. Full article

This research presents a novel approach to 28 $\mathrm{GHz}$ impulse radio ultra-wideband (IR-UWB) transmission using pulse position modulation (PPM) over an analog radio-over-fiber (ARoF) link, investigating the impact of fiber-based fronthaul on the overall performance of the communication system. In this setup, an arbitrary waveform generator (AWG) is employed for PPM signal generation, while demodulation is performed with a commercial time-to-digital converter (TDC) based on an event timer. To enhance the reliability of transmitted reference PPM (TR-PPM) signals, the transmission system integrates Gray coding and Consultative Committee for Space Data Systems (CCSDS)-standard-compliant Reed-Solomon (RS) error correcting code (ECC). System performance was evaluated by transmitting pseudorandom binary sequences (PRBSs) and measuring the bit error ratio (BER) across a 5-m wireless link between two 20 $\mathrm{d}\mathrm{B}\mathrm{i}$ gain horn (Ka-band) antennas, with and without a 20 $\mathrm{k}\mathrm{m}$ single-mode optical fiber (SMF) link in transmitter side and ECC at the receiver side. The system achieved a BER of less than 8.17 × 10⁻⁷, using a time bin duration of 200 $\mathrm{p}\mathrm{s}$ and a pulse duration of 100 $\mathrm{p}\mathrm{s}$, demonstrating robust performance and significant potential for space-to-ground telecommunication applications. Full article

In order to meet the reliability requirements of communication for underwater resource exploration, this study develops an underwater wireless optical communication (UWOC) system utilizing a blue semiconductor laser as the light source. At the receiver, a fully digital automatic gain control (AGC) module, implemented on a field-programmable gate array (FPGA), is designed to mitigate signal fluctuations induced by underwater turbulence. Digital filtering techniques, including median filtering (MF) and bilateral edge detection filtering (BEDF), are also employed to improve signal demodulation reliability. An improved Reed–Solomon (RS) coding scheme is further adopted to significantly reduce the bit error rate (BER). The design of a highly reliable UWOC system was realized based on the above techniques. The system’s performance was evaluated across a range of signal-to-noise ratios (SNRs) and bubble intensities. The results show that the digital AGC module can provide a gain range from −3.2 dB to 16 dB, adapting to varying signal strengths, which greatly bolsters the system’s resilience against underwater turbulence. Filtering techniques and RS coding further enhance the system’s immunity to interference and reduce the system BER. Communication experiments were conducted over various distances under three distinct water quality conditions. The results demonstrate that, within the detection range of the avalanche photodiode (APD), the system consistently maintained a BER below 3.8 × 10⁻³ across all water types, thereby confirming its high reliability. In clear seawater, the system demonstrated reliable information transmission over a 10 m distance at a data rate of 10 Mbps, achieving a BER of 2 × 10⁻⁸. Theoretical calculations indicate that the maximum transmission distance in clear seawater can reach 111.35 m. Full article

As the core of an aircraft’s power system, the stability and reliability of an aero-engine’s performance are crucial to flight safety. Addressing the issues of complex wiring and poor flexibility in traditional wired testing systems, this paper designs and implements a wireless transmission aero-engine pressure measurement system based on FPGA. By integrating front-end memory and a back-end test bench and utilizing LoRa wireless communication technology and the Reed–Solomon (RS) forward error correction (FEC) algorithm, the system significantly enhances the reliability and anti-interference capability of data transmission. Test results demonstrate that the system can monitor and record engine pressure parameters in real time in complex environments, with a notable reduction in bit error rate and packet loss rate, especially under strong interference conditions. This system resolves wiring challenges, enhances the real-time performance of monitoring links and the stability of data storage, and is characterized by high precision, high reliability, and automation. It is suitable for complex and harsh working environments and has broad application prospects in the aviation and military sectors. Full article

The Internet of Things (IoT), which is characteristic of the current industrial revolutions, is the connection of physical devices through different protocols and sensors to share information. Even though the IoT provides revolutionary opportunities, its connection to the current Internet for smart cities brings new opportunities for security threats, especially with the appearance of new threats like quantum computing. Current approaches to protect IoT data are not immune to quantum attacks and are not designed to offer the best data management for smart city applications. Thus, post-quantum cryptography (PQC), which is still in its research stage, aims to solve these problems. To this end, this research introduces the Dynamic Galois Reed–Solomon with Quantum Resilience (DGRS-QR) system to improve the secure management and communication of data in IoT smart cities. The data preprocessing includes K-Nearest Neighbors (KNN) and min–max normalization and then applying the Galois Field Adaptive Expansion (GFAE). Optimization of the quantum-resistant keys is accomplished by applying Artificial Bee Colony (ABC) and Moth Flame Optimization (MFO) algorithms. Also, role-based access control provides strong cloud data security, and quantum resistance is maintained by refreshing keys every five minutes of the active session. For error correction, Reed–Solomon (RS) codes are used which provide data reliability. Data management is performed using an attention-based Bidirectional Long Short-Term Memory (Att-Bi-LSTM) model with skip connections to provide optimized city management. The proposed approach was evaluated using key performance metrics: a key generation time of 2.34 s, encryption time of 4.56 s, decryption time of 3.56 s, PSNR of 33 dB, and SSIM of 0.99. The results show that the proposed system is capable of protecting IoT data from quantum threats while also ensuring optimal data management and processing. Full article

For a finite field GF($p^L$) with prime p and $L>1$, one of the standard representations is $L\times L$ matrices over GF(p) so that the arithmetic of GF($p^L$) can be realized by the arithmetic among these matrices over GF(p). Based on the matrix representation of GF($p^L$), a conventional linear network coding scheme over GF($p^L$) can be transformed to an L-dimensional vector LNC scheme over GF(p). Recently, a few real implementations of coding schemes over GF($2^L$), such as the Reed–Solomon (RS) codes in the ISA-L library and the Cauchy-RS codes in the Longhair library, are built upon the classical result to achieve matrix representation, which focuses more on the structure of every individual matrix but does not shed light on the inherent correlation among matrices which corresponds to different elements. In this paper, we first generalize this classical result from over GF($2^L)$ to over GF($p^L$) and paraphrase it from the perspective of matrices with different powers to make the inherent correlation among these matrices more transparent. Moreover, motivated by this correlation, we can devise a lookup table to pre-store the matrix representation with a smaller size than the one utilized in current implementations. In addition, this correlation also implies useful theoretical results which can be adopted to further demonstrate the advantages of binary matrix representation in vector LNC. In the following part of this paper, we focus on the study of vector LNC and investigate the applications of matrix representation related to the aspects of random and deterministic vector LNC. Full article

Secure distributed matrix multiplication (SDMM) schemes are crucial for distributed learning algorithms where extensive data computation is distributed across multiple servers. Inspired by the application of repairing Reed–Solomon (RS) codes in distributed storage and secret sharing, we propose SDMM schemes with reduced communication overhead through the use of trace polynomials. Specifically, these schemes are designed to address three critical concerns: (i) ensuring information-theoretic privacy against collusion among servers; (ii) providing security against Byzantine servers; and (iii) offering resiliency against stragglers to mitigate computing delays. To the best of our knowledge, security and resiliency are being considered for the first time within trace polynomial-based approaches. Furthermore, our schemes offer the advantage of reduced sub-packetization and a lower server-count requirement, which diminish the computational complexity and download cost for the user. Full article

In communication technologies such as digital watermarking, wireless sensor networks (WSNs), and visual light communication (VLC), error-correcting codes are crucial. The Enhanced Hadamard Error-Correcting Code (EHC), which is based on 2D Hadamard Basis Images, is a novel error correction technique that is presented in this study. This technique is used to evaluate the effectiveness of the video watermarking scheme. Even with highly sophisticated embedding techniques, watermarks usually fail to resist such comprehensive attacks because of the extraordinarily high compression rate of approximately 1:200 that is frequently employed in video dissemination. It can only be used in conjunction with a sufficient error-correcting coding method. This study compares the efficacy of the well-known Reed–Solomon Code with this novel technique, the Enhanced Hadamard Error-Correcting Code (EHC), in maintaining watermarks in embedded videos. The main idea behind this newly created multidimensional Enhanced Hadamard Error-Correcting Code is to use a 1D Hadamard decoding approach on the 2D base pictures after they have been transformed into a collection of one-dimensional rows. Following that, the image is rebuilt, allowing for a more effective 2D decoding procedure. Using this technique, it is possible to exceed the theoretical error-correcting capacity threshold of ⌊$\frac{d_{min}-1}{2}$⌋ bits, where $d_{min}$ is the Hamming distance. It may be possible to achieve better results by converting the 2D EHC into a 3D format. The new Enhanced Hadamard Code is used in a video watermarking coding scheme to show its viability and efficacy. The original video is broken down using a multi-level interframe wavelet transform during the video watermarking embedding process. Low-pass filtering is applied to the video stream in order to extract a certain frequency range. The watermark is subsequently incorporated using this filtered section. Either the Reed–Solomon Correcting Code or the Enhanced Hadamard Code is used to protect the watermarks. The experimental results show that EHC far outperforms the RS Code and is very resilient against severe MPEG compression. Full article

The communication channel is a critical part of the process of information degradation. In the 4K ultra-resolution video transmission domain, the communication channel is a crucial part where information degradation occurs, inevitably leading to errors during reception. To enhance the transmission process in terms of fidelity, advanced technologies such as digital video broadcasting terrestrial (DVB-T) and its evolutionary successor, digital video broadcasting terrestrial second generation (DVB-T2), are utilized to mitigate the effects of data transmission errors. Within this scenario, this research presents an innovative methodology for the temporal analysis of 4K ultra-resolution video quality under the influence of additive white Gaussian noise (AWGN) and Rayleigh channels. This analytical endeavor is facilitated through the application of concatenated coding schemes, specifically, the Bose–Chaudhuri–Hocquenghem concatenated low-density parity check (BCH-LDPC) and Reed–Solomon concatenated convolutional (RS-CONV) coders. A more comprehensive understanding of video quality can be attained by considering its temporal variations, a crucial aspect of the ongoing evolution of technological paradigms. In this study, the Structural Similarity Index (SSIM) serves as the main metric for quality assessment during simulations. Furthermore, the simulated Peak Signal-to-Noise Ratio (PSNR) values validate these findings, exhibiting consistent alignment with the SSIM-based evaluations. Additionally, the performance of the BCH-LDPC significantly outperforms that of RS-CONV under the 64-QAM modulation scheme, yielding superior video quality levels that approximate or surpass those achieved by RS-CONV under QPSK (Quadrature Phase Shift Keying) modulation, leading to an increase in spectral efficiency. This enhancement is evidenced by SSIM gains exceeding 78% on average. The computation of average gains between distinct technologies in video quality analysis furnishes a robust and comprehensive evaluation framework, empowering stakeholders to make informed decisions within this domain. Full article

Faster-than-Nyquist (FTN) signaling has attracted increasing interest in the past two decades. However, when the fifth-generation (5G) communication low-density parity check (LDPC) code is applied to FTN signaling with low Bahl–Cock–Jelinek–Raviv (BCJR) states of detection and few turbo equalization iterations, an error floor near ${10}^{-5}$ is found, which does not exist in the original LDPC used for orthogonal signaling. This can be eliminated through many detection and decoding iterations, but this is unacceptable considering the increase in latency and storage. To solve this problem, we propose an LDPC and Reed–Solomon (RS) concatenation code, shortening, and perturbation scheme to lower the error floor. We propose a parallel encoder architecture for RS component code and a concise algorithm to calculate its constant multiplier coefficients, leveraging a traditional serial encoder, which can also be used for other parallelisms, rates, and lengths. The simulation results show that the proposed concatenation and shortening scheme can lower the error floor to about ${10}^{-7}$. The proposed scheme has an error correction capability for coded FTN signaling and successfully lowers the error floor with the limitation of few turbo iterations and few BCJR states. Full article

As data continue to grow in complexity and size, there is an imperative need for more efficient and robust storage solutions. DNA storage has emerged as a promising avenue to solve this problem, but existing approaches do not perform efficiently enough on video data, particularly for information density and time efficiency. This paper introduces VSD, a pioneering encoding method for video segmentation and storage in DNA, leveraging the Reed–Solomon (RS) error correction code. This method addresses these limitations through an innovative combination of segmentation and encoding, accompanied by RS coding to bolster error resilience. Additionally, the method ensures that the GC-content of the resultant DNA sequences remains around 50%, which further enhances the storage robustness. The experimental results demonstrate the method has commendable encoding efficiency and offers a solution to the prevailing issue of time inefficiency and error correction rates in DNA storage. This groundbreaking approach paves the way for the practical and reliable storage of large-scale video data in DNA, heralding a new era in the domain of information storage. Full article

As the distributed ledger technology underlying cryptocurrencies such as Bitcoin and Ethereum, blockchain has empowered various industries, such as supply chain management, healthcare, government services, e-voting, etc. However, the ever-growing ledger on each node has been the main bottleneck for blockchain scalability as the network scale expands, which worsens in blockchain-enabled IoT scenarios with resource-limited devices. With the support of the Reed–Solomon (RS) code, the Cuckoo-Store (CS), a ledger storage optimization engine, is proposed in this paper to dramatically decrease the storage burden on each node by encoding the ledger as data segments with redundancy and distributing them to multiple nodes. These distributed data segments can be collected and decoded using RS code to recover the original ledger. Furthermore, the Cuckoo filter (CF) is used to guarantee the integrity of the encoded segments, which helps detect the forged segments and facilitates the process of ledger recovery. Theoretical analysis and simulation results show that the CS engine can decrease the storage in each node by more than 94%, and the original ledger can be recovered efficiently with acceptable communication overheads. Full article

The performance of the coded generalized frequency division multiplexing (GFDM) transceiver has been evaluated in a shallow underwater acoustic channel (UAC). Acoustic transmission is the scheme of choice for communication in UAC since radio waves suffer from absorption and light waves scatter. Although orthogonal frequency division multiplexing (OFDM) has found its ground for multicarrier acoustic underwater communication, it suffers from high peak to average power ratio (PAPR) and out of band (OOB) emissions. We propose a coded-GFDM based multicarrier system since GFDM has a higher spectral efficiency compared to a traditional OFDM system. In doing so, we assess two block codes, namely Bose, Chaudari, and Hocquenghem (BCH) codes, Reed-Solomon (RS) codes, and several convolutional codes. We present the error performances of these codes when used with GFDM. Furthermore, we evaluate the performance of the proposed system using two equalizers: Matched Filter (MF) and Zero-Forcing (ZF). Simulation results show that among the various block coding schemes that we tested, BCH (31,6) and RS (15,3) give the best error performance. Among the convolutional codes that we tested, rate 1/4 convolutional codes give the best performance. However, the performance of BCH and RS codes is much better than the convolutional codes. Moreover, the performance of the ZF equalizer is marginally better than the MF equalizer. In conclusion, using the channel coding schemes with GFDM improves error performance manifolds thereby increasing the reliability of the GFDM system despite slightly higher complexity. Full article