Information transmission method, communication device, storage medium and program product

By compressing and encoding the transport block set to generate feedback information such as prefix codewords, padding bit sequences, and compressed codewords, the problem of wasted base station spectrum resources is solved, and data transmission efficiency is improved.

CN118900159APending Publication Date: 2024-11-05ZTE CORP

Patent Information

Application Number
CN202310497804.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-05-05
Publication Date
2024-11-05

AI Technical Summary

Technical Problem

In wireless communication, base stations need to simultaneously report the data packet reception status of tens of thousands of user devices, resulting in wasted spectrum resources and excessive feedback overhead.

Method used

By compressing and encoding the set of correctly or incorrectly received transport blocks, feedback information such as prefix codewords, padding bit sequences, and compressed codewords is generated, reducing the number of input bits for channel coding and improving data transmission efficiency.

Benefits of technology

This has resulted in the saving of spectrum resources, improved data transmission efficiency, and reduced spectrum resource costs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118900159A_ABST
    Figure CN118900159A_ABST
Patent Text Reader

Abstract

The embodiment of the invention provides an information transmission method. The method comprises the following steps: receiving a transmission block sent by at least one second node; the transmission blocks form a transmission block set; sending feedback information of the transmission block set to at least one second node; wherein the feedback information is used for representing the receiving condition of the transmission block sent by the at least one second node, and the feedback information comprises at least two of a prefix code word, a filling bit sequence and a compressed code word, so that spectrum resources can be saved, and the data transmission efficiency can be improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The embodiments of the present application relate to the field of communication technology, and in particular, to an information transmission method, communication equipment, storage medium and program product. Background Art

[0002] With the development of wireless communication technology, each base station (BS) needs to support the connection of tens of thousands of user equipment (UE). Taking the contention-based grant-free (CBGF) random access transmission scheme as an example, the base station does not need to schedule and allocate resources to the UE sending data in advance, nor can it know in advance which UE has data transmission requirements. In this way, there is a possibility that multiple UEs use the same time and frequency resources for transmission. In order for the base station to distinguish different UEs during the receiving detection process, the UE sending data will randomly select a resource (also called a signature) from the random access resource set provided by the system (such as spread spectrum sequence, pilot sequence, etc.) to send data.

[0003] Since the base station does not schedule the UE, it needs to feedback an acknowledgement signal to each UE to determine whether the data packet is successfully received. A base station needs to serve tens of thousands of UEs at the same time. If a 1-bit acknowledgement signal is fed back to each UE being served, tens of thousands of bits of acknowledgement signal need to be fed back. Such feedback overhead is too large, resulting in a waste of spectrum resources. Summary of the invention

[0004] The embodiments of the present application provide an information transmission method, a communication device, a storage medium, and a program product, which are intended to save spectrum resources and improve data transmission efficiency.

[0005] In a first aspect, an embodiment of the present application provides an information transmission method, comprising: receiving a transmission block sent by at least one second node; the transmission blocks form a transmission block set; sending feedback information of the transmission block set to at least one of the second nodes; wherein the feedback information is used to characterize the reception status of the transmission block sent by at least one of the second nodes, and the feedback information includes at least two of the following: a prefix codeword, a padding bit sequence, and a compression codeword.

[0006] In a second aspect, an embodiment of the present application provides an information transmission method, comprising: sending a transmission block to a first node; receiving feedback information sent by the first node based on the transmission block, wherein the feedback information is used to characterize the reception status of the transmission block, and the feedback information includes at least two of the following: a prefix codeword, a padding bit sequence, and a compression codeword.

[0007] In a third aspect, an embodiment of the present application provides a communication device, characterized in that it includes: at least one processor; at least one memory for storing at least one program; at least one of the programs is executed by at least one of the processors to execute the information transmission method described in the first aspect or the second aspect.

[0008] In a fourth aspect, an embodiment of the present application provides a computer-readable medium, characterized in that a program executable by a processor is stored therein, and the program executable by the processor executes the information transmission method described in the first aspect or the second aspect when the processor is executed.

[0009] In a fifth aspect, an embodiment of the present application provides a computer program product, comprising a computer program or computer instructions, characterized in that the computer program or the computer instructions are stored in a computer-readable storage medium, a processor of a communication device reads the computer program or the computer instructions from the computer-readable storage medium, and the processor executes the computer program or the computer instructions, so that the communication device performs the information transmission method as described in the first aspect or the second aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0010] Figure 1 It is a schematic diagram of the system architecture of an application scenario of the information transmission method provided in one embodiment of the present application.

[0011] Figure 2 It is a flowchart of an information transmission method provided by an embodiment of the present application.

[0012] Figure 3 It is a flowchart of an information transmission method provided by an embodiment of the present application.

[0013] Figure 4 It is a flowchart of a method for determining a transmission block error pattern provided by an embodiment of the present application.

[0014] Figure 5 It is a flowchart of a method for determining a transmission block error pattern provided by another embodiment of the present application.

[0015] Figure 6 This is a flowchart of determining a compressed codeword based on a transport block identifier set of a transport block subset provided by an embodiment of the present application.

[0016] Figure 7It is a pseudo program code for determining a compressed codeword according to a transport block identifier set of a transport block subset provided by an embodiment of the present application.

[0017] Figure 8 A flowchart of determining a compressed codeword according to a transmission block error pattern provided in another embodiment of the present application.

[0018] Fig. 9 A pseudo program code for determining a compressed codeword according to a transmission block error pattern is provided in accordance with another embodiment of the present application.

[0019] Fig.10 It is a schematic diagram of feedback information provided by an embodiment of the present application.

[0020] Fig.11 This is a schematic diagram of the relationship between the second node, transmission block and user identifier provided in an example of the present application.

[0021] Fig.12 This is a schematic diagram of the relationship between the second node, transmission block, random access label and label index provided in an example of the present application.

[0022] Fig.13 This is a schematic diagram of the relationship between feedback information, prefix code, padding bit sequence and compressed codeword provided in an example of the present application.

[0023] Fig.14 This is a schematic diagram of the relationship between the second node, transmission block, random access label and label index provided in an example of the present application.

[0024] Fig.15 This is a schematic diagram of the relationship between feedback information, prefix code, padding bit sequence and compressed codeword provided in an example of the present application.

[0025] Fig.16 This is a schematic diagram of the relationship between the second node, transmission block, user identifier, random access label and label index provided in an example of the present application.

[0026] Fig.17 This is a schematic diagram of the relationship between feedback information, padding bit sequence, compression codeword and prefix code provided in an example of the present application.

[0027] Figure 18(a) is a schematic diagram of the relationship between the second node, transmission block, user identifier, random access tag and tag index provided in an example of the present application.

[0028] FIG18( b ) is a schematic diagram showing the relationship between feedback information, prefix code and padding bit sequence provided in an example of the present application.

[0029] Fig.19 A schematic diagram of the relationship between feedback information, prefix codes, and compressed codewords provided as an example of the present application.

[0030] Fig. 20 This is a mapping chart of transmission block error patterns and compression codewords provided in an example of the present application.

[0031] Fig.21 A schematic diagram of the relationship between feedback information, compression codewords and prefix codes provided in an example of the present application.

[0032] Fig. 22 A schematic diagram of the relationship between feedback information, prefix codes and compressed codewords provided for an example of the present application.

[0033] Fig.23 This is a mapping chart of transmission block error patterns and compressed codewords provided in an example of the present application.

[0034] Fig.24 This is a schematic diagram of the relationship between the second node, transmission block, random access label and label index provided in the example of this application.

[0035] Fig.25 A schematic diagram of the relationship between feedback information, compression codewords and prefix codes provided in an example of the present application.

[0036] Fig.26 This is a mapping chart of transmission block error patterns and compressed codewords provided in an example of the present application.

[0037] Fig. 27 This is a schematic diagram of the relationship between feedback information, prefix codes and compressed codewords provided in an example of the present application.

[0038] Fig.28 This is a schematic diagram of the relationship between feedback information, prefix codes and compressed codewords provided in an example of the present application.

[0039] Fig.29 It is a flowchart of an information transmission method provided by an embodiment of the present application.

[0040] Fig.30 A flowchart of a decoding result determination method provided in one embodiment of the present application.

[0041] Fig.31 It is a schematic diagram of the structure of an information transmission device provided in one embodiment of the present application.

[0042] Fig.32 It is a schematic diagram of the structure of an information transmission device provided in one embodiment of the present application.

[0043] Fig.33 It is a structural diagram of a base station provided in one embodiment of the present application.

[0044] Fig.34 It is a structural diagram of a user equipment provided in one embodiment of the present application. DETAILED DESCRIPTION

[0045] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0046] It should be noted that, although the functional modules are divided in the device schematic diagram and the logical order is shown in the flowchart, in some cases, the steps shown or described may be performed in a different order than the module division in the device or the order in the flowchart. The terms "first", "second", etc. in the specification, claims and the above drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence.

[0047] In the description of the embodiments of the present application, unless otherwise clearly defined, words such as setting, installing, connecting, etc. should be understood in a broad sense, and those skilled in the art can reasonably determine the specific meanings of the above words in the embodiments of the present application in combination with the specific content of the technical solution. In the embodiments of the present application, words such as "further", "exemplarily" or "optionally" are used to represent examples, illustrations or explanations, and should not be interpreted as being more preferred or more advantageous than other embodiments or design solutions. The use of words such as "further", "exemplarily" or "optionally" is intended to present related concepts in a specific way.

[0048] Figure 1 This is a schematic diagram of the system architecture of an application scenario of the information transmission method provided in an embodiment of the present application. Figure 1 As shown, in the wireless communication system 100, one base station 110 serves multiple types of user equipment (120, 130, 140), and there may be one or more user equipment of each type. Therefore, the base station 110 serves multiple user equipment.

[0049] The information transmission method provided in the present application can be applied to various wireless communication systems, for example, the Internet of Things (IoT), narrowband Internet of Things (NB-IoT), long term evolution (LTE), fifth generation (5G) communication system, LTE and 5G hybrid architecture, 5G new radio (NR) system, and new communication systems that will emerge in the future development of communication. As long as there is an entity in the communication system that can receive a transport block (TB) and send feedback information on the reception of the transport block, and another entity that can send a transport block and receive feedback information on the reception of the transport block, the information transmission method provided in the embodiment of the present application can be used.

[0050] The user equipment involved in the embodiments of the present application is a device that provides voice and / or data connectivity to users, for example, a handheld device with wireless connection function, a vehicle-mounted device, etc. The user equipment may also be other processing devices connected to a wireless modem. The user equipment may communicate with one or more core networks through a radio access network (RAN). The user equipment may also be referred to as a wireless terminal, a subscriber unit (subscriberunit), a subscriber station (subscriber station), a mobile station (mobile station), a mobile station (mobile), a remote station (remote station), an access point (access point), a remote terminal (remote terminal), an access terminal (access terminal), a user terminal (user terminal), and a user agent (user agent). The user equipment may be a mobile terminal, such as a mobile phone (or "cellular" phone) and a computer with a mobile terminal, for example, a portable, pocket-sized, handheld, computer-built-in or vehicle-mounted mobile device, which exchanges language and / or data with a wireless access network. For example, the user device may also be a personal communication service (PCS) phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), etc. Common user devices include, for example, mobile phones, tablet computers, laptop computers, PDAs, mobile internet devices (MIDs), wearable devices such as smart watches, smart bracelets, pedometers, etc., but the embodiments of the present application are not limited thereto.

[0051] The base station involved in the embodiments of the present application may be a base station (base transceiver station, BTS) in the global system for mobile communication (global system for mobile communication, GSM) or code division multiple access (code division multiple access, CDMA), or a base station (NodeB) in wideband code division multiple access (WCDMA), or an evolutionary Node B (eNB or e-NodeB) in LTE, or a new radio controller (NR controller), or a gNode B (gNB) in a 5G system, or a centralized unit, or a new wireless base station, or a radio frequency remote module, or a micro base station, or a relay, or a distributed unit, or a transmission reception point (TRP) or a transmission point (TP) or any other wireless access device, but the embodiments of the present application are not limited thereto. The network device may cover one or more cells.

[0052] Taking the 5G Technical Specification (TS) of the 3rd Generation Partnership Project (3GPP) as an example, the UE's transmission is scheduled by the base station, so the downlink does not need to feedback the acknowledgement signal. In the uplink, the UE receives the transmission block signal sent by the base station and uses the cyclic redundancy check (CRC) code of the transmission block to determine whether the current transmission block is correctly received. If the transmission block passes the CRC check, it is considered that the reception is correct, and the UE feeds back the correct acknowledgement (positive Acknowledgement, ACK) status (indicated by bit "1") to the base station on the time-frequency resources specified by the base station; otherwise, the UE feeds back the wrong acknowledgement (Negative Acknowledgement, NACK) status (indicated by bit "0") to the base station. According to the needs of different scenarios, the acknowledgement status can be transmitted on the 5 physical uplink control channel (PUCCH) formats defined in the 5G standard. These five formats are: PUCCH format 0, PUCCH format 1, PUCCH format 2, PUCCH format 3 and PUCCH format 4, among which PUCCH formats 0 to 1 are used to transmit 1 or 2 bits of hybrid automatic repeat request (Hybrid Automatic Repeat-reQuest, HARQ) response (HARQ-ACK) information and scheduling request (Scheduling Request), and PUCCH formats 2 to 4 are used to transmit channel state information (Channel State Information, CSI) reports or multi-bit HARQ-ACK information.

[0053] Table 1 Examples of the number of resources occupied, number of transmission bits and usage of different PUCCH formats

[0054]

[0055]

[0056] Table 1 shows the number of payload bits (payload size), the number of occupied resources and the purpose under different PUCCH formats, where OFDM stands for Orthogonal Frequency-Division Multiplexing, RB stands for Resource Block, and RE stands for Resource Element.

[0057] The number of payload bits of PUCCH format 0 and format 1 is no more than 2. The payload is modulated using phase shift keying (Phase-Shift Keying), multiplied by the sequence and spread to obtain the transmission signal. PUCCH formats 2 to 4 use polarization code channel coding and phase shift keying to obtain the transmission signal.

[0058] As can be seen from Table 1, on average, at least 6 REs are required to transmit 1 bit of response signal. For future large-scale scheduling-free systems, even if the base station only serves 1,000 UEs, at least 6,000 REs are required for response signal feedback (about 36 RBs, each RB has 12*14=168 REs). This will occupy a large amount of spectrum resources. But in fact, the number of UEs transmitting data at the same time is far less than 1,000 (usually only dozens), and the response signal feedback efficiency is low.

[0059] Based on this, the embodiments of the present application provide an information transmission method, a communication device, a storage medium and a program product, which compress and encode the information of a set of correctly or incorrectly received transmission blocks, so that the response signals of multiple correctly or incorrectly received UEs are compressed, thereby greatly reducing the number of input bits for channel coding or even minimizing it (in most cases, only 1 bit more than the optimal compression), and then sending it out after channel coding and modulation; each UE decodes and decompresses the received response signal, extracts the corresponding response signal, and thereby achieves the purpose of saving spectrum resources and improving data transmission efficiency.

[0060] It should be noted that in all the embodiments of this application, represents the smallest integer greater than or equal to x, represents the largest integer less than or equal to x, represents the number of combinations of x and y, log2x is the logarithm of x with base 2, max represents the maximum function, mod represents the remainder function, for example: 0mod 2=0, 1mod 2=1, 3mod 2=1, 5mod 3=2, or mod(x,y) represents the remainder of x divided by y, for example: mod(0,2)=0, mod(1,2)=1, mod(3,2)=1, mod(5,3)=2, which will not be repeated in the following text.

[0061] Figure 2 This is a flow chart of an information transmission method provided by an embodiment of the present application. Figure 2 As shown, the information transmission method provided in the embodiment of the present application can be used for any network element with data receiving and signaling sending functions, such as a base station, a relay, a terminal, etc., including but not limited to step S1000, step S2000, step S3000 and step S4000.

[0062] Step S1000: receiving a transmission block sent by at least one second node, where the transmission blocks form a transmission block set.

[0063] In some embodiments, a first node receives a signal including a transport block sent by a second node. The second node may send one or more transport blocks to the first node, and the one or more transport blocks sent form a transport block set.

[0064] In other embodiments, the first node receives a signal containing a transmission block sent by a plurality of second nodes. The plurality of second nodes form a second node sequence (A Sequence of Second Nodes), each of the plurality of second nodes can send one or more transmission blocks to the first node, and all transmission blocks sent by the plurality of second nodes form a transmission block set. The second node sequence includes Nu second nodes, and the transmission block set includes NT transmission blocks; wherein Nu and NT are positive integers, and Nu is less than or equal to NT. It is understood that a plurality refers to two or more.

[0065] In some embodiments, a transport block in a transport block set includes a transport block identifier (Transport Block Identifier), which is an element of an ordered set of transport block identifiers. The ordered set of transport block identifiers includes Na transport block identifiers I(1), I(2), ..., I(Na), where Na is the size of the ordered set of transport block identifiers; for i = 1, 2, ...., Na, the i-th element of the ordered set of transport block identifiers is I(i); wherein the i-th element I(i) of the ordered set of transport block identifiers is an integer; illustratively, the i-th element I(i) of the ordered set of transport block identifiers may be an integer i or an integer i-1.

[0066] In some embodiments, the transport block is indicated by a transport block identification.

[0067] In some embodiments, the transport block identifier may be one of the following: a user equipment identifier (User Equipment Identifier), an index value of a user equipment identifier, or a signature index.

[0068] In some embodiments, the user identifier is a user identifier of a second node in the second node sequence, the user identifiers of two different second nodes in the second node sequence are different, and the user identifier can be used by the first node to distinguish different transmission blocks in the transmission block set in a signal containing the transmission block set, wherein the user identifier is an integer.

[0069] It should be noted that the user identifier can be a subscription permanent identifier (SUPI), a generic public subscription identifier (GPSI), a permanent equipment identifier (PEI), a network access identifier (NAI), a subscription concealed identifier (SUCI), a globally unique temporary identifier (GUTI), a radio network temporary identifier (RNTI), a system information RNTI (SI-RNTI), a paging RNTI (P-RNTI), a random access RNTI (RA-RNTI), a temporary cell RNTI (TC-RNTI), a cell RNTI (Cell RNTI, C-RNTI), and an uplink control channel transmit power control RNTI (Transmit Power Control-PUCCH RNTI, TPC-PUCCH-RNTI), uplink shared channel transmit power control RNTI (Transmit Power Control-PUSCH RNTI, TPC-PUSCH-RNTI), channel sounding reference signal transmit power control RNTI (Transmit Power Control-Sounding Reference Symbols RNTI, TPC-SRS-RNTI), interruption RNTI (Interruption RNTI, INT-RNTI), modulation coding scheme cell RNTI (Modulcation Coding Scheme Cell RNTI, MCS-C-RNTI), configuration scheduling RNTI (Configured Scheduling RNTI, CS-RNTI), slot format indication RNTI (Slot Format Indication RNTI, SFI-RNTI), semi-persistent RNTI (Semi-Persistent CSI RNTI, SP-CSI-RNTI), etc.

[0070] In some embodiments, the transport block identifier is a user identifier, and the element of the transport block identifier ordered set is a user identifier.

[0071] Exemplarily, the transport block identifier ordered set I=<I(1),I(2),I(3),I(4),I(5)> =<0,1,2,3,4>; wherein the size of the transport block identifier ordered set is Na=5, and the user identifier corresponding to the second element I(2) in the transport block identifier ordered set is 1; illustratively, the transport block identifier ordered set I=<I(1),I(2),I(3),I(4),I(5)> =<1,2,3,4,5>; wherein the size of the transport block identifier ordered set is Na=5, and the user identifier corresponding to the second element I(2) in the transport block identifier ordered set is 2; illustratively, the transport block identifier ordered set I=<I(1),I(2),I(3),I(4)> =<0,11,20,30>; wherein the size of the transport block identifier ordered set is Na=4, and the user identifier corresponding to the second element I(2) in the transport block identifier ordered set is 11.

[0072] In some embodiments, the index value of the user identifier refers to the ordered set of transport block identifiers I=<I(1),I(2),.,I(Na)> The index k of the element I(k) in , k = 1, 2, ...., Na, where the index value of the user identifier is an integer.

