Soft buffer partition for superposition coding
US-9973305-B2 · May 15, 2018 · US
US10856286B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10856286-B2 |
| Application number | US-201916402818-A |
| Country | US |
| Kind code | B2 |
| Filing date | May 3, 2019 |
| Priority date | Nov 4, 2016 |
| Publication date | Dec 1, 2020 |
| Grant date | Dec 1, 2020 |
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.
In a data transmission method, a terminal device receives control information, and receives data of a transport block (TB); and the terminal devices obtains m code block (CB) groups in the TB, where m is a positive integer, m=min(NCB_re, NGroup_max), NCB_re is a quantity of CBs in the TB, NGroup_max is a maximum value of a quantity of CB groups, each of the m CB groups includes at least one CB, NCB_re is determined based on a TB size (TBS) and a maximum value of a data size of a CB, and the TBS is determined based on the control information.
Opening claim text (preview).
What is claimed is: 1. A method, comprising: receiving, by a terminal device, control information; receiving, by the terminal device based on the control information, data of a transport block (TB); and obtaining, by the terminal device based on the control information, m code block (CB) groups in the TB, wherein m is a positive integer, m=min(N CB_re , N Group_max ), N CB_re is a quantity of CBs in the TB, N Group_max is a maximum quantity of CB groups for the TB, each of the m CB groups comprises at least one CB, and N CB_re is determined based on a TB size (TBS) and a maximum size of a CB. 2. The method according to claim 1 , wherein a quantity of CBs in each of the m CB groups is C + or C − , wherein C + = ⌈ N CB _ re m ⌉ and C - = ⌊ N CB _ re m ⌋ . 3. The method according to claim 2 , wherein in the m CB groups, each CB group of the first N + CB groups comprises C + CBs, each CB group of the last N − CB groups comprises C − CBs, wherein N + =N CB_re −mC − and N − =m−N + . 4. The method claim 1 , wherein the control information comprises one redundancy version (RV) for the TB. 5. The method according to claim 1 , wherein the control information comprises N Group_max -bit information, and the N Group_max -bit information indicates whether data of each of the m CB groups is retransmitted. 6. The method according to claim 5 , wherein the method further comprises: sending an acknowledgement/negative acknowledgement (ACK/NACK) comprising N Group_max bits. 7. The method according to claim 6 , wherein each bit of the N Group_max bits indicates whether data of a corresponding CB group is correctly checked or not. 8. A communication apparatus, comprising: a transceiver; at least one processor; and a non-transitory computer-readable storage medium coupled to the at least one processor and storing programming instructions for execution by the at least one processor, wherein the programming instructions instruct the at least one processor to: cause the transceiver to receive control information, and receive data of a transport block (TB); and obtain, based on the control information, m code block (CB) groups in the TB, wherein m is a positive integer, m=min(N CB_re , N Group_max ), N CB_re is a quantity of CBs in the TB, N Group_max is a maximum quantity of CB groups, each of the m CB groups comprises at least one CB, and N CB_re is determined based on a TB size (TBS) and a maximum size of a CB. 9. The apparatus according to claim 8 , wherein a quantity of CBs in each of the m CB groups is C + or C − , wherein C + = ⌈ N CB _ re m ⌉ and C - = ⌊ N CB _ re m ⌋ . 10. The apparatus according to claim 9 , wherein in the m CB groups, each CB group of the first N + CB groups comprises C + CBs, each CB group of the last N − CB groups comprises C − CBs, wherein N + =N cB_re −mC − and N − =m−N + . 11. The apparatus according to claim 8 , wherein the control information comprises one redundancy version (RV) for the TB. 12. The apparatus according to claim 8 , wherein the control information comprises N Group_max -bit information, and the N Group_max -bit information indicates whether data of each of the m CB groups is retransmitted. 13. The apparatus according to claim 12 , wherein the transceiver is further configured to send an acknowledgement/negative acknowledgement (ACK/NACK) comprising N Group_max bits. 14. The apparatus according to claim 13 , wherein each bit of the N Group_max bits indicates whether data of a corresponding CB group is correctly checked or not. 15. A processing apparatus, comprising: at least one processor; and a non-transitory computer-readable storage medium coupled to the at least one processor and storing programming instructions for execution by t
in the downlink direction of a wireless link, i.e. towards a terminal · CPC title
Resources in frequency domain, e.g. a carrier in FDMA · CPC title
Resources in time domain, e.g. slots or frames · CPC title
Allocation of pilot signals, i.e. of signals known to the receiver (allocation of control signalling H04L5/0053; use of control signalling H04L5/0091) · CPC title
Rate matching, e.g. puncturing or repetition of code symbols · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.