Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Dianzi xuebao

围长至少为8的QC-LDPC码的新构造:一种显式框架

Guo‐Hua Zhang, 王新梅

Published Jan 1, 2012• 0 citations
OpenAlex

Abstract

构造围长较大的校验矩阵,是提高二进制和多进制QC-LDPC码译码性能的一种有效手段.本文提出一种不需要借助于任何计算机搜索步骤,能够直接构造出围长至少为8的QC-LDPC码的显式构造框架.该框架所构造的QC-LDPC码不仅满足围长至少为8的条件,而且还具有循环置换矩阵(CPM)尺寸可以连续变化的优点.该框架可以分为两个步骤:第一步是在无穷大CPM尺寸条件下利用确定性方法构造一个围长至少为8的校验矩阵;第二步是根据本文新发现的一个围长性质,从该校验矩阵的移位矩阵直接精确地计算出CPM尺寸连续变化的紧致下界.

Related papers

A Graph Theoretic Perspective on CPM(Rel)

Dan Marsden

Mixed states are of interest in quantum mechanics for modelling partial information. More recently categorical approaches to linguistics have also exploited the idea of mixed states to describe ambiguity and hyponym / hypernym relationships. In both these application areas the category Rel of sets and binary relations is often used as an alternative model. Selinger's CPM construction provides the setting for mixed states in Hilbert space based categorical quantum mechanics. By analogy, applying the CPM construction to Rel is seen as introducing mixing into a relational setting. We investigate the category CPM(Rel) of completely positive maps in Rel. We show that the states of an object in CPM(Rel) are in bijective correspondence with certain families of graphs. Via map-state duality this then allows us provide a graph theoretic characterization of the morphisms in CPM(Rel). By identifying an appropriate composition operation on graphs, we then show that CPM(Rel) is isomorphic to a category of sets and graphs between them. This isomorphism then leads to a graph based description of the complete join semilattice enriched dagger compact structure of CPM(Rel). These results allow us to reason about CPM(Rel) entirely in terms of graphs. We exploit these techniques in several examples. We give a closed form expression for the number of states of a finite set in CPM(Rel). The pure states are characterized in graph theoretic terms. We also demonstrate the possibly surprising phenomenon of a pure state that can be given as a mixture of two mixed states.

arXiv:1504.07003•Electronic Proceedings in Theoretical Computer Science•Nov 4, 2015•12 citations

从π-旋转LDPC码到Q-矩阵LDPC码的演进

彭立, 朱光喜

介绍了基于π-旋转矩阵的低密度奇偶校验码(LDPC码)的构造方法,对π-旋转矩阵进行了研究和改造,对其约束条件进行加强,在此基础上定义了Q-矩阵,并提出Q-矩阵LDPC码的构造方法.Q-矩阵是约束满足问题的解,具有快速搜索算法,并能用循环移位的方法获得Q-矩阵集.利用Q-矩阵能快速灵活地构造不合4线循环的大型稀疏奇偶校验矩阵,从而生成LDPC码.提出的编码器设计基本思想是按照有利于LDPC码的构成及其电路设计的方式将奇偶校验矩阵H分解成两个子矩阵,通过对H的分解与重构运算直接构成码字.由于不需生成矩阵G,使LDPC码编码器的实现代价大幅度的降低.

系统工程与电子技术•Jan 1, 2005•0 citations

基于Min—Sum近似算法的QC—LDPC译码器

刘斌彬, 白栋, 梅顺良

由于BP算法中的非线性运算较复杂,实现中通常采用Min—Sum近似简化译码算法。针对译码过程中需要存储大量信息的问题,本文提出了一种基于Min—Sum近似算法的QC—LDPC译码器。通过重新安排Min—Sum近似算法中的运算,并将校验节点信息以一种压缩冗余的形式表示,大大减少了译码器所需的存储空间。针对QC—LDPC码校验矩阵准循环的特性,译码过程中以块为单位对信息进行更新,且可以实现多种消息传递调度策略。为进一步减少存储空间,对变量节点信息采用了非线性量化,根据密度演进理论对量化规则进行了优化。

•Jan 1, 2008•0 citations

Eigenvectors of an Arbitrary Onsager Sector in Superintegrable $τ^{(2)}$-model and Chiral Potts Model

Shi-shyr Roan

