CN110311755B - 一种利用线性分组码传输额外信息的方法 - Google Patents
一种利用线性分组码传输额外信息的方法 Download PDFInfo
- Publication number
- CN110311755B CN110311755B CN201910553130.0A CN201910553130A CN110311755B CN 110311755 B CN110311755 B CN 110311755B CN 201910553130 A CN201910553130 A CN 201910553130A CN 110311755 B CN110311755 B CN 110311755B
- Authority
- CN
- China
- Prior art keywords
- sequence
- linear block
- block code
- information
- code
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 31
- 230000005540 biological transmission Effects 0.000 claims abstract description 10
- 238000004364 calculation method Methods 0.000 claims description 15
- 239000011159 matrix material Substances 0.000 claims description 15
- 208000011580 syndromic disease Diseases 0.000 claims description 6
- 239000004576 sand Substances 0.000 claims description 5
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 238000004891 communication Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 101000741965 Homo sapiens Inactive tyrosine-protein kinase PRAG1 Proteins 0.000 description 1
- 102100038659 Inactive tyrosine-protein kinase PRAG1 Human genes 0.000 description 1
- 239000000654 additive Substances 0.000 description 1
- 230000000996 additive effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/13—Linear codes
- H03M13/15—Cyclic codes, i.e. cyclic shifts of codewords produce other codewords, e.g. codes defined by a generator polynomial, Bose-Chaudhuri-Hocquenghem [BCH] codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1105—Decoding
- H03M13/1111—Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/033—Theoretical methods to calculate these checking codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/11—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits using multiple parity bits
- H03M13/1102—Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
- H03M13/1105—Decoding
- H03M13/1108—Hard decision decoding, e.g. bit flipping, modified or weighted bit flipping
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/13—Linear codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
- H03M13/618—Shortening and extension of codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/63—Joint error correction and other techniques
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0041—Arrangements at the transmitter end
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Algebra (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Pure & Applied Mathematics (AREA)
- Error Detection And Correction (AREA)
Abstract
Description
技术领域
本发明属于数字通信和数字存储领域,特别涉及一种利用线性分组码传输额外信息的方法。
背景技术
为了高效地进行数据调度、传输,在通信系统中,除了要传输数据信息外,还要传输控制信息。对于数据信息的传输,要求逼近信道容量,主要要求速率高。控制信息包括线路信令信息、路由信息等等,通常较短,但要求可靠性较高。现有方案为了保证控制消息较高的可靠性,使用码率较低的编码方案对控制信息进行独立传输。因此,需要额外花费能量、带宽开销来传输这些信息。现有研究主要针对混合自动重传请求(Hybrid AutomaticRepeat reQuest,HARQ)系统中接收段反馈的ACK/NACK信息,通过选择不同星座或不同编码方案实现额外传输1比特的信息。
发明内容
本发明的主要目的在于克服现有技术的缺点与不足,提供一种利用线性分组码传输额外信息的方法,在不需要额外消耗能量、带宽的情况下,将较短的额外信息嵌入基本线性分组码中进行传输。
为了达到上述目的,本发明采用以下技术方案:
本发明提供的一种利用线性分组码传输额外信息的方法,包括下述步骤:
(1)以码长为n,信息位长度为k的线性分组码C作为负载码,用于将长度为m的额外信息序列v=(v0,v1,...,vm-1)叠加编码为长度为n的码字c=(c0,c1,...,cn-1),编码方法具体为:
(1.1)先将长度为k的基本负载信息序列u编成线性分组码码字w=(w0,w1,...,wn-1)=C(u);
(1.2)将长度为m的额外信息序列v输入序列选择器R,输出长度为n的序列s=(s0,s1,...,sn-1)=R(v);
(1.3)将序列s与线性分组码码字w叠加编码得到传输码字c;
(2)对额外信息序列进行译码,具体包括:
(3)对基本负载信息序列进行译码,具体包括下述步骤:
作为优选的技术方案,所述步骤(1)中,所述的码长为n,信息位长度为k的线性分组码C是任意类型的线性分组码编码器;
所述步骤(1.2)中,所述序列选择器R是指输入信息长为m,输出长度为n的任意类型的编码器;
作为优选的技术方案,所述特征度量函数fC采用如下计算方法:
所述硬判决序列r表示为r=(r0,r1,L,rn-1),r中的各个分量按以下方法计算:
其中,减法运算“-”是按有限群减法运算;
所述线性分组码的伴随式的汉明重量W(i)的计算方法为:
其中,H是线性分组码C的校验矩阵,HT表示矩阵H的转置,乘法“·”是关于二进制域的矩阵乘法,WH(g)是汉明重量函数,输出自变量序列中非零元素的个数。
作为优选的技术方案,其中特征度量函数fC采用如下计算方法:
所述序列z表示为z=(z0,z1,L,zn-1),z中的各个分量按以下方法计算:
作为优选的技术方案,所述线性分组码的似然函数η(i)的计算包括以下方法:
其中,m是性分组码C的校验矩阵H的行数,hpq是H的第p行第q列的元素。
其中,译码器D线性分组码C的任意类型的软输入译码器。
作为优选的技术方案,所述步骤(3.2)中,基本线性分组码C的译码器是指任意类型的线性分组码译码器。
本发明与现有技术相比,具有如下优点和有益效果:
本发明通过采用线性码作为基本码对基本负载信息序列进行编码,用序列选择器对额外信息编码并叠加编码到基本线性分组码上。使得在不产生额外的传输能量、带宽开销的条件下,实现额外信息序列的传输。而在额外信息译码时,由于额外信息序列的比特数较少,可通过遍历搜索的方式进行译码,具有较高的可靠性。通过移除额外信息序列叠加编码的影响,再对基本信息序列进行线性分组码的译码,在信噪比较高时,额外比特的传输对基本线性分组的译码性能的影响可忽略。下面通过附图和实施例,对本发明的技术方案做进一步的详细叙述。
附图说明
图1为本发明的方法流程图。
图2为本发明的编码框图。
图3为本发明实施例中额外信息序列译码的误帧率性能图。
图4为本发明实施例中基本负载信息序列译码的误比特率性能图。
具体实施方式
下面结合实施例及附图对本发明作进一步详细的描述,但本发明的实施方式不限于此。
实施例1
如图1所示,本实施例利用线性分组码传输额外信息的方法,其特征在于,包括下述步骤:
(1)基于码长为n,信息位长度为k的线性分组码C作为负载码,用于将长度为m的额外信息序列v=(v0,v1,...,vm-1)叠加编码为长度为n的码字c=(c0,c1,...,cn-1),编码方法具体为:
(1.1)先将长度为k的基本负载信息序列u编成线性分组码码字w=(w0,w1,...,wn-1)=C(u);
(1.2)将长度为m的额外信息序列v输入序列选择器R,输出长度为n的序列s=(s0,s1,...,sn-1)=R(v);
(1.3)将序列s与线性分组码码字w叠加编码得到传输码字c;
(2)对额外信息序列进行译码,具体包括:
(3)对基本负载信息序列进行译码,具体包括下述步骤:
下面结合具体的应用对本发明的方案做进一步的阐述:
使用PEG(progressive edge growth)方法构造的码长为8064,信息位长度为4032的(3,6)-规则LDPC码为基本码,通过BPSK(binary phase-shift keying)调制,在AWGN(additive white Gaussian noise)信道下进行传输。分别设置额外信息序列长度为m=5和m=10。也就是说,每个码长为8064的序列中,包含了4032比特经过LDPC码编码的基本负载信息,以及5或10比特随机叠加编码的额外信息。编码时,如图2所示,使用伪随机数发生器构造大小为m×n的二进制矩阵G作为生成矩阵作为序列选择的编码生成矩阵,叠加编码采用逐比特模2运算。在额外信息序列译码时,分别特征度量函数选择额外信息的译码输出。在基本负载信息序列译码时,采用LDPC码的软判决的和积算法,迭代次数为50次。
本实施例采用硬判决的方式来实现,具体为:
所述特征度量函数fC采用如下计算方法:
所述硬判决序列r表示为r=(r0,r1,L,rn-1),r中的各个分量按以下方法计算:
其中,减法运算“-”是按有限群减法运算;
所述线性分组码的伴随式的汉明重量W(i)的计算方法为:
其中,H是线性分组码C的校验矩阵,HT表示矩阵H的转置,乘法“·”是关于二进制域的矩阵乘法,WH(g)是汉明重量函数,输出自变量序列中非零元素的个数。
如图3所示,可见额外信息序列长度为m=5和m=10,使用本发明提出的利用二元LDPC码的传输额外信息的方法能可靠地传输额外信息序列。统计所得,对于所采用的硬判决,当m=10时,在SNR=0.5dB处,额外信息序列的误帧率达到10-5,在SNR=1dB处仿真帧数达到5×106仍没有发现额外信息序列译码错误;当m=5时,在SNR=0.5dB处,额外信息序列的误帧率达到4.2×10-7,在SNR=1dB处仿真帧数达到2×107仍没有发现额外信息序列译码错误。
如图4所示,可见用硬判决译额外信息序列长度为m=5时,使用本发明提出的利用二元LDPC码的传输额外信息的方法在较高信噪比时,达到传输额外信息的同时对基本负载信息序列的译码的影响可忽略。统计所得,当SNR不小于0dB时,使用本发明提出的方法对基本LDPC码的译码误比特率曲线与无传输额外信息时LDPC码译码的误比特率曲线基本重合。
实施例2
本实施例2除了下述技术特征之外,其它技术方案与实施例1相同,即本实施例2采用软判决的方式实现,具体为:
特征度量函数fC包括如下计算方法:
从接收序列y计算对数似然比(log-likelihood ratio,LLR)序列z,通过从z移除序列s (i)的干扰得到序列再计算关于线性分组码的似然函数η(i),最后将η(i)作为函数fC的输出。
所述序列z表示为z=(z0,z1,L,zn-1),z中的各个分量按以下方法计算:
所述线性分组码的似然函数η(i)的计算包括以下方法:
其中,m是性分组码C的校验矩阵H的行数,hpq是H的第p行第q列的元素。
对于本实施例2的计算方法(即软判决),相比于硬判决有更好的误帧率性能。上述实施例为本发明较佳的实施方式,但本发明的实施方式并不受上述实施例的限制,其他的任何未背离本发明的精神实质与原理下所作的改变、修饰、替代、组合、简化,均应为等效的置换方式,都包含在本发明的保护范围之内。
Claims (9)
1.一种利用线性分组码传输额外信息的方法,其特征在于,包括下述步骤:
(1)以码长为n,信息位长度为k的线性分组码C作为负载码,该负载码用于将长度为m的额外信息序列v=(v0,v1,...,vm-1)叠加编码为长度为n的码字c=(c0,c1,...,cn-1),编码方法具体为:
(1.1)先将长度为k的基本负载信息序列u编成线性分组码码字w=(w0,w1,...,wn-1)=C(u);
(1.2)将长度为m的额外信息序列v输入序列选择器R,输出长度为n的序列s=(s0,s1,...,sn-1)=R(v);
(1.3)将序列s与线性分组码码字w叠加编码得到传输码字c;
(2)对额外信息序列进行译码,具体包括:
(3)对基本负载信息序列进行译码,具体包括下述步骤:
9.根据权利要求1所述利用线性分组码传输额外信息的方法,其特征在于,所述步骤(3.2)中,基本线性分组码C的译码器是指任意类型的线性分组码译码器。
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910553130.0A CN110311755B (zh) | 2019-06-25 | 2019-06-25 | 一种利用线性分组码传输额外信息的方法 |
US16/909,790 US11128317B2 (en) | 2019-06-25 | 2020-06-23 | Method for transmitting additional information by using linear block codes |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910553130.0A CN110311755B (zh) | 2019-06-25 | 2019-06-25 | 一种利用线性分组码传输额外信息的方法 |
Publications (2)
Publication Number | Publication Date |
---|---|
CN110311755A CN110311755A (zh) | 2019-10-08 |
CN110311755B true CN110311755B (zh) | 2020-09-22 |
Family
ID=68076697
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910553130.0A Active CN110311755B (zh) | 2019-06-25 | 2019-06-25 | 一种利用线性分组码传输额外信息的方法 |
Country Status (2)
Country | Link |
---|---|
US (1) | US11128317B2 (zh) |
CN (1) | CN110311755B (zh) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110958025B (zh) * | 2019-12-17 | 2023-03-31 | 中山大学 | 一种基于叠加的短帧长编码及译码方法 |
CN113098529B (zh) * | 2021-03-30 | 2022-06-21 | 中山大学 | 基于循环移位的额外信息传输方法、系统及存储介质 |
CN113765623B (zh) * | 2021-09-02 | 2022-06-07 | 中山大学 | 基于叠加编码和额外信息传输的双向通信方法 |
CN114039701B (zh) * | 2021-11-04 | 2023-12-26 | 中山大学 | 一种ldpc码结合额外信息传输的编译码方法 |
CN116488662B (zh) * | 2023-06-21 | 2023-10-03 | 电子科技大学 | 基于线性变换的f-ldpc码校验矩阵重量压缩方法 |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1855731A (zh) * | 2005-04-25 | 2006-11-01 | 索尼株式会社 | 解码装置及解码方法 |
CN102571254A (zh) * | 2010-12-31 | 2012-07-11 | 和芯星通科技(北京)有限公司 | 全球卫星导航系统的伪随机码生成器及生成方法 |
Family Cites Families (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101277144A (zh) * | 2007-03-28 | 2008-10-01 | 北京三星通信技术研究有限公司 | 基于ldpc码的卫星数字多媒体广播系统 |
US8166367B2 (en) * | 2007-12-06 | 2012-04-24 | Samsung Electronics Co., Ltd. | Method and apparatus for encoding and decoding channel in a communication system using low-density parity-check codes |
CN100586056C (zh) * | 2008-01-11 | 2010-01-27 | 清华大学 | 基于低密度奇偶校验译码软判决信息的迭代定时同步方法 |
US8433971B2 (en) * | 2009-04-29 | 2013-04-30 | Broadcom Corporation | Communication device architecture for in-place constructed LDPC (low density parity check) code |
WO2011033237A1 (fr) * | 2009-09-17 | 2011-03-24 | France Telecom | Procede de transmission d'un signal numerique pour un systeme marc avec relais full-duplex, produit programme et dispositif relais correspondants |
US9729174B2 (en) * | 2015-05-19 | 2017-08-08 | Samsung Electronics Co., Ltd. | Transmitting apparatus and interleaving method thereof |
US10097674B2 (en) * | 2016-12-28 | 2018-10-09 | Intel Corporation | Single user OFDM with bit loading in wireless communications |
CN107508659B (zh) * | 2017-09-15 | 2020-04-07 | 哈尔滨工程大学 | 面向卫星导航系统星间链路数传的自适应编码调制方法 |
-
2019
- 2019-06-25 CN CN201910553130.0A patent/CN110311755B/zh active Active
-
2020
- 2020-06-23 US US16/909,790 patent/US11128317B2/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1855731A (zh) * | 2005-04-25 | 2006-11-01 | 索尼株式会社 | 解码装置及解码方法 |
CN102571254A (zh) * | 2010-12-31 | 2012-07-11 | 和芯星通科技(北京)有限公司 | 全球卫星导航系统的伪随机码生成器及生成方法 |
Also Published As
Publication number | Publication date |
---|---|
US20200412383A1 (en) | 2020-12-31 |
CN110311755A (zh) | 2019-10-08 |
US11128317B2 (en) | 2021-09-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN110311755B (zh) | 一种利用线性分组码传输额外信息的方法 | |
JP6847252B2 (ja) | 符号器、復号器及び送信機 | |
JP6858882B2 (ja) | 符号化されたコードワードを送信する送信機、方法及び非一時的コンピューター可読記憶媒体 | |
JP4241619B2 (ja) | 送信システム | |
US8737519B2 (en) | Apparatus and method for channel coding in a communication system | |
CN101425871B (zh) | 多元纠错码发射接收装置及数据传输系统以及相关方法 | |
CN107231158B (zh) | 一种极化码迭代接收机、系统和极化码迭代译码方法 | |
CN109964426B (zh) | 用于解析接收信号的信号接收器和方法、通信系统 | |
US8875000B2 (en) | Methods and systems systems for encoding and decoding in trellis coded modulation systems | |
WO2002037691A2 (en) | Stopping criteria for iterative decoding | |
US10367600B2 (en) | Forward error correction with contrast coding | |
US11271685B2 (en) | Method of hybrid automatic repeat request implementation for data transmission with multilevel coding | |
US20190207719A1 (en) | Method of hybrid automatic repeat request implementation for data transmission with multi-level coding | |
CN1113499C (zh) | 解码信道编码信号的接收机解码器电路及其方法 | |
CN109194336B (zh) | 级联Spinal码的编码和译码方法、系统及装置 | |
CN107911152B (zh) | 适用于任意发送天线数量的空间编码调制系统和方法 | |
CN110535805B (zh) | 一种基于星座旋转的额外信息传输方法 | |
KR20150004786A (ko) | 저밀도 패리티 검사 부호를 사용하는 통신 시스템에서의 채널 부호화/복호화 방법 및 장치 | |
CN115225202B (zh) | 一种级联译码方法 | |
CN113660064B (zh) | 一种适用于电力线通信系统的基于多数据包的联合二维交织编码方法 | |
CN112953561B (zh) | 基于极化码的空间耦合编码方法及系统、译码方法及系统 | |
CN107196733B (zh) | 一种调制方法和装置 | |
Farkaš et al. | On Soft Decoding of Some Binary RLL-Transmission Codes in Systems with Coherent BPSK Modulation | |
CN111245568A (zh) | 一种在低轨卫星中基于反馈重传技术的极化码译码方法 | |
Behnamfar et al. | Channel-Optimized Quantization With Soft-Decision Demodulation for Space–Time Orthogonal Block-Coded Channels |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |