Search

Turbo codes play a crucial role in wireless communication systems, and their compiled code structures are key factors affecting the performance of the entire communication system. As a result, the study of turbo compiled code structures has been a focal point for researchers. The iterative decoding of turbo code structures has multiple limitations and large storage resource consumption, leading to poor system anti‐interference ability and a rapid increase in BER. To address these issues, this paper proposes the mimic turbo compiled code structure (MTCCS) for wireless communication systems. MTCCS is based on the DHR idea, incorporating dynamic, heterogeneous, and redundancy characteristics. Dynamicity is achieved through a dynamic scheduling algorithm based on abnormal feedback information. Heterogeneity is achieved through a codec component collection design method based on intrinsic and extrinsic heterogeneity. Redundancy is achieved through a majority voting algorithm. At the beginning of information transmission, MTCCS randomly selects heterogeneous codecs from the heterogeneous codec collection to enter the runtime pool. After the information transmission is complete, the majority voting algorithm is used to adjudicate the multi‐mode output of the codecs, resulting in a relatively accurate decoding outcome. Meanwhile, the dynamic scheduling module calculates the abnormal feedback information of each codec and accordingly dynamically schedules the mimic turbo codecs to replace the abnormal ones. Through the above process, MTCCS realizes the adaptive compilation code and improves the anti‐interference ability of turbo code. Simulation experiments are conducted on MTCCS in both non‐interference and interference scenarios. Simulation experiments show that MTCCS introducing the DHR idea achieves a balance between anti‐interference and decoding performance. It effectively addresses the issue of poor anti‐interference ability in turbo codes, and the decoding performance of MTCCS is superior to that of the previous single conventional turbo codes. [ABSTRACT FROM AUTHOR]

Summary: As a consequence of continuing demand for additional capacity and higher quality data transmission, channel coding as a key component of a digital communication network has progressed from a classical single pair, point‐to‐point information theoretic application to a class of coding techniques with diverse parameters. The heterogeneous requirements of B5G/6G networks technology have made flexibility of code parameters the main desired feature while designing channel codes. Owing to this, channel coding techniques have evolved to support enabling applications that depend on different factors such as latency, reliability, energy efficiency and throughput. We review and discuss the application of new techniques, modifications in the design and construction of modern channel coding schemes, including block, convolutional, rateless and space‐time codes. Further, the error correction performance of mainstream channel decoders for LDPC, polar and turbo codes is compared and analysed for their attainable error rate. The aim of this study is to highlight the adaptability of the discussed coding schemes for the forthcoming cellular network landscape. This article also addresses the implementational challenges of high throughput, low latency and machine type communication scenarios. Moreover, some recent studies exploring the role of machine learning for optimisation of B5G/6G networks are classified and discussed. Concluding, research areas pertaining to the scalability of error control coding for next generation networking are addressed. [ABSTRACT FROM AUTHOR]

Abstract Turbo codes play a crucial role in wireless communication systems, and their compiled code structures are key factors affecting the performance of the entire communication system. As a result, the study of turbo compiled code structures has been a focal point for researchers. The iterative decoding of turbo code structures has multiple limitations and large storage resource consumption, leading to poor system anti‐interference ability and a rapid increase in BER. To address these issues, this paper proposes the mimic turbo compiled code structure (MTCCS) for wireless communication systems. MTCCS is based on the DHR idea, incorporating dynamic, heterogeneous, and redundancy characteristics. Dynamicity is achieved through a dynamic scheduling algorithm based on abnormal feedback information. Heterogeneity is achieved through a codec component collection design method based on intrinsic and extrinsic heterogeneity. Redundancy is achieved through a majority voting algorithm. At the beginning of information transmission, MTCCS randomly selects heterogeneous codecs from the heterogeneous codec collection to enter the runtime pool. After the information transmission is complete, the majority voting algorithm is used to adjudicate the multi‐mode output of the codecs, resulting in a relatively accurate decoding outcome. Meanwhile, the dynamic scheduling module calculates the abnormal feedback information of each codec and accordingly dynamically schedules the mimic turbo codecs to replace the abnormal ones. Through the above process, MTCCS realizes the adaptive compilation code and improves the anti‐interference ability of turbo code. Simulation experiments are conducted on MTCCS in both non‐interference and interference scenarios. Simulation experiments show that MTCCS introducing the DHR idea achieves a balance between anti‐interference and decoding performance. It effectively addresses the issue of poor anti‐interference ability in turbo codes, and the decoding performance of MTCCS is superior to that of the previous single conventional turbo codes.

In general, a 5G new radio network is defined by three primary utilization situations, namely upgraded versatile broadband, ultra-reliable, and low latency interchanges of information, as well as huge machine-type correspondences. These utilizations require improved throughput, inertness, dependability contrasted, and a 4G framework. As a coding plan for information, 5G Turbo codes attain high throughput, a variable code rate, and length, and crossover programmed rehash with good error-detecting capability. The execution boundaries of 5G advancements are normal and are tens and thousands of times better compared with 4G. In this paper, the evaluations of puncturing and non-puncturing for turbo code depending on the minimization of penetrating of efficient pieces are discussed. It also provides penetrating of equality pieces considering additive white Gaussian noise (AWGN) Channel with 16 quadrature amplitude modulation (QAM) to attain high spectral efficiency. In addition to this, the super encoder encodes the separated progression with a code speed of 1/3. The code block association progressively connects the yields from the super encoder. The sign mapper employed in this paper adjusts the progression using a 16-QAM balance. Also, the mapper takes effective pieces, one uniformity bit from the upper encoder, and the deinterleaved equity bit from the base encoder. The Orthogonal frequency-division multiplexing (OFDM) mapper parts into more modest equivalent channels, named subcarriers and the information is sent on these equivalent channels at a reduced rate. [ABSTRACT FROM AUTHOR]

This paper presents a history of the development of channel codes in deep-space telemetry and aeronautical mobile telemetry. The history emphasizes "firsts" and other remarkable achievements. Because coding was used first in deep-space telemetry, the history begins with the codes used for Mariner and Pioneer. History continues with the international standard for concatenated coding developed for the Voyager program and the remarkable role channel coding played in rescuing the nearly-doomed Galileo mission. The history culminates with the adoption of turbo codes and LDPC codes and the programs that relied on them. The history of coding in aeronautical mobile telemetry is characterized by a number of "near misses" as channel codes were explored, sometimes tested, and rarely adopted. Aeronautical mobile telemetry is characterized by bandwidth constraints that make use of low-rate codes and their accompanying bandwidth expansion, an unattractive option. The emergence of a family of high-rate LDPC codes coupled with a bandwidth-efficient modulation has nudged the aeronautical mobile telemetry community to adopt the codes in their standards. [ABSTRACT FROM AUTHOR]

Centralized traffic signal control has long been a challenging, high‐dimensional optimization problem. This study establishes a simulation‐based optimization framework and develops a novel optimization algorithm based on trust region Bayesian optimization (TuRBO), which can efficiently obtain an approximate optimal solution to the high‐dimensional traffic signal control problem. Local Gaussian process (GP), trust region, and Thompson sampling are employed in the TuRBO and contribute considerably to performance in terms of computational speed, solution quality, and scalability. Empirical studies are carried out using data from Mudanjiang and Chengdu, China. The performance of TuRBO is compared with that of Bayesian optimization (BO), genetic algorithm and random sampling. The results show that TuRBO converges the fastest because of its ability to balance exploration and exploitation through the trust region and Thompson sampling. Meanwhile, because TuRBO enables more efficient exploitation through the local GP, the solution quality of TuRBO outperforms others significantly. The average waiting time achieved by TuRBO was 2.84% lower than that achieved by BO. Finally, the method has been successfully extended to a large network with 233‐dimensional spaces and 122 signalized intersections, demonstrating that the developed methodology can deal with high‐dimensional traffic signal control effectively for real case applications. [ABSTRACT FROM AUTHOR]

The article proposes a method of assessing information transmission reliability by using the output normalized logarithmic ratio of the likelihood function (LRLF) of the decoder. Based on the evaluation, the method allows adapting system parameters with turbo codes (TC) or LDPC code. This method can be used in combination with other methods of parametric and structural adaptation using turbo codes or LDPC codes.

Copyright of Journal of Engineering (17264073) is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Turbo product codes (TPCs) have been widely used for bit error correction in high‐speed applications such as data storage. This letter introduces an efficient hard‐input hard‐output iterating TPC decoder module. A transpose memory utilizing static random access memory (SRAM) is integrated into the decoder to achieve a low hardware overhead. The transpose memory, based on an 8T SRAM bit‐cell, supports both horizontal (row‐wise), and vertical (column‐wise) read/write operations. It is prototyped under a 28nm high‐k/metal gate stack process with bit‐cell size of 0.582 µm2. This specialized SRAM significantly reduces the hardware overhead when compared with a register‐array‐based transpose memory without significant throughput loss. A field programmable gate array (FPGA) evaluation platform is utilized to emulate the TPC decoder module, and the maximum decoder throughput is up to 6.49 Gbps at 250 MHz. [ABSTRACT FROM AUTHOR]

