The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we investigate the combinatorial design of a new class of One-Step Majority-Logic Decodable (OSMLD) codes, based on Balanced Incomplete Block Designs of type Oval, which are derived from finite geometry. We show that the constructed OSMLD codes provides high rates in addition to good correction capacities. Simulation results shows that the proposed codes converge well under iterative...
The Bit-Flipping (BF) algorithm is considered as a hard decoding method for LDPC codes. It is much simpler than the probabilistic methods like Sum Product Algorithm (SPA), and can be efficiently implemented by electronic circuits. In this paper, we propose a new Bit Flipping algorithm for Low-Density Parity-Check codes (LDPC) called Single Bit-Flipping (SBF). Compared to the Gallager Bit-Flipping...
This paper presents an energy-efficient symmetric block-wise concatenated-BCH (SBC-BCH) decoder architecture for energy-starving mobile storages. The proposed 4KB SBC-BCH code remarkably enhances the hard-decision-based error-correcting performance to defer the energy-consuming memorysensing operations for generating the soft-decision values, which are necessary to prolong the lifetime of flash memories...
The present paper has considered multithreshold decoders for self-orthogonal codes providing a near-optimal efficiency of the error correction under linear computational complexity. New divergence principle used within construction and decoding convolutional codes has been discussed. The paper has shown that usage of such principle allows significantly approximating an area of the decoder effective...
In this paper we are interested to the decoding of blocks turbo codes constructed from Reed Solomon (RS) codes. We have modified the iterative algorithm proposed by Chase in order to exploit the a priori information provided by a correlated source. Indeed, some sources such as images have a strong correlation. A simple iterative decoding algorithm does not take this feature into account. The choice...
This paper presents a non-binary finite-stat Markov channel (FSMC) that captures both the soft-decision information and the temporal correlation of a discrete fading channel (DFC) with 2ξ quantization levels. The parameters of the FSMC that approximate the DFC with fixe parameters are found using the Baum-Welch algorithm. An iterative decoding scheme, based on the sum-product algorithm, is also discussed...
The ADMM based linear programming (LP) technique shows interesting error correction performance when decoding binary LDPC block codes. Nonetheless, it's applicability to decode LDPC convolutional codes (LDPC-CC) has not been yet investigated. In this paper, a first flooding based formulation of the ADMM-LP for decoding LDPC-CCs is described. In addition, reduced complexity decoding schedules to lessen...
Deep learning recently shows strong competitiveness to improve polar code decoding. However, suffering from prohibitive training and computation complexity, the conventional deep neural network (DNN) is only possible for very short code length. In this paper, the main problems of deep learning in decoding are well solved. We first present the multiple scaled belief propagation (BP) algorithm, aiming...
In this paper, as a basic study for combination of turbo equalizer and 4D-8PSK-TCM (4 Dimensional 8 Phase Shift Keying Trellis Coded Modulation) system, which is recommended for X-band band satellite communication in CCSDS, a system combining 8PSK-TCM system and turbo equalizer has been designed and performance evaluation of the system has been performed. BER performance of 8PSK and 8PSK-TCM systems...
The full potential of multiple-input multiple-output (MIMO) wireless technology can be achieved through iterative MIMO decoding with soft information. In iterative MIMO decoder, the complexity can be major obstacle for practical implementation. The soft interference cancellation-minimum mean squared error (SIC-MMSE) approach for detection is considered as a feasible approach due to its complexity-performance...
Sparse-code multiple-access (SCMA) is a novel multiplexing method to increase the capacity of wireless communication systems. By giving users non-orthogonal codebook with few non-zero entries, the SCMA approach can highly improve the spectral efficiency, compared with traditional orthogonal ones such as CDMA, with tolerable detection complexity. Therefore, it has been considered as an option for 5G...
Low-density parity check (LDPC) codes are a mature coding scheme in telecommunications and the low power implementation of corresponding decoders is an issue of significant importance for receivers with stringent power budgets. This paper presents a power reduction technique for LDPC decoders that further extends their energy-proportional behavior, obtained with early-termination (ET), by predicting...
Low-density parity-check (LDPC) coded massive multiple-input and multiple-output (MIMO) scheme is getting increasingly popular and sophisticated in today's wireless communication systems, since it can highly improve the spectral efficiency, data rates, and error performance. In this paper, a novel iterative detection and decoding (IDD) method for LDPC-coded massive MIMO systems is proposed. Based...
This paper presents a new high-throughput, low-complexity Bit Flipping (BF) decoder for Low-Density Parity-Check (LDPC) codes on the Binary Symmetric Channel (BSC), called Probabilistic Parallel Bit Flipping (PPBF). The advantage of PPBF comes from the fact that, no global operation is required during the decoding process and from that, all of the computations could be parallelized and localized at...
The continuing trend towards higher data rates in wireless communication systems will, in addition to a higher spectral efficiency and lowest signal processing latencies, lead to throughput requirements for the digital baseband signal processing beyond 100 Gbit/s, which is at least one order of magnitude higher than the tens of Gbit/s targeted in the 5G standardization. At the same time, advances...
The conventional infinite-length extrinsic information transfer (EXIT) charts would not be accurate for short-length coded systems, because short-length coded sequences do not possess ergodicity as infinite-or very-long length coded sequences. In this paper, we concern with the finite-length EXIT analysis, which is developed for protograph low-density parity-check (PG-LDPC) codes over underwater acoustic...
The Parity check Transformation Algorithm (PTA) is a recently developed symbol wise soft decision decoding algorithm for Reed Solomon codes. The algorithm has been shown in literature to outperform widely used Reed Solomon decoders including the Koetter and Vardy (KV) algorithm. The PTA gets its name from the fact that it transforms the parity check matrix of the Reed Solomon code after every iteration...
Model of Turbo-Product Codes decoder architecture and method for construction of Turbo-Product Codes decoder are proposed in the paper. The model describes decoder functioning taking into account limitations of hardware platform and proposes re-use of components in the decoding process. The method provides set of steps for decoder implementation. Field-Programmable Gate Arrays circuits are selected...
Increasing data traffic and multimedia services in recent years have paved the way for the development of optical transmission methods to be used in high bandwidth communications systems. In order to meet the very high throughput requirements, dedicated application specific integrated circuit and field programmable gate array solutions for low-density parity-check decoding are proposed in recent years...
In this paper a log-MAP turbo decoding algorithm which incorporates reliability threshold based trellis branch elimination together with mean based early iteration termination has been proposed. The proposed algorithm reduces computational complexity by eliminating branches in trellis. Since the minimum Log Likelihood Ratio (LLR) obtained for each iteration varies with channel conditions, an early...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.