共查询到19条相似文献,搜索用时 109 毫秒
1.
2.
3.
低码率二进制线性分组码的盲识别 总被引:5,自引:0,他引:5
针对信息截获领域中的低码率二进制分组码的盲识别问题,提出了根据码重分布距离估计码长的方法,进而通过改进传统的矩阵化简方法获得生成矩阵,实现了对低码率二进制线性分组码的盲识别。理论推算和数据仿真都表明,本算法在较高误码率的情况下,也可以得到很好的识别效果。 相似文献
4.
针对通信信号侦察处理中的截短线性分组码的盲识别问题,提出了一种基于公约式权重最大化的识别方法.算法对侦收的码字序列进行不同长度的分段,计算分段码字与xn+1的最大公约式并按公约式阶数进行滤除,通过高阶公约式的个数估计码字长度.同时根据公约式的出现概率定义公约式的权重,利用权重最大的公约式实现码字生成多项式的估计.仿真实验表明算法有效可行,并理论分析了算法的容错性和计算复杂度.和已有算法相比较,本文算法在相同的误码率条件下,具有更高的检测识别概率,且同时具备截短码字和非截短码字的识别能力. 相似文献
5.
针对BCH码的盲识别问题,提出了一种基于稀疏沃尔什谱的识别方法.算法利用码字与对偶码乘积的码重估计码字的码长,然后利用沃尔什-哈达马变换求解线性方程组的数学模型,通过遍历不同码率,求解少量特定位置的稀疏沃尔什谱,根据谱值大小可实现BCH码的盲识别.仿真实验表明,该算法能够在较高误码率条件下实现对BCH码的盲检测与识别. 相似文献
6.
7.
针对线性分组码编码参数的盲识别问题,根据实际与随机序列码重概率分布间较大的差异性,提出了利用两种特征参数(码重标准差率差值、码重信息熵)分别同时识别码长和起始点的算法.根据这两种算法的不足又进一步改进,提出一种对这两种特征参数进行融合来同时识别码长和起始点的算法.在此基础上,通过建立矩阵进行化简获得生成矩阵,从而实现线性分组码的全盲识别.理论分析及实验仿真表明该方法简单易行,容错性较强,在误码率为0.025条件下对中短码识别率达到90%,误码率为0.005条件下对中长码识别率高于80%. 相似文献
8.
提出了一种基于迭代列消元法的线性分组码参数全盲识别算法.该方法首先对截获二进制码流构造截获矩阵,然后对截获矩阵进行迭代列消元法,利用相关列的归一化数目最大值来识别码字长度和同步时刻.同时,对截获矩阵进行迭代列消元法后的矩阵,选取其中一个小矩阵窗内相关列都是全零列,将其对应的转移矩阵中的列向量横向放入校验矩阵,完成校验矩阵的识别.此外,根据相关列和独立列中的码元0的比例减去1的比例的统计特性差异,提出了判别相关列和独立列的门限.仿真结果证明,在误码率为0.01时,该文算法仍能取得很好的效果. 相似文献
9.
空时分集技术的最大优点在于在不增加带宽的情况下可以提高系统的可靠性,是目前移动通信的研究热点.常模算法是一种性能优良的码分多址(CDMA)盲多用户检测技术,能确保判决信号与实际传送信号之间的差错较小,误码率性能良好.文中提出将标准线性受限常模算法(LCCMA)与空时分组码(STBC)相结合,设计出一种收敛快、能够改善系统性能的基于2-空时分组码的多用户接收机. 相似文献
10.
11.
12.
在多重置换阵的基础上,提出一种适用基于网络编码的协作中继策略的结构化LDPC码构造方法.首先定义了多重置换阵的概念,提出并证明了该方阵在秩和消元等方面的重要性质;给出具体的构造步骤,构造了列重为3和围长至少为6的满秩LDPC码;分析了该LDPC码的生成矩阵,具有稀疏和结构化的特点,适用基于网络编码的协作中继系统中进行联合网络编码和迭代译码.仿真结果表明,在相同码长、2/3码率和准循环矩阵 Y 结构条件下,相比阵列LDPC码、近似双对角形式的LDPC码和三对角形式的LDPC码,新构造的LDPC码具有相对较好的译码性能. 相似文献
13.
《AEUE-International Journal of Electronics and Communications》2014,68(5):379-383
Quasi-cyclic (QC) low-density parity-check (LDPC) codes have the parity-check matrices consisting of circulant matrices. Since QC LDPC codes whose parity-check matrices consist of only circulant permutation matrices are difficult to support layered decoding and, at the same time, have a good degree distribution with respect to error correcting performance, adopting multi-weight circulant matrices to parity-check matrices is useful but it has not been much researched. In this paper, we propose a new code structure for QC LDPC codes with multi-weight circulant matrices by introducing overlapping matrices. This structure enables a system to operate on dual mode in an efficient manner, that is, a standard QC LDPC code is used when the channel is relatively good and an enhanced QC LDPC code adopting an overlapping matrix is used otherwise. We also propose a new dual mode parallel decoder which supports the layered decoding both for the standard QC LDPC codes and the enhanced QC LDPC codes. Simulation results show that QC LDPC codes with the proposed structure have considerably improved error correcting performance and decoding throughput. 相似文献
14.
A new high rate code scheme is proposed in this paper. It consists of serial concatenated recursive systematic ordinary (nonpunctured) convolutional codes with only 8 states in the trellis of the corresponding reciprocal dual codes. With a low complexity and highly parallel decoding algorithm, over additive white Gaussian noise channels, the proposed codes can achieve good bit error rate (BER) performance comparable to that of turbo codes and low density parity check (LDPC) codes. At code rate R=16/17, the overall decoding complexity of the proposed code scheme is almost half that of the LDPC codes. 相似文献
15.
利用有限几何中的点和线,构造出低密度奇偶校验(LDPC)码的校验矩阵。根据这种LDPC码的特点,通过对校验矩阵的行或列变换得到其对偶码,从而获得基于CSS码的量子LDPC码。以量子码(15,4)为例,验证了这种量子LDPC码构造算法的可行性。在仅考虑比特翻转信道下对该量子码进行性能分析,结果表明用这种方法易于得到其对偶码,并且得到的量子码比经典码有更好的性能。 相似文献
16.
极化码作为一种纠错码,具有较好的编译码性能,已成为5G短码控制信道的标准编码方案。但在码长较短时,其性能不够优异。提出一种基于增强奇偶校验码级联极化码的新型编译码方法,在原有的奇偶校验位后设立增强校验位,对校验方程中信道可靠度较低的信息位进行双重校验,辅助奇偶校验码在译码过程中对路径进行修剪,以此提高路径选择的可靠性。仿真结果表明,在相同信道、相同码率码长下,本文提出的新型编译码方法比循环冗余校验(cyclic redundancy check,CRC)码级联极化码、奇偶校验(parity check,PC)码级联极化码误码性能更优异。在高斯信道下,当码长为128、码率为1/2、误码率为10-3时,本文提出的基于增强PC码级联的极化码比PC码级联的极化码获得了约0.3 dB增益,与CRC辅助的极化码相比获得了约0.4 dB增益。 相似文献
17.
Amat A.Gi. Montorsi G. Benedetto S. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2004,50(5):867-881
This correspondence deals with the design and decoding of high-rate convolutional codes. After proving that every (n,n-1) convolutional code can be reduced to a structure that concatenates a block encoder associated to the parallel edges with a convolutional encoder defining the trellis section, the results of an exhaustive search for the optimal (n,n-1) convolutional codes is presented through various tables of best high-rate codes. The search is also extended to find the "best" recursive systematic convolutional encoders to be used as component encoders of parallel concatenated "turbo" codes. A decoding algorithm working on the dual code is introduced (in both multiplicative and additive form), by showing that changing in a proper way the representation of the soft information passed between constituent decoders in the iterative decoding process, the soft-input soft-output (SISO) modules of the decoder based on the dual code become equal to those used for the original code. A new technique to terminate the code trellis that significantly reduces the rate loss induced by the addition of terminating bits is described. Finally, an inverse puncturing technique applied to the highest rate "mother" code to yield a sequence of almost optimal codes with decreasing rates is proposed. Simulation results applied to the case of parallel concatenated codes show the significant advantages of the newly found codes in terms of performance and decoding complexity. 相似文献
18.
Automatic container code recognition from a captured image is used for tracking and monitoring containers, but often fails when the code is not captured clearly. In this paper, we increase the accuracy of container code recognition using multiple views. A character‐level integration method combines recognized codes from different single views to generate a new code. A decision‐level integration selects the most probable results from the codes from single views and the new integrated code. The experiment confirmed that the proposed integration works successfully. The recognition from single views achieved an accuracy of around 70% for the test images collected on a working pier, whereas the proposed integration method showed an accuracy of 96%. 相似文献
19.
该文提出了一种可分解的码率兼容LDPC码的构造方法, 该方法构造所得到的一个高码率LDPC码的校验矩阵中包含有若干低码率LDPC码的校验矩阵,而且一个高码率的LDPC码又可以分解成多个性能优异的低码率的LDPC码进行编译码;结合该特性设计了一种基于可分解的码率兼容LDPC码的混合自动重传方案.与普通的ARQ方案相比,该重传方案不单能够通过重传获得更多的信息,而且能够通过降低纠错码的码率来提高纠错码的性能.仿真结果表明,当所采用LDPC码的码长为2000左右,码率为1/2和2/3时,与一般的ARQ相比,该方案的误帧率以及吞吐量(小于0.5的时候)均能获得近1.5dB的增益. 相似文献