CN105007140B - HARQ processing method and processing devices based on CRC check - Google Patents

HARQ processing method and processing devices based on CRC check Download PDF

Info

Publication number
CN105007140B
CN105007140B CN201510507572.3A CN201510507572A CN105007140B CN 105007140 B CN105007140 B CN 105007140B CN 201510507572 A CN201510507572 A CN 201510507572A CN 105007140 B CN105007140 B CN 105007140B
Authority
CN
China
Prior art keywords
data
code block
crc check
bit
solution
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.)
Active
Application number
CN201510507572.3A
Other languages
Chinese (zh)
Other versions
CN105007140A (en
Inventor
李桓
郭晓龙
郭璟
郭晨
王晓琴
林啸
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Silang Technology Co ltd
Original Assignee
Beijing Si Lang Science And Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Si Lang Science And Technology Co Ltd filed Critical Beijing Si Lang Science And Technology Co Ltd
Priority to CN201510507572.3A priority Critical patent/CN105007140B/en
Publication of CN105007140A publication Critical patent/CN105007140A/en
Application granted granted Critical
Publication of CN105007140B publication Critical patent/CN105007140B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements 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/18Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812Hybrid protocols; Hybrid automatic repeat request [HARQ]

Abstract

HARQ processing method and processing devices provided by the invention based on CRC check, including:Judge whether packet is new data packets, wherein, the new data packets include M code block, and M is positive integer;If the packet is the new data packets, traveled through to obtain at least one first data and at least one first solution bit selection data from first code block in the M code block;If the packet is not the new data packets, traveled through to obtain at least one second data and at least one second solution bit selection data from first CRC CRC check erroneous block in the M code block;At least one first data or at least one second data are subjected to code block cascade respectively, and carry out CRC check.The present invention can efficiently reduce bit-level processing of the HARQ when retransmitting.

Description

HARQ processing method and processing devices based on CRC check
Technical field
The present invention relates to mobile communication technology, more particularly to a kind of HARQ processing method and processing devices based on CRC check.
Background technology
In a wireless communication system, CRC (Cyclic Redundancy Check, CRC) is a kind of conventional Bit error detection method, it by data carry out polynomial computation, obtained result is attached to behind frame, receiving terminal is also held The similar algorithm of row, to ensure the correctness of data transfer and integrality.Because it has stronger detectability, and easily It is performed, therefore is widely used.
In Long Term Evolution (Long Term Evolution, LTE) system, in order to improve the performance of system and throughput, Data transfer uses HARQ transmission mechanism.Its detailed process is:Transmitting terminal carries out Error Correction of Coding processing to data, and receiving terminal presses one Determine algorithm and carry out error-correcting decoding, successfully decoded feedback acknowledgment information, otherwise feeding back unsuccessful information.Transmitting terminal enters according to feedback information The new packet transmission (i.e. confirmation) of row, or retransmit miss data bag (i.e. failure information).
In LTE system, receiving terminal bit-level handling process schematic diagram is specifically as shown in Figure 1.When transport block size exceedes It is transmitted during 6144 bit, it is necessary to be classified as multiple code blocks, each code block individually carries out bit-level processing.Receiving terminal includes Solve the processes such as rate-matched, HARQ merging, decoding.Conventional method in receiving terminal to first carrying out code block CRC check process, and CRC check is carried out to whole transmission block after code block cascade.When transmission block CRC check by when, return ACK send new data packets; Otherwise NACK is returned, if number of retransmissions is equal to 3, sends new data packets, otherwise retransmits packet.
The bit-level processing procedure that correct code block still provides for complexity was transmitted to last time when HARQ retransmits.In LTE system In, maximum transmitted code block number is 13.If the code block CRC check when transmitting first of preceding 12 code blocks is correct, last 1 code block is three CRC check is correct after secondary re-transmission, then when subsequently retransmitting three times, preceding 12 code blocks still repeat solution rate-matched, HARQ merges, translated The complex processes such as code, CRC check, decoding result is not influenceed, but add operand, cause the waste of calculation resources.
In addition, when retransmitting packet, the solution bit that the packet transmits several times before HARQ merging need to retain selects As a result, used when this transmission HARQ merges.Solve bit selection result and include system information position, check bit 1, check bit 2 three Circuit-switched data information, three times of transmission data volume about before coding.Therefore it is higher in the memory space resource requirement to cache information.
The content of the invention
HARQ processing method and processing devices provided by the invention based on CRC check, can efficiently reduce HARQ and retransmit When bit-level processing.
According to an aspect of the present invention, there is provided a kind of HARQ processing methods based on CRC check, including:
Judge whether packet is new data packets, wherein, the new data packets include M code block, and M is positive integer;If The packet is the new data packets, then is traveled through to obtain at least one from first code block in the M code block One data and at least one first solution bit selection data;If the packet is not the new data packets, from the M First CRC CRC check erroneous block in code block is traveled through to obtain at least one second data and at least One second solution bit selection data;At least one first data or at least one second data are subjected to code respectively Block cascades, and carries out CRC check.
According to an aspect of the present invention, there is provided a kind of HARQ processing units based on CRC check, including:
Judging unit, for judging whether packet is new data packets, wherein, the new data packets include M code block, M For positive integer;First Traversal Unit, in the case of being the new data packets in the packet, from the M code block First code block traveled through to obtain at least one first data and at least one first solution bit selection data;Second traversal Unit, in the case of being not the new data packets in the packet, from first cyclic redundancy in the M code block Check code CRC check erroneous block is traveled through to obtain at least one second data and at least one second solution bit selection number According to;Code block concatenation unit, at least one first data or at least one second data to be carried out into code block respectively Cascade, and carry out CRC check.
HARQ processing method and processing devices provided in an embodiment of the present invention based on CRC check, by whether judging packet For new data packets, if packet is new data packets, traveled through to obtain from first code block in M code block at least one First data and at least one first solution bit selection data, if packet is not new data packets, from the in M code block One CRC CRC check erroneous block is traveled through to obtain at least one second data and at least one second solution Bit selects data, and at least one first data or at least one second data are carried out into code block cascade, and carries out CRC check, So as to efficiently reduce bit-level processing of the HARQ when retransmitting.
Brief description of the drawings
Fig. 1 is bit-level handling process schematic diagram;
Fig. 2 is the HARQ process flow figures provided in an embodiment of the present invention based on CRC check;
Fig. 3 is another HARQ process flow figures based on CRC check provided in an embodiment of the present invention;
Fig. 4 is the HARQ processing unit schematic diagrames provided in an embodiment of the present invention based on CRC check.
Embodiment
The HARQ processing method and processing devices provided in an embodiment of the present invention based on CRC check are carried out below in conjunction with the accompanying drawings detailed Thin description.
Fig. 2 is the HARQ process flow figures provided in an embodiment of the present invention based on CRC check.
Reference picture 2, in step S101, judge whether packet is new data packets, wherein, the new data packets include M Code block, M are positive integer.
In step S102, if the packet is the new data packets, from first code block in the M code block Traveled through to obtain at least one first data and at least one first solution bit selection data.
In step S103, if the packet is not the new data packets, followed from first in the M code block Ring redundancy check code CRC check erroneous block is traveled through to obtain at least one second data and at least one second solution than special Select data.
In step S104, at least one first data or at least one second data are subjected to code block level respectively Connection, and carry out CRC check.
Further, if the packet is the new data packets, from first code in the M code block Block is traveled through to obtain at least one first data and at least one first solution bit selects data to include, and repeats following place Reason, until m-th code block is traversed:
Bit-level is carried out to first code block to handle to obtain first data;
First data are subjected to CRC check;
If first data store first data and carry out next code block by the CRC check Bit-level processing;
If first data solve bit selection not over the CRC check, in stored bits level processing procedure As a result, the first solution bit selection data are obtained, and remaining is not subjected to bit-level processing code block and all carries out solving at bit selection Reason.
Here, when packet is new data packets, carry out solving rate-matched and decoding processing from first code block, and carry out CRC check, if by CRC check, the first data are stored, and enter the processing of second code block, second code Block continues to solve rate-matched and decoding processing, and carries out CRC check, to the last a code block (i.e. m-th code block), most Posterior circle terminates.
If first code block carries out solution bit selection and handles to obtain the selection of the first solution bit not over CRC check Data, and stored, since second code block, remaining code block all carries out the selection of solution bit and handled, to the last one Code block (i.e. m-th code block), finally circulation terminate.
Further, if the packet is not the new data packets, first from the M code block CRC CRC check erroneous block is traveled through to obtain at least one second solution of at least one second data than special Selecting data includes, and repeats following processing, until the m-th code block is traversed:
First CRC check erroneous block progress bit-level is handled to obtain second data;
CRC check is carried out to second data;
If second data store second data and carry out next code block by the CRC check Bit-level processing;
If second data are not over the CRC check, to first CRC check erroneous block bit Obtained solution bit selection result is stored in level processing procedure, obtains the second solution bit selection data, and by remaining The code block of only storage solution bit selection data carries out solving bit selection processing.
Here, when packet is not new data packets, from first CRC check erroneous block carry out solution rate-matched, HARQ merges and the processing of decoding, and carries out CRC check, if by CRC check, the second data are stored, gone forward side by side Enter the processing of second code block, second code block continues the processing for solving rate-matched, HARQ merges and decoded, and carries out CRC check, to the last a code block (i.e. m-th code block), finally circulation terminate.
If first CRC check erroneous block carries out solution bit selection and handles to obtain second not over CRC check Bit selection data are solved, and are stored, since second code block, remaining code block all carries out solving bit selection processing, directly To a last code block (i.e. m-th code block), finally circulation terminates.
Further, it is described to carry out bit-level to first code block and handle to obtain first data to include:
Solution rate-matched is carried out to first code block and obtains the 3rd data;
3rd data are entered into row decoding and obtain first data.
Further, it is described to handle first CRC check erroneous block progress bit-level to obtain second number According to including:
Solution rate-matched is carried out to first CRC check erroneous block and obtains the 4th data;
4th data progress HARQ is merged to obtain the 5th data;
5th data are entered into row decoding and obtain the second data.
Fig. 3 is another HARQ process flow figures based on CRC check provided in an embodiment of the present invention.
Reference picture 3, step 1, judge whether packet is new data packets.If new data packets, opened from first code block Beginning is handled, and into code block cyclic, performs step 2;If new data packets it are not, from first CRC check erroneous block Handled, into code block cyclic, perform step 3.
Step 2, bit-level processing is carried out to first code block, bit-level processing includes solving rate-matched and decoding, then CRC check is carried out, if CRC check result is correct, the first data is stored in and cached, perform step 4;If CRC check knot Fruit is incorrect, by the first solution bit selection data deposit caching, performs step 6.
Step 3, carry out bit-level processing to first CRC check erroneous block, bit-level processing include solution rate-matched, HARQ merges and decoding, then enters CRC check, if CRC check result is correct, the second data is stored in and cached, perform step 5;If CRC check result is incorrect, by the second solution bit selection data deposit caching, step 6 is performed.
Step 4, judge whether code block sequence number is more than M, that is, judge whether code block is last code block.If code block sequence number More than M, terminate code block cyclic, perform step 8;If code block sequence number is less than M, next code block is handled, performs step 2。
Step 5, judge whether code block sequence number is more than M, if code block sequence number is more than M, terminate code block cyclic, perform step 8; If code block sequence number is less than M, next code block is handled, performs step 3.
Step 6, judge whether code block sequence number is more than M, if code block sequence number is more than M, terminate code block cyclic, return to NACK. If code block sequence number is less than M, next code block is handled, performs step 7.
Step 7, code-aiming block carries out solving bit selection processing, no longer carries out remaining processing procedure, then records code block CRC As a result it is mistake, and the selection result deposit of solution bit is cached, repeats step 6.
Step 8, at least one first data or at least one second data are subjected to code block cascade, Ran Houjin Row transmission block CRC check.If verification passes through, ACK is returned;If verification is not over returning to NACK.
Fig. 4 is the HARQ processing unit schematic diagrames provided in an embodiment of the present invention based on CRC check.
Reference picture 4, the device include judging unit 30, the first Traversal Unit 31, the second Traversal Unit 32 and code block cascade Unit 33.
Judging unit 30 is used to judge whether packet is new data packets, wherein, the new data packets include M code block, M For positive integer.
First Traversal Unit 31 is used in the case where the packet is the new data packets, from the M code block First code block traveled through to obtain at least one first data and at least one first solution bit selection data.
Second Traversal Unit 32 is used in the case where the packet is not the new data packets, from the M code block In first CRC CRC check erroneous block traveled through to obtain at least one second data and at least one Second solution bit selection data.
Code block concatenation unit 33 is used to respectively enter at least one first data or at least one second data Row code block cascades, and carries out CRC check.
Further, first Traversal Unit 31 is used to repeat following processing, until m-th code block is traversed:
Bit-level is carried out to first code block to handle to obtain first data;
First data are subjected to CRC check;
If first data store first data and carry out next code block by the CRC check Bit-level processing;
If first data solve bit selection not over the CRC check, in stored bits level processing procedure As a result, the first solution bit selection data are obtained, and remaining is not subjected to bit-level processing code block and all carries out solving at bit selection Reason.
Further, second Traversal Unit 32 is used to repeat following processing, until m-th code block quilt time Go through:
First CRC check erroneous block progress bit-level is handled to obtain second data;
CRC check is carried out to second data;
If second data store second data and carry out next code block by the CRC check Bit-level processing;
If second data are not over the CRC check, to first CRC check erroneous block bit Obtained solution bit selection result is stored in level processing procedure, obtains the second solution bit selection data, and by remaining The code block of only storage solution bit selection data carries out solving bit selection processing.
Further, first Traversal Unit 31 also includes:
Solution rate-matched is carried out to first code block and obtains the 3rd data;
3rd data are entered into row decoding and obtain first data.
Further, second Traversal Unit 32 also includes:
Solution rate-matched is carried out to first CRC check erroneous block and obtains the 4th data;
4th data progress HARQ is merged to obtain the 5th data;
5th data are entered into row decoding and obtain the second data.
The foregoing is only a specific embodiment of the invention, but protection scope of the present invention is not limited thereto, any Those familiar with the art the invention discloses technical scope in, change or replacement can be readily occurred in, should all be contained Cover within protection scope of the present invention.Therefore, protection scope of the present invention should be based on the protection scope of the described claims.

Claims (10)

1. a kind of HARQ processing methods based on CRC check, it is characterised in that methods described includes:
Judge whether packet is new data packets, wherein, the packet includes M code block, and M is positive integer;
If the packet is the new data packets, from first code block in the M code block traveled through to obtain to Few first data and at least one first solution bit selection data;
If the packet is not the new data packets, from first CRC CRC in the M code block Check errors code block is traveled through to obtain at least one second data and at least one second solution bit selection data;
At least one first data or at least one second data are subjected to code block cascade respectively, and carry out CRC schools Test.
2. according to the method for claim 1, it is characterised in that if the packet is the new data packets, Traveled through to obtain at least one first data and at least one first solution than special from first code block in the M code block Selecting data includes, and repeats following processing, until m-th code block is traversed:
Bit-level is carried out to first code block to handle to obtain first data;
First data are subjected to CRC check;
If first data store first data and carry out the bit of next code block by the CRC check Level processing;
If first data not over the CRC check, solve bit selection result in stored bits level processing procedure, The first solution bit selection data are obtained, and remaining is not subjected to bit-level processing code block and all carries out solving bit selection processing.
3. according to the method for claim 1, it is characterised in that if the packet is not the new data packets, Then traveled through to obtain at least one from first CRC CRC check erroneous block in the M code block At least one second solution bit selection data of two data include, and following processing are repeated, until m-th code block is traversed:
First CRC check erroneous block progress bit-level is handled to obtain second data;
CRC check is carried out to second data;
If second data store second data and carry out the bit of next code block by the CRC check Level processing;
If second data are not over the CRC check, at first CRC check erroneous block bit-level The solution bit selection result obtained during reason is stored, and obtains the second solution bit selection data, and remaining is only deposited The code block of storage solution bit selection data carries out solving bit selection processing.
4. according to the method for claim 2, it is characterised in that described that first code block progress bit-level is handled Include to first data:
Solution rate-matched is carried out to first code block and obtains the 3rd data;
3rd data are entered into row decoding and obtain first data.
5. according to the method for claim 3, it is characterised in that described to carry out first CRC check erroneous block Bit-level, which handles to obtain second data, to be included:
Solution rate-matched is carried out to first CRC check erroneous block and obtains the 4th data;
4th data progress HARQ is merged to obtain the 5th data;
5th data are entered into row decoding and obtain the second data.
6. a kind of HARQ processing units based on CRC check, it is characterised in that described device includes:
Judging unit, for judging whether packet is new data packets, wherein, the packet includes M code block, and M is just whole Number;
First Traversal Unit, in the case of being the new data packets in the packet, first from the M code block Individual code block is traveled through to obtain at least one first data and at least one first solution bit selection data;
Second Traversal Unit, in the case of being not the new data packets in the packet, from the in the M code block One CRC CRC check erroneous block is traveled through to obtain at least one second data and at least one second solution Bit selects data;
Code block concatenation unit, at least one first data or at least one second data to be carried out into code block respectively Cascade, and carry out CRC check.
7. device according to claim 6, it is characterised in that first Traversal Unit is used to repeat following place Reason, until m-th code block is traversed:
Bit-level is carried out to first code block to handle to obtain first data;
First data are subjected to CRC check;
If first data store first data and carry out the bit of next code block by the CRC check Level processing;
If first data not over the CRC check, solve bit selection result in stored bits level processing procedure, The first solution bit selection data are obtained, and remaining is not subjected to bit-level processing code block and all carries out solving bit selection processing.
8. device according to claim 6, it is characterised in that second Traversal Unit is used to repeat following place Reason, until m-th code block is traversed:
First CRC check erroneous block progress bit-level is handled to obtain second data;
CRC check is carried out to second data;
If second data store second data and carry out the bit of next code block by the CRC check Level processing;
If second data are not over the CRC check, at first CRC check erroneous block bit-level The solution bit selection result obtained during reason is stored, and obtains the second solution bit selection data, and remaining is only deposited The code block of storage solution bit selection data carries out solving bit selection processing.
9. device according to claim 7, it is characterised in that first Traversal Unit also includes:
Solution rate-matched is carried out to first code block and obtains the 3rd data;
3rd data are entered into row decoding and obtain first data.
10. device according to claim 8, it is characterised in that second Traversal Unit also includes:
Solution rate-matched is carried out to first CRC check erroneous block and obtains the 4th data;
4th data progress HARQ is merged to obtain the 5th data;
5th data are entered into row decoding and obtain the second data.
CN201510507572.3A 2015-08-18 2015-08-18 HARQ processing method and processing devices based on CRC check Active CN105007140B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510507572.3A CN105007140B (en) 2015-08-18 2015-08-18 HARQ processing method and processing devices based on CRC check

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510507572.3A CN105007140B (en) 2015-08-18 2015-08-18 HARQ processing method and processing devices based on CRC check

Publications (2)

Publication Number Publication Date
CN105007140A CN105007140A (en) 2015-10-28
CN105007140B true CN105007140B (en) 2018-02-16

Family

ID=54379672

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510507572.3A Active CN105007140B (en) 2015-08-18 2015-08-18 HARQ processing method and processing devices based on CRC check

Country Status (1)

Country Link
CN (1) CN105007140B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110430010B (en) * 2017-01-05 2020-08-07 华为技术有限公司 Information processing method and device
CN109064524A (en) * 2018-08-16 2018-12-21 上海联影医疗科技有限公司 A kind of data transmission method, rebuilds machine and medium at data collection plate

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101237241A (en) * 2007-01-31 2008-08-06 大唐移动通信设备有限公司 A method and system for realizing mixed automatic request re-transfer processing and channel decoding
CN101552659A (en) * 2008-04-01 2009-10-07 普天信息技术研究院有限公司 Selecting type data retransmitting method and equipment
CN101983489A (en) * 2008-03-31 2011-03-02 马维尔国际贸易有限公司 Method and apparatus for selective combining and decoding of the multiple code blocks of a transport block

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20060011249A (en) * 2004-07-29 2006-02-03 삼성전자주식회사 Method and apparatus for managing a deinterleaving buffer in a mobile communication system adapted block interleaving
AU2005239657B2 (en) * 2004-12-01 2007-12-13 Samsung Electronics Co., Ltd. Method and apparatus for transmitting and receiving data with high reliability in a mobile communication system supporting packet data transmission

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101237241A (en) * 2007-01-31 2008-08-06 大唐移动通信设备有限公司 A method and system for realizing mixed automatic request re-transfer processing and channel decoding
CN101983489A (en) * 2008-03-31 2011-03-02 马维尔国际贸易有限公司 Method and apparatus for selective combining and decoding of the multiple code blocks of a transport block
CN101552659A (en) * 2008-04-01 2009-10-07 普天信息技术研究院有限公司 Selecting type data retransmitting method and equipment

Also Published As

Publication number Publication date
CN105007140A (en) 2015-10-28

Similar Documents

Publication Publication Date Title
US8386901B2 (en) Method, device and software application for transmitting data packets in a communication system
CN1973500B (en) Method of, and system for and a station for transmitting data
CN104683073A (en) A decoding method and receiving set
CN101147352A (en) MIMO communication device and data re-transmitting method
CN103098410A (en) Increasing hybrid automatic repeat request (HARQ) throughput
JP5651191B2 (en) Method and apparatus for requesting retransmission of datagram in physical layer
CN103312473B (en) Reduce the method and apparatus that HARQ merges failure
CN102136887A (en) Cyclic redundancy check method and device for transmission blocks
CN104780029B (en) A kind of mixed automatic retransmission request method and relevant apparatus
CN105007140B (en) HARQ processing method and processing devices based on CRC check
CN108347311A (en) Send and receive method, access network equipment and the terminal device of feedback information
RU2015106910A (en) METHOD, DEVICE AND REPEAT SYSTEM
CN102148665B (en) Decoding method for LT (language translation) codes
TWI380621B (en) Method and apparatus for transmitting data, and a communication system
CN104144044B (en) Method for processing multi-device transparent HARQ
CN107733551A (en) A kind of data transmission method, device and system
CN104079376A (en) Data communication method and apparatus using forward error correction
CN102427398A (en) Error detection and correction method, system and device based on two-way parity check
JP3388035B2 (en) Data communication system, transmission apparatus and transmission method using hybrid automatic repeat request method
CN109067503B (en) Data retransmission method and device
EP3667970B1 (en) Harq re-transmission method and apparatus, and transmission device
US20160218835A1 (en) Method and apparatus for constituting feedback signal for harq
CN102208963B (en) Decoding method for determining rate-free codes through binary system
CN104901786B (en) HARQ soft combination methods based on LTE system and device
RU2450466C1 (en) Method of transmitting information over communication channels and system for realising said method

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
TA01 Transfer of patent application right

Effective date of registration: 20171129

Address after: 102412 Beijing City, Fangshan District Yan Village Yan Fu Road No. 1 No. 11 building 4 layer 402

Applicant after: Beijing Si Lang science and Technology Co.,Ltd.

Address before: 100080 Zhongguancun East Road, Beijing, No. 95, No.

Applicant before: Institute of Automation, Chinese Academy of Sciences

TA01 Transfer of patent application right
GR01 Patent grant
GR01 Patent grant
CP03 Change of name, title or address

Address after: 201306 building C, No. 888, Huanhu West 2nd Road, Lingang New District, China (Shanghai) pilot Free Trade Zone, Pudong New Area, Shanghai

Patentee after: Shanghai Silang Technology Co.,Ltd.

Address before: 102412 room 402, 4th floor, building 11, No. 1, Yanfu Road, Yancun Town, Fangshan District, Beijing

Patentee before: Beijing Si Lang science and Technology Co.,Ltd.

CP03 Change of name, title or address