[0073] In some embodiments, the transmission block identifier is an index value of the user identifier, the user identifier is an element in an ordered set of user identifiers, and the ordered set of user identifiers includes Na user identifiers ID(1), ID(2), ..., ID(Na); wherein Na is the size of the ordered set of user identifiers, which is also the size of the ordered set of transmission block identifiers, k=1, 2, ..., Na, and the index value of the user identifier corresponding to the kth user identifier ID(k) in the ordered set of user identifiers is the kth element I(k) in the ordered set of transmission block identifiers. Exemplarily, the ordered set of user identifiers ID=<ID(1),ID(2),ID(3),ID(4)> = <0,11,20,30>, the corresponding transport block identifier ordered set I =<I(1),I(2),I(3),I(4)> =<0,1,2,3>; wherein the user identifier ordered set size and the transport block identifier ordered set size are both Na=4, the index value of the user identifier of the element ID(2)=11 in the user identifier ordered set is the element I(2)=1 in the transport block identifier ordered set; illustratively, the user identifier ordered set ID=<ID(1),ID(2),ID(3),ID(4)> =<11,0,20,30>, the corresponding transport block identifier ordered set I=<I(1),I(2),I(3),I(4)> =<0,1,2,3>; wherein the user identifier ordered set size and the transport block identifier ordered set size are both Na=4, the index value of the user identifier of the element ID(2)=0 in the user identifier ordered set is the element I(2)=1 in the transport block identifier ordered set; illustratively, the user identifier ordered set ID=<ID(1),ID(2),ID(3),ID(4)> =<11,0,20,30>, the corresponding transport block identifier ordered set I=<I(1),I(2),I(3),I(4)> =<1,2,3,4>; wherein the user identifier ordered set size and the transport block identifier ordered set size are both Na=4, and the index value of the user identifier of the element ID(2)=0 in the user identifier ordered set is the element I(2)=2 in the transport block identifier ordered set.

[0074] In some embodiments, the transmission block identifier is a tag index, which is a tag index of a random access tag (signature), that is, a transmission block in a transmission block set includes a random access tag, which is an element of an ordered set of random access tags, and the ordered set of random access tags includes Na random access tags r(1), r(2), ..., r(Na); wherein Na is the size of the ordered set of random access tags, which is also the size of the ordered set of transmission block identifiers, i = 1, 2, ...., Na, and the tag index of the i-th random access tag r(i) in the ordered set of random access tags is the i-th element I(i) of the ordered set of transmission block identifiers, wherein the i-th element I(i) of the ordered set of transmission block identifiers can be an integer i or an integer i-1.

[0075] It should be noted that the random access label can be a pilot, a reference signal, a preamble, a spread spectrum sequence, an interleaver, an interleaver pattern, an interleaver sequence, a scrambling sequence, a sparse code sequence, etc.

[0076] In some embodiments, the second node determines a random access tag of a transport block according to its user identifier as a random access tag included in a transport block in the transport block set, and these random access tags can be used by the first node to distinguish different transport blocks in the transport block set in a signal containing the transport block set.

[0077] In some embodiments, the second node determines a random access tag included in a transport block as a random access tag included in a transport block in a transport block set based on higher layer parameters, and these random access tags can be used by the first node to distinguish different transport blocks in the transport block set in a signal containing the transport block set.

[0078] It should be noted that the first node and the second node may be any network element having data receiving and signaling sending functions, such as a base station, a relay, and a terminal.

[0079] Step S2000: According to a transport block set, information of a transport block subset of the transport block set is obtained.

[0080] It should be noted that the transport block subset is a set consisting of correct transport blocks or erroneous transport blocks in the transport block set.

[0081] In some embodiments, the information of the transport block subset includes a transport block identifier set of the transport block subset, a maximum number of transport blocks Pmax of the transport block subset, a number of transport blocks P of the transport block subset, an ordered set of transport block identifiers, a size of the ordered set of transport block identifiers Na, a feedback information length Nf, and a transport block error pattern a. It should be noted that the feedback information can be obtained according to the above information of one or more of the transport block subsets, that is, the generation of the feedback information does not necessarily require all of the above information.

[0082] In some embodiments, when the transport block subset is a set consisting of correct transport blocks in the transport block set, the transport block identifier set of the transport block subset is a correct transport block identifier set; the maximum number of transport blocks of the transport block subset is the maximum number of correct transport blocks Pmax; and the number of transport blocks of the transport block subset is the correct number of transport blocks P.

[0083] Exemplarily, when the transmission block subset is a set consisting of correct transmission blocks in the transmission block set, the information of the transmission block subset is the information of the correct transmission block set. The information of the correct transmission block set includes the maximum number of correct transmission blocks Pmax, the ordered set of transmission block identifiers, the size of the ordered set of transmission block identifiers Na, the correct transmission block identifier set, the number of correct transmission blocks P, the transmission block error pattern a, and the length Nf of the feedback information f. It should be noted that the feedback information can be obtained based on the above information of one or more correct transmission blocks, that is, the generation of the feedback information does not necessarily require all of the above information.

[0084] In some embodiments, when the transmission block subset is a set consisting of erroneous transmission blocks in the transmission block set, the transmission block identification set of the transmission block subset is an erroneous transmission block identification set; the maximum number of transmission blocks of the transmission block subset is the maximum number of erroneous transmission blocks Pmax; the number of transmission blocks of the transmission block subset is the number of erroneous transmission blocks P.

[0085] Exemplarily, when the transmission block subset is a set consisting of erroneous transmission blocks in the transmission block set, the information of the transmission block subset is the information of the erroneous transmission block set. The information of the erroneous transmission block set includes the maximum number of erroneous transmission blocks Pmax, an ordered set of transmission block identifiers, a size of the ordered set of transmission block identifiers Na, an erroneous transmission block identifier set, the number of erroneous transmission blocks P, a transmission block error pattern a, and the length Nf of the feedback information f. It should be noted that the feedback information can be obtained based on the above information of one or more erroneous transmission blocks, that is, the generation of the feedback information does not necessarily require all of the above information.

[0086] In some embodiments, the maximum number of transport blocks Pmax of the transport block subset is equal to the size Na of the ordered set of transport block identifiers; in other embodiments, the maximum number of transport blocks Pmax of the transport block subset is configured by the first node; in still other embodiments, the maximum number of transport blocks Pmax of the transport block subset is pre-configured by a high-level parameter; in still other embodiments, the maximum number of transport blocks Pmax of the transport block subset is less than or equal to Where Na is the size of the ordered set of transport block identifiers.

[0087] In some embodiments, the transmission block subset is a correct transmission block set, and the information of the correct transmission block set includes a correct transmission block identifier set, and the correct transmission block identifier set is a set of user identifiers included in the correctly received transmission blocks in the transmission block set. The correctly received transmission block refers to a transmission block whose response status is a correct response ACK, and a user identifier belonging to the correct transmission block identifier set is used to indicate that the response status of the transmission block corresponding to the user identifier is a correct response ACK, and a user identifier not belonging to the correct transmission block identifier set is used to indicate that the response status of the transmission block corresponding to the user identifier is an incorrect response NACK.

[0088] In some other embodiments, the transmission block subset is an erroneous transmission block set, and the information of the erroneous transmission block set includes an erroneous transmission block identifier set, which is a set of user identifiers included in the erroneously received transmission blocks in the transmission block set. The erroneously received transmission block refers to a transmission block whose response status is an erroneous response NACK, a user identifier belonging to the erroneous transmission block identifier set is used to indicate that the response status of the transmission block corresponding to the user identifier is an erroneous response NACK, and a user identifier not belonging to the erroneous transmission block identifier set is used to indicate that the response status of the transmission block corresponding to the user identifier is a correct response ACK.

[0089] In some embodiments, the transmission block subset is a correct transmission block set, and the information of the correct transmission block set includes a correct transmission block identifier set, and the correct transmission block identifier set is a set of index values ​​of user identifiers included in the correctly received transmission blocks in the transmission block set. The correctly received transmission block refers to a transmission block whose response status is a correct response ACK, and the index value of a user identifier belongs to the correct transmission block identifier set, which is used to indicate that the response status of the transmission block corresponding to the index value of the user identifier is a correct response ACK, and the index value of a user identifier does not belong to the correct transmission block identifier set, which is used to indicate that the response status of the transmission block corresponding to the index value of the user identifier is an incorrect response NACK.

[0090] In some other embodiments, the transmission block subset is an erroneous transmission block set, and the information of the erroneous transmission block set includes an erroneous transmission block identifier set, and the erroneous transmission block identifier set is a set of index values ​​of user identifiers included in the erroneously received transmission blocks in the transmission block set. The erroneously received transmission block refers to a transmission block whose response status is an erroneous response NACK, and the index value of a user identifier belonging to the erroneous transmission block identifier set is used to indicate that the response status of the transmission block corresponding to the index value of the user identifier is an erroneous response NACK, and the index value of a user identifier not belonging to the erroneous transmission block identifier set is used to indicate that the response status of the transmission block corresponding to the index value of the user identifier is a correct response ACK.

[0091] In some embodiments, the transmission block subset is a correct transmission block set, and the information of the correct transmission block set includes a correct transmission block identification set, and the correct transmission block identification set is a set of label indices of random access labels corresponding to correctly received transmission blocks in the transmission block set. A correctly received transmission block refers to a transmission block whose response status is a correct response ACK, and a label index of a random access label belongs to the correct transmission block identification set to indicate that the response status of the transmission block corresponding to the random access label is a correct response ACK, and a label index of a random access label does not belong to the correct transmission block identification set to indicate that the response status of the transmission block corresponding to the random access label is an incorrect response NACK.

[0092] In some other embodiments, the transmission block subset is an erroneous transmission block set, and the information of the erroneous transmission block set includes an erroneous transmission block identification set, which is a set of label indices of random access labels corresponding to erroneously received transmission blocks in the transmission block set. An erroneously received transmission block refers to a transmission block whose response status is an erroneous response NACK, a label index of a random access label belonging to the erroneous transmission block identification set is used to indicate that the response status of the transmission block corresponding to the label index of the random access label is an erroneous response NACK, and a label index of a random access label not belonging to the erroneous transmission block identification set is used to indicate that the response status of the transmission block corresponding to the label index of the random access label is a correct response ACK.

[0093] Step S3000: Encode the information of the transport block subset to obtain feedback information; wherein the feedback information is used to characterize the reception status of the transport block sent by at least one second node; the encoding process includes compressing and encoding the information of the transport block subset.

[0094] It can be understood that the compression coding may include at least one of the following source coding algorithms: arithmetic coding, Huffman coding, and Shanno-Fano coding.

[0095] Figure 3 1 is a flow chart of “encoding information of a subset of transmission blocks to obtain feedback information” provided by an embodiment of the present application. Figure 3 As shown, the encoding process of the information of the transmission block subset to obtain feedback information includes the following step S3100.

[0096] Step S3100: Determine a prefix codeword according to the information of the transport block subset; determine a padding bit sequence according to the information of the transport block subset; and determine a compression codeword according to the information of the transport block subset.

[0097] In some embodiments, determining a prefix codeword according to information of a transport block subset includes: determining a number of prefix codeword bits Np according to information of the transport block subset; and then determining the prefix codeword according to the number of prefix codeword bits Np.

[0098] In some embodiments, the number of prefix codeword bits Np is determined according to a maximum number Pmax of transport blocks in the transport block subset and the number P of transport blocks in the transport block subset.

[0099] Exemplarily, the number of prefix codeword bits Np=Pmax-P+1.

[0100] In some embodiments, the transport block subset is a correct transport block set, and the number of prefix codeword bits Np is determined according to the maximum number of correct transport blocks Pmax and the size of the correct transport block identifier set, where P ACK is the size of the correct transport block identifier set.

[0101] Exemplarily, the number of prefix codeword bits Np=Pmax-P ACK +1.

[0102] In some other embodiments, the transport block subset is an erroneous transport block set, and the number of prefix codeword bits Np is determined according to the maximum number of erroneous transport blocks Pmax and the size of the erroneous transport block identifier set, where P NACK is the size of the set of error transmission block identifiers.

[0103] Exemplarily, the number of prefix codeword bits Np=Pmax-P NACK +1.

[0104] In some embodiments, the number of prefix codeword bits Np is determined based on at least one of the following parameters: the maximum number of transport blocks Pmax in the transport block subset, the number of transport blocks P in the transport block subset, the size Na of the ordered set of transport block identifiers, and the length Nf of the feedback information f.

[0105] For example, the number of prefix codeword bits or the number of prefix codeword bits or the number of prefix codeword bits or the number of prefix codeword bits

[0106] In some embodiments, determining the prefix codeword according to the number of prefix codeword bits Np includes: determining the first Np-1 bits of the prefix codeword to be "1", and determining the last bit of the prefix codeword to be "0".

[0107] Exemplarily, the number of prefix codeword bits Np=1, and the prefix codeword is [0]; the number of prefix codeword bits Np=4, and the prefix codeword is [1,1,1,0]; the number of prefix codeword bits Np=9, and the prefix codeword is [1,1,1,1,1,1,1,1,0].

[0108] In some other embodiments, determining the prefix codeword according to the number of prefix codeword bits Np includes: determining the first Np-1 bits of the prefix codeword to be "0" and determining the last bit of the prefix codeword to be "1".

[0109] Exemplarily, the number of prefix codeword bits Np=1, and the prefix codeword is [1]; the number of prefix codeword bits Np=4, and the prefix codeword is [0,0,0,1]; the number of prefix codeword bits Np=9, and the prefix codeword is [0,0,0,0,0,0,0,0,1].

[0110] In some other embodiments, determining the prefix codeword according to the number Np of prefix codeword bits includes: determining the first bit of the prefix codeword to be "0" and determining the last Np-1 bits of the prefix codeword to be "1".

[0111] Exemplarily, the number of prefix codeword bits Np=1, and the prefix codeword is [0]; the number of prefix codeword bits Np=4, and the prefix codeword is [1,0,0,0]; the number of prefix codeword bits Np=9, and the prefix codeword is [1,0,0,0,0,0,0,0,0].

[0112] In some other embodiments, determining the prefix codeword according to the number Np of prefix codeword bits includes: determining the first bit of the prefix codeword to be "1" and determining the last Np-1 bits of the prefix codeword to be "0".

[0113] Exemplarily, the number of prefix codeword bits Np=1, and the prefix codeword is [1]; the number of prefix codeword bits Np=4, and the prefix codeword is [0,1,1,1]; the number of prefix codeword bits Np=9, and the prefix codeword is [0,1,1,1,1,1,1,1,1].

[0114] It should be noted that the prefix code is used to indicate the number of transport blocks P of the transport block subset or the size of the transport block identifier set of the transport block subset. The advantage of using the prefix code is that when receiving feedback information, the number of correct or incorrect transport blocks P can be determined by simply counting consecutive "0" or "1".

[0115] In some embodiments, determining the padding bit sequence according to the information of the transport block subset includes: the padding bit sequence is an empty sequence, that is, there is no padding bit sequence.

[0116] In some embodiments, determining the padding bit sequence according to the information of the transport block subset includes: determining the padding bit sequence length Nfb according to the information of the transport block subset; and then determining the padding bit sequence according to the padding bit sequence length Nfb.

[0117] In some embodiments, the padding bit sequence length Nfb is determined according to the transport block identifier ordered set size Na, the maximum value Pmax of the number of transport blocks in the transport block subset, and the number P of transport blocks in the transport block subset.

[0118] For example, the padding bit sequence length is Or padding bit sequence length in, Or padding bit sequence length Where Nf is the length of the feedback information; or the length of the padding bit sequence Right now

[0119] In some embodiments, the padding bit sequence length Nfb is determined according to the length Nf of the feedback information, the length Np of the prefix codeword, the size Na of the transport block identifier ordered set, and the number P of transport blocks in the transport block subset.

[0120] For example, the padding bit sequence length is

[0121] In some embodiments, the padding bit sequence length Nfb is determined based on at least one of the following parameters: the length Nf of the feedback information, the length Np of the prefix codeword, the size Na of the ordered set of transport block identifiers, the maximum value Pmax of the number of transport blocks in the transport block subset, and the number P of transport blocks in the transport block subset.

[0122] For example, the padding bit sequence length is Or padding bit sequence length Or padding bit sequence length in, Or padding bit sequence length

[0123] In some embodiments, according to the length of the padding bit sequence Nfb, the padding bit sequence is determined by: determining the padding bit sequence to be an all-zero sequence [0, ..., 0] of length Nfb.

[0124] In some other embodiments, according to the length of the filling bit sequence Nfb, the filling bit sequence is determined by: determining the filling bit sequence to be an all-one sequence [1, ..., 1] of length Nfb.

[0125] In some other embodiments, the filling bit sequence is determined according to the filling bit sequence length Nfb by: determining the filling bit sequence to be a pseudo-random sequence of length Nfb.

[0126] In some other embodiments, the filling bit sequence is determined according to the filling bit sequence length Nfb by: determining the filling bit sequence to be a preset sequence of length Nfb known to both the first node and the second node.

[0127] In some other embodiments, the filling bit sequence is determined according to the filling bit sequence length Nfb as follows: according to the filling bit sequence length Nfb being 0, the filling bit sequence is determined to be an empty sequence.

[0128] The function of the padding bit sequence is to ensure that the length of the feedback information is the same under the number P of transport blocks in different transport block subsets, so that the second node does not need to perform blind detection to determine the length of the feedback information, thereby reducing decoding complexity.

[0129] In some embodiments, a compressed codeword is directly determined based on information about a transport block subset, wherein the compressed codeword is a bit sequence of length Nc, and the information about the transport block subset includes at least one of the following: a maximum number of transport blocks Pmax of the transport block subset, an ordered set of transport block identifiers, a size Na of the ordered set of transport block identifiers, a set of transport block identifiers of the transport block subset, the number of transport blocks P of the transport block subset, and a transport block error pattern a.

[0130] In some embodiments, when the information of the transport block subset includes a transport block identifier set of the transport block subset, the transport block identifier set is compression-encoded to determine a compression codeword.

[0131] In some embodiments, when the information of the transport block subset includes the transport block error pattern a, the compression codeword may be determined according to the transport block error pattern a.

[0132] It should be noted that the transport block error pattern a is determined according to at least one of the following: an ordered set of transport block identifiers, a size Na of the ordered set of transport block identifiers, a set of transport block identifiers of a transport block subset, and a number P of transport blocks of the transport block subset.

[0133] Figure 4 FIG. 1 is a flow chart of a method for determining a transmission block error pattern a provided by an embodiment of the present application. Figure 4 As shown, the transport block error pattern a is determined by the following steps S3140, S3141 and S3142. Exemplarily, the transport block identifier set of the transport block subset in this embodiment is a correct transport block identifier set.

[0134] Step S3140: Determine whether the elements in each transport block identifier ordered set belong to a correct transport block identifier set.

[0135] Step S3141: If the i-th element in the transport block identifier ordered set belongs to the correct transport block identifier set, the i-th bit a(i) of the transport block error pattern = ack.

[0136] Step S3142: If the i-th element in the transport block identifier ordered set does not belong to the correct transport block identifier set, the i-th bit a(i) of the transport block error pattern = nack.

[0137] It can be understood that the bit "ack" is used to indicate that the response status of the transmission block is a correct response ACK, and the bit "nack" is used to indicate that the response status of the transmission block is an incorrect response NACK, that is, for a(i)=ack, it means that the response status of the transmission block corresponding to the i-th element in the ordered set of transmission block identifiers is a correct response ACK, and for a(i)=nack, it means that the response status of the transmission block corresponding to the i-th element in the ordered set of transmission block identifiers is an incorrect response NACK.

[0138] In some embodiments, the "ack" bit is a "1" bit and the "nack" bit is a "0" bit.

[0139] In some embodiments, the "ack" bit is a "0" bit and the "nack" bit is a "1" bit.

[0140] Figure 5 FIG. 1 is a flow chart of a method for determining a transmission block error pattern a provided by another embodiment of the present application. Figure 5 As shown, the transport block error pattern a is determined by the following steps S3150, S3151 and S3152. Exemplarily, in this embodiment, the transport block subset is a correct transport block set.