This paper proposes a novel Very Large-Scale Integration (VLSI) design for the Turbo decoder, a popular communication tool to achieve optimal data reception with minimal errors. The Turbo decoder includes SISO decoders, interleavers, and deinterleavers, which use the Maximum-a-Posteriori (MAP) algorithm to reduce the number of iterations required for decoding. Additionally, the encoder part uses two Recursive convolutional encoders and a pseudorandom interleaver to enhance the error correction capability of the Turbo code. The paper also suggests using clock gating technology to improve the decoder's performance by selectively activating specific blocks based on the decoding performance. The proposed Turbo decoder is designed in Xilinx Vivado 2018.3 achieves high performance and provides a scalable and efficient solution for implementing Turbo decoders in communication systems. [ABSTRACT FROM AUTHOR]

The article proposes a method of assessing information transmission reliability by using the output normalized logarithmic ratio of the likelihood function (LRLF) of the decoder. Based on the evaluation, the method allows adapting system parameters with turbo codes (TC) or LDPC code. This method can be used in combination with other methods of parametric and structural adaptation using turbo codes or LDPC codes. [ABSTRACT FROM AUTHOR]

Abstract—Sparse code multiple access (SCMA) is a variation of the nonorthogonal multiple access (NOMA) technology. SCMA communication systems use codebooks based on multidimensional constellations, which are generated using original mother constellations. The properties of these constellations largely determine the efficiency of SCMA communication systems. This paper proposes new mother constellations for use in SCMA systems. The proposed constellations were synthesized using a new analytical method for describing tabular functions in the form of a functional dependence of the signal on the vector of binary variables. This representation made it possible to reveal some patterns and determine the characteristics of constellations that affect the efficiency of their use. In particular, a new type of two-dimensional constellation with a parametric description, called Arrow constellations, is proposed. The proposed constellations belong to the class of multidimensional constellations and can be used both independently and in codebook synthesis in SCMA systems. The best effect from using these constellations is observed in SCMA systems with a turbo receiver, in which both the demodulator and the decoder are operated with the same feedback. [ABSTRACT FROM AUTHOR]

This paper presents a history of the development of channel codes in deep-space telemetry and aeronautical mobile telemetry. The history emphasizes “firsts” and other remarkable achievements. Because coding was used first in deep-space telemetry, the history begins with the codes used for Mariner and Pioneer. History continues with the international standard for concatenated coding developed for the Voyager program and the remarkable role channel coding played in rescuing the nearly-doomed Galileo mission. The history culminates with the adoption of turbo codes and LDPC codes and the programs that relied on them. The history of coding in aeronautical mobile telemetry is characterized by a number of “near misses” as channel codes were explored, sometimes tested, and rarely adopted. Aeronautical mobile telemetry is characterized by bandwidth constraints that make use of low-rate codes and their accompanying bandwidth expansion, an unattractive option. The emergence of a family of high-rate LDPC codes coupled with a bandwidth-efficient modulation has nudged the aeronautical mobile telemetry community to adopt the codes in their standards.

Abstract Nanosatellites are persistently progressing and creating global communication and data transmission. It builds up a colossal request for more progressed and dependable frameworks to transmit faster and more reliable information. A syntactic machine learning approach has been distinguished as a good plot for anticipating single-bit and multiple-bit errors that influence onboard nanosatellites. In this paper, we have proposed an analytical approach to error detection and correction for onboard nanosatellites. We have planned the framework separately with three distinct parts: encoding, error checking, and decoding. It has created an amid information exchange from satellite to the ground station. It has analyzed six camera pictures simultaneously with the assistance of field programmable gate array and EDAC strategies. We have presented the progressed turbo mechanics EDAC for unprecedented transfer speeds of satellite communication and execution & examination with the AWGN and Rayleigh channels to extend the proficiency. EDAC strategies codes have been implemented in MATLAB. This method is straightforward and accomplishes unwavering quality and exactness compared to comparable strategies.

Most of the cutting-edge 3D convolutional-based video saliency prediction models adopt a fully convolutional encoder-decoder architecture, which provides a good spatiotemporal representation of salient regions. However, the spatiotemporal cues of the saliency models will be continuously diluted during the decoding process, leading to a decreased ability to locate salient regions. To address this limitation, we propose a simple and effective gated fusion network (GFNet) to conduct video saliency prediction. Specifically, GFNet is built on a fully 3D convolutional encoder-decoder architecture and consists of a key component named the gated fusion (GF) module, which acts as a message screening unit between each level encoder and decoder features. In the GF module, the gate can be obtained via the combination of features from the previous decoder block and the current encoder block, which is employed to weight the encoder features. In this way, GFNet can control the message passing between each level encoder and decoder block. Extensive experimental results on four video saliency datasets show that our method achieves comparable performance against state-of-the-art models. The code is available at https://github.com/wusonghe/GFNet. [ABSTRACT FROM AUTHOR]

