Techniques For Variable Forward Error Correction
US-2016373138-A1 · Dec 22, 2016 · US
US2020295872A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2020295872-A1 |
| Application number | US-202016887915-A |
| Country | US |
| Kind code | A1 |
| Filing date | May 29, 2020 |
| Priority date | Mar 14, 2016 |
| Publication date | Sep 17, 2020 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Embodiments of this application provide a modulation method and apparatus. The method includes: receiving a code word sequence, where each code word includes N bits, and the code word sequence includes at least a first code word; mapping the code word sequence into M sequences, where each sequence includes N/M bits from the first code word; mapping the M sequences into a symbol sequence, where each symbol is corresponding to M bits, the M bits are respectively from the M sequences, first bits corresponding to N/M first-type symbols are from the first code word, and second bits corresponding to N/M second-type symbols are from the first code word. Thus a signal-to-noise ratio requirement during higher order modulation lowered.
Opening claim text (preview).
The following listing of claims replaces all prior versions of claims in the application: 1 . A modulation method, comprising: receiving, by a transmitter device in a communication system, a code word sequence, wherein the code word sequence comprises a first code word and a second code word; mapping, by the transmitter device, the code word sequence into M sequences, wherein each sequence of the M sequences comprises bits from the first code word and bits from the second code word; mapping, by the transmitter device, the M sequences into a symbol sequence, wherein each symbol in the symbol sequence corresponds to M bits, the M bits are from the M sequences, wherein the symbol sequence comprises a first symbol, and the M bits corresponding to the first symbol comprise at least one bit from the first code word, and at least one bit from the second code word; and transmitting, by the transmitter device, the symbol sequence to a receiver device in the communication system. 2 . The method according to claim 1 , wherein the first code word and the second code word are coded by using a same coding rule. 3 . The method according to claim 1 , wherein each code word in the code word sequence comprises N bits, and each sequence of the M sequences comprises N/M bits from the first code word and N/M bits from the second code word, wherein N is an integral multiple of M. 4 . The method according to claim 3 , wherein a number of instances of the first symbol in the symbol sequence is N/M. 5 . The method according to claim 1 , wherein each symbol in the symbol sequence corresponds to one constellation point in 2 M constellation points in a 2 M constellation diagram, a minimum Euclidean distance between the constellation points in the 2 M constellation diagram is a first Euclidean distance, a minimum Euclidean distance between constellation points that are in the 2 M constellation diagram and that correspond to the first-type symbols after bits from the first code word are determined is a second Euclidean distance, and the second Euclidean distance is greater than the first Euclidean distance. 6 . The method according to claim 3 , wherein the mapping the code word sequence into M sequences comprises: performing serial-to-parallel conversion on the code word sequence to obtain the M sequences; and performing delay processing on at least one sequence in the M sequences, wherein a quantity of delayed bits is X*(N/M), and X is an integer greater than or equal to 1. 7 . The method according to claim 1 , wherein the mapping the code word sequence into M sequences comprises: interleaving the code word sequence to obtain the M sequences. 8 . The method according to claim 3 , wherein M is 3, and the mapping the code word sequence into M sequences comprises: performing serial-to-parallel conversion on the code word sequence to obtain three sequences, wherein each sequence comprises N/3 bits from the first code word; and performing delay processing on a first sequence of the M sequences, wherein a quantity of delayed bits is N/3. 9 . A receiving method, comprising: receiving, by a receiver device from a transmitter device in a communications system, a symbol sequence transmitted using a channel, wherein the symbol sequence includes a first code word and a second code word; demodulating, by the receiver device, symbols comprising at least one bit from the first code word to obtain a log-likelihood ratio of bits from the first code word; performing, by the receiver device, decoding based on log-likelihood ratios of the bits from the first code word to obtain first extrinsic information; and demodulating, by the receiver device, the first symbol using the first extrinsic information to obtain a log-likelihood ratio of a bit from another code word, wherein bits corresponding to the first symbol comprise at least one bit from the first code word, and at least one bit from the second code word. 10 . The method according to claim 9 , wherein the first extrinsic information is information obtained after prior information of the decoding is subtracted from later information that is obtained after the decoding. 11 . A modulation apparatus, comprising: a memory storing instructions; and a processor configured to execute the instructions to cause the modulation apparatus to: receive a code word sequence, wherein the code word sequence comprises a first code word and a second code word; map the code word sequence into M sequences, wherein each sequence of the M sequences comprises bits from the first code word and bits from the second code word; and map the M sequences into a symbol sequence, wherein each symbol in the symbol sequence corresponds to M bits, the M bits are from the M sequences, wherein the symbol sequence comprises a first symbol, and the M bits corresponding to the first symbol comprise at least one bit from the first code word, and at least one bit from the second code word. 12 . The apparatus according to claim 11 , wherein the first code word and the second code word are coded by using a same coding rule. 13 . The apparatus according to claim 11 , wherein each code word in the code word sequence comprises N bits, and each sequence of the M sequences comprises N/M bits from the first code word and N/M bits from the second code word, wherein N is an integral multiple of M. 14 . The apparatus according to claim 13 , wherein a number of instances of the first symbol in the symbol sequence is N/M. 15 . The apparatus according to claim 11 , wherein each symbol in the symbol sequence corresponds to one constellation point in 2 M constellation points in a 2 M constellation diagram, a minimum Euclidean distance between the constellation points in the 2 M constellation diagram is a first Euclidean distance, a minimum Euclidean distance between constellation points that are in the 2 M constellation diagram and that corresponds to the first-type symbols after bits from the first code word are determined is a second Euclidean distance, and the second Euclidean distance is greater than the first Euclidean distance. 16 . The apparatus according to claim 13 , wherein executing the instructions further causes the modulation apparatus to: perform serial-to-parallel conversion on the code word sequence to obtain M sequences; and perform delay processing on at least one sequence in the M sequences, wherein a quantity of delayed bits is X*(N/M), and X is an integer greater than or equal to 1. 17 . The apparatus according to claim 11 , wherein executing the instructions further causes the modulation apparatus to: interleave the code word sequence to obtain M sequences. 18 . The apparatus according to claim 13 , wherein M is 3, and wherein executing the instructions further causes the modulation apparatus to: perform serial-to-parallel conversion on the code word sequence to obtain three sequences, wherein each sequence comprises N/3 bits from the first code word; and perform delay processing on a first sequence of the M sequences, wherein a quantity of delayed bits is N/3. 19 . A receiving apparatus, comprising: a memory storing instructions; and a processor configured to execute the instructions to cause the modulation apparatus to: receive a symbol sequence transmitted using a channel, wherein the symbol sequence includes a first code word and a second code word; demodulate symbols comprising at least one bit from the first code word to obtain a log-likelihood ratio of bits from the first code word
Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM] {(modulation codes H03M13/31)} · CPC title
Block codes (H04L1/0061, H04L1/0064 take precedence) · CPC title
Arrangements at the transmitter end · CPC title
Block-coded modulation · CPC title
Use of interleaving (interleaving per se H03M13/27) · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.