[0141] Step S3150: According to the preset length of the transport block error pattern, an initial transport block error pattern corresponding to the preset length is obtained, wherein each element in the initial transport block error pattern corresponds to an error response bit.

[0142] In some embodiments, the transport block error pattern is set to a sequence of length Na and each element is a bit "nack", where Na is the size of the transport block identifier ordered set.

[0143] Step S3151: According to the correct transport block set, in the transport block error pattern initial pattern, the bit whose sequence number is equal to the element in the correct transport block set is set as the correct response bit.

[0144] Step S3152: Determine the transport block error pattern initial pattern as the transport block error pattern.

[0145] In some embodiments, according to the correct transmission block set BI = {BI(1), B(2), ..., BI(P)}, for i = 1, 2, ..., P, the BI(i)th bit in the transmission block error pattern initial pattern is set to a(BI(i)) = ack, and the updated transmission block error pattern initial pattern is the transmission block error pattern, where P is the number of correct transmission blocks.

[0146] It can be understood that the bit "ack" is used to indicate that the response status of the transmission block is a correct response ACK, and the bit "nack" is used to indicate that the response status of the transmission block is an incorrect response NACK, that is, for a(i)=ack, it means that the response status of the transmission block corresponding to the i-th element in the ordered set of transmission block identifiers is a correct response ACK, and for a(i)=nack, it means that the response status of the transmission block corresponding to the i-th element in the ordered set of transmission block identifiers is an incorrect response NACK.

[0147] In some embodiments, the "ack" bit is a "1" bit and the "nack" bit is a "0" bit.

[0148] In some embodiments, the "ack" bit is a "0" bit and the "nack" bit is a "1" bit.

[0149] In some embodiments, the length of the compressed codeword is determined according to the size of the ordered set of transport block identifiers and the number of transport blocks in the transport block subset.

[0150] Exemplarily, the length Nc of the compressed codeword is equal to Where Na represents the size of the ordered set of transport block identifiers, and P represents the number of correct transport blocks. The compressed codeword is obtained by A bit sequence of length Na containing P bits of "ack" is mapped to a bit sequence of length The bit sequence is obtained by arithmetic coding.

[0151] In some embodiments, the length of the compressed codeword is determined based on the length of the transport block error pattern and the number of correct transport blocks.

[0152] Exemplarily, the length Nc of the compressed codeword is equal to Wherein, Na represents the length of the transmission block error pattern a, and P represents the number of correct transmission blocks.

[0153] Figure 6 A flowchart for determining a compressed codeword according to a transport block identifier set of a transport block subset provided in an embodiment of the present application. Figure 6 As shown, BI is the transport block identifier set of the transport block subset, P is the number of transport blocks in the transport block subset, I(1), I(2), ..., I(Na) are the Na elements included in the transport block identifier ordered set, and Na is the size of the transport block identifier ordered set. The final output length of the program flowchart of this method is Exemplarily, in this embodiment, the transport block subset is a correct transport block set.

[0154] Figure 7 The pseudo program code for determining a compressed codeword according to a transport block identifier set of a transport block subset provided in an embodiment of the present application. Figure 7 As shown, BI is the transport block identifier set of the transport block subset, P is the number of transport blocks in the transport block subset, I(1), I(2), ..., I(Na) are the number of Na elements included in the transport block identifier ordered set, and Na is the size of the transport block identifier ordered set. The final output length of the program code of this method is The bit representation of the compressed codeword c = [c(1), c(2), ..., c(Nc)].

[0155] Figure 8 A flowchart of determining a compressed codeword according to a transmission block error pattern provided in another embodiment of the present application. Figure 8 As shown, Na is the length of the transport block error pattern a, P is the number of transport blocks in the transport block subset, and the final output length of the program flowchart of this method is Exemplarily, in this embodiment, the transport block subset is a correct transport block set.

[0156] Fig. 9 A pseudo program code for determining a compressed codeword according to a transmission block error pattern provided in another embodiment of the present application. Fig. 9 As shown, Na is the length of the transport block error pattern a, P is the number of transport blocks in the transport block subset, and "nack" indicates that the response status of the corresponding transport block is the bit of the error response NACK. The final output length of the method program code The bit representation of the compressed codeword c=[c(1), c(2), ..., c(Nc)]. Exemplarily, in this embodiment, the transport block subset is a correct transport block set.

[0157] In some embodiments, Figure 3 As shown, the "encoding the information of the transmission block subset to obtain feedback information" may also include the following step S3200.

[0158] Step S3200: concatenate at least two of the prefix codeword, the padding bit sequence and the compression codeword to obtain feedback information.

[0159] like Fig.10 Some schematic diagrams of obtaining feedback information by concatenating prefix codewords, padding bit sequences and compression codewords are given.

[0160] The prefix codeword of length Np is [p1,p2,…,p Np ], let the padding bit sequence of length Nfb be [fb1,fb2,…,fb Nfb ], let the compressed codeword of length Nc be c=[c1,c2,…,c Nc ].

[0161] In some embodiments, the feedback information f is [p1, p2, ..., p Np ,fb1,fb2,…,fb Nfb ,c1,c2,…,c Nc ], the schematic diagram is as follows Fig.10 (a).

[0162] In some embodiments, the feedback information f is [p1, p2, ..., p Np ,c1,c2,…,c Nc ,fb1,fb2,…,fb Nfb ], the schematic diagram is as follows Fig.10 (b).

[0163] In some embodiments, the feedback information f is [c1, c2, ..., c Nc ,fb1,fb2,…,fb Nfb ,p1,p2,…,p Np ], the schematic diagram is as follows Fig.10 (c).

[0164] In some embodiments, the feedback information f is [fb1, fb2, ..., fb Nfb ,c1,c2,…,c Nc ,p1,p2,…,p Np ], the schematic diagram is as follows Fig.10 (d).

[0165] In some embodiments, the feedback information f includes a prefix codeword.

[0166] In some embodiments, the feedback information f includes a compressed codeword.

[0167] In some embodiments, the feedback information f includes a padding bit sequence.

[0168] In some embodiments, when the length of the padding bit sequence is 0, the feedback information f only includes the prefix codeword and the compression codeword. Exemplarily, the feedback information f is [p1, p2, ..., p Np ,c1,c2,…,c Nc ], the schematic diagram is as follows Fig.10 (e); or the feedback information f is [c1,c2,…,c Nc ,p1,p2,…,p Np ], the schematic diagram is as follows Fig.10 (f).

[0169] In some embodiments, when the length of the compressed codeword is 0, the feedback information f only includes the prefix codeword and the padding bit sequence. Exemplarily, the feedback information f is [p1, p2, ..., p Np ,fb1,fb2,…,fb Nfb ], the schematic diagram is as follows Fig.10 (g); or the feedback information f is [fb1,fb2,…,fb Nfb ,p1,p2,…,p Np ], the schematic diagram is as follows Fig.10 (h).

[0170] In some embodiments, the feedback information f includes Pmax-P+1 bits for indicating the number P of transport blocks in the transport block subset.

[0171] In some embodiments, the feedback information f includes a prefix codeword of Pmax-P+1 bits.

[0172] In some embodiments, the feedback information f includes Long sequence of padding bits.

[0173] In some embodiments, the feedback information f includes A long filling bit sequence, where Nf is the length of the feedback information f.

[0174] In some embodiments, the length Nf of the feedback information f is determined based on at least one of the following parameters: the maximum number of transport blocks in the transport block subset, the number of transport blocks in the transport block subset, the size of the transport block identifier ordered set, and the length of the transport block error pattern.

[0175] In some embodiments, the length of the feedback information f is

[0176] In some embodiments, the length of the feedback information f is greater than

[0177] In some embodiments, the length of the feedback information f is

[0178] In some embodiments, the length of the feedback information f is

[0179] In some embodiments, the length of the feedback information f is Where Nfb is the length of the padding bit sequence.

[0180] In some embodiments, the length of the feedback information f is

[0181] In some embodiments, the length of the feedback information f is Pmax-P+1+Nfb, where Nfb is the length of the padding bit sequence.

[0182] Step S4000: Send feedback information to at least one second node.

[0183] In some embodiments, the first node sends feedback information to one or more second node sequences, and the feedback information can represent the reception status of the transmission block sent by at least one second node at the first node.

[0184] The information transmission method provided in the above embodiment, when When , the length of the feedback information can be made at most 1 bit more than the optimal value, that is, the number of input bits of the channel coding is at most 1 bit more than the optimal value, thereby achieving the purpose of saving spectrum resources and improving data transmission efficiency. In the case of , the above embodiments are generally only 2 or 3 bits more than the minimum length and have the characteristics of low decoding complexity (linear complexity).

[0185] In some embodiments, the transmission block subset is a correct transmission block set. When the first node does not receive a transmission block correctly and the correct transmission block identifier set is an empty set, that is, P=0, the first node determines that the length Nf=0 of the feedback information f, that is, the feedback information f is an empty sequence. The first node determines that the signal containing the feedback information f that is an empty sequence is an empty signal, that is, the first node determines that the signal containing the feedback information f is a zero-power signal.

[0186] In the information transmission method provided in the above embodiment, since the first node sends a zero-power signal, the energy consumption is reduced, and a second node in the second node sequence will not successfully receive the signal containing the feedback information f (i.e., the zero-power signal). Therefore, a second node in the second node sequence can determine that the feedback information is an error response NACK.

[0187] In some embodiments, the feedback information is channel coded to obtain a first coded sequence.

[0188] It should be noted that the channel coding may be, but is not limited to, polar coding, low-density parity check coding, convolutional coding, turbo coding, RM code (Reed-Muller code), RS code (Reed-Solomon code), BCH code (Bose-Chaudhuri-Hocquenghem code), concatenated code, cyclic code, block coding, Hamming code, Golay code, repetition coding, single-parity-check code, cyclic redundancy check code, superposition coding, sparse superposition coding, sparse regression coding, lattice coding, algebraic geometric code, Goppa code, Polarization-Adjusted Convolutional Code. Codes), Pre-transformed Polar Codes, and Parity-Check Polar Codes.

[0189] Example 1

[0190] In this example, the first node is a base station, the second node is a terminal, this example includes multiple terminals, these terminals form a second node sequence, the transmission block identifier is a user identifier, and the following example describes the specific process in which the transmission block subset is a correct transmission block set, the maximum number of transmission blocks in the transmission block subset is the maximum number of correct transmission blocks, the number of transmission blocks in the transmission block subset is the correct number of transmission blocks, and the correct number of transmission blocks P is 0 and feedback information f is not sent.

[0191] Fig.11 is a schematic diagram of the relationship between the second node, the transmission block and the user identifier provided by the example of this application, such as Fig.11 As shown, the base station receives a signal including a transmission block set B sent by a terminal sequence, wherein the terminal sequence includes Nu=4 terminals SN(1), SN(2), SN(3), SN(4), and the transmission block set B includes NT=4 transmission blocks b(1), b(2), b(3), b(4). Furthermore, the signal including the transmission block set B includes a signal including transmission block b(1), a signal including transmission block b(2), a signal including transmission block b(3), and a signal including transmission block b(4).

[0192] In this example, for t=1, 2, 3, 4, the transmission block b(t) in the transmission block set B is sent to the base station by the terminal SN(t) in the terminal sequence, wherein the transmission block b(t) in the transmission block set B corresponds to the user identifier of the terminal SN(t), and the user identifier of the terminal SN(t) is a random access RNTI (RA-RNTI). The user identifiers of the terminals SN(1), SN(2), SN(3), and SN(4) are 4, 3, 2, and 5, respectively, wherein the user identifiers 4, 3, 2, and 5 are elements of the transmission block identifier ordered set, and the transmission block identifier ordered set includes Na=8 user identifiers 0, 1, 2, 3, 4, 5, 6, and 7.

[0193] In this example, the maximum value of the number of correct transmission blocks Pmax=3 is configured by the base station. The correct transmission block identifier set is a set of user identifiers included in the correctly received transmission blocks in the transmission block set. In this example, the base station determines that the correct transmission block identifier set is an empty set Φ according to the signal containing the transmission block set B, that is, the number of correct transmission blocks P=0, and then the base station determines that the length of the feedback information f is Nf=0 and the feedback information f is an empty sequence according to the correct transmission block identifier set being an empty set Φ (or the number of correct transmission blocks P=0), and correspondingly, the base station determines that the signal containing the feedback information f is a zero power signal.

[0194] The base station then sends a zero-power signal containing feedback information f to the terminal sequence SN(1), SN(2), SN(3), SN(4). The terminal sequence SN(1), SN(2), SN(3), SN(4) receives the zero-power signal containing feedback information f. Those skilled in the art will understand that for t=1, 2, 3, 4, the terminal SN(t) fails to decode and determines that the response to the transport block b(t) is an error response NACK.

[0195] Example 2:

[0196] The difference between this example and Example 1 is that in this example, the transmission block identifier is the index value of the user identifier, and the user identifier ordered set ID=<ID(1),ID(2),ID(3),ID(4)> = <0,11,20,30>, the corresponding transport block identifier ordered set I =<I(1),I(2),I(3),I(4)> =<0,1,2,3>, the index value of the user identifier whose element ID(1)=0 in the user identifier ordered set is the element I(1)=0 in the transmission block identifier ordered set, the index value of the user identifier whose element ID(2)=11 in the user identifier ordered set is the element I(2)=1 in the transmission block identifier ordered set, the index value of the user identifier whose element ID(3)=20 in the user identifier ordered set is the element I(3)=2 in the transmission block identifier ordered set, the index value of the user identifier whose element ID(4)=30 in the user identifier ordered set is the element I(4)=3 in the transmission block identifier ordered set, wherein the size of the transmission block identifier ordered set is Na=4.

[0197] Another difference between this example and Example 1 is that in this example, the user identifiers of terminals SN(1), SN(2), SN(3), and SN(4) are 0, 11, 20, and 30, respectively, where user identifiers 0, 11, 20, and 30 are elements of the user identifier ordered set ID.

[0198] Example 3:

[0199] The difference between this example and Example 1 is that, in this example, the transmission block identifier is a label index, the label index is an element of an ordered set of transmission block identifiers, the ordered set of transmission block identifiers includes Na=6 label indexes 0, 1, 2, 3, 4, 5, and the correct transmission block identifier set is a set of label indices of random access labels included in the correctly received transmission blocks in the transmission block set.

[0200] Fig.12 is a schematic diagram of the relationship between the second node, the transmission block, the random access label and the label index provided by the example of this application. Another difference between this example and Example 1 is that in this example, Fig.12As shown, for t=1, 2, 3, 4, the transport block b(t) in the transport block set B includes a random access tag, wherein the random access tag is a preamble. The random access tags included in the transport blocks b(1), b(2), b(3), b(4) are respectively the preambles r(4), r(3), r(2), r(1) determined by the terminals SN(1), SN(2), SN(3), SN(4) according to the high-level parameters. The preambles r(4), r(3), r(2), r(1) are elements of the random access tag ordered set. The random access tag ordered set includes Na=6 preambles r(1), r(2), r(3), r(4), r(5), r(6), wherein the tag indexes of the preambles r(1), r(2), r(3), r(4), r(5), r(6) are respectively the Na=6 tag indexes 0, 1, 2, 3, 4, 5 included in the transport block identifier ordered set.

[0201] Example 4:

[0202] The difference between this example and Example 1 is that in this example, for t=1, 2, 3, 4, the user identifier of the terminal SN(t) is a temporary cell RNTI (TC-RNTI), and the transport block identifier ordered set includes Na=7 user identifiers 1, 2, 3, 4, 5, 6, 7, that is, the transport block identifier ordered set I=<I(1),I(2),I(3),I(4),I(5),I(6),I(7)> =<1,2,3,4,5,6,7>.

[0203] Another difference between this example and Example 1 is that in this example, the base station determines, based on a signal including a transport block set B, that the correct transport block identifier set is set BI={2} and the correct transport block number P=1.

[0204] Another difference between this example and Example 1 is that, in this example, the feedback information f is determined by the base station based on the following parameters: correct transmission block identifier set BI = {2}, correct transmission block number P = 1, transmission block identifier ordered set size Na = 7 and maximum number of correct transmission blocks Pmax = 3.

[0205] Fig.13 Schematic diagram of providing feedback information, prefix code, filling bit sequence, and compressed codeword in the example of this application. Fig.13 As shown, the specific method for determining the feedback information f is as follows:

[0206] The base station encodes the information of the correct transmission block set according to the following method to obtain feedback information:

[0207] According to the size PACK=1 of the correct transport block identifier set BI={2} and the maximum number of correct transport blocks Pmax=3, the base station determines the number of prefix codeword bits Np=Pmax-PACK+1=3-1+1=3; according to the number of prefix codeword bits Np=3, the base station determines the first Np-1=3-1=2 bits of the prefix codeword to be "0", and determines the last bit of the prefix codeword to be "1", that is, the prefix codeword is [p1, p2, p3]=[0,0,1];

[0208] According to the transport block identifier ordered set size Na=7, the maximum number of correct transport blocks Pmax=3, and the number of correct transport blocks P=1, the base station determines the length of the padding bit sequence. According to the padding bit sequence length Nfb=1, the padding bit sequence is determined to be an all-zero sequence [fb1]=[0];

[0209] The base station performs compression encoding on the correct transmission block identifier set according to the following method to determine the compression codeword c:

[0210] The base station determines the feedback information f according to the correct transport block identifier set BI={2}, the transport block identifier ordered set I and the transport block identifier ordered set size Na=7 according to the following method:

[0211] The base station determines the length Nc of the compressed codeword according to P=1 and the correct transmission block identifier set BI={2}:

[0212] The base station calculates the compressed codeword length Nc=3 and the correct transmission block identifier set BI={2} according to Figure 6 The algorithm flow chart is The possible correct transport block identifier sets of size 1 are mapped to Arithmetic coding of long bit sequences yields compressed codeword c = [c1, c2, ..., c Nc ]=[c1,c2,c3]=[1,1,0].

[0213] like Fig.10 (b) The base station sets the prefix codeword [p1, p2, p3] = [0, 0, 1], the filling bit sequence [fb1] = [0], and the compression codeword c = [c1, c2, ..., c Nc ]=[c1,c2,c3]=[1,1,0], and the feedback information f=[p1,p2,p3,c1,c2,c3,fb1]=[0,0,1,1,1,0,0] is obtained. The length of the feedback information f is

[0214] In this example, the base station sends a signal containing feedback information f = [0, 0, 1, 1, 1, 0, 0] to the terminal sequence<SN(1),SN(2),SN(3),SN(4)> . Terminal sequence<SN(1),SN(2),SN(3),SN(4)> Receive a signal containing feedback information f. Terminals SN(1), SN(2), SN(3), SN(4) respectively decode the signal containing feedback information f and determine the response of transport blocks b(1), b(2), b(3), b(4) according to the following method:

[0215] If the terminal SN(1) fails in decoding, the terminal SN(1) determines that the response to the transport block b(1) is an error response NACK. If the terminal SN(1) succeeds in decoding and obtains the feedback information f, the terminal SN(1) counts the number of consecutive bits "0" N0 starting from the first bit and the maximum number of correct transport blocks Pmax=3 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N0, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=7 and the estimated number of correct transport blocks P' as Then intercept the feedback information f from the N0+2th to the N0+2th Total locations The bits and the estimated number of correct transport blocks P' and the transport block identifier ordered set size Na=7 are used as the input of arithmetic decoding to obtain the correct transport block identifier set BI. Since the user identifier of terminal SN(1) is 4 and does not belong to BI, terminal SN(1) determines that the response to transport block b(1) is an error response NACK.

[0216] If the decoding of the terminal SN(2) fails, the terminal SN(2) determines that the response of the transport block b(2) is an error response NACK. If the decoding of the terminal SN(2) succeeds and the feedback information f is obtained, the terminal SN(2) counts the number of consecutive bits "0" N0 starting from the first bit and the maximum number of correct transport blocks Pmax=3 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N0, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=7 and the estimated number of correct transport blocks P' as Then intercept the feedback information f from the N0+2th to the N0+2th Total locations The bits and the estimated number of correct transport blocks P' and the transport block identifier ordered set size Na=7 are used as the input of arithmetic decoding to obtain the correct transport block identifier set BI. Since the user identifier of terminal SN(2) is 3 and does not belong to BI, terminal SN(2) determines that the response to transport block b(2) is an error response NACK.

