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.
This study proposes a novel coding method, called geometry permutation decoding (GPD). The GPD algorithm provides a two dimension geometry construction and decodes information sequence based on this construction. Majority logic decoding (MLD) algorithm can be used for some specially coding scheme, especially finite geometry codes. MLD algorithms are simple and fast owing to the finite geometry construction,...
In this paper, the belief propagation (BP) based approximation methods which are introduced for low density parity check (LDPC) codes in literature are adapted to the Raptor decoder structure in order to reduce its computational complexity. The bit error rate (BER) performances of the algorithms over the additive white Gaussian noise (AWGN) channel are obtained by both theoretical works and simulations...
Characterization of a Sparse Code Multiple Access (SCMA) decoder is performed to measure its error performance and its time and hardware implementation complexity. SCMA is a non-orthogonal technique proposed to support massive connectivity in future 5G wireless telecommunication systems. The reported SCMA decoder is based on the Message Passing Algorithm (MPA). The complexity of SCMA decoding is characterized...
By analyzing a new generation of agile earth-observing satellite scheduling problem, a hybrid integer programing model was established according to the problem's characteristics of multi-selection and combinatorial optimization. A hybrid coding method combining binary and integer coding was put forward under the framework of genetic algorithm, and the corresponding genetic operators and heuristic...
The article discusses self-orthogonal error-correcting codes (SOC) for the decoding of which multithreshold algorithms (MTD) are usually used. To decode SOC the algorithms used for low-density parity-check (LDPC) codes can also be applied. The article shows that using a min-sum decoder for SOC over a channel with additive white Gaussian noise (AWGN) in case of binary phase shift keying allows to receive...
This paper analyzes the spectral efficiency, probability of a lost block and average delay performances of the generic Repetition Redundancy (RR) and Incremental Redundancy (IR) truncated Hybrid-Automat Repeat reQuest (H-ARQ) algorithms on block-faded Rayleigh channels. The analysis presents the derivation of the three performance metrics' expressions, using an intermediate performance metric called...
In this paper we propose a very simple but powerful self-correction method for the UMP-APP decoding of LDPC codes. Like self-corrected min-sum decoding, our method does not try to correct the check node processing approximation, but it modifies the variable node processing by erasing unreliable messages. Monte-Carlo simulations show that the proposed self-corrected UMP-APP decoding performs better...
Channel coding for the next generation communication system needs to support higher data throughput and transmission rate. Due to the inherent parallel feature, low density parity check (LDPC) codes comply with the target. In this paper, we propose a complete channel coding scheme based on structured LDPC codes. In our design, the correlation among different parity check matrices for different code...
A multiplier requires an Adder circuitry to add carry of previous result to next stage to form partial products and to get final result of multiplication. This paper presents a novel way to implement Line Multiplier without using Adders. The Adder-less Multiplier is implemented on both CMOS and FPGA platforms. In ASIC paradigm CMOS 90nm technology and on FPGA platforms Spartan-3 have been used for...
In this paper, a design methodology for MBIST (Memory Built In Self Test) which has a feature of executing multiple March algorithms to detect faults is proposed. SOCs have a wide range of memories. It is not possible to test different memory modules of a SOC with a single algorithm. Hence it is desirable to have a programmable MBIST controller capable of executing multiple test algorithms. The proposed...
Polar codes have become one of the most attractive topics in coding theory community because of their provable capacity-achieving property. Belief propagation (BP) algorithm, as one o f the popular approaches for decoding polar codes, has unique advantage of high parallelism but suffers from high computation complexity, which translates to very large silicon area and high power consumption. This paper,...
Modern digital communication systems can benefit from soft-decision algorithms in receiver implementations. Such algorithms require reliability information about every data bit which is typically given in terms of Log-Likelihood Ratios (LLRs) or short L-Values. Several efficient receiver implementations based on L-Values have already been proposed in the literature. Many of them exploit the famous...
This paper considers multilevel multithreshold decoder for a self-orthogonal codes. Simulation results for an AWGN channel are reported. New modifications of this decoder provided coding gain improving by a few tenths of dB due to better using of the bits soft information are offered. Recommendations to choose the best algorithms of constituting blocks of the multilevel multithreshold decoder and...
We consider the advanced digital noncoherent demodulator of "integrally" coded binary phase-shift keyed signals. This demodulator requires carrying out the minimum simple arithmetic operations over the input signal period. We study its noise immunity, and we show that for relatively short codes “integrally” demodulation leads to considerable gain in comparison with step-by-step demodulation...
Due to their impressive error correction performances, Error Correcting Codes (ECC) are now widely used in communication systems. In order to achieve high throughput requirements ECC decoders are based on parallel architectures, which results in a major issue: memory access conflicts. In this paper, we introduce a new class of ECC decoder architectures that dynamically reconfigures by executing on-chip...
This paper is based on cyclic redundancy check based encoding scheme. High throughput and high speed hardware for Golay code encoder and decoder could be useful in digital communication system. In this paper, a new algorithm has been proposed for CRC based encoding scheme, which devoid of any linear feedback shift registers (LFSR). In addition, efficient architectures have been proposed for both Golay...
Today it is very necessary to protecting Sensitive information from external world. To protecting sensitive information now a day's barcode technique is used. In the real world many industries are using the technique to protect sensitive information form external parties. This paper contains the algorithm which helps to protect the sensitive information. This proposed algorithm is useful to hiding...
This project aims to develop an Android application which performs arithmetic encoding and decoding. The application is mainly developed for learning purpose. Arithmetic coding is superior in most respects to the commonly used Huffman method. Its performance is efficient without the need of high number of data bits. The application comprises of five inputs which includes the probabilities of four...
In order to familiarize and comprehend the learning of Huffman algorithm in a simpler way, we have implemented Huffman algorithm in Julia language which can be visualized in an interactive platform called IJulia supported by Jupyter and it creates a learning platform that increases the understanding of the coding technique for students. It involves a set of commands that are understandable and familiar...
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.