Results 251 to 260 of about 178,509 (285)
Some of the next articles are maybe not open access.
A flexible LDPC decoder architecture supporting two decoding algorithms
Proceedings of 2010 IEEE International Symposium on Circuits and Systems, 2010In this paper a programmable and area-efficient decoder architecture supporting two main stream decoding algorithms for any Block-LDPC codes is presented. The novel decoder can be configured to decode in either TPMP or TDMP decoding mode according to different Block-LDPC codes. To verify our proposed architecture, a flexible LDPC decoder which supports
Shuangqu Huang +4 more
openaire +1 more source
Encoding and decoding algorithms for LP-decodable multipermutation codes
2015 IEEE Information Theory Workshop (ITW), 2015LP-decodable multipermutation codes are a class of multipermutation codes that can be decoded using linear programming (LP). These codes are defined using linearly constrained multipermutation matrices, which are binary matrices that satisfy particular row sum and column sum constraints.
Xishuo Liu, Stark C. Draper
openaire +1 more source
1997
In this tutorial paper we present iterative algorithms which can be used for decoding of concatenated codes. The decoding operation is based on either a maximum a posteriori (MAP) algorithm or a Viterbi algorithm generating a weighted soft estimate of the input sequence.
openaire +1 more source
In this tutorial paper we present iterative algorithms which can be used for decoding of concatenated codes. The decoding operation is based on either a maximum a posteriori (MAP) algorithm or a Viterbi algorithm generating a weighted soft estimate of the input sequence.
openaire +1 more source
Adaptive Iterative Turbo Decoding Algorithm
2006 IEEE 63rd Vehicular Technology Conference, 2006Turbo decoding has large iteration delay. Based on tail bits of turbo codes, a low-complexity adaptive iterative decoder is proposed for turbo codes in this paper. In the proposed algorithm, tail bits work as CRC bits to detect whether the decoding succeeds or not.
null Jian Gu +3 more
openaire +1 more source
New automatic SPI decoding algorithm
2012 10th International Symposium on Electronics and Telecommunications, 2012In this paper is presented a new method how to decode SPI signals. The signals are viewed and acquisitioned with an oscilloscope, after that the signals is transferred to the PC through Ethernet interface and decoded with the application using this algorithm.
Roland Szabo, Ioan Lie
openaire +1 more source
Low complexity sphere decoding algorithms
2008 IEEE International Symposium on Wireless Communication Systems, 2008The complex sphere decoding algorithm has optimal bit error ratio performance for uncoded multiple-input multiple-output (MIMO) systems. The computational and hardware complexities of this algorithm increase significantly for detection of 64-QAM modulated signal streams.
Ramin Shariat-Yazdi, Tad Kwasniewski
openaire +1 more source
Traceback-enhanced MAP decoding algorithm
2004 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2004Soft-input soft-output algorithms are the principal component of the iterative decoding used in turbo codes and other 'turbo' feedback schemes. To enable efficient implementation, especially on energy constrained platforms such as portable devices, it is crucial to reduce the computational complexity to a minimum.
C. Schurgers, A. Chandrakasan
openaire +1 more source
Optimizing the pre-decoding algorithm
SPIE Proceedings, 2007Considering the coding-excitation technology applied in ultrasonic systems, pre-decoding by multi-center before beam-synthesis is recognized as the best method for decoding. Compared with the method of decoding after synthesizing, the former avoids the inferior quality of side-lobe performance invited by beam-synthesis (the attenuation is more than ...
Jun He, Song Han, Ziqiang Han
openaire +1 more source
Decoding Google's PageRank Algorithm
A comprehensive analysis reviews Google’s PageRank development alongside its AI-based ranking technologies and behavior data integration systems for better search result algorithms. This research compares user interactions between organic search results and sponsored listings, analyzes the evolution from PageRank to AI-driven algorithms like RankBrain ...Moksh Desarda, Abhishek Raj Bharti
openaire +1 more source
Iterative decoding algorithm of lattices
Canadian Conference on Electrical and Computer Engineering 2004 (IEEE Cat. No.04CH37513), 2004The so-called min-sum algorithm for iterative decoding of low-density parity-check (LDPC) codes is generalized to decode lattices. An upper bound on the decoding complexity per iteration is derived, and for LDPC lattices constructed by Construction D' and using a nested sequence of LDPC codes, exact values for computational complexity are also given ...
M.R. Sadeghi +2 more
openaire +1 more source