Various types of interleavers in turbo codes and their parameters affecting the efficiency of turbo codes are considered. It is noted that the type of interleaver directly affects the efficiency and error correcting of turbo codes. Also, the efficiency of turbo codes is influenced by the parameters of the minimum distance, the length of interleaver, and the distance spectrum of the code. A modification of the chaotic interleaver of turbo codes is proposed with the change of the equation to the Duffing and with examining the code's distance spectrum with the condition of increasing the code's distance between the code words with a small weight. The algorithm for modifying the chaotic interleaver with the Duffing equation and with examining the code's distance spectrum of turbo codes is presented. The characteristics of the modified chaotic interleaver with the Duffing equation and with examining the code's distance spectrum of turbo codes according to various parameters of turbo codes are given. This modification of the interleaver of turbo codes increased the minimum distance between elements for different lengths of the interleaver and polynomials of the turbo code by 10 % …33 %. Given this, there was an increase in the energy efficiency of the turbo codes by 0,05, …, 0,25 dB in comparison with a chaotic interleaver without modification at the same value of the bit error probability. When increasing the length of the modified chaotic interleaver with the Duffing equation and applying distance spectrum of the code the increasing the energy efficiency of the turbo code slows down compared to the chaotic interleaver without modification. The application scope of the modified chaotic interleaving with the Duffing equation and with examining the code's distance spectrum of turbo codes is the infocommunication channels for mobile, wired, and satellite communications. [ABSTRACT FROM AUTHOR]

This research highlights the importance of error-correcting codes in ensuring secure and efficient data transmission over noisy channels. This paper aims to address the issue of limited information regarding the factors that contribute to the effectiveness of the implementation of Convolutional Codes in GPS systems. The research problem revolves around the insufficiency of scholarly sources elucidating the rationale behind the utilization of convolutional codes, specifically in GPS systems, rather than others. Through an in-depth analysis of these factors, this study strives to achieve a comprehensive understanding of the application of Convolutional Codes in GPS. To tackle this research problem, a novel methodology involving comparative analysis is employed. The coding techniques commonly used in satellite communication systems (such as BCH, LDPC, and turbo codes) are carefully examined and compared to the advantages and suitability of Convolutional codes and the Viterbi algorithm for GPS systems. Each coding technique is evaluated based on factors such as error detection and correction capabilities, bandwidth efficiency, computational complexity, and resilience to noise. The key findings of this study shed light on the unique advantages offered by Convolutional codes and the Viterbi algorithm for GPS systems. The analysis reveals that these coding techniques exhibit superior error detection and correction capabilities, efficient bandwidth utilization, and the ability to withstand noise in the GPS communication channel. The results also highlight the computational complexity associated with these techniques, providing valuable insights for the implementation of convolutional codes in GPS systems. Overall, this article contributes to the existing knowledge by providing a comprehensive understanding of the reasons behind the suitability of convolutional codes for GPS systems. The findings of this study serve as a resource for researchers, engineers, and practitioners in the field of satellite communication, aiding in the comprehensive understanding, advancement, and optimization of GPS system designs. [ABSTRACT FROM AUTHOR]

Copyright of Tikrit Journal of Engineering Sciences is the property of Republic of Iraq Ministry of Higher Education & Scientific Research (MOHESR) and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The oceanic positioning, navigation and timing (PNT) network requires high-quality underwater acoustic message transmission. Turbo equalization technology has exhibited superior performance for underwater acoustic (UWA) communications compared with conventional channel equalizers. To overcome the performance reduction caused by severe doubly selective UWA channels, the virtual space-time diversity soft direct-adaptation turbo equalization is proposed for UWA communications. The proposed scheme improves the ability of the typical turbo equalizer to deal with both Doppler and multipath effects for time varying channels. We utilize a fractionally spaced soft interference cancellation equalizer (FS-SE) instead of a hard decision to constitute the soft-input soft-output (SISO) equalizer. Combined with another virtual time-reversal mirror equalizer component, we can obtain virtual space and time diversity with only a single receiving transducer and mitigate the error propagation phenomenon of the feedback filter. To satisfy the sparse UWA channel, the ℓ p , q -PRLS algorithm is applied to adaptive updates for FS-SE. In the proposed scheme, an adjustable interpolator and digital phase-locked loop are embedded into the equalizer to overcome the residual Doppler frequency shift and recover the timing distortion. Results of simulations and field lake trial show that the proposed scheme achieves better performance than existing ones under the same equalizer order. [ABSTRACT FROM AUTHOR]

