CN114070468A - Self-resolution identification method applied to redundant version number 2 in 5G base station communication - Google Patents
Self-resolution identification method applied to redundant version number 2 in 5G base station communication Download PDFInfo
- Publication number
- CN114070468A CN114070468A CN202111342205.4A CN202111342205A CN114070468A CN 114070468 A CN114070468 A CN 114070468A CN 202111342205 A CN202111342205 A CN 202111342205A CN 114070468 A CN114070468 A CN 114070468A
- Authority
- CN
- China
- Prior art keywords
- version number
- redundancy version
- info
- self
- length
- 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.)
- Granted
Links
Images
Classifications
-
- 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/0061—Error detection codes
-
- 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0006—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format
-
- 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/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
- H04L1/1819—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different redundancy
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a self-solution identification method of a redundancy version number 2 applied to 5G base station communication, which relates to the technical field of 5G base station communication and comprises the following steps: firstly, the method comprises the following steps: setting encoding and decoding parameters, and calculating the available information length according to the set encoding and decoding parameters; II, secondly: and judging the calculated base graph of the information length according to a preset condition, and if the preset condition is met, judging that the redundancy version number 2 cannot be solved by self. Aiming at the problem of self-resolution of the redundancy version number 2, the invention can enhance the merging effect when HARQ merges by judging the self-resolution condition of the redundancy version number 2 in advance, can send the redundancy version number 2 capable of self-resolving when the channel condition is very poor, can greatly improve the gain of the HARQ merge, and can ensure that a receiving end can correctly demodulate by sending the redundancy version number 2 capable of self-resolving by judging the self-resolution condition in advance under the condition that the HARQ merge cannot be used but signals of different redundancy version numbers are sent.
Description
Technical Field
The invention relates to the technical field of 5G base station communication, in particular to a self-solution identification method of a redundancy version number 2 applied to 5G base station communication.
Background
In a mobile communication system, in order to ensure the reliability of transmission, error control termination is generally used to provide the transmission quality of a signal. In 5G base station communication, a hybrid automatic repeat request (HARQ) technique is employed to ensure reliability of transmission. An important tool for HARQ is the rate matching algorithm. The transmitting end sends data with different redundancy version numbers, and the receiving end combines the data blocks retransmitted for several times, so that the coding gain can be improved. The rate matching of 5G forms a buffer loop for the channel-coded data, with the front part being the system bits (information bits) and the remaining part being the redundancy bits. As shown in fig. 2. RV0, RV1, RV2, RV3 in the figure represent different redundancy version numbers. The arc of each color indicates where a redundancy version number is fetched in the data buffer. As can be seen from the figure, the starting point of the access of each redundancy version number is different, and therefore the position of the data to be accessed is also different.
Starting point k of buffer ring access for different redundancy version numbers0Is calculated differently as shown in table 1. K in Table 10The start position of the fetch is rate matched for different redundancy version numbers. rvid0,1,2,3 are different redundancy version numbers. As can be seen from table 1, for the redundancy version number 2, the starting position is:
wherein N iscbEncoding the output length, Z, of LDPC for the preceding channelcAnd adopting a spreading factor for LDPC coding. In general NcbIs ZcIs an integer of (1). As can be seen from the above equation, the starting position of the redundancy version number 2 is half of the buffer area. In general, if LDCPBaseGraph1 is used, the data length of the buffer ring is 3 times the length of the LDPC input, which is 1 time the system bit and 2 times the check bit respectively; if LDPCBaseGraph2 is adopted, the data length of the buffer circle is 5 times of the length of the LDPC input, and is respectively 1 time of the system bit and 4 times of the check bit. Therefore, if it is set off from half the length of the bufferAnd starting to fetch, wherein the fetching is started from the check bit. If the length of the fetch does not exceed half of the length of the buffer, all the fetched data are check bits, so that correct decoding cannot be performed, and the redundancy version number 2 cannot be self-solved. If the fetch data length exceeds half the buffer length, it is likely that correct decoding is possible, and the redundancy version number 2 is self-explanatory.
Table 15G communication standard 3GPP protocol clock starting position calculation schematic table with different redundancy version numbers
Disclosure of Invention
The invention aims to provide a self-resolution identification method of a redundancy version number 2 applied to 5G base station communication aiming at the self-resolution problem of the redundancy version number 2.
The purpose of the invention is realized by the following technical scheme:
a self-solution identification method of a redundancy version number 2 applied to 5G base station communication comprises the following steps:
the method comprises the following steps: setting coding and decoding parameters and calculating the available information length N according to the set coding and decoding parametersinfo；
Step two: according to preset conditions, the calculated information length N is obtainedinfoThe basegraph judges whether the redundancy version number can be solved by itself or not if the basegraph meets the preset condition, otherwise, the redundancy version number can be solved by itself.
Specifically, the first step specifically comprises:
let R be the target code rate, QmFor modulation order, v is the number of layers, NinfoFor available information length, information length NinfoThe calculation method of (c) is as follows:
Ninfo＝NRE*R*Qm*v
NREthe number of available Re resource particles.
Parameter NREThe calculation formula of (a) is as follows:
NRE＝min(156,N'RE)*nPRB
wherein N'REIs the resource element available on each RB.
Parameter N'REThe calculation formula of (a) is as follows:
wherein
To be an available OFDM symbol,
is the number of REs used to fill the pilot symbols on one RB.
The second step specifically comprises:
if N is presentinfo3824 or less, if R is less than 0.67, BG2 pattern is adopted, the length of the buffer is 5 times of the length of the input signal, C is the number of code blocks, TBS is the size of the transmitted bit number, and when the following formula is satisfied, the redundancy version number 2 cannot be solved by itself:
NRE*Qm*v＜2.5(TBS+24)；
if R > 0.67, using a BG1 pattern, the buffer length is 3 times the input signal length, and the redundancy version number 2 is not self-solvable when the following equation is satisfied:
NRE*Qm*v＜1.5(TBS+24)；
if 8424 is not less than Ninfo＞3824，
If the code rate is less than 1/4, the LDPCBG2 is still used, the length of the buffer is still ≈ 5(TBS +24), and the joint code block calculation formula includes:
NRE*Qm*v/C＜2.5(TBS+24)
at this time, the formula condition is satisfied, and the redundancy version number 2 cannot be solved by itself;
if the code rate is greater than 1/4, the LDPCBG1 is still used, the length of the buffer is still ≈ 3(TBS +24), and the joint code block calculation formula includes:
NRE*Qm*v/C＜1.5(TBS+24)
at the moment, if the formula condition is met, the redundancy version number 2 cannot be solved by self;
if N is presentinfoIf the code rate R is greater than 1/4, LDPCBG1 is adopted, and the buffer length is: 3 × 66 × 384 ═ 25344, so there are:
NRE*Qm*v/C＜12672
at this time, the formula condition is satisfied, and the redundancy version number 2 cannot be solved by itself;
if the code rate is less than 1/4, then the length of the buffer length information is 5 times that of the LDPCBG2, so that:
NRE*Qm*v/C＜2.5(TBS+24)
at this time, the above formula condition is satisfied, and the redundancy version number 2 cannot be solved by itself.
The calculation method of the code block number C is as follows:
if N is presentinfo3824 or less, then C is 1;
if N is presentinfoWhen the code rate is more than 3824 and less than 1/4, the code rate is less than
If N is presentinfo3824 and the code rate R is greater than 1/4, but Ninfo' > 8424, then
If N is presentinfo3824 and the code rate R is greater than 1/4, but Ninfo'. ltoreq.8424, then C equals 1.
The invention has the beneficial effects that:
the invention can enhance the combining effect by judging the self-resolving condition of the redundancy version number 2 in advance when HARQ is combined, especially when the channel condition is very poor, the combination can not be resolved after the previous retransmission is combined, and the honor version number 2 which can be self-resolved is sent at the moment, thereby greatly improving the gain of HARQ combination. In addition, under the condition that signals with different redundancy version numbers cannot be combined by using the HARQ and are transmitted, the self-solvable redundancy version number 2 is transmitted by judging the self-solvation condition in advance, and the receiving end can correctly demodulate.
Drawings
FIG. 1 is a flow chart of the method of the present invention.
Fig. 2 is a diagram of a data buffer loop in the prior art.
Detailed Description
The following detailed description will be selected to more clearly understand the technical features, objects and advantages of the present invention. It should be understood that the embodiments described are illustrative of some, but not all embodiments of the invention, and are not to be construed as limiting the scope of the invention. All other embodiments that can be obtained by a person skilled in the art based on the embodiments of the present invention without any inventive step are within the scope of the present invention.
The first embodiment is as follows:
in this embodiment, as shown in fig. 1, a self-solution identification method applied to a redundancy version number 2 in 5G base station communication includes:
the method comprises the following steps: setting coding and decoding parameters and calculating the available information length N according to the set coding and decoding parametersinfo；
Step two: according to preset conditions, the calculated information length N is obtainedinfoThe basegraph judges whether the redundancy version number can be solved by itself or not if the basegraph meets the preset condition, otherwise, the redundancy version number can be solved by itself.
In this embodiment, the first step specifically includes setting R as the target code rate, QmV is the number of layers for the modulation order. N is a radical ofinfoFor the available information length, the calculation is as follows:
Ninfo＝NRE*R*Qm*v
NREfor the number of available Re (resource elements), the calculation formula is as follows:
NRE＝min(156,N'RE)*nPRB
wherein N'REFor resources available on each RBA source particle. The calculation method is as follows:
wherein
To be an available OFDM symbol,
is the number of REs used to fill the pilot symbols on one RB. C is the number of code blocks and TBS is the size of the number of bits sent.
For 5G communication, different information lengths NinfoThe basegraphs of the LDPC used are different. Therefore, the determination in step two can be classified into the following 3 cases:
1. due to Ninfo≤3824
If R is less than or equal to 0.67, a BG2 pattern is used, and the buffer length is 5 times the input signal length ≈ 5(TBS + 24). At this time, the following equation is satisfied, and the redundancy version number 2 is not self-solvable.
NRE*Qm*v＜2.5(TBS+24)
If R > 0.67, then the buffer length is 3 ≈ 3(TBS +24) times the input signal length using a BG1 pattern. At this time, the following equation is satisfied, and the redundancy version number 2 is not self-solvable.
NRE*Qm*v＜1.5(TBS+24)
2. For 8424. gtoreq.Ninfo＞3824，
If the code rate is less than 1/4, the LDPCBG2 is still used, the length of the buffer is still ≈ 5(TBS +24), and the joint code block calculation formula includes:
NRE*Qm*v/C＜2.5(TBS+24)
at this time, the above formula condition is satisfied, and the redundancy version number 2 cannot be solved by itself.
If the code rate is greater than 1/4, the LDPCBG1 is still used, the length of the buffer is still ≈ 3(TBS +24), and the joint code block calculation formula includes:
NRE*Qm*v/C＜1.5(TBS+24)
at this time, if the above formula condition is satisfied, the redundancy version number 2 cannot be solved by itself.
3. For Ninfo＞8424，
If the code rate R is greater than 1/4, the LDPCBG1 is adopted, and the buffer length is: 3 × 66 × 384 ═ 25344, so there are:
NRE*Qm*v/C＜12672
at this time, the above formula condition is satisfied, and the redundancy version number 2 cannot be solved by itself.
If the code rate is less than 1/4, then LDPCBG2 is adopted, and the length of the buffer length information is 5 times. Therefore, there are:
NRE*Qm*v/C＜2.5(TBS+24)
at this time, the above formula condition is satisfied, and the redundancy version number 2 cannot be solved by itself.
Example two:
in the embodiment, simulation parameter simulation is performed on the basis of the method provided in the first embodiment. Wherein, the scheduling physical layer parameters are as shown in the following table 2:
TABLE 2 simulation parameters and results table
The first column of the table is the ordering of cases. The second column is the number of RBs (resource blocks) scheduled. The third column is a table of MSCs to be scheduled and an index into the MSC table. R is the code rate. BG was selected for LDPCbasegraph. TBS is the block length of the transmission. The CRC is the final demodulation result, where 0 indicates correct demodulation and 1 indicates error demodulation.
N of case 1info＞8424，R<0.25，Ninfo24027 > 2.5 (8448+24) ═ 21180, CRC ═ 0, demodulation was successful, and the conclusion is reached at 3.2; similarly, case 2 also met the conclusion of 3.2.
N of case 3info＞8424，R>0.25,Ninfo12012 < 12672, CRC 1, demodulation failed,the conclusion of 3.1 is met; n of case 4info＞8424，R>0.25,Ninfo25344 and 12672, 0 CRC, and the demodulation is successful, which accords with the conclusion of 3.1. Similarly, cases 5, 6 and 7 all have the symbol 3.1.
3824 > N for case 8info＞8424，R<0.25，NinfoThe result is that the/R/C18480 > 2.5 × (4360+24) ═ 10960, CRC ═ 0, demodulation was successful, and the conclusion is reached at 2.1. 3824 > N for case 9info＞8424，R>0.25,NinfoThe result is that the/R/C is 12320 < 1.5 (18960+24) ═ 28476, the CRC is 1, the demodulation fails, and the result is 2.2.
N of case 11info＜3824，R<0.67, where C is 1, so Ninfo/R/C＝NRE*QmV 264 < 2.5 (128+24) < 380, CRC 1, demodulation failed, consistent with the conclusion of 1.1.
N of case 12info＜3824，R>0.67, where C is 1, so Ninfo/R/C＝NRE*QmV 528 < 1.5 (336+24) < 380 < 540, CRC 1, demodulation failed, consistent with 1.2.
Example three:
in this embodiment, a specific flow of steps of the method for calculating the relevant parameter related to the first and second embodiments is provided, which specifically includes:
1. according to the 3GPP38.214 protocol, the code block number C is calculated as follows:
if N is presentinfo3824 or less, then C is 1;
if N is presentinfoWhen the code rate is more than 3824 and less than 1/4, the code rate is less than
If N is presentinfo3824 and the code rate R is greater than 1/4, but Ninfo' > 8424, then
If N is presentinfo3824 and the code rate R is greater than 1/4, but Ninfo'. ltoreq.8424, then C equals 1.
Wherein N'infoThe calculation method is as follows:
when N is presentinfoWhen the content is less than or equal to 3824, the following components are adopted:
When N is presentinfoAt > 3824, there are:
2. The method for calculating the Transport Block Size (TBS) in this embodiment is as follows:
IfNinfo＜＝3824
TBS is equal to more than N 'in Table appendix B'infoA first number of;
else
N′info＝max(3840,2n*round((Ninfo-24)/2n))
if R≤0.25
C＝|(N′info+24)/3816|
TBS＝8*C*|(N′info+24)/8/C|-24
else
if N'info＞8424
C＝|(N′info+24)/8424|
TBS＝8*C*|(N′info+24)/8/C|-24
else
TBS＝8*C*|(N′info+24)/8/C|-24
end
end
End
wherein N isinfoCalculated as described above, the calculated TBS values are shown in table 3 below.
TABLE 3NinfoTBS value of 3824 or less
| Index | TBS | Index | TBS | Index | TBS | Index | TBS |
| 1 | 24 | 31 | 336 | 61 | 1288 | 91 | 3624 |
| 2 | 32 | 32 | 352 | 62 | 1320 | 92 | 3752 |
| 3 | 40 | 33 | 368 | 63 | 1352 | 93 | 3824 |
| 4 | 48 | 34 | 384 | 64 | 1416 | ||
| 5 | 56 | 35 | 408 | 65 | 1480 | ||
| 6 | 64 | 36 | 432 | 66 | 1544 | ||
| 7 | 72 | 37 | 456 | 67 | 1608 | ||
| 8 | 80 | 38 | 480 | 68 | 1672 | ||
| 9 | 88 | 39 | 504 | 69 | 1736 | ||
| 10 | 96 | 40 | 528 | 70 | 1800 | ||
| 11 | 104 | 41 | 552 | 71 | 1864 | ||
| 12 | 112 | 42 | 576 | 72 | 1928 | ||
| 13 | 120 | 43 | 608 | 73 | 2024 | ||
| 14 | 128 | 44 | 640 | 74 | 2088 | ||
| 15 | 136 | 45 | 672 | 75 | 2152 | ||
| 16 | 144 | 46 | 704 | 76 | 2216 | ||
| 17 | 152 | 47 | 736 | 77 | 2280 | ||
| 18 | 160 | 48 | 768 | 78 | 2408 | ||
| 19 | 168 | 49 | 808 | 79 | 2472 | ||
| 20 | 176 | 50 | 848 | 80 | 2536 | ||
| 21 | 184 | 51 | 888 | 81 | 2600 | ||
| 22 | 192 | 52 | 928 | 82 | 2664 | ||
| 23 | 208 | 53 | 984 | 83 | 2728 | ||
| 24 | 224 | 54 | 1032 | 84 | 2792 | ||
| 25 | 240 | 55 | 1064 | 85 | 2856 | ||
| 26 | 256 | 56 | 1128 | 86 | 2976 | ||
| 27 | 272 | 57 | 1160 | 87 | 3104 | ||
| 28 | 288 | 58 | 1192 | 88 | 3240 | ||
| 29 | 304 | 59 | 1224 | 89 | 3368 | ||
| 30 | 320 | 60 | 1256 | 90 | 3496 |
The foregoing shows and describes the general principles, essential features, and advantages of the invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, which are described in the specification and illustrated only to illustrate the principle of the present invention, but that various changes and modifications may be made therein without departing from the spirit and scope of the present invention, which fall within the scope of the invention as claimed. The scope of the invention is defined by the appended claims and equivalents thereof.
Claims (6)
1. A self-solution identification method of a redundancy version number 2 applied to 5G base station communication is characterized by comprising the following steps:
the method comprises the following steps: setting coding and decoding parameters and calculating the available information length N according to the set coding and decoding parametersinfo；
Step two: according to preset conditions, the calculated information length N is obtainedinfoThe basegraph judges whether the redundancy version number can be solved by itself or not if the basegraph meets the preset condition, otherwise, the redundancy version number can be solved by itself.
2. The self-solution identification method of redundancy version number 2 applied to 5G base station communication according to claim 1, wherein the first step specifically comprises:
let R be the target code rate, QmFor modulation order, v is the number of layers, NinfoFor available information length, information length NinfoThe calculation method of (c) is as follows:
Ninfo＝NRE*R*Qm*v
NREthe number of available Re resource particles.
3. The self-solution identification method of redundancy version number 2 applied to 5G base station communication according to claim 2, wherein the parameter N isREThe calculation formula of (a) is as follows:
NRE＝min(156,N'RE)*nPRB
wherein N'REIs the resource element available on each RB.
4. The self-solution identification method of redundant version number 2 applied to 5G base station communication according to claim 3, wherein the parameter N'REThe calculation formula of (a) is as follows:
wherein
To be an available OFDM symbol,
is the number of REs used to fill the pilot symbols on one RB.
5. The self-solution identification method of redundancy version number 2 applied to 5G base station communication according to claim 1, wherein the second step specifically comprises:
if N is presentinfo3824 or less, if R is less than 0.67, BG2 pattern is adopted, the length of the buffer is 5 times of the length of the input signal, C is the number of code blocks, TBS is the size of the transmitted bit number, and when the following formula is satisfied, the redundancy version number 2 cannot be solved by itself:
NRE*Qm*v＜2.5(TBS+24)；
if R > 0.67, using a BG1 pattern, the buffer length is 3 times the input signal length, and the redundancy version number 2 is not self-solvable when the following equation is satisfied:
NRE*Qm*v＜1.5(TBS+24)；
if 8424 is not less than Ninfo＞3824，
If the code rate is less than 1/4, then the LDPC BG2 is still adopted, the length of the buffer is still ≈ 5(TBS +24), and the joint code block calculation formula includes:
NRE*Qm*v/C＜2.5(TBS+24)
at this time, the formula condition is satisfied, and the redundancy version number 2 cannot be solved by itself;
if the code rate is greater than 1/4, then the LDPC BG1 is still adopted, the length of the buffer is still ≈ 3(TBS +24), and the joint code block calculation formula includes:
NRE*Qm*v/C＜1.5(TBS+24)
at the moment, if the formula condition is met, the redundancy version number 2 cannot be solved by self;
if N is presentinfoIf the code rate R is greater than 1/4, then LDPC BG1 is adopted, and the buffer length is: 3 × 66 × 384 ═ 25344, so there are:
NRE*Qm*v/C＜12672
at this time, the formula condition is satisfied, and the redundancy version number 2 cannot be solved by itself;
if the code rate is less than 1/4, then using LDPC BG2, the length of the buffer length information is 5 times, so there are:
NRE*Qm*v/C＜2.5(TBS+24)
at this time, the above formula condition is satisfied, and the redundancy version number 2 cannot be solved by itself.
6. The self-solution identification method of redundancy version number 2 applied to 5G base station communication of claim 5, wherein the code block number C is calculated as follows:
if N is presentinfo3824 or less, then C is 1;
if N is presentinfoWhen the code rate is more than 3824 and less than 1/4, the code rate is less than
If N is presentinfo3824 and the code rate R is greater than 1/4, but Ninfo' > 8424, then
If N is presentinfo3824 and the code rate R is greater than 1/4, but Ninfo'. ltoreq.8424, then C equals 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111342205.4A CN114070468B (en) | 2021-11-12 | 2021-11-12 | Self-resolution identification method applied to redundancy version number 2 in 5G base station communication |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111342205.4A CN114070468B (en) | 2021-11-12 | 2021-11-12 | Self-resolution identification method applied to redundancy version number 2 in 5G base station communication |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114070468A true CN114070468A (en) | 2022-02-18 |
| CN114070468B CN114070468B (en) | 2023-05-23 |
Family
ID=80271991
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111342205.4A Active CN114070468B (en) | 2021-11-12 | 2021-11-12 | Self-resolution identification method applied to redundancy version number 2 in 5G base station communication |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114070468B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018144560A1 (en) * | 2017-02-03 | 2018-08-09 | Idac Holdings, Inc. | Code block segmentation depending on ldpc base matrix selection |
| US20190021097A1 (en) * | 2017-07-11 | 2019-01-17 | Qualcomm Incorporated | Uplink hopping pattern modes for hybrid automatic repeat request (harq) transmissions |
| US20190052400A1 (en) * | 2017-08-11 | 2019-02-14 | Qualcomm Incorporated | Self-decodable redundancy versions for low-density parity-check codes |
| CN109586843A (en) * | 2017-09-29 | 2019-04-05 | 华为技术有限公司 | The design scheme of redundancy versions in communication system |
| WO2019136652A1 (en) * | 2018-01-11 | 2019-07-18 | 华为技术有限公司 | Method, apparatus and system for transmitting system information |
| US20190379485A1 (en) * | 2018-06-07 | 2019-12-12 | Qualcomm Incorporated | Self-decodability for low-density parity-check codes |
-
2021
- 2021-11-12 CN CN202111342205.4A patent/CN114070468B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018144560A1 (en) * | 2017-02-03 | 2018-08-09 | Idac Holdings, Inc. | Code block segmentation depending on ldpc base matrix selection |
| US20190021097A1 (en) * | 2017-07-11 | 2019-01-17 | Qualcomm Incorporated | Uplink hopping pattern modes for hybrid automatic repeat request (harq) transmissions |
| US20190052400A1 (en) * | 2017-08-11 | 2019-02-14 | Qualcomm Incorporated | Self-decodable redundancy versions for low-density parity-check codes |
| CN109586843A (en) * | 2017-09-29 | 2019-04-05 | 华为技术有限公司 | The design scheme of redundancy versions in communication system |
| WO2019136652A1 (en) * | 2018-01-11 | 2019-07-18 | 华为技术有限公司 | Method, apparatus and system for transmitting system information |
| US20190379485A1 (en) * | 2018-06-07 | 2019-12-12 | Qualcomm Incorporated | Self-decodability for low-density parity-check codes |
Non-Patent Citations (5)
| Title |
|---|
| "\"R1-1715732 Redundancy Version for HARQ of LDPC Codes\"", 3GPP TSG_RAN\\WG1_RL1 * |
| "\"R1-1718376 RV order for LDPC codes\"", 3GPP TSG_RAN\\WG1_RL1 * |
| "\"R1-1721406 Remaining details of LDPC coding\"", 3GPP TSG_RAN\\WG1_RL1 * |
| "\"R1-1721518 Remaining details of LDPC coding\"", 3GPP TSG_RAN\\WG1_RL1 * |
| 王正海;田茂;胡树楷;王玉;: "基于无线电波广播特性的多用户自动请求重传", 电波科学学报 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114070468B (en) | 2023-05-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105515733B (en) | A kind of feedback method and device | |
| US10708099B2 (en) | Method and apparatus for code block division | |
| US9893842B2 (en) | Symbol detection technique | |
| US8213291B2 (en) | Wireless data transmission methods, devices, and systems | |
| WO2020156468A1 (en) | Adaptive transmission method, device and system for satellite communication | |
| CN106031072A (en) | Harq frame data structure and method of transmitting and receiving with harq in systems using blind detection | |
| TWI698099B (en) | Method and system of data retransmission in a wireless network | |
| US20020021698A1 (en) | Data transmission method for hybrid ARQ type II/III uplink for a wide-band radio communication system | |
| WO2018076944A1 (en) | Coding and decoding method and apparatus | |
| CN109964426B (en) | Signal receiver and method for analyzing received signal, communication system | |
| JP6980918B2 (en) | PUSCH transmission method, reception method, terminal and base station | |
| WO2018090571A1 (en) | Acknowledgement/negative acknowledgement information detection method, apparatus and storage medium | |
| CN104660319B (en) | A kind of interference elimination method and device | |
| CN103347202A (en) | EWF code decoding method for wireless communication system | |
| WO2018196875A1 (en) | Data processing method and data processing apparatus | |
| KR20170096555A (en) | Method and apparatus for hybrid automatic repeat requests (harq) processing for retransmissions with unknown data length | |
| CN104753631A (en) | 256 QAM scheduling method, base station and user equipment | |
| JP7357859B2 (en) | Method and apparatus in UE and base station for channel coding | |
| CN104348576A (en) | Method for determining MSC grade in downlink HARQ retransmission and system thereof | |
| WO2018201984A1 (en) | Data transmission method and device | |
| JP2004007028A (en) | Transmission apparatus and transmission method | |
| CN114070468A (en) | Self-resolution identification method applied to redundant version number 2 in 5G base station communication | |
| CN107005349A (en) | A kind of data processing method, base station and terminal device | |
| CN101867439B (en) | Indication method of bit mapping mode | |
| US9344226B2 (en) | Data packet transmission method |
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 |