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.
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...
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...
A node-wise (NS) schedule has been recently proposed for decoding LDPC codes with the linear programming (LP) decoding approach, based on the alternate direction method of multipliers (ADMM). It improves the error correction performances as well as the convergence speed of the ADMM-LP decoder. However, it suffers from a high computational complexity resulted from residuals calculation. In this paper,...
With the growing development of video applications and services for mobile devices, saving energy consumption when managing video is becoming a more and more important issue. The challenge is then to deliver video with high quality while reducing the energy consumption. In this paper, we investigate the relationship between subjective video quality and energy consumption in an HEVC decoder. By reducing...
Syndrome coding is a very classical coding scheme in Physical layer security. It is necessary to design a efficient and secure code for syndrome coding to guarantee the security of the instant communications. In this paper, we apply two ways to construct random codes. By analysing on the effect of the parity check matrix on the average equivocation, we propose a method to generate the best random...
LDPC codes have been applied in recent communication standards, such as WiFi, WiGig, and 10GBased-T Ethernet as a forward error correction code. However, LDPC codes require a large number of computational complexity for high performances. To solve this problem, various studies have been continuously performed for reducing computational complexity. In this paper, we propose an adaptive forced convergence...
Sphere decoding (SD) is an efficient algorithm for Multiple-input Multiple-output (MIMO) digital communications. It has been showed to achieve near Maximum Likelihood (ML) performance with low complexity. However, the complexity of conventional SD algorithm is high under the specific environment. The performance and the computation complexity of SD algorithm is highly dependent on the initial choice...
The task of the definition of an a priori unknown Error Correcting code is one of the major tasks for governmental radio control authorities. In particular, the case of the choice of the most probable ECC from the predefined ECCs set. The SA-method (Syndromes analysis method) is suggested to solve the issue. This method is based on the sequences syndrome analysis. Here are given basic results, which...
The extended min-sum (EMS) algorithm for decoding low-density parity-check codes over the finite field with q elements significantly reduces decoding complexity by truncating each message of length q into a message of effective length nm. The number of effectively dominant components in each truncated message may gradually decrease with the number of decoding iterations. Based on this observation,...
A channel W is said to be input-degraded from another channel W′ if W can be simulated from W′ by randomization at the input. We provide a necessary and sufficient condition for a channel to be input-degraded from another one. We show that any decoder that is good for W′ is also good for W. We provide two characterizations for input-degradedness, one of which is similar to the Blackwell-Sherman-Stein...
To achieve high data rates, reliable data rate transmission and near capacity performance for future wireless communication systems iterative processing has been widely considered. However, such an efficient receiver design has been made significant challenge. In this paper, multiple-input multiple output (MIMO) detection with channel decoding techniques has been investigated for achieve reliable...
Random Linear Network Coding (RLNC) is a popular coding scheme to improve communication over lossy channels. For packet streaming applications (video streaming, general IP streams), recent research has shown that sliding window schemes can improve in-order delay properties compared to the block/-generation based coding. However, implementing sliding window RLNC with a limited coding window poses new...
Sphere decoding(SD)is an efficient algorithm which has been proposed in Multiple input Multiple output (MIMO) digital communication. Sphere decoding algorithm is based on the rule of maximum likelihood decoding algorithm, But SD algorithm does not like ML algorithm to retrieve all of the lattice. However, SD in some environment complexity is very high. The complexity of the SD is controlled by radius...
In this work, we consider a variant of the set reconciliation problem where the estimate for the size of the symmetric difference may be inaccurate. Given this setup, we propose a new method to reconciling sets of data and we then compare our method to the Invertible Bloom Filter approach proposed by Eppstein et al. [2].
the complexity of sphere detection algorithm is high when the Signal to Noise Ratio (SNR) is low. For this problem, a new type of detection algorithm of sphere decoder is proposed. The new algorithm reduces the radius of sphere when the SNR is low by using the Minimum Mean Square Error (MMSE) algorithm and a compressibility factor. With the result of simulation, It shows that when the SNR is less...
Convolutional encoders and Viterbi decoders are the most commonly used channel encoders/decoders used for efficient extraction of message bits. Convolutional encoder used EXOR gates for generating the code bits. Conventional Viterbi decoders use Trellis diagrams for extracting the message bits. Architecture of Viterbi decoder includes Branch Metric Unit (BMU), Path Metric Unit (PMU) and SurvivorMemory...
Due to the inherent intersymbol interference (ISI), the detection for faster-than-Nyquisy (FTN) signaling is long considered to be a challenging problem. In this paper, we study three equalization and detection schemes in terms of their performance and computational complexity for FTN signaling system. The first one is the widely employed optimal maximum a posterior (MAP) equalization implemented...
A lot of research has been done on efficient implementation of RS code encoders and decoders as VLSI chips. However, none of them tries to seek a unified approach for solution to obtain VLSI hardware for RS encoders and decoders which can be easily configured for use across a large set of application areas with varying specifications. In this paper, a novel parallel RS decoding algorithm suitable...
Document is unavailable: This DOI was registered to an article that was not presented by the author(s) at this conference. As per section 8.2.1.B.13 of IEEE's "Publication Services and Products Board Operations Manual," IEEE has chosen to exclude this article from distribution. We regret any inconvenience.
In this paper we study the problem of increasing the decoding success probability of random linear fountain code over GF (2) for small packet lengths used in delay-intolerant applications such as multimedia streaming. Such code over GF (2) are attractive as they have lower decoding complexity than codes over larger field size, but suffer from high transmission redundancy. In our proposed coding scheme...
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.