This paper investigates the turbo coded-spatial modulation (TC-SM) scheme based on code matched interleaver (CMI) for multiple input multiple output (MIMO) antenna system. The information bits for the selection of transmit active antenna and for the M-QAM modulated symbols are protected by a forward error correcting turbo code. In this work, we demonstrate that parallel encoding and decoding construction of the TC-SM scheme enabled us to effectively extend the TC-SM scheme to a turbo coded-cooperative spatial modulation (TCC-SM) scheme with CMI placed at the relay node. Numerical results based on Monte Carlo simulations revealed that the TCC-SM and TC-SM schemes outperform state of the art polar coded-cooperative spatial modulation (PCC-SM) and polar coded spatial modulation (PC-SM) schemes, respectively, under identical conditions. This performance improvement in bit-error rate (BER) of the proposed TCC-SM and TC-SM schemes occurred due to the joint soft input soft output log maximum a posteriori probability (SISO-Log-MAP) iterative decoding at the receiver. Furthermore, the mathematical error performance of the TC-SM scheme has also been presented. The numerical results demonstrate that the proposed TCC-SM scheme offers robustness not only in BER performance over the practical (non-ideal) source to relay channel but also presents less encoding and decoding complexity as compared to the PCC-SM scheme. [ABSTRACT FROM AUTHOR]

Vehicle-to-everything (V2X) communications is an emerging branch of wireless communications and has recently gained a lot of interest not only from academia but also from the automotive and telecommunications industry. An important feature of V2X telecommunication systems is that the communication quality varies quickly in time due to the high mobility of the transceivers and due to the rapid change in the fading characteristics of the communication medium. For this reason, it is vital to maintain tolerable quality of service (QoS) in a V2X communication environment, in terms of communication reliability, power, end-to-end latency, data rate, communication range, throughput and vehicle density. A significant impact on the quality parameters of the system has been the coding scheme used by the V2X telecommunication system. For this purpose, we examine the effect that popular coding schemes have on the QoS of a V2X communication system. More specifically, the impact of fourth-generation long-term evolution (4G-LTE) turbo codes, fifth-generation new radio (5G-NR) polar codes and 5G-NR low-density parity-check codes (LDPC) on the QoS parameters of a V2X communication system is researched. Το this end, we employ stochastic V2X propagation models that simulate every possible V2X channel state and traffic environment, based on the third-generation partnership project (3GPP) Release 16 specifications. These propagation models form the basis of our study, since through them, at a first level, we analyze the frame error rate (FER) performance for different levels of signal-to-noise ratios (SNRs) for all the aforementioned coding schemes and 128-bit V2X-compatible data frames, and, at a second level, we investigate the impact of these propagation models and coding schemes on the V2X QoS parameters. Our analysis shows that turbo-based coding schemes satisfy all the QoS parameters and achieve overall communication quality comparable to polar and better than LDPC, making them suitable for small-frame 5G V2X services. [ABSTRACT FROM AUTHOR]

Nanosatellites are persistently progressing and creating global communication and data transmission. It builds up a colossal request for more progressed and dependable frameworks to transmit faster and more reliable information. A syntactic machine learning approach has been distinguished as a good plot for anticipating single-bit and multiple-bit errors that influence onboard nanosatellites. In this paper, we have proposed an analytical approach to error detection and correction for onboard nanosatellites. We have planned the framework separately with three distinct parts: encoding, error checking, and decoding. It has created an amid information exchange from satellite to the ground station. It has analyzed six camera pictures simultaneously with the assistance of field programmable gate array and EDAC strategies. We have presented the progressed turbo mechanics EDAC for unprecedented transfer speeds of satellite communication and execution & examination with the AWGN and Rayleigh channels to extend the proficiency. EDAC strategies codes have been implemented in MATLAB. This method is straightforward and accomplishes unwavering quality and exactness compared to comparable strategies. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Chongqing University of Technology (Natural Science) is the property of Chongqing University of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This article presents a new stopping criterion for the logarithmic - maximum a posteriori (Log-MAP) turbo decoding. This method is inspired from the recent stopping criterion Sum alpha of the maximum a posteriori (MAP) algorithm. We call it Sum-Log. This criterion manipulates logarithmic quantities of the Log-MAP algorithm and provides a decision on the decoding quality. It is proposed in two versions Sum-Log-1 and Sum-Log-2. It is aimed for practical use and at the same time guarantees lower complexity. The simulation results show that the Sum-Log criterion offers the same performances in terms of Bit Error Rate (BER), Frame Error Rate (FER) and average number of iterations of the Sum alpha and the famous Cross-Entropy (CE) criteria.

