Location:
Search - interleavers
Search list
Description: GSM TCH/FS 信道编码仿真
仿真通信系统包括内外编码器、交织重排器、加性/突发或混合干扰信道、去交织反重排器、内外译码器，模拟了信息从信源到信宿的全过程；
在高斯噪声、突发干扰或混合信道下测试每个步骤对误码率和系统性能的影响，通过数字及图形的比较，得出通信系统中各个模块的作用。-GSM TCH/FS channel coding simulation Simulation of communication systems, including internal and external encoder, interleaving rearrangement, and additive/sudden or mixed channel interference, de-interlacing anti-rearrangement, and internal and external decoder, analog information from the source to the letter places the entire process in Gaussian noise, sudden disruption or mixed channel to test each step of the bit error rate and system performance, through the figures and graphics comparison, the communication system in the role of each module.
Platform: |
Size: 45056 |
Author: 123456 |
Hits:
Description: Beyond third generation (B3G) and fourth
generation (4G) communication systems require
bandwidth efficiency and low complexity receivers to
accommodate high data rate and large number of
users per cell. This paper provides the
recommendations for why Interleave Division Multiple
Access (IDMA) stands out among all the present day
multiple access systems. Even if IDMA is a special
case of Code Division Multiple Access (CDMA), it
simply trounces CDMA as far as the cell capacity is
concerned. In IDMA, interleavers are used as the only
means for user separation. Interleaver size can be
varied for a set of users but the recommended
interleaver size is 1024bits at which it provides better
efficiency and minimum processing delay.
Investigations carried throughout this paper are while
using 1024 bit interleavers. IDMA exhibits the
tendency to handle huge number of users.
Platform: |
Size: 366592 |
Author: raghaw |
Hits:
Description: Beyond third generation (B3G) and fourth
generation (4G) communication systems require
bandwidth efficiency and low complexity receivers to
accommodate high data rate and large number of
users per cell. This paper provides the
recommendations for why Interleave Division Multiple
Access (IDMA) stands out among all the present day
multiple access systems. Even if IDMA is a special
case of Code Division Multiple Access (CDMA), it
simply trounces CDMA as far as the cell capacity is
concerned. In IDMA, interleavers are used as the only
means for user separation. Interleaver size can be
varied for a set of users but the recommended
interleaver size is 1024bits at which it provides better
efficiency and minimum processing delay.
Investigations carried throughout this paper are while
using 1024 bit interleavers. IDMA exhibits the
tendency to handle huge number of users.
Platform: |
Size: 268288 |
Author: raghaw |
Hits:
Description: The FFT architecture is pipelined on a rank basis each rank has
its own butterfly and ranks are isolated from each other using
memory interleavers.-The FFT architecture is pipelined on a rank basis each rank has
its own butterfly and ranks are isolated from each other using
memory interleavers.
Platform: |
Size: 211968 |
Author: FPGACore |
Hits:
Description: Its about implementation of interleavers
Platform: |
Size: 339968 |
Author: Reetika Bishnoi |
Hits:
Description: Its about comparisons of performance of interleavers
Platform: |
Size: 339968 |
Author: Reetika Bishnoi |
Hits:
Description: 这是一套完整的支持wimax 16e协议CTC的编译码程序，
主程序在demo.c
译码器：tcdecoder.c
编码器：tcencoder.c-/* This program simulates the classical turbo encoding-decoding system on PC.*/
/* It uses parallel concatenated convolutional codes described in Figure 2.9 in Chapter 2.*/
/* Two component RSC (Recursive Systematic Convolutional) encoders are used. */
/* First encoder is terminated with tails bits. (Info+ tail) bits are scrambled and */
/* passed to the second encoder, while second encoder is left open without tail bits. */
/* Random information bits are modulated into+1/-1, and transmitted through an AWGN channel.*/
/* Interleavers are randomly generated for each frame.*/
/* Log-MAP algorithm without quantization or approximation is used.*/
/* By making use of ln(e^x+e^y) = max (x,y)+ ln(1+e^(-abs(x-y))), */
/* the Log-MAP is simplified with a look-up table for the correction term.*/
/* When the approximation ln(e^x+e^y) = max (x,y) is, we have MAX-Log-MAP.*/
/* To set the number of iterations, change the globle variable "DECITER". To set the fr
Platform: |
Size: 26624 |
Author: bennytang |
Hits:
Description: The FFT architecture is pipelined on a rank basis each rank has
its own butterfly and ranks are isolated from each other using
memory interleavers. This FFT can perform calculations on
continuous streaming data (one data set right after another).
More over, inputs and outputs are passed in pairs, doubling the
bandwidth. For instance, a 4096 point FFT can perform a transform
every 2048 cycles-The FFT architecture is pipelined on a rank basis each rank has
its own butterfly and ranks are isolated from each other using
memory interleavers. This FFT can perform calculations on
continuous streaming data (one data set right after another).
More over, inputs and outputs are passed in pairs, doubling the
bandwidth. For instance, a 4096 point FFT can perform a transform
every 2048 cycles
Platform: |
Size: 3125248 |
Author: amin |
Hits:
Description: On the Equivalence of Interleavers for Turbo Codes Using Quadratic Permutation Polynomials over Integer Rings
Platform: |
Size: 130048 |
Author: oudjani |
Hits:
Description: Flexible Interleaving Sub–systems for
FEC in Baseband Processors
Platform: |
Size: 2209792 |
Author: sbs |
Hits:
Description: This script simulates the classical turbo encoding-decoding system.
It simulates parallel concatenated convolutional codes.
Two component rate 1/2 RSC (Recursive Systematic Convolutional) component encoders are assumed.
First encoder is terminated with tails bits. (Info + tail) bits are scrambled and passed to
the second encoder, while second encoder is left open without tail bits of itself.
Random information bits are modulated into +1/-1, and transmitted through a AWGN channel.
Interleavers are randomly generated for each frame.
Log-MAP algorithm without quantization or approximation is used.
By making use of ln(e^x+e^y) = max(x,y) + ln(1+e^(-abs(x-y))),
the Log-MAP can be simplified with a look-up table for the correction function.
If use approximation ln(e^x+e^y) = max(x,y), it becomes MAX-Log-MAP.- This script simulates the classical turbo encoding-decoding system.
It simulates parallel concatenated convolutional codes.
Two component rate 1/2 RSC (Recursive Systematic Convolutional) component encoders are assumed.
First encoder is terminated with tails bits. (Info + tail) bits are scrambled and passed to
the second encoder, while second encoder is left open without tail bits of itself.
Random information bits are modulated into +1/-1, and transmitted through a AWGN channel.
Interleavers are randomly generated for each frame.
Log-MAP algorithm without quantization or approximation is used.
By making use of ln(e^x+e^y) = max(x,y) + ln(1+e^(-abs(x-y))),
the Log-MAP can be simplified with a look-up table for the correction function.
If use approximation ln(e^x+e^y) = max(x,y), it becomes MAX-Log-MAP.
Platform: |
Size: 2048 |
Author: yk |
Hits:
Description: Another popular turbo interleaver is the row-column (or block) interleaver which, unlike S-random interleavers, has a very simply algorithmic implementation
Platform: |
Size: 1024 |
Author: wayne |
Hits:
Description: this paper is about Efficient Generation of Interleavers for IDMA
Platform: |
Size: 184320 |
Author: mustapha |
Hits:
Description: 这是汉明码在使用交织和不使用交织时的一个编译码例程,本程序用于纠正突发的一位错误或连续两位错误-the program deals with hamming codes with and without interleavers under the environment of hamming codes.It can be used for correcting single and adjacent bits errors
Platform: |
Size: 4096 |
Author: 张晨宇 |
Hits: