公开(公告)号：KR1020010038383A

公开(公告)日：2001-05-15

申请号：KR1019990046343

申请日：1999-10-25

Applicant: 한국전자통신연구원

Inventor： 곽지혜 ,  이병길 ,  배상재 ,  강석근 ,  이수인 ,  주언경

IPC: H03M13/27

CPC classification number: H03M13/2778 ,  H03M13/2703 ,  H03M13/2732

Abstract: PURPOSE: An exchange interleaver realizing method is provided to be capable of satisfying a distance-limited condition value and securing a sufficient random characteristic, even though the size of an interleaver is large. CONSTITUTION: A block interleaver of N is constituted so that a difference between a row and a column is minimized(301), and different random integers(i1,i2) are generated(302). Each of the integers is more than or identical to a zero and less than N. Positions of i1 and i2 interleaver values are exchanged(303). Whether a distance-limited condition value(S) is satisfied with regard to the exchanged interleaver values is checked(304). If not, the positions of the i1 and i2 interleaver values are recovered originally and the procedure goes to the 302 step. If so, whether two interleaver values are sufficiently exchanged is checked(306). If not, the procedure goes to the 302 step. If so, the procedure is ended.

Abstract translation: 目的：提供交换交织器实现方法，即使交织器的大小较大，也能够满足距离限制状态值并确保足够的随机特性。 构成：N的块交织器被构造成使得行和列之间的差被最小化（301），并且生成不同的随机整数（i1，i2）（302）。 每个整数大于或等于零且小于N.交互i1和i2交织值的位置（303）。 检查关于交换的交织器值的距离限制条件值（S）是否被满足（304）。 如果不是，则首先恢复i1和i2交织器值的位置，并且过程进行到302步骤。 如果是，则检查两个交织器值是否被充分交换（306）。 如果没有，程序进入302步骤。 如果是，程序结束。