Summary: In this work, a digital differential transmitter based on low‐power wireless compensation transceiver for body channel communication (BCC) is proposed. Further, the proposed transceiver is composed of Touch Status Detection Unit (TSDU), Wireless Status Compensation Unit (WSCU), and a reconfigurable preamplifier. Initially, the human body channel environment for wireless communication is investigated based on properties from 1 to 100 MHz. Further, the turbo code‐based encoding scheme is used to encode the data before transferring the data on the transmitter side. Also, the proposed error‐correcting parallel turbo decoder using a modified step‐by‐step algorithm is presented. The turbo code‐based decoding scheme is used to recover the error‐free transmitted data at the receiver side. Results demonstrate that the proposed BCC transceiver is designed using 90 nm CMOS technology and it is observed that the proposed BCC transceiver has utilized an area of 600mm2. Also, the maximum data rate achieved by a proposed BCC transceiver was 100 Mbps, and the overall transceiver power consumption is 0.42 mW, and energy for communication is 0.02 nj/b. [ABSTRACT FROM AUTHOR]

The concept of labeling-based recipient identification (LABRID) for bit-interleaved coded modulation with iterative decoding (BICM-ID) is revisited. LABRID allows addressing a message recipient station in a wireless network by using an individual labeling map without compromising error performance. This eliminates the need to use any byte of the data frame to carry the recipient address explicitly. In addition, the destination of the frame can be determined in parallel with a BICM-ID decoding procedure in the receiver's physical layer. Therefore, the MAC layer is not involved in processing the vast majority of frames transmitted in a network. Previously, it was shown that LABRID works fine if there are only LABRID-compatible stations within the network, and every receiver can reject frames destined for other receivers. This paper considers a scenario in which LABRID-compatible BICM-ID stations and legacy BICM stations coexist in the same network. A few experiments show that the LABRID receiver can reject an old-fashioned BICM frame by judging the convergence of the iterative decoding process. It also turns out that the legacy BICM receiver can identify and dismiss the LABRID-type frames thanks to the standard cyclic redundancy check (CRC) procedure. [ABSTRACT FROM AUTHOR]

With the ever growth of Internet users, video applications, and massive data traffic across the network, there is a higher need for reliable bandwidth-efficient multimedia communication. Versatile Video Coding (VVC/H.266) is finalized in September 2020 providing significantly greater compression efficiency compared to Highest Efficient Video Coding (HEVC) while providing versatile effective use for Ultra-High Definition (HD) videos. This article analyzes the quality performance of convolutional codes, turbo codes and self-concatenated convolutional (SCC) codes based on performance metrics for reliable future video communication. The advent of turbo codes was a significant achievement ever in the era of wireless communication approaching nearly the Shannon limit. Turbo codes are operated by the deployment of an interleaver between two Recursive Systematic Convolutional (RSC) encoders in a parallel fashion. Constituent RSC encoders may be operating on the same or different architectures and code rates. The proposed work utilizes the latest source compression standards H.266 and H.265 encoded standards and Sphere Packing modulation aided differential Space Time Spreading (SP-DSTS) for video transmission in order to provide bandwidth-efficient wireless video communication. Moreover, simulation results show that turbo codes defeat convolutional codes with an averaged Eb/N0 gain of 1.5 dB while convolutional codes outperformcompared to SCC codes with an Eb/N0 gain of 3.5 dBatBit ErrorRate (BER) of 10-4. The Peak Signal to Noise Ratio (PSNR) results of convolutional codes with the latest source coding standard of H.266 is plotted against convolutional codes with H.265 and it was concluded H.266 outperform with about 6 dB PSNR gain at Eb/N0 value of 4.5 dB. [ABSTRACT FROM AUTHOR]

Nowadays, Power Line Communication (PLC) is increasingly recognized as a serious alternative to broadband data transmission in several contexts such as Smart Grids. However, PLC systems performances suffer mainly from impulsive noise which is a consequence of impedance-level variation and attenuation. In this paper, we propose a very promising PLC system structure for an efficient impulsive noise mitigation with a view to novel access technologies such as 5G. The proposed solution takes advantage of a turbo-coded PAPR-efficient FBMC modulation and channel equalization. Simulation tests showed that the proposed method achieves a distinct enhancement in the PAPR performance compared to other existing methods without affecting the BER performance. The proposed solution, thus, stands for a serious candidate for reliable transmissions in the presence of PLC channel impairments and multipath effect. [ABSTRACT FROM AUTHOR]

Channel coding is a fundamental procedure in wireless telecommunication systems and has a strong impact on the data transmission quality. This effect becomes more important when the transmission must be characterised by low latency and low bit error rate, as in the case of vehicle-to-everything (V2X) services. Thus, V2X services must use powerful and efficient coding schemes. In this paper, we thoroughly examine the performance of the most important channel coding schemes in V2X services. More specifically, the impact of use of 4th-Generation Long-Term Evolution (4G-LTE) turbo codes, 5th-Generation New Radio (5G-NR) polar codes and low-density parity-check codes (LDPC) in V2X communication systems is researched. For this purpose, we employ stochastic propagation models that simulate the cases of line of sight (LOS), non-line of sight (NLOS) and line of sight with vehicle blockage (NLOSv) communication. Different communication scenarios are investigated in urban and highway environments using the 3rd-Generation Partnership Project (3GPP) parameters for the stochastic models. Based on these propagation models, we investigate the performance of the communication channels in terms of bit error rate (BER) and frame error rate (FER) performance for different levels of signal to noise ratio (SNR) for all the aforementioned coding schemes and three small V2X-compatible data frames. Our analysis shows that turbo-based coding schemes have superior BER and FER performance than 5G coding schemes for the vast majority of the considered simulation scenarios. This fact, combined with the low-complexity requirements of turbo schemes for small data frames, makes them more suitable for small-frame 5G V2X services. [ABSTRACT FROM AUTHOR]

Differential spatial modulation uses the antenna index to transmit information, which improves the spectral efficiency, and completely bypasses any channel side information in the recommended setting. A generalized distributed multiple turbo coded-cooperative differential spatial modulation based on distributed multiple turbo code is put forward and its performances in Rayleigh fading channels is analyzed. The generalized distributed multiple turbo coded-cooperative differential spatial modulation scheme is a coded-cooperation communication scheme, in which we proposed a new joint parallel iterative decoding method. Moreover, the code matched interleaver is considered to be the best choice for the generalized multiple turbo coded-cooperative differential spatial modulation schemes, which is the key factor of turbo code. Monte Carlo simulated results show that the proposed cooperative differential spatial modulation scheme is better than the corresponding non-cooperative scheme over Rayleigh fading channels in multiple input and output communication system under the same conditions. In addition, the simulation results show that the code matched interleaver scheme gets a better diversity gain as compared to the random interleaver. [ABSTRACT FROM AUTHOR]

Copyright of Space-Integrated-Ground Information Networks is the property of Beijing Xintong Media Co., Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

This paper discusses the results of simulations relating to the performances of turbo codes, low density parity check (LDPC) codes, and polar codes over an additive white Gaussian noise (AWGN) channel in the presence of inter symbol interference, denoting the disturbances that altered the original signal. To eliminate the negative effects of inter symbol interference (ISI), an equalizer was used at the level of the receiver. Practically, two types of equalizers were used: zero forcing (ZF) and minimum mean square error (MMSE), considering the case of perfect channel estimation and the case of estimation using the least square algorithm. The performance measure used was the modification of the bit error rate compared to a given signal to noise ratio; in this sense, the MMSE equalizer offered a higher performance than the ZF equalizer. The aspect of channel equalization considered here is not novel, but there have been very few works that dealt with equalization in the context of the use of turbo codes, especially LDPC codes and polar codes for channel coding. In this respect, this research can be considered a contribution to the field of digital communications. [ABSTRACT FROM AUTHOR]

Although radio frequency (RF) systems have been developed at a level that can operate almost within theoretical limits in terms of spectral efficiency due to increasing demands, the RF spectrum allocated for wireless mobile communication has started to fill up rapidly and become insufficient. Visible light communication (VLC), one of the optical wireless communication systems, stands out as a promising technology that can be an alternative to RF technology in some application areas and can help meet the demands by playing a complementary role in some application areas. However, VLC systems face the flickering problem. In this study, it is proposed to combine the double binary Turbo coding (DBTC) technique with color shift keying (CSK) modulation, which does not have a flickering problem, as a solution to the flicker problem of VLC systems. The proposed combined DBTC-CSK method is tested on optical OFDM systems from multi-carrier wireless communication systems. Monte-Carlo simulations are performed to verify the performance of the proposed DBTC-CSK-OFDM system in terms of bit-error-rate (BER) over AWGN channel, single-path optical LOS channel and multi-path optical channel. According to the simulation results it is observed that, DBTC-CSK-OFDM system has better BER performance than that of RS–CC coded CSK-OFDM and un-coded CSK-OFDM systems, providing 5.5 dB and 14 dB SNR gain at multi-path optical channel environments, respectively. [ABSTRACT FROM AUTHOR]

