US 12,463,755 B2
Method and device for data storage
Zhihui Zhu, Chongqing (CN); Yi Xu, Chongqing (CN); Qiao Feng, Chongqing (CN); and Shu Tan, Chongqing (CN)
Assigned to UNISOC (CHONGQING) TECHNOLOGIES CO., LTD., Chongqing (CN)
Filed by UNISOC (CHONGQING) TECHNOLOGIES CO., LTD., Chongqing (CN)
Filed on Apr. 29, 2022, as Appl. No. 17/733,239.
Application 17/733,239 is a continuation of application No. PCT/CN2020/093448, filed on May 29, 2020.
Claims priority of application No. 201911044606.4 (CN), filed on Oct. 30, 2019.
Prior Publication US 2022/0263607 A1, Aug. 18, 2022
Int. Cl. H04L 1/1829 (2023.01); H04L 1/00 (2006.01); H04L 1/1812 (2023.01)
CPC H04L 1/1835 (2013.01) [H04L 1/0061 (2013.01); H04L 1/1812 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method for data storage, comprising:
determining a plurality of storage sub-blocks in a storage space according to a size of a code block (CB) of a hybrid automatic repeat request (HARQ) process, the CB of the HARQ process being a largest CB of the HARQ process, each of the plurality of storage sub-blocks having a sub-block indicator, and the sub-block indicator indicating a next storage sub-block to which a present storage sub-block points; and
storing the CB of the HARQ process to the plurality of storage sub-blocks, wherein
the plurality of storage sub-blocks comprise a storage sub-block of a first type or a storage sub-block of a second type, a size of the storage sub-block of the first type is ¼ to 1 times the size of the largest CB of the HARQ process, and a size of the storage sub-block of the second type is ⅛ to ½ times the size of the largest CB of the HARQ process.