Results 101 to 110 of about 4,741 (155)
Protocol for validating computationally predicted splice-altering variants using full-length gene reporter assays. [PDF]
STAR ProtocLukes ME +3 more
europepmc +1 more source
Efficient FPGA implementation of polar codes-based information reconciliation for quantum key distribution. [PDF]
Sci RepLiao L +10 more
europepmc +1 more source
A universal protein ladder for standardisation of diverse FRET assays
Smith ER +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Hybrid Decoder for Block Turbo Codes
IEEE Transactions on Communications, 2009We propose a novel iterative decoder for block turbo codes (BTCs). The proposed decoder combines soft-input/softoutput (SISO) and hard-input/hard-output (HIHO) constituent decoders in order to obtain better error performance and reduce the computational complexity compared to classical BTC decoders. We show that the new decoder, called 'hybrid decoder',
Arafat Al-Dweik +2 more
openaire +2 more sources
Reduced-search SOVA for block turbo codes
IEEE International Conference on Communications, 2003. ICC '03., 2004In this paper, we propose an efficient reduced-search SOVA (soft output Viterbi algorithm) for block turbo codes. To reduce complexity, the decoder selects a part of the existing paths using the statistics of the path metrics. In addition, we compensate for the performance degradation incurred from soft output values at the parity part of the trellis ...
Sooyoung Kim 0001, Deockgil Oh
openaire +1 more source
How we implemented block turbo codes?
Annales Des Télécommunications, 2001This paper presents a block turbo decoding algorithm, from its theory to its implementation in a programmable circuit. In this study, we discuss the two prototypes realized. It will be possible to compare the complexity of the core of the process, which is the elementary decoder, thanks to the choice of essential parameters.
Kerouedan, Sylvie +2 more
openaire +3 more sources
Block Turbo Codes: From Architecture to Application
2006 IEEE International Symposium on Information Theory, 2006This paper is concerned with the design of block turbo codes for very high bit rate applications. We first introduce an original low-complexity architecture designed for the iterative decoding of product codes. The implementation of the Chase-Pyndiah algorithm is simplified by not memorizing any of the list decoding concurrent code words.
Benoit Geller +4 more
openaire +1 more source
Combined turbo equalisation and block turbo coded modulation
IEE Proceedings - Communications, 2003The combination of equalisation and turbo decoded M-QAM is studied. In a system of block turbo coding based on iterative decoding of a product code, equalisation is incorporated in the decoding iteration loop. Most research in this area has considered the trellis equaliser. When using a high throughput modulation trellis equalisation is impossible. The
M. Noorbakhsh, K. Mohamed-Pour
openaire +1 more source
Block turbo codes for magnetic recording channels
2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record, 2002Block turbo codes have been shown to have near-optimum performance and lower decoding complexity than convolutional turbo codes for additive white Gaussian noise (AWGN) channels. In this paper we discuss the applicability of block turbo codes to partial-response (PR) equalized Lorentzian channels for magnetic recording.
Hongxin Song, J. R. Cruz
openaire +1 more source
An efficient decoding algorithm for block turbo codes
IEEE Transactions on Communications, 2001Summary: An efficient soft-input soft-output iterative decoding algorithm for block turbo codes (BTCs) is proposed. The proposed algorithm utilizes Kaneko's decoding algorithm for soft-input hard-output decoding. These hard outputs are converted to soft decisions using reliability calculations.
Sameep Dave +2 more
openaire +2 more sources