The wide application of the Internet of Things (IoT), large-scale satellite clusters and drone clusters requires multiple access capabilities for massive devices. In order to meet the high-capacity and low-latency access requirements in application scenarios such as the IoT, this paper proposes to apply sparse code multiple access (SCMA) technology to the massive terminal access of the IoT, focusing on the study of SCMA decoding algorithm. Aiming at the high complexity of its traditional decoding algorithm, a decoding algorithm based on codeword reliability is proposed. The algorithm reduces the number of codeword iterations with higher reliability by setting a threshold to reduce the algorithm complexity. The simulation results show that the algorithm reduces the complexity of the algorithm while the loss of bit error rate performance is very small. Then, aiming at the poor bit error rate performance of SCMA technology under the condition of low signal-to-noise ratio, a joint coding and decoding simulation link based on soft input and soft output Turbo code and SCMA technology is proposed. The simulation results prove that Turbo codes can speed up the convergence speed of the decoding algorithm. When the SNR is 4 dB, the bit error rate of the joint system has been reduced to below 10e-3, which has obvious advantages compared with the SCMA system without Turbo coding. Therefore, the two methods proposed in this paper can be used for the high-capacity demand of the IoT communication system. [ABSTRACT FROM AUTHOR]

Copyright of Computer Measurement & Control is the property of Magazine Agency of Computer Measurement & Control and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Convolutional codes form an important class of codes that have memory. One natural way to study these codes is by means of input state output representations. In this paper we study the minimum (Hamming) weight among codewords produced by input sequences of weight two. In this paper, we consider rate 1=n and use the linear system setting called (A; B;C; D) input-state-space representations of convolutional codes for our analysis. Previous results on this area were recently derived assuming that the matrix A, in the input-state-output representation, is nonsingular. This work completes this thread of research by treating the nontrivial case in which A is singular. Codewords generated by weight-2 inputs are relevant to determine the effective free distance of Turbo codes. [ABSTRACT FROM AUTHOR]

This study presents two reconfigurable turbo/low-density parity-check (LDPC) decoding kernels for the two powerline communication standards, HomePlug and G.hn. Two architectures are presented, both of which use the radix-4 double-binary enhanced max-log maximum a posteriori probability algorithm with next-iteration initialization in turbo decoding. In LDPC decoding, the two architectures employ the normalized min-sum and the layered radix-4 forward and backward algorithms. The two algorithms cause differences in the architecture and throughput rate. Consequently, the proposed decoding kernels have different architectures when combined with the turbo decoding algorithm, and the two proposed decoding kernels each have their own advantages and disadvantages in terms of throughput and area cost. To make the features of two kernels more evident, we have implemented the proposed decoding kernels that lead to significant throughput gains and better area efficiency compared with other studies. The proposed decoding kernels can be operated in all modes specified in the HomePlug and G.hn standards using a 40-nm complementary metal-oxide-semiconductor (CMOS) process. Moreover, the proposed decoding kernels provide different solutions to achieve the expected throughput rates of the G.hn and HomePlug standards. [ABSTRACT FROM AUTHOR]

This article presents the performance analysis and comparison of turbo codes for several interleavers with short blockchains. According to the symmetry concept, turbo codes consist of two symmetric convolutional codes preceded by an interleaver. Some interleavers can be described by symmetric 3 × 3 generator matrices, whereas others are represented through symmetric matrices in which the nonzero terms in the matrix are monomials. Interest in short blockchains has grown over the years because of their use in emerging applications that require the transmission of data units in the order of hundred bits. In this research, interleavers used are random interleaver, semi-random interleaver, quadratic polynomial permutation (QPP) interleaver, and chaotic Lozi map interleaver. For each interleaver, the turbo code is assessed with at least two short data distances; then, the interleavers are compared against each other. The performance of turbo codes is assessed based on bit error rate, particularly with lengths between 64 and 512 bits. Additionally, an interleaver based on Duffing chaotic maps is proposed, whose deterministic nature provides an advantage, and the performance results are presented, achieving excellent BER values for 64 bits. With these results, the effect of the interleaver on turbo codes and particularly on short block length interleavers, is studied. [ABSTRACT FROM AUTHOR]