[0217] If the terminal SN(3) fails in decoding, the terminal SN(3) determines that the response to the transport block b(3) is an error response NACK. If the terminal SN(3) succeeds in decoding and obtains feedback information f, the terminal SN(3) counts the number of consecutive bits "0" N0 starting from the first bit and the maximum number of correct transport blocks Pmax=3 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N0, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=7 and the estimated number of correct transport blocks P' as Then intercept the feedback information f from the N0+2th to the N0+2th Total locations The bits and the estimated number of correct transport blocks P' and the transport block identifier ordered set size Na=7 are used as the input of arithmetic decoding to obtain the correct transport block identifier set BI. Since the user identifier of terminal SN(3) is 2, which belongs to BI, terminal SN(3) determines that the response of transport block b(3) is the correct response ACK.

[0218] If the terminal SN(4) fails in decoding, the terminal SN(4) determines that the response to the transport block b(4) is an error response NACK. If the terminal SN(4) succeeds in decoding and obtains feedback information f, the terminal SN(4) counts the number of consecutive bits "0" N0 starting from the first bit and the maximum number of correct transport blocks Pmax=3 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N0, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=7 and the estimated number of correct transport blocks P' as Then intercept the feedback information f from the N0+2th to the N0+2th Total locations The bits and the estimated number of correct transport blocks P' and the transport block identifier ordered set size Na=7 are used as the input of arithmetic decoding to obtain the correct transport block identifier set BI. Since the user identifier of terminal SN(4) is 5 and does not belong to BI, terminal SN(4) determines that the response to transport block b(4) is an error response NACK.

[0219] Example 5:

[0220] The difference between this example and example 4 is that in this example, the transport block identifier is a label index, wherein the label index is an element of the transport block identifier ordered set, and the transport block identifier ordered set includes Na=7 label indexes 1, 2, 3, 4, 5, 6, 7, that is, the transport block identifier ordered set I=<I(1),I(2),I(3),I(4),I(5),I(6),I(7)> =<1,2,3,4,5,6,7>.

[0221] Fig.14 is a schematic diagram of the relationship between the second node, the transmission block, the random access label and the label index provided by the example of this application, such as Fig.14 As shown, another difference between this example and Example 4 is that in this example, Fig.14 As shown, for t=1, 2, 3, 4, the transport block b(t) in the transport block set B includes a random access tag, wherein the random access tag is a reference signal. The random access tags included in the transport blocks b(1), b(2), b(3), b(4) are respectively reference signals r(1), r(5), r(3), r(2) determined by the terminals SN(1), SN(2), SN(3), SN(4) according to the high-layer parameters, wherein the reference signals r(1), r(5), r(3), r(2) are elements of the random access tag ordered set. The random access tag ordered set includes Na=7 reference signals r(1), r(2), r(3), r(4), r(5), r(6), r(7), wherein the tag indexes of the reference signals r(1), r(2), r(3), r(4), r(5), r(6), r(7) are respectively Na=7 tag indexes 1, 2, 3, 4, 5, 6, 7 included in the transport block identifier ordered set.

[0222] Another difference between this example and Example 4 is that, in this example, the correct transport block identifier set refers to a set of label indices of random access labels included in the correctly received transport blocks in the transport block set.

[0223] Fig.15 Schematic diagram of feedback information, prefix code, padding bit sequence and compressed codeword provided by the example of this application. The specific method of determining feedback information f with length Nf=7 is as follows:

[0224] The base station encodes the information of the correct transmission block set according to the following method to obtain feedback information:

[0225] According to the number of correct transmission blocks P=1 and the maximum number of correct transmission blocks Pmax=3, the base station determines the number of prefix codeword bits Np=Pmax-P+1=3-1+1=3; according to the number of prefix codeword bits Np=3, the base station determines the first bit of the prefix codeword to be "0", and determines the last Np-1=3-1=2 bits of the prefix codeword to be "1", that is, the prefix codeword is [p1, p2, p3]=[0, 1, 1];

[0226] According to the transport block identifier ordered set size Na=7, the maximum number of correct transport blocks Pmax=3, the number of correct transport blocks P=1, and the length of the feedback information f Nf=7, the base station determines the length of the padding bit sequence According to the padding bit sequence length Nfb=1, the padding bit sequence is determined to be an all-one sequence [fb1]=[1];

[0227] The base station performs compression encoding on the correct transmission block identifier set according to the following method to determine a compression codeword:

[0228] The base station determines the length Nc of the compressed codeword according to P=1 and the correct transmission block identifier set BI={2}:

[0229] The base station calculates the compressed codeword length Nc=3 and the correct transmission block identifier set BI={2} according to Figure 7 The algorithm flow chart is The possible correct transport block identifier sets of size 1 are mapped to

[0230] Arithmetic coding of long bit sequences yields compressed codeword c = [c1, c2, ..., c Nc ]=

[0231] [c1,c2,c3]=[1,1,0].

[0232] like Fig.10 (c) The base station sets the prefix codeword [p1, p2, p3] = [0, 1, 1], the filling bit sequence [fb1] = [1], and the compression codeword c = [c1, c2, …, c Nc ]=[c1,c2,c3]=[1,1,0] and concatenate them to get the feedback information f=[c1,c2,c3,fb1,p1,p2,p3]=[1,1,0,1,0,1,1].

[0233] In this example, the base station sends a signal containing feedback information f = [1, 1, 0, 1, 0, 1, 1] to the terminal sequence<SN(1),SN(2),SN(3),SN(4)> . Terminal sequence<SN(1),SN(2),SN(3),SN(4)> Receive a signal containing feedback information f. Terminals SN(1), SN(2), SN(3), SN(4) respectively decode the signal containing feedback information f and determine the response of transport blocks b(1), b(2), b(3), b(4) according to the following method:

[0234] If the terminal SN(1) fails in decoding, the terminal SN(1) determines that the response to the transport block b(1) is an error response NACK. If the terminal SN(1) succeeds in decoding and obtains feedback information f, the terminal SN(1) counts the number of consecutive bits "1" N1 counting from the last bit and the maximum number of correct transport blocks Pmax=3 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=7 and the estimated number of correct transport blocks P' as Then intercept the first to the second Location bits and the estimated number of correct transmission blocks P' and the transmission block identifier ordered set size Na=7 are used as the input of arithmetic decoding to obtain the correct transmission block identifier set BI. Since the correct transmission block identifier set BI does not include the label index 1 of the random access label included in the transmission block b(1), the terminal SN(1) determines that the response to the transmission block b(1) is an erroneous response NACK.

[0235] If the terminal SN(2) fails in decoding, the terminal SN(2) determines that the response to the transport block b(2) is an error response NACK. If the terminal SN(2) succeeds in decoding and obtains the feedback information f, the terminal SN(2) counts the number of consecutive bits "1" N1 counting from the last bit and the maximum number of correct transport blocks Pmax=3 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=7 and the estimated number of correct transport blocks P' as Then intercept the first to the second Location bits and the estimated number of correct transport blocks P' and the transport block identifier ordered set size Na=7 are used as the input of arithmetic decoding to obtain the correct transport block identifier set BI. Since the correct transport block identifier set BI does not include the label index 5 of the random access label included in the transport block b(2), the terminal SN(2) determines that the response to the transport block b(2) is an erroneous response NACK.

[0236] If the terminal SN(3) fails in decoding, the terminal SN(3) determines that the response to the transport block b(3) is an error response NACK. If the terminal SN(3) succeeds in decoding and obtains feedback information f, the terminal SN(3) counts the number of consecutive bits "1" N1 counting from the last bit and the maximum number of correct transport blocks Pmax=3 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=7 and the estimated number of correct transport blocks P' as Then intercept the first to the second Location bits and the estimated number of correct transport blocks P' and the transport block identifier ordered set size Na=7 are used as the input of arithmetic decoding to obtain the correct transport block identifier set BI. Since the correct transport block identifier set BI does not include the label index 3 of the random access label included in the transport block b(3), the terminal SN(3) determines that the response to the transport block b(3) is an erroneous response NACK.

[0237] If the terminal SN(4) fails in decoding, the terminal SN(4) determines that the response to the transport block b(4) is an error response NACK. If the terminal SN(4) succeeds in decoding and obtains feedback information f, the terminal SN(4) counts the number of consecutive bits "1" N1 counting from the last bit and the maximum number of correct transport blocks Pmax=3 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=7 and the estimated number of correct transport blocks P' as Then intercept the first to the second Location bits and the estimated number of correct transmission blocks P' and the transmission block identifier ordered set size Na=7 are used as the input of arithmetic decoding to obtain the correct transmission block identifier set BI. Since the correct transmission block identifier set BI includes the label index 2 of the random access label included in the transmission block b(4), the terminal SN(4) determines that the response of the transmission block b(4) is the correct response ACK.

[0238] Example 6:

[0239] In this example, the first node is a relay, the second node is a terminal, the example includes multiple terminals, these terminals form a second node sequence, and the transmission block identifier is a user identifier. It should be noted that this example describes a situation where the transmission block subset is a correct transmission block set, the maximum number of transmission blocks of the transmission block subset is the maximum number of correct transmission blocks, and the number of transmission blocks of the transmission block subset is the correct number of transmission blocks.

[0240] Fig.16 This is a schematic diagram of the relationship between the second node, transmission block, user identifier, random access label and label index provided by the example of this application, such as Fig.16As shown, the relay receives a signal including a transport block set B sent by a terminal sequence, wherein the terminal sequence includes Nu=4 terminals SN(1), SN(2), SN(3), SN(4), and the transport block set B includes NT=4 transport blocks b(1), b(2), b(3), b(4). Furthermore, the signal including the transport block set B includes a signal including a transport block b(1), a signal including a transport block b(2), a signal including a transport block b(3), and a signal including a transport block b(4).

[0241] For t=1,2,3,4, the transport block b(t) in the transport block set B is sent to the relay by the terminal SN(t) in the terminal sequence, wherein the transport block b(t) in the transport block set B includes a random access tag and a user identifier of the terminal SN(t); wherein the user identifier of the terminal SN(t) is a cell RNTI (Cell RNTI, C-RNTI). The user identifiers of the terminals SN(1), SN(2), SN(3), and SN(4) are 4, 3, 2, and 0 respectively, wherein the user identifiers 4, 3, 2, and 0 are elements of an ordered set of transport block identifiers, and the ordered set of transport block identifiers includes Na=8 user identifiers 0, 1, 2, 3, 4, 5, 6, and 7, i.e., the ordered set of transport block identifiers I=<I(1),I(2),I(3),I(4),I(5),I(6),I(7),I(8)> =<0,1,2,3,4,5,6,7>. For t=1,2,3,4, the random access tag included in the transport block b(t) is a spread spectrum sequence (Spread Spectrum Sequence), where the spread spectrum sequence is an element of the random access tag ordered set. The random access tag ordered set includes 6 spread spectrum sequences r(1), r(2), r(3), r(4), r(5), r(6), where the tag indexes of the spread spectrum sequences r(1), r(2), r(3), r(4), r(5), r(6) are 0, 1, 2, 3, 4, 5 respectively. The random access tags included in the transport blocks b(1), b(2), b(3), b(4) are spread spectrum sequences determined by the terminals SN(1), SN(2), SN(3), SN(4) according to the user identifiers 4, 3, 2, 0 of the terminals SN(1), SN(2), SN(3), SN(4) according to the following formula:

[0242] The label index of the spreading sequence included in the transmission block b(t)=the remainder of the square of the user identification of the terminal SN(t) divided by 6.

[0243] Substituting the user identifiers 4, 3, 2, 0 of terminals SN(1), SN(2), SN(3), and SN(4) into the above formula, we obtain the spreading sequences of terminals SN(1), SN(2), SN(3), and SN(4) as r(5), r(4), r(5), and r(1), respectively.

[0244] In this example, the maximum number of correct transport blocks Pmax=3 is configured by a high-level parameter. In this example, the correct transport block identifier set refers to the set of user identifiers included in the correctly received transport blocks in the transport block set. In this example, the relay determines based on the signal containing the transport block set B that the correct transport block identifier set is the set BI={0} and the number of correct transport blocks P=1. The feedback information f is determined by the relay based on the following parameters: the correct transport block identifier set BI={0}, the number of correct transport blocks P=1, the transport block identifier ordered set size Na=8, the transport block identifier ordered set I=<I(1),I(2),I(3),I(4),I(5),I(6),I(7),I(8)> =<0,1,2,3,4,5,6,7>.

[0245] Fig.17 Schematic diagram of the relationship between feedback information, filling bit sequence, compression codeword and prefix code provided by the example of this application. The specific method for determining feedback information f is as follows:

[0246] The base station encodes the information of the correct transmission block set according to the following method to obtain feedback information:

[0247] According to the number of correct transmission blocks P=1 and the maximum number of correct transmission blocks Pmax=3, the base station determines the number of prefix codeword bits Np=Pmax-P+1=3-1+1=3; according to the number of prefix codeword bits Np=3, the base station determines the first bit of the prefix codeword to be "1", and determines the last Np-1=3-1=2 bits of the prefix codeword to be "0", that is, the prefix codeword is [p1, p2, p3]=[1, 0, 0];

[0248] According to the transport block identifier ordered set size Na=8, the maximum number of correct transport blocks Pmax=3, and the number of correct transport blocks P=1, the base station determines the length of the padding bit sequence. According to the padding bit sequence length Nfb=1, the padding bit sequence is determined to be [fb1]=[q(1), q(2), ..., q(Nfb)]=[0], where q(p) is the output sequence of the pseudo-random number generator, which is a length-31 Gold sequence; specifically, it is defined as follows:

[0249] q(n+1)=(x1(n+Nd)+x2(n+Nd))mod 2

[0250] x1(n+31)=(x1(n+3)+x1(n))mod 2

[0251] x2(n+31)=(x2(n+3)+x2(n+2)+x2(n+1)+x2(n))mod 2

[0252] Where n = 0, 1, 2, ..., Nfb-1, mod is the modulo function, Nd = 1600 and the first m-sequence x1(n) is initialized to x1(0) = 1, x1(n) = 0, n = 1, 2, ..., 30, and the second m-sequence x2(n) is initialized to satisfy The initialization of the second m-sequence x2(n) satisfies That is, Nfb is set as part of the seed of the pseudo-random sequence generator that generates a Gold sequence of length 31.

[0253] The base station performs compression encoding on the correct transmission block identifier set according to the following method to determine a compression codeword:

[0254] The base station determines the length Nc of the compressed codeword according to P=1 and the correct transmission block identifier set BI={0}:

[0255] The base station calculates the compressed codeword length Nc=3 and the correct transmission block identifier set BI={0} according to Figure 7 The algorithm flow chart is The possible correct transport block identifier sets of size 1 are mapped to Arithmetic coding of long bit sequences yields compressed codeword c = [c1, c2, ..., c Nc ]=[c1,c2,c3]=[1,1,1].

[0256] like Fig.10 (d) The base station sets the filling bit sequence [fb1] = [0], the prefix codeword [p1, p2, p3] = [0, 1, 1], and the compression codeword c = [c1, c2, ..., c Nc ]=[c1,c2,c3]=[1,1,1] and concatenate them to get the feedback information f=[fb1,c1,c2,c3,p1,p2,p3]=[0,1,1,1,1,0,0].

[0257] The relay sends a signal containing feedback information f = [0, 1, 1, 1, 1, 0, 0] to the terminal sequence<SN(1),SN(2),SN(3),SN(4)> . Terminal sequence<SN(1),SN(2),SN(3),SN(4)> Receive a signal containing feedback information f. Terminals SN(1), SN(2), SN(3), SN(4) respectively decode the signal containing feedback information f and determine the response of transport blocks b(1), b(2), b(3), b(4) according to the following method:

[0258] If the terminal SN(1) fails in decoding, the terminal SN(1) determines that the response to the transport block b(1) is an error response NACK. If the terminal SN(1) succeeds in decoding and obtains the feedback information f, the terminal SN(1) counts the number of consecutive bits "0" N0=2 and the maximum number of correct transport blocks Pmax=3 from the last bit of the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N0=1, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=8 and the estimated number of correct transport blocks P' as Then intercept the penultimate part of the feedback information f To the last P'+2 position bits and the estimated number of correct transport blocks P' and the transport block identifier ordered set size Na=8 are used as the input of arithmetic decoding to obtain the correct transport block identifier set BI. It is determined that the correct transport block identifier set BI does not include the user identifier 4 of the terminal SN(1). The terminal SN(1) determines that the response to the transport block b(1) is an error response NACK.

[0259] If the decoding of the terminal SN(2) fails, the terminal SN(2) determines that the response of the transport block b(2) is an error response NACK. If the decoding of the terminal SN(2) succeeds and the feedback information f is obtained, the terminal SN(2) counts the number of consecutive bits "0" N0=2 and the maximum number of correct transport blocks Pmax=3 of the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N0=1, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=8 and the estimated number of correct transport blocks P' as Then intercept the penultimate part of the feedback information f To the last P'+2 position bits and the estimated number of correct transport blocks P' and the transport block identifier ordered set size Na=8 are used as the input of arithmetic decoding to obtain the correct transport block identifier set BI. It is determined that the correct transport block identifier set BI does not include the user identifier 3 of the terminal SN(2). The terminal SN(2) determines that the response to the transport block b(2) is an error response NACK.

[0260] If the terminal SN(3) fails in decoding, the terminal SN(3) determines that the response to the transport block b(3) is an error response NACK. If the terminal SN(3) succeeds in decoding and obtains the feedback information f, the terminal SN(3) counts the number of consecutive bits "0" N0=2 and the maximum number of correct transport blocks Pmax=3 from the last bit of the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N0=1, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=8 and the estimated number of correct transport blocks P' as Then intercept the penultimate part of the feedback information f To the last P'+2 position bits and the estimated number of correct transport blocks P' and the transport block identifier ordered set size Na=8 are used as the input of arithmetic decoding to obtain the correct transport block identifier set BI. It is determined that the correct transport block identifier set BI does not include the user identifier 2 of the terminal SN(3). The terminal SN(3) determines that the response to the transport block b(3) is an error response NACK.

[0261] If the terminal SN(4) fails in decoding, the terminal SN(4) determines that the response to the transport block b(4) is an error response NACK. If the terminal SN(4) succeeds in decoding and obtains the feedback information f, the terminal SN(4) counts the number of consecutive bits "0" N0=2 and the maximum number of correct transport blocks Pmax=3 from the last bit of the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N0=1, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=8 and the estimated number of correct transport blocks P' as Then intercept the penultimate part of the feedback information f To the last P'+2 position bits and the estimated number of correct transport blocks P'=1, and the transport block identifier ordered set size Na=8 are used as the input of arithmetic decoding to obtain the correct transport block identifier set BI. It is determined that the correct transport block identifier set BI includes the user identifier 0 of the terminal SN(4). The terminal SN(4) determines that the response of the transport block b(4) is the correct response ACK.

[0262] Example 7:

[0263] The difference between this example and Example 6 is that in this example, the transmission block identifier is a label index, wherein the label index is an element of an ordered set of transmission block identifiers, and the ordered set of transmission block identifiers includes Na=6 transmission block identifiers 0, 1, 2, 3, 4, 5.

[0264] Figure 18 (a) is a schematic diagram of the relationship between the second node, transmission block, user identifier, random access tag and label index provided by the example of the present application. Another difference between this example and Example 6 is that, as shown in Figure 18, for t = 1 2, 3, 4, the user identifier of the terminal SN (t) is the modulation coding scheme cell RNTI (Modulcation Coding Scheme Cell RNTI, MCS-C-RNTI). The random access label included in the transmission block b (t) is a scrambling sequence (Scrambling Sequence), wherein the scrambling sequence is an element of the random access label ordered set. The random access label ordered set includes Na = 6 scrambling sequences r (1), r (2), r (3), r (4), r (5), r (6), wherein the label indexes of the scrambling sequences r (1), r (2), r (3), r (4), r (5), r (6) are the transmission block identifiers 0, 1, 2, 3, 4, 5 of the transmission block identifier ordered set respectively. Furthermore, the random access tags included in the transport blocks b(1), b(2), b(3), and b(4) are scrambling sequences determined according to the following method based on the user identification of the terminal SN(t):

