针对与线性分组码级联的矩阵交织器，提出了一种矩阵交织参数盲估计方法。首先构造数据矩阵，确定交织深度的整数倍；再进行一维假设确定交织偏差；最后对交织深度和交织宽度进行二维搜索，对数据进行解交织，确定这2个参数，实现了矩阵交织不同交织深度下参数的盲估计。该方法适用于任何交织深度下矩阵交织器参数估计，尤其适用于未被研究过的交织深度不等于码长整数倍的情况。仿真表明：在误码率为0.001时，无论交织深度是否为码长的整数倍，所提算法的参数估计速度均较快，且检测概率可达98%。

For linear block code which takes the matrix interleave in channel coding, a new method is proposed to estimate blindly the interleave parameters. It determines firstly the multiple of interleave depth by constructing data matrix, then does one-dimensional hypothesis for the interleave offset. At last, two-dimensional hypothesis for the interleave depth and interleave width is taken in order to deinterleave the intercepted data, and to achieve the blind estimation of all interleave parameters. The method is applicable to any case of matrix interleaver for interleaver depth estimation, especially for the kind that the interleaver depth is not equal to an integer multiple of the code length which has not been studied so far. Simulation results show that, the detection probability can reaches 98% even though the bit error rate is 0.001. Meanwhile, the algorithm has a fast detection speed no matter what the interleaver depth is.

交织区是快速路主线通行的交通瓶颈和事故多发地。合理的交织区长度对提高交织区服务水平和通行能力具有重要意义。鉴于此，分析了交织区运行的各个影响因素，提出了基于密度指标的交织区长度设计方法，采用试算法给出了不同条件组合下的交织区长度设计值。结果表明，应用密度指标进行交织区长度设计具有一定的可行性。

Weaving segment is the bottleneck of expressway mainline and the accident-prone area. Suit?able length of weaving segment has an important significance to improve its capacity and level of service. A design method of length of weaving segment based on traffic density was proposed after the factors which influencded the operation of weaving segment were analyzed. The design values under different con?ditions were given by the trial means. Results show that it is of some feasibility to design length of weaving segment by using the traffic density index.

针对传统交织多址(IDMA)系统中的交织器问题,提出了一种低复杂度的二维交织方法。该方法基于二维扩频的思想,分别在时域和频域对数据进行交织处理。同时,该方法对所有用户按照时域扩频码进行分组,用户组间采用不同的时域交织器,用户组内采用不同的频域交织器。仿真结果表明,该方法不但可以降低交织器的数量和长度,还可以降低IFFT/FFT操作和频域检测的复杂度。

For alleviating the problem of interleavers in conventional interleave division multiple access (IDMA) systems,this paper proposed a two dimensional interleaving scheme with low-complexity. Based on the idea of two dimensional spreading , the data is interleaved in both time and frequency domain. Meanwhile, all users are grouped by the time domain spreading factor. Different time domain interleavers are adopted in each group, and different frequency domain interleavers are adopted within the same group. According to the simulation results, this scheme can reduce not only the number and length of interleavers, but also the complexity of IFFT/FFT and frequency detection.

为了提高低信噪比情况下系统的纠错能力，Turbo码作为通信传输系统中的一种新兴的信道纠错编码技术，逐渐成为了信息编码界的研究热点。交织器是Turbo码编、译码器的重要组成部件。本设计对CDMA2000中的Turbo交织器进行了介绍，设计了交织器模块，并通过MATLAB进一步对交织器的应用进行了仿真。

To improve the error -correcting capabilities under the condition of low SNR , the Turbo codes has become the research hotspot in the field of channel encoding .The interleaver is the most important part of Turbo coding machine .The Turbo interleaver of CDMA2000 is introduced in the design .The paper designs the interleaver module , and then makes a further simulation about the appli-cation of interleaver by MATLAB .

并行译码方案能够显著地降低译码延迟,适合于高比特速率传输的通信系统。然而,在turbo码分块并行译码方案中,交织器的随机置换可能引起存储器地址争用问题。因此在分块并行译码方案中要解决的一个关键问题就是设计出能够避免存储器地址争用的并行交织器。这篇文章提出一种新的产生并行无冲突S随机交织器的算法,和现有的无冲突行列S随机交织器相比较,新算法产生的交织器具有较大的延展因子S和平均码字自由距离。

As for the high data-rate transmission, the parallel decoding method can greatly reduce the decoding latency. However, in the parallel decoding method, the random permutation of interleaver may probably result in memory collision problem. A challenge to the design of parallel turbo decoder is the design of collision-free interleavers with the purpose to avoid the memory access collision. This paper proposes a novel algorithm for generating collision-free S-random interleavers of turbo codes. The collision-free S-random interleavers generated by the proposed algorithm could achieve larger spreading factor S and better average code distance than the collision-free row column S-random interleavers by existing algorithm.