Dynamic compression coverage
US-2016309363-A1 · Oct 20, 2016 · US
US2024171311A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2024171311-A1 |
| Application number | US-202418430905-A |
| Country | US |
| Kind code | A1 |
| Filing date | Feb 2, 2024 |
| Priority date | Aug 6, 2021 |
| Publication date | May 23, 2024 |
| 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.
This application discloses a communication method that comprises obtaining first data, where the length of the first data is A; compressing the first data into second data, where the length of the second data is C; and generating third data based on the second data, where the third data includes the second data and (T−C+p) alignment bits. T is a threshold in the J thresholds that is greater than or equal to C and the closest to C. The J thresholds correspond to A and are greater than 0, with J being a positive integer greater than or equal to 2. p is a quantity of auxiliary check bits and is an integer greater than or equal to 0. The communication method further comprises performing channel encoding on the third data to obtain fourth data and sending the fourth data.
Opening claim text (preview).
What is claimed is: 1 . A communication method, comprising: obtaining first data, wherein a length of the first data is A, and A is a positive integer; compressing the first data into second data, wherein a length of the second data is C, and C is a positive integer; generating third data based on the second data, wherein the third data comprises the second data and T−C+p alignment bits, T is a threshold that is greater than or equal to C and closest to C and that is in J thresholds, the J thresholds correspond to A, each of the J thresholds is greater than 0, J is a positive integer greater than or equal to 2, p is a quantity of auxiliary check bits, and p is an integer greater than or equal to 0; performing channel encoding on the third data, to obtain fourth data; and sending the fourth data. 2 . The method according to claim 1 , wherein the T−C+p alignment bits are any one of the following: T−C+p check bits, T−C+p repeated bits, T−C+p “0” bits, or T−C+p “1” bits. 3 . The method according to claim 1 , wherein the method further comprises: sending first information, wherein the first information corresponds to T. 4 . The method according to claim 1 , wherein the J thresholds are variable. 5 . The method according to claim 1 , wherein transmission of the J thresholds is performed by using any one of the following signaling: radio resource control (RRC) signaling, downlink control information (DCI) signaling, or media access control control element (MAC CE) signaling. 6 . A communication method, comprising: receiving to-be-decoded data, wherein the to-be-decoded data corresponds to N, and N corresponds to A; performing channel decoding on the to-be-decoded data, to obtain a first decoding result, wherein the first decoding result comprises third data, wherein the third data comprises second data and T−C+p alignment bits, T is a threshold that is greater than or equal to C and closest to C and that is in J thresholds, the J thresholds correspond to A, each of the J thresholds is greater than 0, J is a positive integer greater than or equal to 2, C is a length of the second data, C is a positive integer, p is a quantity of auxiliary check bits, and p is an integer greater than or equal to 0; and obtaining first data based on the third data, wherein a length of the first data is A. 7 . The method according to claim 6 , wherein the second data is obtained by compressing the first data. 8 . The method according to claim 6 , wherein the first data is a sequence that meets a similarity criterion and that is in a first candidate set; the first candidate set comprises X1 candidate results that pass a check in X2 candidate results in a second candidate set; the second candidate set comprises the X2 candidate results that pass interval confirmation in J candidate results in a third candidate set; and the third candidate set comprises the J candidate results that are obtained by decompressing and compressing the first decoding result based on the J thresholds. 9 . The method according to claim 6 , wherein the T−C+p alignment bits are any one of the following: T−C+p check bits, T−C+p repeated bits, T−C+p “0” bits, or T−C+p “1” bits. 10 . The method according to claim 6 , wherein the method further comprises: receiving first information, wherein the first information corresponds to T. 11 . The method according to claim 6 , wherein the J thresholds are variable. 12 . The method according to claim 6 , wherein transmission of the J thresholds is performed by using any one of the following signaling: radio resource control (RRC) signaling, downlink control information DCI signaling, or media access control control element (MAC CE) signaling. 13 . A communication apparatus, wherein the communication apparatus comprises at least one processor and at least one memory, wherein the at least one memory stores a computer program; and the at least one processor is configured to execute the computer program stored in the memory, to enable the apparatus to: obtain first data, wherein a length of the first data is A, and A is a positive integer; compress the first data into second data, wherein a length of the second data is C, and C is a positive integer; generate third data based on the second data, wherein the third data comprises the second data and T−C+p alignment bits, T is a threshold that is greater than or equal to C and closest to C and that is in J thresholds, the J thresholds correspond to A, each of the J thresholds is greater than 0, J is a positive integer greater than or equal to 2, p is a quantity of auxiliary check bits, and p is an integer greater than or equal to 0; perform channel encoding on the third data, to obtain fourth data; and send the fourth data. 14 . The apparatus according to claim 13 , wherein the T−C+p alignment bits are any one of the following: T−C+p check bits, T−C+p repeated bits, T−C+p “0” bits, or T−C+p “1” bits. 15 . The apparatus according to claim 13 , wherein the at least one processor further enables the apparatus to send first information, and the first information corresponds to T. 16 . The apparatus according to claim 13 , wherein the J thresholds are variable. 17 . The apparatus according to claim 13 , wherein transmission of the J thresholds is performed by using any one of the following signaling: radio resource control (RRC) signaling, downlink control information DCI signaling, or media access control control element (MAC CE) signaling. 18 . The apparatus according to claim 13 , wherein the apparatus is a terminal device or a chip.
using block codes (H03M13/2957 takes precedence) · CPC title
using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits {(H03M13/2906 takes precedence)} · CPC title
Error detection only, e.g. using cyclic redundancy check [CRC] codes or single parity bit · CPC title
Error control coding in combination with rate matching · CPC title
Error control coding in combination with data compression · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.