[0265] Terminals SN(1), SN(2), SN(3), and SN(4) use the user identifiers 4, 3, 2, and 0 of terminals SN(1), SN(2), SN(3), and SN(4) as part of the random number seed of a pseudo-random sequence generator (Pseudo-Random Sequence Generator) to obtain label indexes of random access labels of terminals SN(1), SN(2), SN(3), and SN(4) as 4, 3, 1, and 0 respectively, and obtain random access labels included in transmission blocks b(1), b(2), b(3), and b(4) as r(5), r(4), r(2), and r(1) respectively.

[0266] Another difference between this example and Example 6 is that in this example, the correct transmission block identifier set refers to a set of label indices of random access labels included in the correctly received transmission blocks in the transmission block set. In this example, the relay determines, based on a signal containing the transmission block set B, that the correct transmission block identifier set is an empty set Φ and the number of correct transmission blocks P = 0. The feedback information f is determined by the relay based on the following parameters: the correct transmission block identifier set is an empty set Φ, the number of correct transmission blocks P = 0, the transmission block identifier ordered set size Na = 6, and the maximum number of correct transmission blocks Pmax = 3.

[0267] FIG. 18( b ) is a schematic diagram of the relationship between feedback information, prefix code, and padding bit sequence provided in the example of the present application. As shown in FIG. 18( b ), the specific method for determining the feedback information f is as follows:

[0268] The base station encodes the information of the correct transmission block set according to the following method to obtain feedback information:

[0269] According to the number of correct transmission blocks P=0 and the maximum number of correct transmission blocks Pmax=3, the base station determines the number of prefix codeword bits Np=Pmax-P+1=3-0+1=4; according to the number of prefix codeword bits Np=4, the base station determines the first Np-1=3 bits of the prefix codeword to be "1", and determines the last bit of the prefix codeword to be "0", that is, the prefix codeword is [p1, p2, p3, p4]=[1, 1, 1, 0];

[0270] According to the transport block identifier ordered set size Na=6, the maximum number of correct transport blocks Pmax=3, and the number of correct transport blocks P=0, the base station determines the length of the padding bit sequence. According to the padding bit sequence length Nfb=2, the padding bit sequence is determined to be the first Nfb=2 bits of the preset defined sequence [q(1), q(2), ..., q(Nq)], that is, [fb1, fb2]=[q(1), q(2)]. A specific example is that the qth bit of the preset defined sequence is q(p)=p mod 2, that is, [fb1, fb2]=[1,0].

[0271] The base station performs compression encoding on the correct transmission block identifier set according to the following method to determine a compression codeword:

[0272] According to P = 0 or the correct transmission block identifier set is an empty set Φ, the base station determines the length Nc of the compressed codeword as

[0273] The base station determines that the compressed codeword c is an empty sequence [] according to the length Nc=0 of the compressed codeword.

[0274] like Fig.10 (g) The base station concatenates the prefix codeword [p1, p2, p3, p4] = [1, 1, 1, 0] and the padding bit sequence [fb1, fb2] = [q(1), q(2)] = [1, 0] to obtain feedback information f = [p1, p2, p3, p4, fb1, fb2] = [1, 1, 1, 0, 1, 0], where the length of the feedback information f is

[0275] Another difference between this example and Example 6 is that in this example, the relay sends a signal containing feedback information f = [1, 1, 1, 0, 1, 0] to the terminal sequence<SN(1),SN(2),SN(3),SN(4)> Terminals SN(1), SN(2), SN(3), and SN(4) receive and decode the signal containing the feedback information f, and determine the response of the transport blocks b(1), b(2), b(3), and b(4) according to the following method:

[0276] If the terminal SN(1) fails in decoding, the terminal SN(1) determines that the response to the transmission block b(1) is an error response NACK; if the terminal SN(1) succeeds in decoding and obtains the feedback information f, the terminal SN(1) counts the number of consecutive bits "1" N1=3 starting from the first bit and the maximum number of correct transmission blocks Pmax=3 of the decoded feedback information f, determines the estimated number of correct transmission blocks P'=Pmax-N1=0, and then determines that the correct transmission block identifier set is an empty set Φ based on the number of correct transmission blocks P'=0, determines that the correct transmission block identifier set does not include the label index 4 of the random access label r(5) included in the transmission block b(1), and the terminal SN(1) determines that the response to the transmission block b(1) is an error response NACK.

[0277] If the terminal SN(2) fails in decoding, the terminal SN(2) determines that the response to the transmission block b(2) is an error response NACK; if the terminal SN(2) succeeds in decoding and obtains the feedback information f, the terminal SN(2) counts the number of consecutive bits "1" N1=3 starting from the first bit and the maximum number of correct transmission blocks Pmax=3 of the decoded feedback information f, determines the estimated number of correct transmission blocks P'=Pmax-N1=0, and then determines that the correct transmission block identifier set is an empty set Φ based on the number of correct transmission blocks P'=0, determines that the correct transmission block identifier set does not include the label index 3 of the random access label r(4) included in the transmission block b(2), and the terminal SN(2) determines that the response to the transmission block b(2) is an error response NACK.

[0278] If the terminal SN(3) fails in decoding, the terminal SN(3) determines that the response to the transmission block b(3) is an error response NACK; if the terminal SN(3) succeeds in decoding and obtains the feedback information f, the terminal SN(3) counts the number of consecutive bits "1" N1=3 starting from the first bit and the maximum number of correct transmission blocks Pmax=3 of the decoded feedback information f, determines the estimated number of correct transmission blocks P'=Pmax-N1=0, and then determines that the correct transmission block identifier set is an empty set Φ based on the number of correct transmission blocks P'=0, determines that the correct transmission block identifier set does not include the label index 1 of the random access label r(2) included in the transmission block b(3), and the terminal SN(3) determines that the response to the transmission block b(3) is an error response NACK.

[0279] If the terminal SN(4) fails in decoding, the terminal SN(4) determines that the response to the transmission block b(4) is an error response NACK; if the terminal SN(4) succeeds in decoding and obtains the feedback information f, the terminal SN(4) counts the number of consecutive bits "1" N1=3 starting from the first bit and the maximum number of correct transmission blocks Pmax=3 of the decoded feedback information f, determines the estimated number of correct transmission blocks P'=Pmax-N1=0, and then determines that the correct transmission block identifier set is an empty set Φ based on the number of correct transmission blocks P'=0, determines that the correct transmission block identifier set does not include the label index 0 of the random access label r(1) included in the transmission block b(4), and the terminal SN(4) determines that the response to the transmission block b(4) is an error response NACK.

[0280] It should be noted that, although the length of the feedback information f in this example is the same as the size of the transport block identifier ordered set Na=6, in actual applications, when the size of the transport block identifier ordered set Na is large, the length of the feedback information f will be shorter than Na. For example, when Na=100 and Pmax=4, the length Nf of the feedback information f is Much smaller than the length of Na=100, and only one bit more than the optimal compression length of:

[0281]

[0282] Example 8:

[0283] In this example, the first node is a base station, the second node is a terminal, there are multiple terminals in this example, forming a terminal sequence, and the transmission block identifier is a user identifier. It should be noted that the transmission block subset in this example is a correct transmission block set, the maximum number of transmission blocks in the transmission block subset is the maximum number of correct transmission blocks, and the number of transmission blocks in the transmission block subset is the correct number of transmission blocks.

[0284] like Fig.11 As shown, the base station receives a signal including a transport block set B sent by a terminal sequence, wherein the terminal sequence includes Nu=4 terminals SN(1), SN(2), SN(3), SN(4), and the transport block set B includes NT=4 transport blocks b(1), b(2), b(3), b(4). The signal including the transport block set B includes a signal including transport block b(1), a signal including transport block b(2), a signal including transport block b(3), and a signal including transport block b(4).

[0285] In this example, for t=1, 2, 3, 4, the transport block b(t) in the transport block set B is sent to the base station by the terminal SN(t) in the terminal sequence, wherein the transport block b(t) in the transport block set B includes the user identifier of the terminal SN(t), and the user identifier of the terminal SN(t) is the configured scheduling RNTI (CS-RNTI). The user identifiers of the terminals SN(1), SN(2), SN(3), and SN(4) are 4, 3, 2, and 5, respectively, wherein the user identifiers 4, 3, 2, and 5 are the transport block identifier ordered set I=<I(1),I(2),I(3),I(4),I(5),I(6),I(7),I(8)> = an element in <0,1,2,3,4,5,6,7>. The transport block identifier ordered set includes the user identifiers 0,1,2,3,4,5,6,7.

[0286] In this example, the maximum number of correct transmission blocks Pmax=3 is configured by the base station. The correct transmission block identifier set refers to the set of user identifiers corresponding to the correctly received transmission blocks in the transmission block set. The base station determines, based on the signal including the transmission block set B, that the correct transmission block identifier set is set BI={2,3} and the number of correct transmission blocks P=2.

[0287] In this example, the feedback information f is determined by the base station according to the following parameters: correct transport block identifier set BI, the number of correct transport blocks P=2, the transport block identifier ordered set I, the transport block identifier ordered set size Na=8, the maximum number of correct transport blocks Pmax=3, and the transport block error pattern a. The transport block error pattern a is determined by the base station according to the following parameters: correct transport block identifier set BI, the transport block identifier ordered set I, and the transport block identifier ordered set size Na.

[0288] In this example, the bit "ack" of the correct response ACK is bit "1", and the bit "nack" of the incorrect response NACK is bit "0". The base station encodes the information of the correct transmission block set according to the following method to obtain feedback information:

[0289] According to the number of correct transmission blocks P=2 and the maximum number of correct transmission blocks Pmax=3, the base station determines the number of prefix codeword bits Np=Pmax-P+1=3-2+1=2; according to the number of prefix codeword bits Np=2, the base station determines the first Np-1=2-1=1 bits of the prefix codeword to be "1", and determines the last bit of the prefix codeword to be "0", that is, the prefix codeword is [p1, p2]=[1, 0];

[0290] According to the transport block identifier ordered set size Na=8, the maximum number of correct transport blocks Pmax=3, and the number of correct transport blocks P=2, the base station determines the length of the padding bit sequence.

[0291] According to the filling bit sequence length Nfb=0, the filling bit sequence is determined to be an empty sequence [];

[0292] The base station performs compression encoding on the correct transmission block identifier set according to the following method to determine the compression codeword c:

[0293] The base station determines the transport block error pattern a=[0,0,1,1,0,0,0,0] according to the correct transport block identifier set BI={2,3}, the transport block identifier ordered set I and the transport block identifier ordered set size Na=8.

[0294] Fig.19 A schematic diagram of the relationship between the feedback information, prefix code, and compressed codeword provided for the example of this application, such as Fig.19 As shown, the base station determines the feedback information f for the transmission block error pattern a=[0,0,1,1,0,0,0,0] according to the following method:

[0295] The base station determines the length of the compressed codeword based on P = 2 and the transmission block error pattern a = [0,0,1,1,0,0,0,0]:

[0296] Fig. 20 is a mapping chart of the transmission block error pattern and the compressed codeword provided by the example of this application, such as Fig. 20 As shown, A sequence of length Na=8 containing P=2 bits "ack"=1 is mapped to Arithmetic coding of long bit sequences yields compressed codeword c = [c1, c2, ..., c Nc ]=[c1,c2,c3,c4,c5]=[1,0,0,0,1].

[0297] like Fig.10 (e) The base station sets the prefix codeword [p1, p2] = [1, 0] and the compression codeword c = [c1, c2, ..., c Ncv ]=[1,0,0,0,1] are concatenated to obtain feedback information f=[p1,p2,c1,c2,c3,c4,c5]=[1,0,1,0,0,0,1], where the length of feedback information f is

[0298] In this example, the base station sends a signal containing feedback information f = [1, 0, 1, 0, 0, 0, 1] to the terminal sequence<SN(1),SN(2),SN(3),SN(4)> . Terminal sequence<SN(1),SN(2),SN(3),SN(4)> Receive a signal containing feedback information f. Terminals SN(1), SN(2), SN(3), SN(4) respectively decode the signal containing feedback information f and determine the response of transport blocks b(1), b(2), b(3), b(4) according to the following method:

[0299] If the terminal SN(1) fails in decoding, the terminal SN(1) determines that the response to the transport block b(1) is an error response NACK. If the terminal SN(1) succeeds in decoding and obtains the feedback information f, the terminal SN(1) counts the number of consecutive bits "1" N1 starting from the first bit and the maximum number of correct transport blocks Pmax=3 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=8 and the estimated number of correct transport blocks P' as Then intercept the last part of the feedback information f The bits and the estimated number of correct transport blocks P' and the transport block identifier ordered set size Na=8 are used as the input of arithmetic decoding to obtain the transport block error pattern a. Since the user identifier of the terminal SN(1) is 4 and a(5)=0, the terminal SN(1) determines that the response to the transport block b(1) is an error response NACK.

[0300] If the decoding of the terminal SN(2) fails, the terminal SN(2) determines that the response of the transport block b(2) is an error response NACK. If the decoding of the terminal SN(2) succeeds and the feedback information f is obtained, the terminal SN(2) counts the number of consecutive bits "1" N1 starting from the first bit and the maximum number of correct transport blocks Pmax=3 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=8 and the estimated number of correct transport blocks P' as Then intercept the last part of the feedback information f The bits and the estimated number of correct transport blocks P' and the transport block identifier ordered set size Na=8 are used as the input of arithmetic decoding to obtain the transport block error pattern a. Based on the user identifier 3 of the terminal SN(2) and a(4)=1, the terminal SN(2) determines that the response of the transport block b(2) is the correct response ACK.

[0301] If the terminal SN(3) fails in decoding, the terminal SN(3) determines that the response to the transport block b(3) is an error response NACK. If the terminal SN(3) succeeds in decoding and obtains the feedback information f, the terminal SN(3) counts the number of consecutive bits "1" N1 starting from the first bit and the maximum number of correct transport blocks Pmax=3 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=8 and the estimated number of correct transport blocks P' as Then intercept the last part of the feedback information f The bits and the estimated number of correct transport blocks P' and the transport block identifier ordered set size Na=8 are used as the input of arithmetic decoding to obtain the transport block error pattern a. According to the user identifier 2 of the terminal SN(3) and a(3)=1, the terminal SN(3) determines that the response of the transport block b(3) is the correct response ACK.

[0302] If the terminal SN(4) fails in decoding, the terminal SN(4) determines that the response to the transport block b(4) is an error response NACK. If the terminal SN(4) succeeds in decoding and obtains the feedback information f, the terminal SN(4) counts the number of consecutive bits "1" N1 starting from the first bit and the maximum number of correct transport blocks Pmax=3 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=8 and the estimated number of correct transport blocks P' as Then intercept the last part of the feedback information f The bits and the estimated number of correct transport blocks P' and the transport block identifier ordered set size Na=8 are used as the input of arithmetic decoding to obtain the transport block error pattern a. According to the user identifier 5 of the terminal SN(4) and a(6)=0, the terminal SN(4) determines that the response to the transport block b(4) is an error response NACK.

[0303] The information transmission method provided in this example converts the correct transmission block identification set BI into a transmission block error pattern a, obtains a compressed codeword c through arithmetic coding, obtains prefix codes of different lengths through the size of the correct transmission block number P, and adds padding bits of different lengths to make the feedback information f, so that the length of the feedback information f does not change with the size of the correct transmission block identification set BI, thereby reducing the complexity of decoding. It should be noted that although the feedback information f in this example is only 1 less than the length of the transmission block error pattern a, in actual applications, the length Na of the transmission block error pattern a is very large, and the feedback information f will be shorter than the length of the transmission block error pattern a. For example, when Na=100 and Pmax=4, the length Nf of the feedback information f is Much smaller than the length of Na=100, and only one bit more than the optimal compression length below, but simpler to decode (linearly related to the length of the transport block error pattern a):

[0304]

[0305] Therefore, under the condition of the same resources, the solution provided in this example has a lower channel coding rate than directly transmitting the transmission block error pattern a, so that the terminal can use a lower receiving signal-to-noise ratio and enhance coverage.

[0306] Example 9:

[0307] The difference between this example and Example 8 is that in this example, the maximum number of correct transmission blocks Pmax=4 is configured by the base station.

[0308] Fig.21 A schematic diagram of the relationship between the feedback information, compression codewords and prefix codes provided for the example of this application, such as Fig.21 As shown, the base station encodes the information of the correct transmission block set according to the following method to obtain feedback information:

[0309] According to the number of correct transmission blocks P=2 and the maximum number of correct transmission blocks Pmax=4, the base station determines the number of prefix codeword bits Np=Pmax-P+1=4-2+1=3; according to the number of prefix codeword bits Np=3, the base station determines the last Np-1=3-1=2 bits of the prefix codeword to be "1", and determines the first bit of the prefix codeword to be "0", that is, the prefix codeword is [p1, p2, p3]=[0, 1, 1];

[0310] According to the transport block identifier ordered set size Na=8, the maximum number of correct transport blocks Pmax=4, and the number of correct transport blocks P=2, the base station determines the length of the padding bit sequence. in, According to the filling bit sequence length Nfb=0, the filling bit sequence is determined to be an empty sequence [];

[0311] The base station determines feedback information for the transmission block error pattern a=[0,0,1,1,0,0,0,0] according to the following method:

[0312] The base station determines the length of the compressed codeword c based on P = 2 and the transmission block error pattern a = [0,0,1,1,0,0,0,0]:

[0313] like Fig. 20 As shown, A sequence of length Na=8 containing P=2 bits ack=1 is mapped to Arithmetic coding of long bit sequences yields compressed codeword c = [c1, c2, ..., c Nc ]=[c1,c2,c3,c4,c5]=[1,0,0,0,1].

[0314] like Fig.10 (f), the base station sets the prefix codeword [p1, p2, p3] = [0, 0, 1] and the compression codeword c = [c1, c2, ..., c Nc ]=[1,0,0,0,1] are concatenated to get the feedback information f=[c1,c2,c3,c4,c5,p1,p2,p3]=[1,0,0,0,1,0,1,1], where the length of the feedback information f is

[0315] In this example, the base station sends a signal containing feedback information f = [1, 0, 0, 0, 1, 0, 1, 1] to the terminal sequence<SN(1),SN(2),SN(3),SN(4)> . Terminal sequence<SN(1),SN(2),SN(3),SN(4)> Receive a signal containing feedback information f. Terminals SN(1), SN(2), SN(3), SN(4) respectively decode the signal containing feedback information f and determine the response of transport blocks b(1), b(2), b(3), b(4) according to the following method:

[0316] If the terminal SN(1) fails in decoding, the terminal SN(1) determines that the response to the transport block b(1) is an error response NACK. If the terminal SN(1) succeeds in decoding and obtains the feedback information f, the terminal SN(1) counts the number of consecutive bits "1" N1 counting from the last bit and the maximum number of correct transport blocks Pmax=4 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=8 and the estimated number of correct transport blocks P' as Then intercept the front of the feedback information f bits and the estimated number of correct transport blocks P' and the transport block identifier ordered set size Na=8 are used as the input of arithmetic decoding to obtain the transport block error pattern a. Since the user identifier of terminal SN(1) is 4 and a(5)=0, terminal SN(1) determines that the response to transport block b(1) is an error response NACK.

[0317] If the decoding of the terminal SN(2) fails, the terminal SN(2) determines that the response of the transport block b(2) is an error response NACK. If the decoding of the terminal SN(2) succeeds and the feedback information f is obtained, the terminal SN(2) counts the number of consecutive bits "1" N1 counting from the last bit and the maximum number of correct transport blocks Pmax=4 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=8 and the estimated number of correct transport blocks P' as Then intercept the front of the feedback information f bits and the estimated number of correct transport blocks P' and the transport block identifier ordered set size Na=8 are used as the input of arithmetic decoding to obtain the transport block error pattern a. Based on the user identifier 3 of the terminal SN(2) and a(4)=1, the terminal SN(2) determines that the response of the transport block b(2) is the correct response ACK.

[0318] If the terminal SN(3) fails in decoding, the terminal SN(3) determines that the response to the transport block b(3) is an error response NACK. If the terminal SN(3) succeeds in decoding and obtains the feedback information f, the terminal SN(3) counts the number of consecutive bits "1" N1 counting from the last bit and the maximum number of correct transport blocks Pmax=4 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=8 and the estimated number of correct transport blocks P' as Then intercept the front of the feedback information f bits and the estimated number of correct transport blocks P' and the transport block identifier ordered set size Na=8 are used as the input of arithmetic decoding to obtain the transport block error pattern a. Based on the user identifier 2 of the terminal SN(3) and a(3)=1, the terminal SN(3) determines that the response of the transport block b(3) is the correct response ACK.

[0319] If the terminal SN(4) fails in decoding, the terminal SN(4) determines that the response to the transport block b(4) is an error response NACK. If the terminal SN(4) succeeds in decoding and obtains the feedback information f, the terminal SN(4) counts the number of consecutive bits "1" N1 counting from the last bit and the maximum number of correct transport blocks Pmax=4 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=8 and the estimated number of correct transport blocks P' as Then intercept the front of the feedback information f bits and the estimated number of correct transport blocks P' and the transport block identifier ordered set size Na=8 are used as the input of arithmetic decoding to obtain the transport block error pattern a. According to the user identifier 5 of the terminal SN(4) and a(6)=0, the terminal SN(4) determines that the response to the transport block b(4) is an error response NACK.

[0320] Example 10:

[0321] The difference between this example and Example 8 is that in this example, the bit ack of the correct response ACK is bit "0", and the bit nack of the incorrect response NACK is "1". The base station determines the transport block error pattern a = [1, 1, 0, 0, 1, 1, 1, 1] according to the correct transport block identifier set BI = {2, 3}, the transport block identifier ordered set I and the transport block identifier ordered set size Na.

[0322] Fig. 22 A schematic diagram of the relationship between the compression codeword, prefix code and feedback information provided for the example of this application, such as Fig. 22 As shown, the base station encodes the information of the correct transmission block set according to the following method to obtain feedback information:

[0323] According to the number of correct transmission blocks P=2 and the maximum number of correct transmission blocks Pmax=3, the base station determines the number of prefix codeword bits Np=Pmax-P+1=3-2+1=2; according to the number of prefix codeword bits Np=2, the base station determines the first Np-1=2-1=1 bits of the prefix codeword to be "1", and determines the last bit of the prefix codeword to be "0", that is, the prefix codeword is [p1, p2]=[1, 0];

[0324] According to the transport block identifier ordered set size Na=8, the maximum number of correct transport blocks Pmax=3, and the number of correct transport blocks P=2, the base station determines the length of the padding bit sequence.

[0325] According to the filling bit sequence length Nfb=0, the filling bit sequence is determined to be an empty sequence [];

[0326] The base station determines the compression codeword for the transmission block error pattern a=[1,1,0,0,1,1,1,1] according to the following method:

[0327] The base station determines the transport block error pattern a=[1,1,0,0,1,1,1,1] according to the correct transport block identifier set BI={2,3}, the transport block identifier ordered set I and the transport block identifier ordered set size Na=8.

[0328] The base station determines the length of the compressed codeword c based on P=2 and the transmission block error pattern length Na=8:

[0329] Fig.23 is a mapping chart of the transmission block error pattern and the compressed codeword provided by the example of this application, such as Fig.23 As shown, A sequence of length Na=8 containing P=2 bits "ack"=0 is mapped to a sequence of length The arithmetic coding of the bit sequence obtains the compressed codeword c = [0, 1, 1, 1, 1].

[0330] like Fig.10 (e) The base station sets the prefix codeword [p1, p2] = [1, 0] and the compression codeword c = [c1, c2, ..., c Nc ]=[0,1,1,1,1] are concatenated to get feedback information f=[p1,p2,c1,c2,c3,c4,c5]=[1,0,0,1,1,1,1], where the length of feedback information f is

[0331] In this example, the base station sends a signal containing feedback information f = [1, 0, 0, 1, 1, 1] to the terminal sequence<SN(1),SN(2),SN(3),SN(4)> . Terminal sequence<SN(1),SN(2),SN(3),SN(4)> Receive a signal containing feedback information f. Terminals SN(1), SN(2), SN(3), SN(4) respectively decode the signal containing feedback information f and determine the response of transport blocks b(1), b(2), b(3), b(4) according to the following method:

[0332] If the terminal SN(1) fails in decoding, the terminal SN(1) determines that the response to the transport block b(1) is an error response NACK. If the terminal SN(1) succeeds in decoding and obtains the feedback information f, the terminal SN(1) counts the number of consecutive bits "1" N1 starting from the first bit and the maximum number of correct transport blocks Pmax=3 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1=3-1=2, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=8 and the estimated number of correct transport blocks P'=2 as Then intercept the last part of the feedback information f The bits and the estimated number of correct transport blocks P'=2, the transport block identifier ordered set size Na=8 are used as the input of arithmetic decoding to obtain the transport block error pattern a. Since the user identifier of the terminal SN(1) is 4 and a(5)=1, the terminal SN(1) determines that the response to the transport block b(1) is an error response NACK.

[0333] If the decoding of the terminal SN(2) fails, the terminal SN(2) determines that the response of the transport block b(2) is an error response NACK. If the decoding of the terminal SN(2) succeeds and the feedback information f is obtained, the terminal SN(2) counts the number of consecutive bits "1" N1 starting from the first bit and the maximum number of correct transport blocks Pmax=3 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1=3-1=2, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=8 and the estimated number of correct transport blocks P'=2 as Then intercept the last part of the feedback information f The bits and the estimated number of correct transport blocks P'=2, the transport block identifier ordered set size Na=8 are used as the input of arithmetic decoding to obtain the transport block error pattern a. According to the user identifier 3 of the terminal SN(2) and a(4)=0, the terminal SN(2) determines that the response of the transport block b(2) is the correct response ACK.

[0334] If the terminal SN(3) fails in decoding, the terminal SN(3) determines that the response to the transport block b(3) is an error response NACK. If the terminal SN(3) succeeds in decoding and obtains the feedback information f, the terminal SN(3) counts the number of consecutive bits "1" N1 starting from the first bit and the maximum number of correct transport blocks Pmax=3 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1=3-1=2, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=8 and the estimated number of correct transport blocks P'=2 as Then intercept the last part of the feedback information f The bits and the estimated number of correct transport blocks P'=2, the transport block identifier ordered set size Na=8 are used as the input of arithmetic decoding to obtain the transport block error pattern a. According to the user identifier 2 of the terminal SN(3) and a(3)=0, the terminal SN(3) determines that the response of the transport block b(3) is the correct response ACK.

[0335] If the terminal SN(4) fails in decoding, the terminal SN(4) determines that the response to the transport block b(4) is an error response NACK. If the terminal SN(4) succeeds in decoding and obtains the feedback information f, the terminal SN(4) counts the number of consecutive bits "1" N1 starting from the first bit and the maximum number of correct transport blocks Pmax=3 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1=3-1=2, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=8 and the estimated number of correct transport blocks P'=2 as Then intercept the last part of the feedback information f The bits and the estimated number of correct transport blocks P'=2, the transport block identifier ordered set size Na=8 are used as the input of arithmetic decoding to obtain the transport block error pattern a. According to the user identifier 5 of the terminal SN(4) and a(6)=1, the terminal SN(4) determines that the response of the transport block b(4) is an error response NACK.

[0336] Example 11:

[0337] In this example, the first node is a base station, and the second node is a terminal. There are multiple terminals in this example, forming a terminal sequence, and the transmission block identifier is a label index. It should be noted that the transmission block subset in this example is a correct transmission block set, the maximum number of transmission blocks in the transmission block subset is the maximum number of correct transmission blocks, and the number of transmission blocks in the transmission block subset is the correct number of transmission blocks.

[0338] Fig.24 is a schematic diagram of the relationship between the second node, the transmission block, the random access label and the label index provided by the example of this application, such as Fig.24 As shown, the base station receives a signal including a transmission block set B sent by a terminal sequence, wherein the terminal sequence includes Nu=3 terminals SN(1), SN(2), SN(3), and the transmission block set B includes NT=4 transmission blocks b(1), b(2), b(3), and b(4). Furthermore, the signal including the transmission block set B includes a signal including transmission block b(1), a signal including transmission block b(2), a signal including transmission block b(3), and a signal including transmission block b(4).

[0339] In this example, for t=1, 2, 3, the transport block b(t) in the transport block set B is sent to the base station by the terminal SN(t). The transport block b(4) in the transport block set B is also sent to the base station by the terminal SN(1).

[0340] For t=1,2,3,4, the transport block b(t) in the transport block set B corresponds to a random access tag, where the random access tag is an interleaver. The random access tags corresponding to the transport blocks b(1), b(2), b(3), b(4) are the random access tags r(2), r(3), r(4), r(1) determined by the terminals SN(1), SN(2), SN(3), SN(1) according to the higher layer parameters, where the interleavers r(2), r(3), r(4), r(1) are elements of the random access tag ordered set. The random access tag ordered set includes Na=6 interleavers r(1), r(2), r(3), r(4), r(5), r(6), where the tag indexes of the interleavers r(1), r(2), r(3), r(4), r(5), r(6) are the Na=6 tag indexes 1, 2, 3, 4, 5, 6 included in the transport block identifier ordered set. The transport block identifier ordered set I=<I(1),I(2),I(3),I(4),I(5),I(6)> =<1,2,3,4,5,6>.

[0341] In this example, the maximum number of correct transmission blocks Pmax=2 is configured by the base station. The correct transmission block identifier set refers to the set of label indices of the random access labels included in the correctly received transmission blocks in the transmission block set. The base station determines based on the signal containing the transmission block set B: the correct transmission block identifier set is BI={2,3}, and the number of correct transmission blocks P=2. The feedback information f is determined by the base station based on the following parameters: correct transmission block identifier set BI, correct transmission block number P=2, transmission block identifier ordered set I, transmission block identifier ordered set size Na=6, maximum correct transmission block number Pmax=2, transmission block error pattern a.

[0342] In this example, the bit "ack" of a correct response ACK is bit "1", and the bit "nack" of an incorrect response NACK is bit "0". In this example, the base station determines the feedback information f according to the following method:

[0343] Fig.25 A schematic diagram of the relationship between the compression codeword, prefix code and feedback information provided for the example of this application. The base station encodes the information of the correct transmission block set according to the following method to obtain feedback information:

[0344] According to the number of correct transmission blocks P=2 and the maximum number of correct transmission blocks Pmax=2, the base station determines the number of prefix codeword bits Np=Pmax-P+1=2-2+1=1; according to the number of prefix codeword bits Np=1, the base station determines the first Np-1=1-1=0 bits of the prefix codeword as "1", and determines the last bit of the prefix codeword as "0", that is, the prefix codeword is [p1]=[0];

[0345] According to the transport block identifier ordered set size Na=6, the maximum number of correct transport blocks Pmax=2, and the number of correct transport blocks P=2, the base station determines the length of the padding bit sequence

[0346] According to the filling bit sequence length Nfb=0, the filling bit sequence is determined to be an empty sequence [];

[0347] The base station determines the transport block error pattern a as a=[0,1,1,0,0,0] according to the correct transport block identifier set BI={2,3} and the transport block identifier ordered set size Na=6;

[0348] The base station determines the compression codeword for the transmission block error pattern a=[0,1,1,0,0,0] according to the following method:

[0349] The base station determines a transport block error pattern a=[0,1,1,0,0,0] according to the correct transport block identifier set BI={2,3}, the transport block identifier ordered set I and the transport block identifier ordered set size Na=6.

[0350] The base station determines the length of the compressed codeword c based on P=2 and the transmission block error pattern length Na=6:

[0351] Fig.26 is a mapping chart of the transmission block error pattern and the compressed codeword provided by the example of this application, such as Fig.26 As shown, A sequence of length Na=6 containing P=2 bits "ack"=1 is mapped to a sequence of length The arithmetic coding of the bit sequence obtains the compressed codeword c = [1,0,1,0].

[0352] like Fig.10 (e) The base station sets the prefix codeword [p1] = [0] and the compression codeword c = [c1, c2, ..., c Nc ]=[1,0,1,0] are concatenated to obtain feedback information f=[p1,c1,c2,c3,c4]=[0,1,0,1,0], where the length of feedback information f is

[0353] In this example, the base station sends a signal containing feedback information f = [0, 1, 0, 1, 0] to the terminal sequence<SN(1),SN(2),SN(3)> . Terminal sequence<SN(1),SN(2),SN(3)> A signal containing feedback information f is received and decoded, and the responses of transport blocks b(1), b(2), b(3), and b(4) are determined as follows:

[0354] If the decoding of the terminal SN(1) fails, the terminal SN(1) determines that the responses of the transport block b(1) and the transport block b(4) are both error responses NACK. If the decoding of the terminal SN(1) succeeds and feedback information f is obtained, the terminal SN(1) counts the number of consecutive bits "1" N1=0 starting from the first bit and the maximum number of correct transport blocks Pmax=2 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1=2-0=2, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=6 and the estimated number of correct transport blocks P'=2 as Then intercept the last part of the feedback information f The bits and the estimated number of correct transport blocks P'=2, and the transport block identifier ordered set size Na=6 are used as the input of arithmetic decoding to obtain the transport block error pattern a. Since the label index of the random access label corresponding to the transport block b(1) is 2 and a(2)=1, the terminal SN(1) determines that the response of the transport block b(1) is a correct response ACK. Since the label index of the random access label corresponding to the transport block b(4) is 1 and a(1)=0, the terminal SN(1) determines that the response of the transport block b(4) is an incorrect response NACK.

[0355] If the terminal SN(2) fails in decoding, the terminal SN(2) determines that the response to the transport block b(2) is an error response NACK. If the terminal SN(2) succeeds in decoding and obtains the feedback information f, the terminal SN(2) counts the number of consecutive bits "1" N1=0 starting from the first bit and the maximum number of correct transport blocks Pmax=2 for the decoded feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1=2-0=2, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=6 and the estimated number of correct transport blocks P'=2 as Then intercept the last part of the feedback information f The bits and the estimated number of correct transport blocks P'=2, the transport block identifier ordered set size Na=6 are used as the input of arithmetic decoding to obtain the transport block error pattern a. Since the label index of the random access label corresponding to the transport block b(2) is 3 and a(3)=1, the terminal SN(2) determines that the response of the transport block b(2) is the correct response ACK.

[0356] If the terminal SN(3) fails in decoding, the terminal SN(3) determines that the response to the transport block b(3) is an error response NACK. If the terminal SN(3) succeeds in decoding and obtains the feedback information f, the terminal SN(3) counts the number of consecutive bits "1" N1=0 starting from the first bit and the maximum number of correct transport blocks Pmax=2 for the feedback information f, determines the estimated number of correct transport blocks P'=Pmax-N1=2-0=2, and then determines the length of the compressed codeword according to the transport block identifier ordered set size Na=6 and the estimated number of correct transport blocks P'=2 as Then intercept the last part of the feedback information f The bits and the estimated number of correct transport blocks P'=2, the transport block identifier ordered set size Na=6 are used as the input of arithmetic decoding to obtain the transport block error pattern a. Since the label index of the random access label corresponding to the transport block b(3) is 4 and a(4)=0, the terminal SN(3) determines that the response to the transport block b(3) is an error response NACK.

[0357] In the information transmission method provided in this example, the terminal SN(1) sends two transmission blocks b(1) and b(4), but selects different random access tags; the base station determines the feedback information f according to the tag index of the random access tag of the correctly decoded transmission block, so that the terminal SN(1) can distinguish whether the two transmission blocks b(1) and b(4) are correctly received. At the same time, since the size of the random access tag ordered set is generally smaller than the size of the user identifier ordered set, the length of the feedback information f can also be reduced, reducing the control signaling resource overhead and improving the information transmission efficiency.

[0358] Example 12:

[0359] The difference between this example and Example 5 is that in this example, the feedback information includes a prefix code and a compression codeword. Fig. 27 Schematic diagram of feedback information, prefix code and compressed codeword provided by the example of this application. The specific method for determining feedback information f is as follows:

[0360] The base station encodes the information of the correct transmission block set according to the following method to obtain feedback information:

[0361] According to the number of correct transmission blocks P = 1, the maximum number of correct transmission blocks Pmax = 3, and the size of the ordered set of input block identifiers Na = 7, the base station determines the number of prefix codeword bits. According to the number of bits Np=4 of the prefix codeword, the base station determines that the first Np-1=4-1=3 bits of the prefix codeword are "1", and determines that the last bit of the prefix codeword is "0", that is, the prefix codeword is [p1, p2, p3, p4]=[1, 1, 1, 0];

[0362] The base station performs compression encoding on the correct transmission block identifier set according to the following method to determine a compression codeword:

[0363] The base station determines the length Nc of the compressed codeword according to P=1 and the correct transmission block identifier set BI={2}:

[0364] The base station calculates the compressed codeword length Nc=3 and the correct transmission block identifier set BI={2} according to Figure 7 The algorithm flow chart is The possible correct transport block identifier sets of size 1 are mapped to Arithmetic coding of long bit sequences yields compressed codeword c = [c1, c2, ..., c Nc ]=[c1,c2,c3]=[1,1,0].

[0365] like Fig.10 (e) The base station sets the prefix codeword [p1, p2, p3, p4] = [1, 1, 1, 0] and the compression codeword c = [c1, c2, …, c Nc ]=[c1,c2,c3]=[1,1,0], and the feedback information f=[p1,p2,p3,p4,c1,c2,c3]=[1,1,1,0,1,1,0] is obtained. The length of the feedback information f is

[0366] Table 2 Correspondence between the number of correct transmission blocks P and the compressed codeword length Nc

[0367]

[0368] Another difference between this example and Example 5 is that in this example, the base station sends a signal containing feedback information f = [1, 1, 1, 0, 1, 1, 0] to the terminal sequence<SN(1),SN(2),SN(3),SN(4)> . Terminal sequence<SN(1),SN(2),SN(3),SN(4)> Receive a signal containing feedback information f. Terminals SN(1), SN(2), SN(3), SN(4) respectively decode the signal containing feedback information f and determine the response of transport blocks b(1), b(2), b(3), b(4) according to the following method:

[0369] If the decoding of the terminal SN(1) fails, the terminal SN(1) determines that the response of the transport block b(1) is an error response NACK. If the decoding of the terminal SN(1) succeeds and feedback information f is obtained, the terminal SN(1) counts the number of consecutive bits "1" N1=3 starting from the first bit and the length Nf=7 of the feedback information f obtained by decoding, determines the length Nc=Nf-N1-1=7-3-1=3 of the compressed codeword, and then determines the number of correct transport blocks P=1 by looking up Table 2 according to the length Nc of the compressed codeword. Then, the last Nc bits of the feedback information f, the number of correct transport blocks P, and the size Na=7 of the ordered set of transport block identifiers are intercepted as inputs of arithmetic decoding to obtain the correct transport block identifier set BI. Since the correct transport block identifier set BI does not include the label index 1 of the random access label included in the transport block b(1), the terminal SN(1) determines that the response of the transport block b(1) is an error response NACK.

[0370] If the decoding of the terminal SN(2) fails, the terminal SN(2) determines that the response of the transport block b(2) is an error response NACK. If the decoding of the terminal SN(2) succeeds and feedback information f is obtained, the terminal SN(2) counts the number of consecutive bits "1" N1=3 starting from the first bit and the length Nf=7 of the feedback information f obtained by decoding, determines the length Nc=Nf-N1-1=7-3-1=3 of the compressed codeword, and then determines the number of correct transport blocks P=1 by looking up Table 2 according to the length Nc of the compressed codeword. Then, the last Nc bits of the feedback information f, the number of correct transport blocks P, and the size Na=7 of the ordered set of transport block identifiers are intercepted as inputs of arithmetic decoding, and arithmetic decoding is performed to obtain the correct transport block identifier set BI. Since the correct transport block identifier set BI does not include the label index 5 of the random access label included in the transport block b(2), the terminal SN(2) determines that the response of the transport block b(2) is an error response NACK.