We study the eigenvector problem in homogeneous superintegrable $N$-state chiral Potts model (CPM) by the symmetry principal. Using duality symmetry and (spin-)inversion in CPM, together with Onsager-algebra symmetry and $sl_2$-loop-algebra symmetry of the superintegrable $τ^{(2)}$-model, we construct the complete $k'$-dependent CPM-eigenvectors in the local spin basis for an arbitrary Onsager sector. In this paper, we present the complete classification of quantum numbers of superintegrable $τ^{(2)}$-model. Accordingly, there are four types of sectors. The relationships among Onsager sectors under duality and inversion, together with their Bethe roots and CPM-eigenvectors, are explicitly found. Using algebraic-Bethe-ansatz techniques and duality of CPM, we construct the Bethe states and the Fabricius-McCoy currents of the superintegrable $τ^{(2)}$-model through its equivalent spin-$\frac{N-1}{2}$-XXZ chain. The $τ^{(2)}$-eigenvectors in a sector are derived from the Bethe state and the $sl_2$-product structure determined by the Fabricius-McCoy current of the sector. From those $τ^{(2)}$-eigenvectors, the $k'$-dependence of CPM state vectors in local-spin-basis form is obtained by the Onsager-algebra symmetry of the superintegrable chiral Potts quantum chain.

arXiv:1003.3621•Mar 18, 2010•11 citations

基于改进的整数量化 LDPC 码分层译码算法

Lingling Lao, 李立欣, 朱梦 +1 more

LDPC码分层译码算法在进行整数量化操作时,存储单元的限制会导致译码信息的溢出。本文系统分析了溢出错误的原因,并提出了两种改进的分层译码方案,错误部分消除方案( partially eliminating errors scheme,PEES)和不同比特量化方案(different bit quantization scheme,DBQS)。两种改进方案分别从消除部分错误和避免溢出错误的角度来改进译码性能,且硬件实现时只需增加一定数量的加法器和移位操作。通过对不同码长、不同量化比特的LDPC码进行仿真,结果表明,2种方案均有效地抑制了溢出错误,与基于全精度浮点数运算的修正算法相比,在误码率为1.0×10-4时,分别仅有约1 dB和1.8 dB的性能损耗。

西北工业大学学报•Jan 1, 2014•0 citations

CPM-LDPC Codes Attaining the Minimum-Distance Bound

Kenta Kasai

We study binary quasi-cyclic LDPC codes whose parity-check matrices are full arrays of single circulant permutation matrices (CPMs), referred to here as CPM-LDPC codes. Their minimum distance is at most $(J+1)!$, where $J$ is the column weight. For every fixed pair of column and row weights $2\le J

arXiv:2609.16836•Sep 15, 2026•0 citations
构造围长较大的校验矩阵,是提高二进制和多进制QC-LDPC码译码性能的一种有效手段.本文提出一种不需要借助于任何计算机搜索步骤,能够直接构造出围长至少为8的QC-LDPC码的显式构造框架.该框架所构造的QC-LDPC码不仅满足围长至少为8的条件,而且还具有循环置换矩阵(CPM)尺寸可以连续变化的优点.该框架可以分为两个步骤:第一步是在无穷大CPM尺寸条件下利用确定性方法构造一个围长至少为8的校验矩阵;第二步是根据本文新发现的一个围长性质,从该校验矩阵的移位矩阵直接精确地计算出CPM尺寸连续变化的紧致下界.
Mixed states are of interest in quantum mechanics for modelling partial information. More recently categorical approaches to linguistics have also exploited the idea of mixed states to describe ambiguity and hyponym / hypernym relationships. In both these application areas the category Rel of sets and binary relations is often used as an alternative model. Selinger's CPM construction provides the setting for mixed states in Hilbert space based categorical quantum mechanics. By analogy, applying the CPM construction to Rel is seen as introducing mixing into a relational setting. We investigate the category CPM(Rel) of completely positive maps in Rel. We show that the states of an object in CPM(Rel) are in bijective correspondence with certain families of graphs. Via map-state duality this then allows us provide a graph theoretic characterization of the morphisms in CPM(Rel). By identifying an appropriate composition operation on graphs, we then show that CPM(Rel) is isomorphic to a category of sets and graphs between them. This isomorphism then leads to a graph based description of the complete join semilattice enriched dagger compact structure of CPM(Rel). These results allow us to reason about CPM(Rel) entirely in terms of graphs. We exploit these techniques in several examples. We give a closed form expression for the number of states of a finite set in CPM(Rel). The pure states are characterized in graph theoretic terms. We also demonstrate the possibly surprising phenomenon of a pure state that can be given as a mixture of two mixed states.
介绍了基于π-旋转矩阵的低密度奇偶校验码(LDPC码)的构造方法,对π-旋转矩阵进行了研究和改造,对其约束条件进行加强,在此基础上定义了Q-矩阵,并提出Q-矩阵LDPC码的构造方法.Q-矩阵是约束满足问题的解,具有快速搜索算法,并能用循环移位的方法获得Q-矩阵集.利用Q-矩阵能快速灵活地构造不合4线循环的大型稀疏奇偶校验矩阵,从而生成LDPC码.提出的编码器设计基本思想是按照有利于LDPC码的构成及其电路设计的方式将奇偶校验矩阵H分解成两个子矩阵,通过对H的分解与重构运算直接构成码字.由于不需生成矩阵G,使LDPC码编码器的实现代价大幅度的降低.
由于BP算法中的非线性运算较复杂,实现中通常采用Min—Sum近似简化译码算法。针对译码过程中需要存储大量信息的问题,本文提出了一种基于Min—Sum近似算法的QC—LDPC译码器。通过重新安排Min—Sum近似算法中的运算,并将校验节点信息以一种压缩冗余的形式表示,大大减少了译码器所需的存储空间。针对QC—LDPC码校验矩阵准循环的特性,译码过程中以块为单位对信息进行更新,且可以实现多种消息传递调度策略。为进一步减少存储空间,对变量节点信息采用了非线性量化,根据密度演进理论对量化规则进行了优化。
Eigenvectors of an Arbitrary Onsager Sector in Superintegrable τ(2)τ^{(2)}τ(2)-model and Chiral Potts Model
We study the eigenvector problem in homogeneous superintegrable NNN-state chiral Potts model (CPM) by the symmetry principal. Using duality symmetry and (spin-)inversion in CPM, together with Onsager-algebra symmetry and sl2sl_2sl2​-loop-algebra symmetry of the superintegrable τ(2)τ^{(2)}τ(2)-model, we construct the complete k′k'k′-dependent CPM-eigenvectors in the local spin basis for an arbitrary Onsager sector. In this paper, we present the complete classification of quantum numbers of superintegrable τ(2)τ^{(2)}τ(2)-model. Accordingly, there are four types of sectors. The relationships among Onsager sectors under duality and inversion, together with their Bethe roots and CPM-eigenvectors, are explicitly found. Using algebraic-Bethe-ansatz techniques and duality of CPM, we construct the Bethe states and the Fabricius-McCoy currents of the superintegrable τ(2)τ^{(2)}τ(2)-model through its equivalent spin-N−12\frac{N-1}{2}2N−1​-XXZ chain. The τ(2)τ^{(2)}τ(2)-eigenvectors in a sector are derived from the Bethe state and the sl2sl_2sl2​-product structure determined by the Fabricius-McCoy current of the sector. From those τ(2)τ^{(2)}τ(2)-eigenvectors, the k′k'k′-dependence of CPM state vectors in local-spin-basis form is obtained by the Onsager-algebra symmetry of the superintegrable chiral Potts quantum chain.
LDPC码分层译码算法在进行整数量化操作时,存储单元的限制会导致译码信息的溢出。本文系统分析了溢出错误的原因,并提出了两种改进的分层译码方案,错误部分消除方案( partially eliminating errors scheme,PEES)和不同比特量化方案(different bit quantization scheme,DBQS)。两种改进方案分别从消除部分错误和避免溢出错误的角度来改进译码性能,且硬件实现时只需增加一定数量的加法器和移位操作。通过对不同码长、不同量化比特的LDPC码进行仿真,结果表明,2种方案均有效地抑制了溢出错误,与基于全精度浮点数运算的修正算法相比,在误码率为1.0×10-4时,分别仅有约1 dB和1.8 dB的性能损耗。
We study binary quasi-cyclic LDPC codes whose parity-check matrices are full arrays of single circulant permutation matrices (CPMs), referred to here as CPM-LDPC codes. Their minimum distance is at most (J+1)!(J+1)!(J+1)!, where JJJ is the column weight. For every fixed pair of column and row weights $2\le J