Results 291 to 300 of about 2,501,833 (347)
Some of the next articles are maybe not open access.
1999 Information Theory and Networking Workshop (Cat. No.99EX371), 2003
Random coding applied to blocks of size k offers minimum distances as large as k/4 roughly, but is not decodable in practice. We propose a decodable multidimensional extension of classical two-dimensional turbo codes, giving minimum distances comparable to those of random codes.
Berrou, Claude +2 more
openaire +3 more sources
Random coding applied to blocks of size k offers minimum distances as large as k/4 roughly, but is not decodable in practice. We propose a decodable multidimensional extension of classical two-dimensional turbo codes, giving minimum distances comparable to those of random codes.
Berrou, Claude +2 more
openaire +3 more sources
A 2.15GBit/s turbo code decoder for LTE advanced base station applications
International Symposium on Turbo Codes and Iterative Information Processing, 2012The LTE standard [1], will soon be upgraded to LTE advanced, which will add new techniques like multi user MIMO using iterative demodulation, cooperative multi point reception (CoMP) and beam forming to increase the system throughput in the uplink of one
T. Ilnseher, F. Kienle, C. Weis, N. Wehn
semanticscholar +1 more source
Turbo Code-Based Error Correction Scheme for Dimmable Visible Light Communication Systems
IEEE Photonics Technology Letters, 2012This letter presents an error correction scheme for dimmable visible light communication systems. To provide dimming control of on-off keying, the proposed coding scheme yields a codeword with the codeword weight adapted to the dimming requirement.
Sang Hyun Lee, J. Kwon
semanticscholar +1 more source
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), 2002
We prove the existence of thresholds for turbo codes and we prove concentration of the performance of turbo codes within the ensemble determined by the random interleaver. In effect, we show that the results obtained for low-density parity-check codes extend to turbo codes.
Richardson, T., Urbanke, R.
openaire +3 more sources
We prove the existence of thresholds for turbo codes and we prove concentration of the performance of turbo codes within the ensemble determined by the random interleaver. In effect, we show that the results obtained for low-density parity-check codes extend to turbo codes.
Richardson, T., Urbanke, R.
openaire +3 more sources
An Improved Rate Matching Algorithm for 3GPP LTE Turbo Code
2011 Third International Conference on Communications and Mobile Computing, 2011Long Term Evolution (LTE) describes the standardization work by the Third Generation Partnership Project (3GPP) to define a new high-speed radio access method for mobile communications systems. Rate Matching (RM) is an essential component in the adaptive
Long Yu, Xu Wang, Jian Liu
semanticscholar +1 more source
A 150Mbit/s 3GPP LTE Turbo code decoder
Design, Automation and Test in Europe, 20103GPP long term evolution (LTE) enhances the wireless communication standards UMTS and HSDPA towards higher throughput. A throughput of 150 Mbit/s is specified for LTE using 2×2 MIMO.
Matthias May +3 more
semanticscholar +1 more source
, 2015
The parallel encoding and decoding structure of turbo codes makes them natural candidate for coded-cooperative scenarios. In this paper, we focus on one of the key components of turbo codes i.e., interleaver, and analyze its effect on the performance of ...
S. Ejaz, Fengfan Yang
semanticscholar +1 more source
The parallel encoding and decoding structure of turbo codes makes them natural candidate for coded-cooperative scenarios. In this paper, we focus on one of the key components of turbo codes i.e., interleaver, and analyze its effect on the performance of ...
S. Ejaz, Fengfan Yang
semanticscholar +1 more source
Reconstruction of a turbo-code interleaver from noisy observation
2010 IEEE International Symposium on Information Theory, 2010We propose in this paper an algorithm to recover the interleaver of an unknown turbo encoder by observing noisy codewords. Our technique is practical but is limited to rate 1/3 turbo-code using two unpunctured rate 1/2 systematic convolutional encoders.
M. Côte, N. Sendrier
semanticscholar +1 more source
DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligence
arXiv.orgWe present DeepSeek-Coder-V2, an open-source Mixture-of-Experts (MoE) code language model that achieves performance comparable to GPT4-Turbo in code-specific tasks. Specifically, DeepSeek-Coder-V2 is further pre-trained from an intermediate checkpoint of
DeepSeek-AI +39 more
semanticscholar +1 more source
Iterative (turbo) soft interference cancellation and decoding for coded CDMA
IEEE Transactions on Communications, 1999The presence of both multiple-access interference (MAI) and intersymbol interference (ISI) constitutes a major impediment to reliable communications in multipath code-division multiple-access (CDMA) channels.
Xiaodong Wang, H. Poor
semanticscholar +1 more source