[0371] If the decoding of the terminal SN(3) fails, the terminal SN(3) determines that the response of the transport block b(3) is an error response NACK; if the decoding of the terminal SN(3) succeeds and feedback information f is obtained, the terminal SN(3) counts the number of consecutive bits "1" N1=3 starting from the first bit and the length Nf=7 of the feedback information f obtained by decoding, determines the length Nc=Nf-N1-1=7-3-1=3 of the compressed codeword, and then determines the number of correct transport blocks P=1 by looking up Table 2 according to the length Nc of the compressed codeword, then intercepts the last Nc bits of the feedback information f, the number of correct transport blocks P, and the size Na=7 of the ordered set of transport block identifiers as inputs of arithmetic decoding, performs arithmetic decoding, and obtains the correct transport block identifier set BI. Since the correct transport block identifier set BI does not include the label index 3 of the random access label included in the transport block b(3), the terminal SN(3) determines that the response of the transport block b(3) is an error response NACK.

[0372] If the decoding of the terminal SN(4) fails, the terminal SN(4) determines that the response of the transmission block b(4) is an error response NACK; if the decoding of the terminal SN(4) succeeds and feedback information f is obtained, the terminal SN(4) counts the number of consecutive bits "1" N1=3 starting from the first bit and the length Nf=7 of the feedback information f obtained by decoding, determines the length Nc=Nf-N1-1=7-3-1=3 of the compressed codeword, and then determines the number of correct transmission blocks P=1 by looking up Table 2 according to the length Nc of the compressed codeword, then intercepts the last Nc bits of the feedback information f, the number of correct transmission blocks P, and the size Na=7 of the ordered set of transmission block identifiers as inputs of arithmetic decoding, performs arithmetic decoding, and obtains the correct transmission block identifier set BI. Since the correct transmission block identifier set BI includes the label index 2 of the random access label included in the transmission block b(4), the terminal SN(4) determines that the response of the transmission block b(4) is a correct response ACK.

[0373] Example 13:

[0374] The difference between this example and Example 5 is that in this example, the feedback information includes a prefix code and a compression codeword. Fig.28 Schematic diagram of feedback information, prefix code and compressed codeword provided by the example of this application. The specific method for determining feedback information f is as follows:

[0375] The base station encodes the information of the correct transmission block set according to the following method to obtain feedback information:

[0376] According to the number of correct transmission blocks P = 1, the maximum number of correct transmission blocks Pmax = 3, and the size of the ordered set of input block identifiers Na = 7, the base station determines the number of prefix codeword bits. According to the number of bits of the prefix codeword Np=4, the base station determines that the first bit of the prefix codeword is "1", and after determining the prefix codeword, Np-1=4-1=3 bits are "0", that is, the prefix codeword is [p1, p2, p3, p4]=[1, 0, 0, 0];

[0377] The base station performs compression encoding on the correct transmission block identifier set according to the following method to determine a compression codeword:

[0378] The base station determines the length Nc of the compressed codeword according to P=1 and the correct transmission block identifier set BI={2}:

[0379] The base station calculates the compressed codeword length Nc=3 and the correct transmission block identifier set BI={2} according to Figure 7 The algorithm flow chart is The possible correct transport block identifier sets of size 1 are mapped to

[0380] Arithmetic coding of long bit sequences yields compressed codeword c = [c1, c2, ..., c Nc ]=

[0381] [c1,c2,c3]=[1,1,0].

[0382] like Fig.10 (f), the base station sets the prefix codeword [p1, p2, p3, p4] = [1, 0, 0, 0] and the compression codeword c = [c1, c2, ..., c Nc ]=[c1,c2,c3]=[1,1,0], and the feedback information f=[c1,c2,c3,p1,p2,p3,p4]=[1,1,0,1,0,0,0] is obtained by splicing. The length of the feedback information f is

[0383] Another difference between this example and Example 5 is that in this example, the base station sends a signal containing feedback information f = [1, 1, 0, 1, 0, 0, 0] to the terminal sequence<SN(1),SN(2),SN(3),SN(4)> . Terminal sequence<SN(1),SN(2),SN(3),SN(4)> Receive a signal containing feedback information f. Terminals SN(1), SN(2), SN(3), SN(4) respectively decode the signal containing feedback information f and determine the response of transport blocks b(1), b(2), b(3), b(4) according to the following method:

[0384] If the decoding of the terminal SN(1) fails, the terminal SN(1) determines that the response of the transmission block b(1) is an error response NACK; if the decoding of the terminal SN(1) succeeds and the feedback information f is obtained, the terminal SN(1) counts the number of consecutive bits "0" N0=3 starting from the last bit and the length Nf=7 of the feedback information f obtained by decoding, determines the length Nc=Nf-N0-1=7-3-1=3 of the compressed codeword, and then determines the number of correct transmission blocks P=1 by looking up Table 2 according to the length Nc of the compressed codeword, then intercepts the first Nc bits of the feedback information f, the number of correct transmission blocks P, and the size Na=7 of the ordered set of transmission block identifiers as the input of arithmetic decoding, and performs arithmetic decoding to obtain the correct transmission block identifier set BI. Since the correct transmission block identifier set BI does not include the label index 1 of the random access label included in the transmission block b(1), the terminal SN(1) determines that the response of the transmission block b(1) is an error response NACK.

[0385] If the decoding of the terminal SN(2) fails, the terminal SN(2) determines that the response of the transport block b(2) is an error response NACK; if the decoding of the terminal SN(2) succeeds and feedback information f is obtained, the terminal SN(2) counts the number of consecutive bits "0" N0=3 starting from the last bit and the length Nf=7 of the feedback information f obtained by decoding, determines the length Nc=Nf-N0-1=7-3-1=3 of the compressed codeword, and then determines the number of correct transport blocks P=1 by looking up Table 2 according to the length Nc of the compressed codeword, then intercepts the first Nc bits of the feedback information f, the number of correct transport blocks P, and the size Na=7 of the ordered set of transport block identifiers as inputs of arithmetic decoding, performs arithmetic decoding, and obtains the correct transport block identifier set BI. Since the correct transport block identifier set BI does not include the label index 5 of the random access label included in the transport block b(2), the terminal SN(2) determines that the response of the transport block b(2) is an error response NACK.

[0386] If the decoding of the terminal SN(3) fails, the terminal SN(3) determines that the response of the transmission block b(3) is an error response NACK; if the decoding of the terminal SN(3) succeeds and feedback information f is obtained, the terminal SN(3) counts the number of consecutive bits "0" N0=3 starting from the last bit and the length Nf=7 of the feedback information f obtained by decoding, determines the length Nc=Nf-N0-1=7-3-1=3 of the compressed codeword, and then determines the number of correct transmission blocks P=1 by looking up Table 2 according to the length Nc of the compressed codeword, then intercepts the first Nc bits of the feedback information f, the number of correct transmission blocks P, and the size Na=7 of the ordered set of transmission block identifiers as inputs of arithmetic decoding, performs arithmetic decoding, and obtains the correct transmission block identifier set BI. Since the correct transmission block identifier set BI does not include the label index 3 of the random access label included in the transmission block b(3), the terminal SN(3) determines that the response of the transmission block b(3) is an error response NACK.

[0387] If the decoding of the terminal SN(4) fails, the terminal SN(4) determines that the response of the transmission block b(4) is an error response NACK; if the decoding of the terminal SN(4) succeeds and feedback information f is obtained, the terminal SN(4) counts the number of consecutive bits "0" N0=3 starting from the last bit and the length Nf=7 of the feedback information f obtained by decoding, determines the length Nc=Nf-N0-1=7-3-1=3 of the compressed codeword, and then determines the number of correct transmission blocks P=1 by looking up Table 2 according to the length Nc of the compressed codeword, then intercepts the first Nc bits of the feedback information f, the number of correct transmission blocks P, and the size Na=7 of the ordered set of transmission block identifiers as inputs of arithmetic decoding, performs arithmetic decoding, and obtains the correct transmission block identifier set BI. Since the correct transmission block identifier set BI includes the label index 2 of the random access label included in the transmission block b(4), the terminal SN(4) determines that the response of the transmission block b(4) is a correct response ACK.

[0388] Example 14:

[0389] The difference between this example and Example 12 is that in this example, the feedback information includes a prefix code and a compression codeword. Fig. 27 Schematic diagram of feedback information, prefix code and compressed codeword provided by the example of this application. The specific method for determining feedback information f is as follows:

[0390] The base station encodes the information of the correct transmission block set according to the following method to obtain feedback information:

[0391] According to the number of correct transmission blocks P = 1, the maximum number of correct transmission blocks Pmax = 3, and the size of the ordered set of input block identifiers Na = 7, the base station determines the number of prefix codeword bits. According to the number of prefix codeword bits Np=4, the base station determines that the first Np-1=4-1=3 bits of the prefix codeword are "1", and determines that the last bit of the prefix codeword is "0", that is, the prefix codeword is [p1, p2, p3, p4]=[1, 1, 1, 0].

[0392] Fig.29 The information transmission method provided in the embodiment of the present application specifically includes step S5000 and step S6000.

[0393] Step S5000: Send a transmission block to the first node.

[0394] Step S6000: receiving feedback information sent by the first node; wherein the feedback information is used to characterize the reception status of the transmission block.

[0395] In some embodiments, a second node sends a signal including one or more transmission blocks to a first node, and the one or more transmission blocks form a transmission block set at the first node. In other embodiments, two or more second nodes may send one or more transmission blocks to a first node, and the transmission blocks form a transmission block set.

[0396] In some embodiments, when multiple second nodes send transmission blocks to the first node, the second nodes that send the transmission block set constitute a second node sequence, wherein the second node sequence includes Nu second nodes, and the transmission block set includes NT transmission blocks; wherein Nu and NT are positive integers, and Nu is less than or equal to NT.

[0397] In some embodiments, a transport block in a transport block set includes a transport block identifier (Transport Block Identifier), which is an element of an ordered set of transport block identifiers. The ordered set of transport block identifiers includes Na transport block identifiers I(1), I(2), ..., I(Na), where Na is the size of the ordered set of transport block identifiers; for i = 1, 2, ...., Na, the i-th element of the ordered set of transport block identifiers is I(i); wherein the i-th element I(i) of the ordered set of transport block identifiers is an integer; illustratively, the i-th element I(i) of the ordered set of transport block identifiers may be an integer i or an integer i-1.

[0398] In some embodiments, the transport block is indicated by a transport block identification.

[0399] In some embodiments, the transport block identifier may be one of the following: a user equipment identifier (User Equipment Identifier), an index value of a user equipment identifier, or a signature index.

[0400] In some embodiments, the user identifier is a user identifier of a second node in the second node sequence, the user identifiers of two different second nodes in the second node sequence are different, and the user identifier can be used by the first node to distinguish different transmission blocks in the transmission block set in a signal containing the transmission block set, wherein the user identifier is an integer.

[0401] It should be noted that the user identifier can be a subscription permanent identifier (SUPI), a generic public subscription identifier (GPSI), a permanent equipment identifier (PEI), a network access identifier (NAI), a subscription concealed identifier (SUCI), a globally unique temporary identifier (GUTI), a radio network temporary identifier (RNTI), a system information RNTI (SI-RNTI), a paging RNTI (P-RNTI), a random access RNTI (RA-RNTI), a temporary cell RNTI (TC-RNTI), a cell RNTI (Cell RNTI, C-RNTI), and an uplink control channel transmit power control RNTI (Transmit Power Control-PUCCH RNTI, TPC-PUCCH-RNTI), uplink shared channel transmit power control RNTI (Transmit Power Control-PUSCH RNTI, TPC-PUSCH-RNTI), channel sounding reference signal transmit power control RNTI (Transmit Power Control-Sounding Reference Symbols RNTI, TPC-SRS-RNTI), interruption RNTI (Interruption RNTI, INT-RNTI), modulation coding scheme cell RNTI (Modulcation Coding Scheme Cell RNTI, MCS-C-RNTI), configuration scheduling RNTI (Configured Scheduling RNTI, CS-RNTI), slot format indication RNTI (Slot Format Indication RNTI, SFI-RNTI), semi-persistent RNTI (Semi-Persistent CSI RNTI, SP-CSI-RNTI), etc.

[0402] In some embodiments, the transport block identifier is a user identifier, and the element of the transport block identifier ordered set is a user identifier.

[0403] Exemplarily, the transport block identifier ordered set I=<I(1),I(2),I(3),I(4),I(5)> =<0,1,2,3,4>; wherein the size of the transport block identifier ordered set is Na=5, and the user identifier corresponding to the second element I(2) in the transport block identifier ordered set is 1; illustratively, the transport block identifier ordered set I=<I(1),I(2),I(3),I(4),I(5)> =<1,2,3,4,5>; wherein the size of the transport block identifier ordered set is Na=5, and the user identifier corresponding to the second element I(2) in the transport block identifier ordered set is 2; illustratively, the transport block identifier ordered set I=<I(1),I(2),I(3),I(4)> =<0,11,20,30>; wherein the size of the transport block identifier ordered set is Na=4, and the user identifier corresponding to the second element I(2) in the transport block identifier ordered set is 11.

[0404] In some embodiments, the index value of the user identifier refers to the ordered set of transport block identifiers I=<I(1),I(2),.,I(Na)> The index k of the element I(k) in , k = 1, 2, ...., Na, where the index value of the user identifier is an integer.

[0405] In some embodiments, the transmission block identifier is an index value of the user identifier, the user identifier is an element in an ordered set of user identifiers, and the ordered set of user identifiers includes Na user identifiers ID(1), ID(2), ..., ID(Na); wherein Na is the size of the ordered set of user identifiers, which is also the size of the ordered set of transmission block identifiers, k=1, 2, ..., Na, and the index value of the user identifier corresponding to the kth user identifier ID(k) in the ordered set of user identifiers is the kth element I(k) in the ordered set of transmission block identifiers. Exemplarily, the ordered set of user identifiers ID=<ID(1),ID(2),ID(3),ID(4)> = <0,11,20,30>, the corresponding transport block identifier ordered set I =<I(1),I(2),I(3),I(4)> =<0,1,2,3>; wherein the user identifier ordered set size and the transport block identifier ordered set size are both Na=4, the index value of the user identifier of the element ID(2)=11 in the user identifier ordered set is the element I(2)=1 in the transport block identifier ordered set; illustratively, the user identifier ordered set ID=<ID(1),ID(2),ID(3),ID(4)> =<11,0,20,30>, the corresponding transport block identifier ordered set I=<I(1),I(2),I(3),I(4)> =<0,1,2,3>; wherein the user identifier ordered set size and the transport block identifier ordered set size are both Na=4, the index value of the user identifier of the element ID(2)=0 in the user identifier ordered set is the element I(2)=1 in the transport block identifier ordered set; illustratively, the user identifier ordered set ID=<ID(1),ID(2),ID(3),ID(4)> =<11,0,20,30>, the corresponding transport block identifier ordered set I=<I(1),I(2),I(3),I(4)> =<1,2,3,4>; wherein the user identifier ordered set size and the transport block identifier ordered set size are both Na=4, and the index value of the user identifier of the element ID(2)=0 in the user identifier ordered set is the element I(2)=2 in the transport block identifier ordered set.

[0406] In some embodiments, the transmission block identifier is a tag index, which is a tag index of a random access tag (signature), that is, a transmission block in a transmission block set includes a random access tag, which is an element of an ordered set of random access tags, and the ordered set of random access tags includes Na random access tags r(1), r(2), ..., r(Na); wherein Na is the size of the ordered set of random access tags, which is also the size of the ordered set of transmission block identifiers, i = 1, 2, ...., Na, and the tag index of the i-th random access tag r(i) in the ordered set of random access tags is the i-th element I(i) of the ordered set of transmission block identifiers, wherein the i-th element I(i) of the ordered set of transmission block identifiers can be an integer i or an integer i-1.

[0407] It should be noted that the random access label can be a pilot, a reference signal, a preamble, a spread spectrum sequence, an interleaver, an interleaver pattern, an interleaver sequence, a scrambling sequence, a sparse code sequence, etc.

[0408] In some embodiments, the second node determines a random access tag of a transport block according to its user identifier as a random access tag included in a transport block in the transport block set, and these random access tags can be used by the first node to distinguish different transport blocks in the transport block set in a signal containing the transport block set.

[0409] In some embodiments, the second node determines a random access tag included in a transport block as a random access tag included in a transport block in a transport block set based on higher layer parameters, and these random access tags can be used by the first node to distinguish different transport blocks in the transport block set in a signal containing the transport block set.

[0410] It should be noted that the first node and the second node may be any network element having data receiving and signaling sending functions, such as a base station, a relay, and a terminal.

[0411] It should be noted that the transmission block subset is a set consisting of correct transmission blocks or erroneous transmission blocks in the transmission block set. The information of the transmission block subset includes the transmission block identifier set of the transmission block subset, the maximum number of transmission blocks Pmax of the transmission block subset, the number of transmission blocks P of the transmission block subset, the transmission block identifier ordered set, the transmission block identifier ordered set size Na, the feedback information length Nf and the transmission block error pattern a. It should be noted that the feedback information can be obtained according to the above information of one or more transmission block subsets, that is, the generation of feedback information does not necessarily require all of the above information.

[0412] In some embodiments, when the transport block subset is a set consisting of correct transport blocks in the transport block set, the transport block identifier set of the transport block subset is a correct transport block identifier set; the maximum number of transport blocks of the transport block subset is the maximum number of correct transport blocks Pmax; and the number of transport blocks of the transport block subset is the correct number of transport blocks P.

[0413] Exemplarily, when the transmission block subset is a set consisting of correct transmission blocks in the transmission block set, the information of the transmission block subset is the information of the correct transmission block set. The information of the correct transmission block set includes the maximum number of correct transmission blocks Pmax, the ordered set of transmission block identifiers, the size of the ordered set of transmission block identifiers Na, the correct transmission block identifier set, the number of correct transmission blocks P, the transmission block error pattern a, and the length Nf of the feedback information f. It should be noted that the feedback information can be obtained based on the above information of one or more correct transmission blocks, that is, the generation of the feedback information does not necessarily require all of the above information.

[0414] In some embodiments, when the transmission block subset is a set consisting of erroneous transmission blocks in the transmission block set, the transmission block identification set of the transmission block subset is an erroneous transmission block identification set; the maximum number of transmission blocks of the transmission block subset is the maximum number of erroneous transmission blocks Pmax; the number of transmission blocks of the transmission block subset is the number of erroneous transmission blocks P.

[0415] Exemplarily, when the transmission block subset is a set consisting of erroneous transmission blocks in the transmission block set, the information of the transmission block subset is the information of the erroneous transmission block set. The information of the erroneous transmission block set includes the maximum number of erroneous transmission blocks Pmax, an ordered set of transmission block identifiers, a size of the ordered set of transmission block identifiers Na, an erroneous transmission block identifier set, the number of erroneous transmission blocks P, a transmission block error pattern a, and the length Nf of the feedback information f. It should be noted that the feedback information can be obtained based on the above information of one or more erroneous transmission blocks, that is, the generation of the feedback information does not necessarily require all of the above information.

[0416] In some embodiments, the maximum number of transport blocks Pmax of the transport block subset is equal to the size Na of the ordered set of transport block identifiers; in other embodiments, the maximum number of transport blocks Pmax of the transport block subset is configured by the first node; in yet other embodiments, the maximum number of transport blocks Pmax of the transport block subset is pre-configured by high-level parameters.

[0417] In some embodiments, the transmission block subset is a correct transmission block set, and the information of the correct transmission block set includes a correct transmission block identifier set, and the correct transmission block identifier set is a set of user identifiers included in the correctly received transmission blocks in the transmission block set. The correctly received transmission block refers to a transmission block whose response status is a correct response ACK, and a user identifier belonging to the correct transmission block identifier set is used to indicate that the response status of the transmission block corresponding to the user identifier is a correct response ACK, and a user identifier not belonging to the correct transmission block identifier set is used to indicate that the response status of the transmission block corresponding to the user identifier is an incorrect response NACK.

