turbo码交织器设计(IEEE文章)

hebe

【文件名】:06727@52RD_owth algorithms of polynomial complexity.part1.rar
【格　式】:rar
【大　小】:100K
【简　介】:Abstract—This paper addresses the problem of designing interleavers for parallel concatenated convolutional codes (PCCC’s)
tailored to specific constituent codes. We start by establishing
the role of the interleaver in the PCCC and the various parameters
that influence the performance of the PCCC with a given interleaver. Subsequently, we define a canonical form of the interleaving engine denoted as the finite-state pe rmuter (FSP) and demonstrate the minimal delay property of this canonical form. For any given permutation, we present a procedure for
deriving the canonical FSP engine. We address the issue of
implementation of the FSP and propose a very simple structure
for the FSP. Next, using the structural property of the FSP engine,
we develop a systematic iterative technique for construction
of interleavers with a complexity that is polynomial in the
interleaver size. Subsequently, we develop a cost function that,
coupled with the iterative interleaver growth procedure, can be
used to design optimized interleavers for PCCC’s. We provide
examples of application of the interleaver design technique, and
compare the designed interleavers with some of the interleavers
of comparable size found in the literature.
Index Terms—Interleavers, iterative algorithms, optimization,
permutations, turbo codes.
【目　录】:
I. INTRODUCTION
II. FINITE-STATE PERMUTER, THE CANONICAL PERMUTATION ENGINE
III. ITERATIVE INTERLEAVER GROWTH
IV. COST FUNCTION FOR THE INTERLEAVER DESIGN
V. COMPARISON OF INTERLEAVERS
VI. CONCLUSIONS

hebe

【文件名】:06727@52RD_owth algorithms of polynomial complexity.part2.rar
【格　式】:rar
【大　小】:100K
【简　介】:
【目　录】:

hebe

【文件名】:06727@52RD_owth algorithms of polynomial complexity.part3(1).rar
【格　式】:rar
【大　小】:100K
【简　介】:
【目　录】:

hebe

【文件名】:06727@52RD_owth algorithms of polynomial complexity.part4.rar
【格　式】:rar
【大　小】:54K
【简　介】:
【目　录】:

jn1223

资料对自己选的课题很有帮助，RD不够啊

mxxfboy

谢谢共享资料谢谢共享资料