A rate-compatible spatially coupled repeat-accumulate (RC-SC-RA) code is proposed. Its protograph is obtained by extending a given (J, K, L) SC-RA coupled chain (denoted as the mother chain) with extra check nodes and...A rate-compatible spatially coupled repeat-accumulate (RC-SC-RA) code is proposed. Its protograph is obtained by extending a given (J, K, L) SC-RA coupled chain (denoted as the mother chain) with extra check nodes and parity bit nodes T times. At each time, the extension is realized via coupling the message bits in the same way as that in the mother chain. Rate-compatibility is achieved by adjusting the extension parameters and applying random puncturing technique. Density evolution analysis shows that the iterative decoding thresholds of all the member codes in the proposed RC-SC-RA code family are very close to Shannon limits over the binary erasure channel. Finite length simulation results are consistent with the thresholds well. Moreover, the proposed RC-SC-RA codes perform better than spatially coupled low density parity check (SC-LDPC) codes in decoding performance especially in lower-rate region.展开更多
针对半双工译码转发中继信道,提出了一种可逼近三节点中继信道容量限的空间耦合RA码的设计方法。针对二进制删除信道,源节点分别向中继节点和目的节点发送空间耦合RA码,中继节点先正确恢复出源节点发送的空间耦合RA,然后再次编码产生额...针对半双工译码转发中继信道,提出了一种可逼近三节点中继信道容量限的空间耦合RA码的设计方法。针对二进制删除信道,源节点分别向中继节点和目的节点发送空间耦合RA码,中继节点先正确恢复出源节点发送的空间耦合RA,然后再次编码产生额外的校验比特并转发给目的节点;目的节点结合中继节点发送的额外校验比特和源节点发送的空间耦合RA码进行译码,正确恢复出源节点的信息。为了评估所设计的空间耦合RA码在三节点中继信道下的渐近性能,推导了密度进化算法用于计算阈值。阈值分析结果表明,所提出的空间耦合RA码能够同时逼近源到中继链路和源到目的链路的容量限。同时,基于半双工二进制删除中继信道,仿真了所设计的空间耦合RA码的误码性能,结果表明,其误码性能与所推导的密度进化算法计算的阈值结果一致,呈现出逼近于容量限的优异性能,且优于采用空间耦合低密度奇偶校验(Low Density Parity Check,LDPC)码的性能。展开更多
正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)技术由于具有频谱利用率高、抗多径能力强等优点,成为当前水声通信的研究重点和热点,但较高的峰均功率比(Peak-to-Average Power Ratio,PAPR)严重影响了水声OFDM通信系...正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)技术由于具有频谱利用率高、抗多径能力强等优点,成为当前水声通信的研究重点和热点,但较高的峰均功率比(Peak-to-Average Power Ratio,PAPR)严重影响了水声OFDM通信系统的性能。采用重复累积码(Repeat Accumulate,RA)作为信道编码方案,并用线性反馈移位寄存器(Linear Feedback Shift Registers,LFSR)代替原RA码结构中的累加器,再通过选择映射(Selective Mapping,SLM)方法降低系统的峰均功率比。计算机仿真和水池实验结果表明,采用改进结构的RA码结合SLM技术能有效降低水声OFDM系统的PAPR,提高系统的性能,具有很好的应用前景。展开更多
准循环重复累积(Quasi⁃Cyclic Repeat Accumulate,QC⁃RA)码具有准循环低密度奇偶校验(Low Density Parity Check,LDPC)码的优点,同时能实现差分编码且为系统码,非常适用于编码协作系统,文中研究采用QC⁃RA码的编码协作系统。首先,提出基...准循环重复累积(Quasi⁃Cyclic Repeat Accumulate,QC⁃RA)码具有准循环低密度奇偶校验(Low Density Parity Check,LDPC)码的优点,同时能实现差分编码且为系统码,非常适用于编码协作系统,文中研究采用QC⁃RA码的编码协作系统。首先,提出基于最大公约数(Greatest Common Divisor,GCD)定理的QC⁃RA码构造方法;然后,进一步基于GCD定理联合构造编码协作系统信源节点与中继节点采用的QC⁃RA码,并从理论上证明基于该联合构造方法得到的编码协作系统QC⁃RA码无girth⁃4、girth⁃6环。仿真结果表明,采用QC⁃RA码的编码协作系统相对于点对点系统具有明显的性能增益;同时,与采用大列重构造QC⁃RA的编码协作相比,采用文中基于GCD定理联合构造的QC⁃RA码的编码协作误码率性能更加优异。展开更多
In order to solve high encoding complexities of irregular low-density parity-check （LDPC） codes, a deterministic construction of irregular LDPC codes with low encoding complexities is proposed. The encoding algorith...In order to solve high encoding complexities of irregular low-density parity-check （LDPC） codes, a deterministic construction of irregular LDPC codes with low encoding complexities is proposed. The encoding algorithms are designed, whose complexities are linear equations of code length. The construction and encoding algorithms are derived from the effectively encoding characteristics of repeat-accumulate （RA） codes and masking technique. First, the new construction modifies parity-check matrices of RA codes to eliminate error floors of RA codes. Second, the new constructed parity-check matrices are based on Vandermonde matrices; this deterministic algebraic structure is easy for hardware implementation. Theoretic analysis and experimental results show that, at a bit-error rate of 10 × 10^-4, the new codes with lower encoding complexities outperform Mackay＇s random LDPC codes by 0.4-0.6 dB over an additive white Gauss noise （AWGN） channel.展开更多
基金Supported by the National Natural Science Foundation of China(No.61801371,61801372,61701291,61771417)Natural Science Basic Research Plan in Shaanxi Province of China(No.2018JM5052)+1 种基金National Key Research and Development Program of China(No.2018YFC0808301)Talent Foundation of Xi’an University of Science and Technology(No.2018QDJ028)
文摘A rate-compatible spatially coupled repeat-accumulate (RC-SC-RA) code is proposed. Its protograph is obtained by extending a given (J, K, L) SC-RA coupled chain (denoted as the mother chain) with extra check nodes and parity bit nodes T times. At each time, the extension is realized via coupling the message bits in the same way as that in the mother chain. Rate-compatibility is achieved by adjusting the extension parameters and applying random puncturing technique. Density evolution analysis shows that the iterative decoding thresholds of all the member codes in the proposed RC-SC-RA code family are very close to Shannon limits over the binary erasure channel. Finite length simulation results are consistent with the thresholds well. Moreover, the proposed RC-SC-RA codes perform better than spatially coupled low density parity check (SC-LDPC) codes in decoding performance especially in lower-rate region.
文摘针对半双工译码转发中继信道,提出了一种可逼近三节点中继信道容量限的空间耦合RA码的设计方法。针对二进制删除信道,源节点分别向中继节点和目的节点发送空间耦合RA码,中继节点先正确恢复出源节点发送的空间耦合RA,然后再次编码产生额外的校验比特并转发给目的节点;目的节点结合中继节点发送的额外校验比特和源节点发送的空间耦合RA码进行译码,正确恢复出源节点的信息。为了评估所设计的空间耦合RA码在三节点中继信道下的渐近性能,推导了密度进化算法用于计算阈值。阈值分析结果表明,所提出的空间耦合RA码能够同时逼近源到中继链路和源到目的链路的容量限。同时,基于半双工二进制删除中继信道,仿真了所设计的空间耦合RA码的误码性能,结果表明,其误码性能与所推导的密度进化算法计算的阈值结果一致,呈现出逼近于容量限的优异性能,且优于采用空间耦合低密度奇偶校验(Low Density Parity Check,LDPC)码的性能。
文摘准循环重复累积(Quasi⁃Cyclic Repeat Accumulate,QC⁃RA)码具有准循环低密度奇偶校验(Low Density Parity Check,LDPC)码的优点,同时能实现差分编码且为系统码,非常适用于编码协作系统,文中研究采用QC⁃RA码的编码协作系统。首先,提出基于最大公约数(Greatest Common Divisor,GCD)定理的QC⁃RA码构造方法;然后,进一步基于GCD定理联合构造编码协作系统信源节点与中继节点采用的QC⁃RA码,并从理论上证明基于该联合构造方法得到的编码协作系统QC⁃RA码无girth⁃4、girth⁃6环。仿真结果表明,采用QC⁃RA码的编码协作系统相对于点对点系统具有明显的性能增益;同时,与采用大列重构造QC⁃RA的编码协作相比,采用文中基于GCD定理联合构造的QC⁃RA码的编码协作误码率性能更加优异。
基金Supported by the National Natural Science Foundation of China(60496315, 60572050)
文摘In order to solve high encoding complexities of irregular low-density parity-check （LDPC） codes, a deterministic construction of irregular LDPC codes with low encoding complexities is proposed. The encoding algorithms are designed, whose complexities are linear equations of code length. The construction and encoding algorithms are derived from the effectively encoding characteristics of repeat-accumulate （RA） codes and masking technique. First, the new construction modifies parity-check matrices of RA codes to eliminate error floors of RA codes. Second, the new constructed parity-check matrices are based on Vandermonde matrices; this deterministic algebraic structure is easy for hardware implementation. Theoretic analysis and experimental results show that, at a bit-error rate of 10 × 10^-4, the new codes with lower encoding complexities outperform Mackay＇s random LDPC codes by 0.4-0.6 dB over an additive white Gauss noise （AWGN） channel.