[0418] In some other embodiments, the transmission block subset is an erroneous transmission block set, and the information of the erroneous transmission block set includes an erroneous transmission block identifier set, which is a set of user identifiers included in the erroneously received transmission blocks in the transmission block set. The erroneously received transmission block refers to a transmission block whose response status is an erroneous response NACK, a user identifier belonging to the erroneous transmission block identifier set is used to indicate that the response status of the transmission block corresponding to the user identifier is an erroneous response NACK, and a user identifier not belonging to the erroneous transmission block identifier set is used to indicate that the response status of the transmission block corresponding to the user identifier is a correct response ACK.

[0419] In some embodiments, the transmission block subset is a correct transmission block set, and the information of the correct transmission block set includes a correct transmission block identifier set, and the correct transmission block identifier set is a set of index values ​​of user identifiers included in the correctly received transmission blocks in the transmission block set. The correctly received transmission block refers to a transmission block whose response status is a correct response ACK, and the index value of a user identifier belongs to the correct transmission block identifier set, which is used to indicate that the response status of the transmission block corresponding to the index value of the user identifier is a correct response ACK, and the index value of a user identifier does not belong to the correct transmission block identifier set, which is used to indicate that the response status of the transmission block corresponding to the index value of the user identifier is an incorrect response NACK.

[0420] In some other embodiments, the transmission block subset is an erroneous transmission block set, and the information of the erroneous transmission block set includes an erroneous transmission block identifier set, which is a set of index values ​​of user identifiers included in the erroneously received transmission blocks in the transmission block set. The erroneously received transmission block refers to a transmission block whose response status is an erroneous response NACK, and the index value of a user identifier belonging to the erroneous transmission block identifier set is used to indicate that the response status of the transmission block corresponding to the index value of the user identifier is an erroneous response NACK, and the index value of a user identifier not belonging to the erroneous transmission block identifier set is used to indicate that the response status of the transmission block corresponding to the index value of the user identifier is a correct response ACK.

[0421] In some embodiments, the transmission block subset is a correct transmission block set, and the information of the correct transmission block set includes a correct transmission block identification set, and the correct transmission block identification set is a set of label indices of random access labels corresponding to correctly received transmission blocks in the transmission block set. A correctly received transmission block refers to a transmission block whose response status is a correct response ACK, and a label index of a random access label belongs to the correct transmission block identification set to indicate that the response status of the transmission block corresponding to the random access label is a correct response ACK, and a label index of a random access label does not belong to the correct transmission block identification set to indicate that the response status of the transmission block corresponding to the random access label is an incorrect response NACK.

[0422] In some other embodiments, the transmission block subset is an erroneous transmission block set, and the information of the erroneous transmission block set includes an erroneous transmission block identification set, which is a set of label indexes of random access labels corresponding to erroneously received transmission blocks in the transmission block set. The erroneously received transmission block refers to a transmission block whose response status is an erroneous response NACK, and a label index of a random access label belongs to the erroneous transmission block identification set to indicate that the response status of the transmission block corresponding to the random access label is an erroneous response NACK, and a label index of a random access label does not belong to the erroneous transmission block identification set to indicate that the response status of the transmission block corresponding to the random access label is a correct response ACK.

[0423] In this example, the process of obtaining the feedback information f is described from the perspective of the terminal.

[0424] like Fig.24 As shown, the difference between this example and example 11 is that the terminal sequence includes Nu=3 terminals SN(1), SN(2), SN(3) which respectively receive the signal containing feedback information f sent by the base station, wherein the feedback information f is the feedback information of the transmission block set B; the feedback information f is the length The transmission block set B includes NT = 4 transmission blocks b(1), b(2), b(3), b(4), which are sent to the base station by the terminals SN(1), SN(2), SN(3), SN(1) respectively. The feedback information f is determined by the base station according to the signal containing the transmission block set B sent by the terminal sequence.

[0425] Fig.30 The flowchart of the decoding result judgment method provided in the embodiment of the present application specifically includes step S7100, step S7200, step S7300, step S7310, and step S7320.

[0426] Step S7100: Decode the feedback signal corresponding to the feedback information to obtain a decoding result.

[0427] Step S7200: Determine whether the decoding is successful based on the decoding result.

[0428] Step S7300: If the decoding is successful, determine whether the decoding result contains the transport block identifier of the transport block sent by the second node according to the correct transport block identifier set.

[0429] Step S7310: If the decoding result does not include the transport block identifier of the transport block sent to the second node, it is determined that the response to the transport block sent to the second node is an error response NACK.

[0430] Step S7320: If the decoding result includes the transport block identifier of the transport block sent to the second node, it is determined that the response to the transport block sent to the second node is a correct response ACK.

[0431] Fig.31 Schematic diagram of the structure of an information transmission device provided by an embodiment of the present application. Fig.31 As shown, the information transmission device 200 provided in the embodiment of the present application is applied to the base station, and can execute the information transmission method provided in the embodiment of the present application, and the terminal has the functional modules and technical effects corresponding to the execution method. The device can be implemented by software, hardware or a combination of software and hardware, including: a receiving module 201, configured to receive a transmission block sent by at least one second node; wherein the transmission blocks form a transmission block set;

[0432] The transport block subset information obtaining module 202 is configured to obtain information of a transport block subset of the transport block set according to the transport block set.

[0433] The feedback information generating module 203 is configured to obtain feedback information according to the information of the transmission block subset; wherein the feedback information is used to characterize the reception status of the transmission block sent by the second node;

[0434] The sending module 204 is configured to send feedback information to at least one second node.

[0435] Fig.32 Schematic diagram of the structure of an information transmission device provided by an embodiment of the present application. Fig.32 As shown, the information transmission device 300 provided in the embodiment of the present application is applied to a user device, and can execute the information transmission method provided in the embodiment of the present application, and the terminal has the functional modules and technical effects corresponding to the execution method. The device can be implemented by software, hardware, or a combination of software and hardware, including:

[0436] A sending module 301 is configured to send a transmission block to a first node; wherein the transmission block forms a transmission block set at the first node;

[0437] The receiving module 302 is configured to receive feedback information sent by the first node; wherein the feedback information is used to characterize the reception status of the transmission block.

[0438] Fig.33 is a schematic diagram of the structure of a base station provided in an embodiment of the present application, such as Fig.33 As shown, the base station 400 includes a memory 401, a processor 402, a receiver 403 and a transmitter 404. The number of the memory 401 and the processor 402 can be one or more. Fig.33 In the example, a memory 401 and a processor 402 are used; the memory 401 and the processor 402 in the base station can be connected by a bus or other means. Fig.33 The example of connecting through bus is taken in the following.

[0439] The memory 401 is a computer-readable storage medium that can be used to store software programs, computer executable programs, and modules, such as program instructions / modules corresponding to the information transmission method provided in any embodiment of the present application. The processor 402 implements the above-mentioned information transmission method by running the software programs, instructions, and modules stored in the memory 401.

[0440] The memory 401 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system and an application required for at least one function. In addition, the memory 401 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device or other non-volatile solid-state storage device. In some instances, the memory 401 further includes a memory remotely arranged relative to the processor 402, and these remote memories may be connected to the device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network and a combination thereof.

[0441] The receiver 403 is configured to receive a transmission block; the transmitter 404 is configured to send feedback information according to the control of the processor 402 .

[0442] Fig.34 is a schematic diagram of the structure of a user equipment provided by an embodiment of the present application, such as Fig.34 As shown, the user equipment 500 includes a memory 501, a processor 502, a receiver 503 and a transmitter 504. The number of the memory 501 and the processor 502 can be one or more. Fig.34 In the example, a memory 501 and a processor 502 are used; the memory 501 and the processor 502 in the user equipment can be connected via a bus or other means. Fig.34 The example of connecting through bus is taken in the following.

[0443] The memory 501 is a computer-readable storage medium that can be used to store software programs, computer executable programs, and modules, such as program instructions / modules corresponding to the information transmission method provided in any embodiment of the present application. The processor 502 implements the above-mentioned information transmission method by running the software programs, instructions, and modules stored in the memory 501.

[0444] The memory 501 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system and an application required for at least one function. In addition, the memory 501 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device or other non-volatile solid-state storage device. In some instances, the memory 501 further includes a memory remotely arranged relative to the processor 502, and these remote memories may be connected to the device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network and a combination thereof.

[0445] The receiver 503 is configured to receive feedback information; the transmitter 504 is configured to send a transmission block according to the control of the processor 502.

[0446] An embodiment of the present application further provides a computer-readable storage medium storing computer-executable instructions, wherein the computer-executable instructions are used to execute the information transmission method provided in any embodiment of the present application.

[0447] An embodiment of the present application also provides a computer program product, including a computer program or computer instructions, which are stored in a computer-readable storage medium. A processor of a computer device reads the computer program or computer instructions from the computer-readable storage medium, and the processor executes the computer program or computer instructions, so that the computer device executes an information transmission method provided in any embodiment of the present application.

[0448] The system architecture and application scenarios described in the embodiments of the present application are intended to more clearly illustrate the technical solutions of the embodiments of the present application, and do not constitute a limitation on the technical solutions provided in the embodiments of the present application. Those skilled in the art will appreciate that with the evolution of the system architecture and the emergence of new application scenarios, the technical solutions provided in the embodiments of the present application are equally applicable to similar technical problems.

[0449] Those skilled in the art will appreciate that all or some of the steps in the methods disclosed above, and the functional modules / units in the systems and devices may be implemented as software, firmware, hardware, or a suitable combination thereof.

[0450] In hardware implementation, the division between the functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed by several physical components in cooperation. Some physical components or all physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor or a microprocessor, or implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or non-transitory medium) and a communication medium (or temporary medium). As known to those of ordinary skill in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules or other data). Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, it is well known to those skilled in the art that communication media typically embodies computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

[0451] The terms "component", "module", "system", etc. used in this specification are used to represent computer-related entities, hardware, firmware, a combination of hardware and software, software, or software in execution. For example, a component can be, but is not limited to, a process running on a processor, a processor, an object, an executable file, an execution thread, a program, or a computer. By way of illustration, both applications running on a computing device and a computing device can be components. One or more components may reside in a process or an execution thread, and a component may be located on a computer or distributed between two or more computers. In addition, these components may be executed from various computer-readable media having various data structures stored thereon. Components may communicate, for example, through local or remote processes based on signals having one or more data packets (e.g., data from two components interacting with another component between a local system, a distributed system, or a network, such as the Internet interacting with other systems through signals).

[0452] The above describes some embodiments of the present application with reference to the accompanying drawings, but does not limit the scope of the present invention. Any modification, equivalent substitution and improvement made by those skilled in the art without departing from the scope and essence of the present invention shall be within the scope of the present application.

Claims

1. An information transmission method, comprising: receiving a transport block sent by at least one second node; the transport blocks forming a transport block set; Sending feedback information of the transport block set to at least one of the second nodes; The feedback information is used to characterize the reception status of at least one transmission block sent by the second node, and the feedback information includes at least two of the following: a prefix codeword, a filling bit sequence, and a compression codeword.

2. The method according to claim 1, characterized in that: The feedback information further includes information of transport blocks in a transport block subset of the transport block set; and the method further includes: At least two of the following are determined according to the information of the transport block subset: the prefix codeword, the filling bit sequence, and the compression codeword.

3. The method according to claim 2, characterized in that The information of the transport block subset includes at least one of the following: a transport block identifier set of the transport block subset, a maximum number of transport blocks in the transport block subset, the number of transport blocks in the transport block subset, a transport block identifier ordered set size, and a length of the feedback information; When the content determined according to the information of the transport block subset includes the prefix codeword, the prefix codeword is determined according to the number of prefix codeword bits, and the number of prefix codeword bits is determined according to at least one of the following: the size of the transport block identifier set of the transport block subset, the maximum number of transport blocks in the transport block subset, the number of transport blocks in the transport block subset, the size of the transport block identifier ordered set and the length of the feedback information.

4. The method according to claim 3, characterized in that The information of the transport block subset includes a transport block identifier set of the transport block subset, a maximum number of transport blocks in the transport block subset, and the number of transport blocks in the transport block subset; the number of prefix codeword bits is determined according to one of the following formulas: Np=Pmax-P+1, where Np is the number of bits of the prefix codeword, Pmax is the maximum number of transport blocks in the transport block subset, and P is the number of transport blocks in the transport block subset; Np=Pmax-P ACK +1, where Np is the number of bits of the prefix codeword, Pmax is the maximum number of transport blocks in the transport block subset, and P ACK The method further comprises: obtaining a size of a transport block identifier set of the transport block subset.

5. The method according to claim 3, characterized in that: The information of the transport block subset includes the maximum number of transport blocks in the transport block subset, the number of transport blocks in the transport block subset and the size of the ordered set of transport block identifiers; the number of prefix codeword bits is determined according to one of the following formulas: Wherein, Np is the number of bits of the prefix codeword, Pmax is the maximum number of transport blocks in the transport block subset, P is the number of transport blocks in the transport block subset, and Na is the size of the transport block identifier ordered set; Wherein, Np is the number of bits of the prefix codeword, Pmax is the maximum number of transport blocks in the transport block subset, P is the number of transport blocks in the transport block subset, and Na is the size of the transport block identifier ordered set; Among them, Np is the number of prefix codeword bits, Pmax is the maximum number of transport blocks in the transport block subset, P is the number of transport blocks in the transport block subset, and Na is the size of the ordered set of transport block identifiers.

6. The method according to claim 3, characterized in that The information of the transport block subset includes the number of transport blocks in the transport block subset, the size of the ordered set of transport block identifiers, and the length of the feedback information; the number of prefix codeword bits is determined according to the following formula: Among them, Np is the number of prefix codeword bits, Nf is the length of the feedback information, P is the number of transport blocks in the transport block subset, and Na is the size of the ordered set of transport block identifiers.

7. The method according to claim 1, characterized in that The feedback information includes the prefix codeword, and the content of the prefix codeword includes one of the following: The first Np-1 bits have a value of 0, and the last bit has a value of 1; The first Np-1 bits have a value of 1, and the last bit has a value of 0; The first bit has a value of 1, and the next Np-1 bits have a value of 0; The first bit has a value of 0, and the next Np-1 bits have a value of 1; Wherein, Np is the length of the prefix codeword.

8. The method according to claim 2, characterized in that: The information of the transport block subset includes at least one of the following: a transport block identifier set of the transport block subset, a maximum number of transport blocks in the transport block subset, the number of transport blocks in the transport block subset, a transport block identifier ordered set size, and a length of the feedback information; When the content determined according to the information of the transport block subset includes the filling bit sequence, the filling bit sequence is determined according to the length of the filling bit sequence, and the length of the filling bit sequence is determined according to at least one of the following: the size of the transport block identifier set of the transport block subset, the maximum value of the number of transport blocks in the transport block subset, the number of transport blocks in the transport block subset, the size of the transport block identifier ordered set and the length of the feedback information.

9. The method according to claim 1, characterized in that: The length of the padding bit sequence is not zero, and the padding bit sequence is one of the following sequences: all-zero sequence; All one sequence; Pseudo-random sequence.

10. The method according to claim 1, characterized in that The information transmission method is applied to a first node, the length of the filling bit sequence is not zero, and the filling bit sequence is a preset sequence determined by pre-negotiation between the first node and the second node.

11. The method according to claim 1, characterized in that: The length of the padding bit sequence is zero, and the padding bit sequence is an empty sequence.

12. The method according to claim 2, characterized in that: The information packet of the transport block subset includes at least one of the following: a transport block identifier set of the transport block subset, a maximum number of transport blocks in the transport block subset, a number of transport blocks in the transport block subset, a transport block identifier ordered set size, and a transport block error pattern; When the content determined according to the information of the transport block subset includes the compressed codeword, the compressed codeword is determined according to at least one of the following: the size of the transport block identifier set of the transport block subset, the maximum value of the number of transport blocks in the transport block subset, the number of transport blocks in the transport block subset, the size of the transport block identifier ordered set and the transport block error pattern.

13. The method according to claim 2, characterized in that The information of the transport block subset includes the number of transport blocks of the transport block subset and the size of the ordered set of transport block identifiers. When the content determined according to the information of the transport block subset includes the compressed codeword, the length of the compressed codeword is determined according to the following formula: Wherein, Nc is the length of the compressed codeword, P is the number of transport blocks in the transport block subset, and Na is the size of the ordered set of transport block identifiers.

14. The method according to claim 1, characterized in that The feedback information is obtained by concatenating at least two of the following: the prefix codeword, the filling bit sequence, and the compressed codeword.

15. The method according to any one of claims 2 to 6, 8, 12 and 13, characterized in that The transport block subset is a set consisting of correct transport blocks or erroneous transport blocks in the transport block set.

16. The method according to claim 1, characterized in that The transport block is indicated by a transport block identifier, and the transport block identifier includes at least one of the following: User ID, index value of user ID, tag index.

17. The method according to claim 16, characterized in that When the transmission block identifier includes the user identifier, the user identifier includes at least one of the following: Subscription permanent identifier, universal public subscription identifier, permanent equipment identifier, network access identifier, subscription hidden identifier, globally unique temporary identifier, wireless network temporary identifier, system information wireless network temporary identifier, paging wireless network temporary identifier, random access wireless network temporary identifier, temporary cell wireless network temporary identifier, cell wireless network temporary identifier, uplink control channel transmit power control wireless network temporary identifier, uplink shared channel transmit power control wireless network temporary identifier, channel sounding reference signal transmit power control wireless network temporary identifier, interruption wireless network temporary identifier, modulation and coding mode cell wireless network temporary identifier, configuration scheduling wireless network temporary identifier, time slot format indication wireless network temporary identifier, semi-persistent wireless network temporary identifier.

18. The method according to claim 16, characterized in that When the transport block identifier includes the label index, the label index is a label index of a random access label, and the random access label includes at least one of the following: Pilot, reference signal, preamble, spreading sequence, interleaver, interleaving pattern, interleaving sequence, scrambling sequence, sparse code sequence.

19. The method according to claim 1, characterized in that The sending feedback information of the transmission block set to at least one of the second nodes comprises: performing channel coding on the feedback information of the transport block set to obtain channel-coded feedback information; Send the channel-coded feedback information to at least one of the second nodes.

20. The method according to claim 19, characterized in that The channel coding includes at least one of the following: Polarization coding, low-density parity-check coding, convolutional coding, turbo coding, RM code, RS code, BCH code, cascade coding, cyclic code, block coding, Hamming coding, Gore code, repetition coding, single parity-check code, cyclic redundancy check code, superposition coding, sparse superposition coding, sparse regression coding, lattice coding, algebraic geometry code, Goppa code, polarization adjustment convolutional code, pre-transformation polarization code, parity check polarization code.

21. An information transmission method, comprising: sending a transport block to the first node; Receive feedback information sent by the first node according to the transmission block, wherein the feedback information is used to characterize the reception status of the transmission block, and the feedback information includes at least two of the following: a prefix codeword, a filling bit sequence, and a compression codeword.

22. The method according to claim 21, characterized in that The transport block is indicated by a transport block identifier, and the transport block identifier includes at least one of the following: User ID, index value of user ID, tag index.

23. The method according to claim 21, characterized in that The method further comprises: Decoding the feedback information to obtain a decoding result; A reception status of the transmission block by the first node is determined according to the decoding result.

24. A communication device, characterized in that: include: at least one processor; at least one memory for storing at least one program; When at least one of the programs is executed by at least one of the processors, the information transmission method according to any one of claims 1 to 23 is executed.

25. A computer-readable storage medium, characterized in that: A processor-executable program is stored therein, and when the processor-executable program is run by the processor, the information transmission method according to any one of claims 1 to 23 is executed.

26. A computer program product comprising a computer program or computer instructions, characterized in that The computer program or the computer instructions are stored in a computer-readable storage medium, the processor of the communication device reads the computer program or the computer instructions from the computer-readable storage medium, and the processor executes the computer program or the computer instructions, so that the communication device executes the information transmission method as described in any one of claims 1 to 23.

Citation Information

Patent Citations

  • Triggering method, feedback method and equipment for HARQ-ACK feedback

    CN113472487A

  • Method and apparatus for HARQ-ACK codebook reduction

    US20220052790A1

Cited By

  • Information transmission method, communication device, storage medium, and program product

    EP4701109A1