WO2023241287A1 - 信息传输方法、装置、基站、设备、存储介质及程序产品 - Google Patents

信息传输方法、装置、基站、设备、存储介质及程序产品 Download PDF

Info

Publication number
WO2023241287A1
WO2023241287A1 PCT/CN2023/094340 CN2023094340W WO2023241287A1 WO 2023241287 A1 WO2023241287 A1 WO 2023241287A1 CN 2023094340 W CN2023094340 W CN 2023094340W WO 2023241287 A1 WO2023241287 A1 WO 2023241287A1
Authority
WO
WIPO (PCT)
Prior art keywords
transport block
correct
information
transmission block
feedback information
Prior art date
Application number
PCT/CN2023/094340
Other languages
English (en)
French (fr)
Inventor
赵喆
梁楚龙
许进
袁志锋
李立广
郁光辉
康健
傅强
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2023241287A1 publication Critical patent/WO2023241287A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/04—Error control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information

Definitions

  • the embodiments of the present application relate to the field of communication technology, and in particular, an information transmission method, device, base station, user equipment, storage medium and program product.
  • each base station (Base Station, BS) needs to support the connections of tens of thousands of user equipment (User Equipment, UE).
  • UE User Equipment
  • CBGF contention-based grant-free
  • the base station does not need to schedule and allocate resources in advance to the UEs sending data, nor can it know in advance which UEs have data to send. requirements, so there is the possibility that multiple UEs use the same time and frequency resources (Time and Frequency Resource) for transmission.
  • the UE sending data will randomly select a resource (also called signature) from the random access resource set provided by the system (such as spreading sequence, pilot sequence, etc.) for data processing. send.
  • a resource also called signature
  • the base station Since the base station does not schedule UEs, it needs to feedback an acknowledgment signal (Acknowledgement signaling) to each UE whether the data packet is successfully received, and a base station needs to serve thousands of UEs at the same time. If each UE being served is given To feed back a 1-bit response signal, thousands of bits of response signals need to be fed back. Such feedback overhead is too large, resulting in a waste of spectrum resources.
  • Acknowledgement signaling acknowledgment signaling
  • Embodiments of the present application provide an information transmission method, device, base station, user equipment, computer-readable storage medium, and computer program product, aiming to save spectrum resources and improve data transmission efficiency.
  • embodiments of the present application provide an information transmission method.
  • the method includes: receiving a transmission block sent by at least one second node; the transmission block forms a transmission block set; and obtaining correct transmission according to the transmission block set.
  • the information of the block set; the information of the correct transmission block set is encoded to obtain feedback information; wherein the feedback information is used to characterize the reception of the transmission block sent by the at least one second node; the encoding process
  • the method includes compressing and encoding the information of the correct transmission block set; sending the feedback information to the at least one second node.
  • embodiments of the present application provide an information transmission method, which is applied to a second node.
  • the method includes: sending a transmission block to a first node; receiving feedback information sent by the first node; The feedback information is used to characterize the reception status of the transport block.
  • embodiments of the present application provide an information transmission device, including: a receiving module configured to receive at least one a transmission block sent by a second node; the transmission block forms a transmission block set; a correct transmission block information acquisition module is configured to obtain the information of the correct transmission block set according to the transmission block set; a feedback information generation module is configured to pass Encoding the information of the correct transport block set to obtain feedback information; wherein the feedback information is used to characterize the reception of the transport blocks sent by the at least one second node; the encoding process includes encoding the correct The information of the transport block set is compressed and encoded; the sending module is configured to send the feedback information to the at least one second node.
  • embodiments of the present application provide an information transmission device, including: a sending module configured to send a transmission block to a first node; a receiving module configured to receive feedback information sent by the first node; wherein, Feedback information is used to characterize the reception of the transport block.
  • embodiments of the present application provide a base station, including: a memory, a processor, and a computer program stored in the memory and executable on the processor.
  • the processor executes the computer program, the first aspect is implemented. Or the information transmission method described in any one of the second aspects.
  • embodiments of the present application provide a user equipment, including: a memory, a processor, and a computer program stored in the memory and executable on the processor.
  • the processor executes the computer program, the first The information transmission method described in any one of the aspects or the second aspect.
  • embodiments of the present application provide a computer-readable storage medium that stores computer-executable instructions, and the computer-executable instructions are used to execute any one of the first aspect or the second aspect.
  • the information transmission method described in the item is not limited to:
  • embodiments of the present application provide a computer program product, including a computer program or computer instructions.
  • the computer program or computer instructions are stored in a computer-readable storage medium.
  • the processor of the computer device can read the computer program from the computer. Reading the storage medium reads the computer program or the computer instructions, and the processor executes the computer program or the computer instructions, so that the computer device executes the method described in any one of the first aspect or the second aspect. Information transmission method.
  • Figure 1 is a schematic system architecture diagram of an application scenario of an information transmission method provided by an embodiment of the present application
  • Figure 2 is a flow chart of an information transmission method provided by an embodiment of the present application.
  • Figure 3 is a schematic flowchart of determining feedback information from a correct transmission block identifier set according to an embodiment of the present application
  • Figure 5 is a schematic flowchart of a method for determining a transport block error pattern provided by an embodiment of the present application
  • Figure 6 is a schematic flowchart of a method for determining a transport block error pattern provided by another embodiment of the present application.
  • Figure 7 is a schematic flowchart of determining feedback information from transport block error patterns according to an embodiment of the present application.
  • Figure 9 is a schematic flowchart of determining an intermediate codeword from a correct transmission block identifier set according to an embodiment of the present application.
  • Figure 11 is a schematic flowchart of determining intermediate codewords from transport block error patterns according to an embodiment of the present application.
  • Figure 15 is a mapping relationship diagram of the number of correct transmission blocks, correct transmission block sets, transmission block error patterns, intermediate codewords, offset value bit sequences and feedback information provided by an example of this application;
  • Figure 16 is a mapping relationship diagram of the number of correct transmission blocks, correct transmission block set, transmission block error pattern, intermediate codeword, offset value bit sequence and feedback information provided by an example of this application;
  • Figure 21 is a mapping relationship diagram of the number of correct transmission blocks, correct transmission block set, transmission block error pattern, intermediate codeword, offset value bit sequence and feedback information provided by an example of this application;
  • Figure 22 is a schematic diagram of the relationship between the second node, the transmission block, the random access tag and the tag index provided in an example of this application;
  • Figure 23 is a mapping relationship diagram of the number of correct transmission blocks, correct transmission block sets, transmission block error patterns, intermediate codewords, offset value bit sequences and feedback information provided by an example of this application;
  • Figure 24 is a mapping relationship diagram of the number of correct transmission blocks, correct transmission block sets, transmission block error patterns, offset values and feedback information provided by an example of this application;
  • Figure 25 is a schematic flowchart of determining feedback information from a correct transmission block identification set provided by an example of this application.
  • Figure 26 is a mapping relationship diagram of the number of correct transmission blocks, correct transmission block sets, transmission block error patterns, offset values and feedback information provided by an example of this application;
  • Figure 27 is a schematic flowchart of determining feedback information from a correct transmission block identification set provided by another example of this application.
  • Figure 29 is a schematic diagram of the relationship between the second node, the transport block, the user identification and the index value of the user identification provided in an example of this application;
  • Figure 34 is a schematic structural diagram of a base station provided by an embodiment of the present application.
  • Figure 35 is a schematic structural diagram of user equipment provided by an embodiment of the present application.
  • words such as setting, installation, and connection should be understood in a broad sense. Those skilled in the art can reasonably determine the meaning of the above words in the embodiments of this application based on the specific content of the technical solution. specific meaning.
  • words such as “further”, “exemplarily” or “optionally” are used as examples, illustrations or illustrations, and should not be interpreted as being more preferable or better than other embodiments or designs.
  • the use of the words “further,” “exemplarily,” or “optionally” is intended to present the relevant concepts in a specific manner.
  • FIG 1 is a schematic system architecture diagram of an application scenario of an information transmission method provided by an embodiment of the present application.
  • a base station 110 serves multiple types of user equipment (120, 130, 140). Each type of user equipment can have one or more. Therefore, the base station 110 serves multiple types of user equipment. user equipment.
  • the user equipment involved in the embodiments of this application is a device that provides voice and/or data connectivity to users, such as a handheld device, a vehicle-mounted device, etc. with a wireless connection function.
  • the user equipment may also be other processing equipment connected to the wireless modem.
  • User equipment can communicate with one or more core networks through a radio access network (RAN).
  • RAN radio access network
  • User equipment may also be called a wireless terminal, subscriber unit, subscriber station, mobile station, mobile station, remote station, access point , remote terminal, access terminal, user terminal, user agent.
  • the user equipment may be a mobile terminal, such as a mobile phone (also known as a "cellular" phone) and a computer with a mobile terminal, for example, may be a portable, pocket-sized, handheld, computer-built-in or vehicle-mounted mobile device that is connected to a wireless The access network exchanges language and/or data.
  • the user equipment 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 (personal digital assistant, PDA) and other equipment.
  • PCS personal communication service
  • SIP session initiation protocol
  • WLL wireless local loop
  • PDA personal digital assistant
  • Common user devices include, for example: mobile phones, tablets, laptops, PDAs, mobile internet devices (MID), wearable devices, such as smart watches, smart bracelets, pedometers, etc., but this application implements Examples are not limited to this.
  • the base station involved in the embodiment of the present application may be a base transceiver station (BTS) in the global system for mobile communication (GSM) or code division multiple access (code division multiple access, CDMA), or It can be a base station (NodeB) in wideband code division multiple access (WCDMA), an evolutionary base station (eNB or e-NodeB) in LTE, or a new radio control
  • the new radio controller (NR controller) can be the gNode B (gNB) in the 5G system, it can be a centralized unit (centralized unit), it can be a new wireless base station, or it can be a radio frequency remote mode
  • a block can be a micro base station, a relay, a distributed unit, 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 to this.
  • Network equipment can cover 1 or multiple cells.
  • PUCCH format 0 and format 1 The number of payload bits in PUCCH format 0 and format 1 is no more than 2.
  • Phase-Shift Keying is used to modulate the load and then is multiplied with the sequence and spread spectrum to obtain the transmitted signal.
  • PUCCH formats 2 to 4 use polar code channel coding and phase shift keying to obtain the transmitted signal.
  • embodiments of the present application provide an information transmission method, device, base station, equipment, storage medium and program product.
  • the responses of multiple correctly received UEs can be made
  • the signal is compressed to minimize the number of input bits for channel coding, and then channel coded and modulated before being sent. out; each UE decodes and decompresses the received response signal, and extracts the corresponding response signal, thereby achieving the purpose of saving spectrum resources and improving data transmission efficiency.
  • FIG 2 is a flow chart of an information transmission method provided by an embodiment of the present application.
  • the information transmission method provided by the embodiment of the present application can be used for any network element with data receiving and signaling sending functions such as base stations, relays, terminals, etc., including but not limited to step S1000, step S2000, step S3000 and Step S4000.
  • Step S1000 Receive a transport block sent by at least one second node, and the transport blocks form a transport block set.
  • the first node (First Node) receives a signal containing a transport block sent by the second node.
  • a first node when a first node receives signals containing transport blocks sent by multiple second nodes, these second nodes form a sequence of second nodes (A Sequence of Second Nodes), and the transport blocks sent by the multiple second nodes A collection of transport blocks is formed.
  • the second node sequence includes Nu second nodes, and the transport block set includes Nb transport blocks; where Nu and Nb are positive integers, and Nu is less than or equal to Nb.
  • a second node may send one or more transport blocks to the first node, and the one or more transport blocks form a transport block set.
  • two or more second nodes may send one or more transport blocks to the first node, and these transport blocks form a transport block set.
  • the transport block identifier may be one of the following: user identifier (User Equipment Identifier), an index value of the user identifier, or a label index (signature index).
  • 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.
  • the user identifier can be used for the first node.
  • the user identifier is an integer.
  • the user identification can be a Subscription Permanent Identifier (SUPI), a Generic Public Subscription Identifier (GPSI), a Permanent Equipment Identifier (PEI), or a network access identifier.
  • Identifier Network Access Identifier, NAI
  • Subscription Concealed Identifier SUCI
  • GTI Globally Unique Temporary Identity
  • RNTI System Information RNTI
  • SI-RNTI System Information RNTI
  • Paging RNTI Paging RNTI
  • P-RNTI random access RNTI
  • Random Access RNTI Random Access RNTI
  • RA-RNTI random access RNTI
  • temporary cell RNTI Temporary Cell RNTI, TC-RNTI
  • cell RNTI Cell RNTI, C-RNTI
  • uplink control channel transmit power control RNTI Transmit Power Control-PUCCH RNTI, TPC-PUCCH-RNTI
  • the transport block identifier is a user identifier
  • the elements of the ordered set of transport block identifiers are user identifiers.
  • the transmission block identifier is the index value of the user identifier
  • the user identifier is an element in an ordered set of user identifiers.
  • the index value of the user ID corresponding to the identification ID(i) is the i-th element I(i) in the ordered set of transmission block identification elements.
  • the transmission block identifier is a label index
  • the label index is a label index of a random access label (signature). That is, one transmission block in the transmission block set includes a random access label, and the random access label is a random access label.
  • the ordered set of random access tags includes Na random access tags r(1), r(2),...,r(Na); where Na is the number of random access tags.
  • the tag index of the i-th random access tag r(i) in the ordered set of random access tags is The transport block identifies the i-th element I(i) of the ordered set, where the transport block identifies the i-th element I(i) of the ordered set, which may be an integer i or an integer i-1.
  • random access tags can be Pilot, Reference Signal, Preamble, Spread Spectrum Sequence, Interleaver, and Interleaver Pattern. ), interleaver sequence (Interleaver Sequence), scrambling sequence (Scrambling Sequence), sparse code sequence (Sparse Code Sequence), etc.
  • the second node determines a random access label of a transmission block according to its user identity as a random access label included in a transmission block in the transmission block set, and these random access labels can be used by the first node in the transmission block set.
  • Different transport blocks in the transport block set are distinguished in the signal of the transport block set.
  • the second node determines a random access label included in a transmission block according to higher layer parameters as a random access label included in a transmission block in the transmission block set, and these random access labels can be used for
  • the first node distinguishes different transport blocks in the set of transport blocks in a signal containing the set of transport blocks.
  • first node and the second node may be base stations, relays, terminals, or any other device capable of data reception and signaling.
  • the network element that orders the sending function may be base stations, relays, terminals, or any other device capable of data reception and signaling.
  • Step S2000 Obtain the information of the correct transport block set according to the transport 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 identifications, the size of the ordered set of transmission block identifications Na, the correct transmission block identification set, the number of correct transmission blocks P, and the intermediate code word.
  • Transport block error pattern a. Ordered set Q of offset values. It should be noted that the feedback information can be obtained based on the information on one or more of the above correct transmission blocks, that is, the generation of the feedback information does not necessarily require all the above information.
  • the maximum number of correct transmission blocks Pmax is equal to the size of the ordered set of transmission block identifiers Na; in other embodiments, the maximum number of correct transmission blocks Pmax is configured by the first node; in still other embodiments, the maximum number of correct transmission blocks Pmax is The number of transport blocks Pmax is pre-configured by high-level parameters.
  • the number of elements of the offset value ordered set Q is determined according to the maximum number of correct transmission blocks Pmax.
  • the value of the element in the offset value ordered set Q is determined according to the transmission block identification ordered set size Na and the index of the element in the offset value ordered set Q in the offset value ordered set Q.
  • the information of the correct transmission block set is a correct transmission block identification set
  • the correct transmission block identification set is a set of user identifications included in correctly received transmission blocks in the transmission block set.
  • a correctly received transport block refers to a transport block whose response status is Correct Response ACK.
  • a user identification belongs to the correct transmission block identification set. It is used to indicate that the response status of the transmission block corresponding to this user identification is Correct Response ACK.
  • a user identification does not belong to the correct transmission block identification set.
  • the transport block identifier set is used to indicate that the response status of the transport block corresponding to the user identifier is an error response NACK.
  • the information of the correct transmission block set is a correct transmission block identification set
  • the correct transmission block identification set is a set of index values of user identifications.
  • a correctly received transport block refers to a transport block whose response status is correct response ACK.
  • the index value of a user ID belongs to the correct transport block ID set and is used to indicate the transmission block corresponding to the index value of the user ID.
  • the response status is correct response ACK.
  • the index value of a user ID does not belong to the correct transmission block identification set. It is used to indicate that the response status of the transport block corresponding to the index value of the user ID is incorrect response NACK.
  • the information of the correct transmission block set is a set of correct transmission block identifiers
  • the correct transmission block identification set is a set of tag indexes of random access tags corresponding to correctly received transmission blocks in the transmission block set.
  • a correctly received transport block refers to a transport block whose response status is Correct Response ACK.
  • the label index of a random access tag belongs to the correct transmission block identification set and is used to indicate that the response status of the transmission block corresponding to this random access label is Correct Response ACK.
  • the tag index of a random access tag does not belong to the correct transport block identification set is used to indicate that the response status of the transport block corresponding to the random access tag is an error response NACK.
  • Step S3000 Encoding the information of the correct transport block set to obtain feedback information; wherein the feedback information is used to characterize the reception of the transport block sent by at least one second node; the encoding process includes compressing the information of the correct transport block set coding.
  • the offset value elements in the offset value ordered set are binary represented to obtain an offset value bit sequence with the same length as the feedback information, and the offset value is mapped to the correct transport block identification set.
  • the value bit sequence and the mapped correct transmission block identification set are subjected to binary addition calculation to obtain feedback information.
  • the correct transmission block identifier set is compressed and encoded to obtain an intermediate codeword, and then the intermediate codeword and the offset value bit sequence are added to obtain feedback information.
  • the transport block error pattern is obtained based on the information of the correct transport block set, the transport block error pattern is then mapped to the feedback information bit sequence, and the feedback information bit sequence is determined as the feedback information.
  • the transport block error pattern is compressed and encoded to obtain an intermediate codeword, and then the intermediate codeword and the offset value bit sequence are added to obtain feedback information.
  • Step S4000 Send feedback information to at least one second node.
  • the first node sends feedback information to one or more second node sequences, and the feedback information can characterize the reception of the transport block sent by at least one second node at the first node.
  • the information transmission method provided by the above embodiments can minimize the number of input bits for channel coding, thereby achieving the purpose of saving spectrum resources and improving data transmission efficiency.
  • the energy overhead is reduced, and a second node in the second node sequence will not receive the signal containing the feedback information f (i.e., the zero-power signal). Success, therefore a second node in the second node sequence can determine that the feedback information is an error response NACK.
  • the length Nf of the feedback information f is determined according to the maximum number of correct transport blocks Pmax and the transport block identification ordered set size Na.
  • the length Nf of the feedback information f is greater than or equal to
  • the length Nf of the feedback information f is greater than or equal to
  • the length Nf of the feedback information f is greater than or equal to
  • the length Nf of the feedback information f is greater than or equal to
  • a specific embodiment is provided for encoding the information of the correct transmission block set and obtaining feedback information.
  • Figure 3 is a schematic flowchart of determining feedback information from a correct transmission block identification set provided by an embodiment of the present application.
  • the first node performs compression encoding processing on the information of the correct transmission block set refers to A coding process in which a set of correct transport block identifiers containing at most Pmax elements is mapped to a bit sequence of length Nf.
  • Figure 4 is a schematic flowchart of determining feedback information from a correct transmission block identification set provided by another embodiment of the present application.
  • compressing and encoding the correct transmission block identification set by the first node means A coding process in which a set of correct transport block identifiers containing at most Pmax elements and at least 1 element is mapped to a bit sequence of length Nf.
  • the transport block error pattern a is determined according to at least one of the following: a transport block identification ordered set, a transport block identification ordered set size Na, a correct transmission block identification set, and a correct transmission block number P.
  • Figure 5 is a flow chart of a method for determining a transport block error pattern provided by an embodiment of the present application. As shown in Figure 5, the transport block error pattern a is determined through the following steps S3510, S3521 and S3522.
  • Step S3510 Determine whether the elements in each transport block identifier ordered set belong to the correct transport block identifier set.
  • bit “ack” is used to indicate that the response status of the transport block is correct response ACK
  • bit “nack” is used to indicate that the response status of the transport block is error response NACK
  • ack it means that the transmission
  • the response status of the transport block corresponding to the i-th element in the ordered set of the block identifier is correct response ACK.
  • nack it means that the response of the transport block corresponding to the i-th element in the ordered set of the transport block identifier is The status is correct response NACK.
  • bit “ack” is bit “1” and bit “nack” is bit “0”.
  • bit “ack” is bit “0” and bit “nack” is bit “1”.
  • Step S3610 According to the preset length of the transport block error pattern, obtain an initial pattern of the transport block error pattern corresponding to the preset length, where each element in the initial pattern of the transport block error pattern corresponds to an error response bit.
  • the transport block error pattern is set to a length Na and each element is a sequence of bits "nack", where Na is the transport block identification ordered set size.
  • Step S3620 According to the correct transport block set, in the initial pattern of the transport block error pattern, set the bit whose sequence number is equal to the element in the correct transport block set as the correct response bit.
  • Step S3630 Determine the initial pattern of the transport block error pattern as the transport block error pattern.
  • the block will be transmitted
  • the updated initial pattern of the transport block error pattern is the transport block error pattern, where P is the number of correct transport blocks.
  • bit “ack” is bit “1” and bit “nack” is bit “0”.
  • bit “ack” is bit “0” and bit “nack” is bit “1”.
  • a specific embodiment is provided for encoding the information of the correct transport block set and obtaining feedback information.
  • Figure 7 is a schematic flowchart of determining feedback information from a transport block error pattern provided by an embodiment of the present application.
  • the first node compresses and codes the transport block error pattern a by means of compressing and encoding the transport block error pattern a.
  • a transport block error pattern a of length Na containing at most Pmax bits "ack" is mapped to a bit sequence of length Nf.
  • P is the number of correct transmission blocks
  • Na is the size of the ordered set of transmission block identifiers
  • a is the transport block error pattern
  • f(j) is the j-th bit of the feedback information f.
  • the bit sequence [q(i,1),q(i,2),...,q(i,Nf)] is the offset value ordered set Q
  • the binary representation of Nf bits of the i-th element Q(i), that is, the bit sequence [q(i,1),q(i,2),...,q(i,Nf)] is the offset value element
  • Figure 8 is a schematic flowchart of determining feedback information from a transport block error pattern provided by another embodiment of the present application.
  • the first node compresses and codes the transport block error pattern a by means of compressing and encoding the transport block error pattern a.
  • a transport block error pattern a of length Na containing at most Pmax bits "ack” and at least 1 bit "ack” is mapped to a bit sequence of length Nf.
  • bit sequence [q(i,1),q(i,2) ,...,q(i,Nf)] is the binary representation of Nf bits of the i-th element Q(i) of the offset value ordered set Q, that is, the bit sequence [q(i,1),q( i,2),...,q(i,Nf)] is the offset value bit sequence corresponding to the offset value element Q(i), where q(i,1) is the most reliable bit, q(i, Nf) is the lowest reliable bit.
  • the intermediate codeword c is determined by the first node according to at least any one of the following parameters or any combination thereof: an ordered set of transport block identifiers, an ordered set size of transport block identifiers Na, a correct transport block identifier set, a correct The number of transmission blocks P, the transmission block error pattern a, and the maximum number of correct transmission blocks Pmax.
  • the length Nc of the intermediate codeword c is greater than or equal to
  • the length Nc of the intermediate codeword c is greater than or equal to the length of the feedback information f.
  • the intermediate codeword is obtained by compressing and encoding the correct transmission block identification set, specifically by A set of correct transport block identifiers containing P elements is mapped to a set of length Arithmetic coding implementation of a sequence of bits.
  • Figure 9 is a schematic flowchart of determining an intermediate codeword from a correct transmission block identification set provided by an embodiment of the present application.
  • P is the number of correct transmission blocks
  • Na is an ordered set of transmission block identifications.
  • Size, I(1),I(2),...,I(Na) is the Na element included in the ordered set of transmission block identifiers
  • BI is the correct transmission block identifier set
  • c(j) is the intermediate codeword c
  • the jth bit of is the length of the intermediate codeword c.
  • Figure 10 is a schematic flow chart of determining intermediate codewords from a correct transmission block identification set provided by another embodiment of the present application.
  • P is the number of correct transmission blocks
  • Na is the number of transmission block identifications.
  • the size of the ordered set, I(1),I(2),...,I(Na) is the Na elements included in the ordered set of transmission block identifiers, BI is the correct transmission block identification set, and c(j) is the intermediate code
  • the first Nf-Ni bits of the intermediate codeword c are bits "0".
  • the intermediate codeword is obtained by compression encoding the transport block error pattern. Specifically through pointing A bit sequence of length Na containing P bits "ack" is mapped to a length of Arithmetic coding implementation of a sequence of bits. Next, specific embodiments for calculating intermediate codewords are provided.
  • Figure 11 is a schematic flow chart of determining intermediate codewords from transport block error patterns according to an embodiment of the present application.
  • P is the number of correct transport blocks
  • Na is the size of the ordered set of transport block identifiers
  • a(i) is the i-th bit of the transport block error pattern a
  • c(j) is the i-th bit of the intermediate codeword c.
  • j bits is the length of the intermediate code word c.
  • Figure 12 is a schematic flow chart of determining intermediate codewords from transport block error patterns provided by another embodiment of the present application.
  • P is the number of correct transport blocks
  • Na is the size of the ordered set of transport block identifiers
  • a(i) is the i-th bit of the transport block error pattern a
  • c(j) is the j-th bit of the intermediate codeword c
  • Nf is the length of the feedback information f, where the intermediate codeword c includes an all-zero sequence of length Nf-Ni.
  • the first Nf-Ni bits of the intermediate codeword c are bits "0".
  • feedback information is determined based on the intermediate codeword. Specific examples of determining feedback information based on intermediate codewords are provided below.
  • Figure 13 is a program flow chart for determining feedback information based on intermediate codewords provided by an embodiment of the present application, as shown in the figure, where P is the number of correct transmission blocks, and the bit sequence [q(P,1),q(P,2 ),...,q(P,Nf)] is the binary representation of Nf bits of the P-th element Q(P) of the offset value ordered set Q, that is, the bit sequence [q(P,1),q (P,2),...,q(P,Nf)] is the offset value bit sequence corresponding to the offset value element Q(P), Nf is the length of the feedback information f, and Nc is the length of the intermediate codeword c , q(P,1) is the most reliable bit, and q(P,Nf) is the least reliable bit.
  • channel coding is performed on the feedback information to obtain a first coding sequence.
  • the channel coding can 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 (concatenated code), cyclic code (cyclic code), block coding (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 Codes, Pre-transformed Polar Codes, Parity-Check Polar Codes.
  • the first node is a base station
  • the second node is a terminal.
  • This example includes multiple terminals, these terminals form a terminal sequence, and the transmission block identifier is a user identifier.
  • Figure 14 is a schematic diagram of the relationship between the second node, the transport block and the user identification provided by the example of this application.
  • the signal containing the transport block set B includes a signal containing the transport block b(1), a signal containing the transport block b(2), a signal containing the transport block b(3) and a signal containing the transport block b(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, and the transport block in the transport block set B b(t) includes the user identification of terminal SN(t), and the user identification of terminal SN(t) is Random Access RNTI (RA-RNTI).
  • the user IDs of terminals SN(1), SN(2), SN(3), and SN(4) are 4, 3, 2, and 5 respectively. Among them, user IDs 4, 3, 2, and 5 are transmission block IDs in order.
  • the correct transmission block identification set refers to the set of user identifications included in the correctly received transmission blocks in the transmission block set.
  • bit "ack” indicating a correct response ACK is a bit "1”
  • bit "nack” indicating an incorrect response NACK is a bit "0”.
  • Figure 15 is the number of correct transmission blocks P, the correct transmission block set BI, the transmission block error pattern a, the intermediate codeword c, and the offset value bit sequence [q(P,1), q(P,2) provided by the example of this application. ,q(P,3),q(P,4),q(P,5),q(P,6),q(P,7)] and the mapping relationship between feedback information f, as shown in Figure 15 Mapping relationship (only the mapping relationship involved in this example is shown in the figure), the base station determines the feedback information f according to the following method:
  • the terminal sequence ⁇ SN(1), SN(2), SN(3), SN(4)> receives a signal containing feedback information f.
  • the terminals SN(1), SN(2), SN(3), and SN(4) respectively decode the signal containing the feedback information f, and determine the transmission blocks b(1), b(2), b( 3), response to b(4):
  • the terminal SN(1) determines that the response of the transport block b(1) is an error response NACK; if the terminal SN(1) decodes successfully, the correct transport block identification set BI is obtained, and the terminal SN(1) ) determines that the user identification 4 of the terminal SN(1) does not belong to the correct transmission block identification set BI, and the terminal SN(1) determines that the response of the transmission block b(1) is an error response NACK.
  • the terminal SN (2) determines that the response of the transport block b (2) is an error response NACK; if the terminal SN (2) decodes successfully, the correct transport block identification set BI is obtained, and the terminal SN (2) ) determines that the user identification 3 of the terminal SN(2) belongs to the correct transmission block identification set BI, and the terminal SN(2) determines that the response of the transmission block b(2) is the correct response ACK.
  • the terminal SN (3) determines that the response of the transport block b (3) is an error response NACK; if the terminal SN (3) decodes successfully, the correct transport block identification set BI is obtained, and the terminal SN (3) ) determines that the user identification 2 of the terminal SN(3) belongs to the correct transmission block identification set BI, and the terminal SN(3) determines that the response of the transmission block b(3) is the correct response ACK.
  • the terminal SN (4) determines that the response of the transport block b (4) is an error response NACK; if the terminal SN (4) decodes successfully, the correct transport block identification set BI is obtained, and the terminal SN (4) ) determines that the user identification 5 of the terminal SN (4) does not belong to the correct transmission block identification set BI, and the terminal SN (4) determines that the response of the transmission block b (4) is an error response NACK.
  • the intermediate code word c is the length bit sequence.
  • FIG. 16 is the number of correct transmission blocks P, the correct transmission block set BI, the transmission block error pattern a, the intermediate codeword c, and the offset value bit sequence [q(P,1), q(P,2) provided by the example of this application. , q(P,3),q(P,4),q(P,5),q(P,6),q(P,7)] and the mapping relationship between feedback information f, as shown in Figure 16 Mapping relationship (only the mapping relationship involved in this example is shown in the figure), the base station determines the feedback information f according to the following method:
  • the intermediate code word c does not include the length of The all-zero sequence reduces storage overhead, saves storable resources, and improves information transmission efficiency.
  • the first node is the relay.
  • the user identity of terminal SN(t) is cell RNTI (Cell RNTI, C-RNTI).
  • the relay determines the feedback information f as follows:
  • Figure 17 is the number of correct transmission blocks P, the correct transmission block set BI, the transmission block error pattern a, the intermediate codeword c, and the offset value bit sequence [q(P,1), q(P,2) provided by the example of this application. ,q(P,3),q(P,4),q(P,5),q(P,6),q(P,7)] and the mapping relationship between feedback information f, as shown in Figure 17 Mapping relationship (only the mapping relationship involved in this example is shown in the figure), the base station determines the feedback information f according to the following method:
  • Example 1 Another difference between this example and Example 1 is that in this example, if the number of correct transmission blocks P is 0, the length Nf of the feedback information f is 0, the feedback information f is an empty sequence, and the signal containing the feedback information f has zero power. Signal.
  • the feedback information f is a zero-power signal, reducing energy consumption.
  • the first node cannot know in advance whether there is a user sending information in the current time slot. Therefore, the first node needs to perform signal reception, signal decoding and response feedback processing in each time slot. , therefore when the first node does not receive any transmission block correctly, the first node feeds back a zero-power signal, that is, no response feedback processing is performed, which can save the power consumption of the first node.
  • CS-RNTI Configured Scheduling RNTI
  • the base station determines the feedback information f according to the following method:
  • the feedback information f is a zero-power signal, reducing energy consumption.
  • this example directly uses the correct transmission block identification set to determine the intermediate codeword c, which reduces the storage space.
  • the first node is the base station and the second node is the terminal. Since there are multiple terminals, a terminal sequence is formed, and the transmission block identifier is the user identifier.
  • Figure 18 is a schematic diagram of the relationship between the second node, transport block, user identification, random access label and label index provided in the example of this application.
  • the signal containing the transport block set B includes a signal containing the transport block b(1), a signal containing the transport block b(2), a signal containing the transport block b(3) and a signal containing the transport block b(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, where
  • the transmission block b(t) includes the user identification and random access tag of the terminal SN(t).
  • the user identity of terminal SN(t) is the permanent equipment identifier (Permanent Equipment Identifier, PEI), and the random access label is the reference signal (Reference Signal).
  • the user IDs of terminals SN(1), SN(2), SN(3), and SN(4) are 4, 3, 2, and 5 respectively. Among them, user IDs 4, 3, 2, and 5 are transmission block IDs in order.
  • the reference signal is an element of an ordered set of random access tags.
  • the ordered set of random access tags includes 6 reference signals r(1), r(2), r(3), r(4), r(5), r(6), where the reference signal r(1) ,The label indexes of 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 transmission blocks b(1), b(2), b(3), and b(4) are determined by the terminals SN(1), SN(2), SN(3), and SN(4) respectively.
  • the user IDs 4, 3, 2, and 5 of terminals SN(1), SN(2), SN(3), and SN(4) are determined as follows:
  • the tag index of the reference signal included in the transport block b(t) the remainder of the square of the user identification of the terminal SN(t) divided by 6.
  • terminals SN(1), SN(2), SN(3), and SN(4) Substituting the user IDs 4, 3, 2, and 5 of terminals SN(1), SN(2), SN(3), and SN(4) into the above equation respectively, we get terminals SN(1), SN(2), SN( 3), the tag indexes of the reference signals of SN(4) are 4, 3, 4, and 1 respectively.
  • the final reference signals of the terminals SN(1), SN(2), SN(3), and SN(4) are respectively r(5),r(4),r(5),r(2).
  • the correct transmission block identification set refers to the set of user identifications included in the correctly received transmission blocks in the transmission block set.
  • the intermediate codeword c is length bit sequence.
  • bit “ack” is a bit “1” and the bit “nack” is a bit "0".
  • Figure 19 The number of correct transmission blocks P, the correct transmission block set BI, the transmission block error pattern a, the intermediate codeword c, and the offset value bit sequence [q(P,1), q(P,2), provided by the example of this application, The mapping relationship between q(P,3),q(P,4),q(P,5),q(P,6),q(P,7)] and the feedback information f, as shown in Figure 19 relationship (only the mapping relationship involved in this example is shown in the figure), the base station determines the feedback information f according to the following method:
  • the terminal sequence ⁇ SN(1), SN(2), SN(3), SN(4)> receives a signal containing feedback information f.
  • the terminals SN(1), SN(2), SN(3), and SN(4) respectively decode the signal containing the feedback information f, and determine the transmission blocks b(1), b(2), b( 3), response to b(4):
  • the terminal SN(1) determines that the response of the transport block b(1) is an error response NACK; if the terminal SN(1) decodes successfully, the correct transport block identification set BI is obtained, and the terminal SN(1) ) determines that the user identification 4 of the terminal SN(1) does not belong to the correct transmission block identification set BI, and the terminal SN(1) determines that the response of the transmission block b(1) is an error response NACK.
  • the terminal SN (2) determines that the response of the transport block b (2) is an error response NACK; if the terminal SN (2) decodes successfully, the correct transport block identification set BI is obtained, and the terminal SN (2) ) determines that the user identification 3 of the terminal SN(2) belongs to the correct transmission block identification set BI, and the terminal SN(2) determines that the response of the transmission block b(2) is the correct response ACK.
  • the terminal SN (3) determines that the response of the transport block b (3) is an error response NACK; if the terminal SN (3) decodes successfully, the correct transport block identification set BI is obtained, and the terminal SN (3) ) determines that the user identification 2 of the terminal SN(3) belongs to the correct transmission block identification set BI, and the terminal SN(3) determines that the response of the transmission block b(3) is the correct response ACK.
  • the terminal SN (4) determines that the response of the transport block b (4) is an error response NACK; if the terminal SN (4) decodes successfully, the correct transport block identification set BI is obtained, and the terminal SN (4) ) determines that the user identification 5 of the terminal SN (4) does not belong to the correct transmission block identification set BI, and the terminal SN (4) determines that the response of the transmission block b (4) is an error response NACK.
  • the intermediate code word c does not include the length of The all-zero sequence further reduces the storage space.
  • the first node is the base station and the second node is the terminal. Because there are multiple terminals, a terminal sequence is formed, and the transmission block identifier is a label index.
  • Figure 20 is a schematic diagram of the relationship between the second node, transport block, user identification, random access label and label index provided in the example of this application.
  • the signal containing the transport block set B includes a signal containing the transport block b(1), a signal containing the transport block b(2), a signal containing the transport block b(3) and a signal containing the transport block b(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, where
  • the transmission block b(t) includes the user identification and random access tag of the terminal SN(t).
  • the user identification of the terminal SN(t) is the Generic Public Subscription Identifier (GPSI), and the random access label is the preamble (Preamble).
  • the user IDs of terminals SN(1), SN(2), SN(3), and SN(4) are 4, 3, 2, and 5 respectively.
  • the preamble is an element of an ordered set of random access tags.
  • the label indexes of codes r(1), r(2), r(3), r(4), r(5), and r(6) are 1, 2, 3, 4, 5, and 6 respectively.
  • the random access tags included in the transmission blocks b(1), b(2), b(3), and b(4) are determined by the terminals SN(1), SN(2), SN(3), and SN(4) respectively.
  • the user IDs 4, 3, 2, and 5 of terminals SN(1), SN(2), SN(3), and SN(4) are preambles determined in the following manner:
  • Terminals SN(1), SN(2), SN(3), and SN(4) respectively assign the user IDs 4, 3, and 2 of terminals SN(1), SN(2), SN(3), and SN(4).
  • ,5 As part of the random number seed of the Pseudo-Random Sequence Generator, the label indexes of the preambles of the terminals SN(1), SN(2), SN(3), and SN(4) are obtained respectively.
  • 4,3,2,1 the preambles included in the transmission blocks b(1), b(2), b(3), and b(4) are obtained as r(4), r(3), r(2) respectively. ,r(1).
  • the correct transmission block identification set refers to the set of tag indexes of random access tags included in correctly received transmission blocks in the transmission block set.
  • the bit “ack” is a bit “1” and the bit “nack” is a bit "0".
  • the base station determines the feedback as follows Information f:
  • the terminal sequence ⁇ SN(1), SN(2), SN(3), SN(4)> receives a signal containing feedback information f.
  • the terminals SN(1), SN(2), SN(3), and SN(4) respectively decode the signal containing the feedback information f, and determine the transmission blocks b(1), b(2), b( 3), response to b(4):
  • the terminal SN(1) determines that the response of the transport block b(1) is an error response NACK; if the terminal SN(1) decodes successfully, the correct transport block identification set BI is obtained, and the terminal SN(1) ) determines that the tag index 4 of the random access tag included in the transmission block b(1) does not belong to the correct transmission block identification set BI, and the terminal SN(1) determines that the response to the transmission block b(1) is an error response NACK.
  • the terminal SN (2) determines that the response of the transport block b (2) is an error response NACK; if the terminal SN (2) decodes successfully, the correct transport block identification set BI is obtained, and the terminal SN (2) ) determines that the tag index 3 of the random access tag included in the transmission block b(2) belongs to the correct transmission block identification set BI, and the terminal SN(2) determines that the response to the transmission block b(2) is a correct response ACK.
  • the terminal SN (3) determines that the response of the transport block b (3) is an error response NACK; if the terminal SN (3) decodes successfully, the correct transport block identification set BI is obtained, and the terminal SN (3) ) determines that the tag index 2 of the random access tag included in the transmission block b(3) belongs to the correct transmission block identification set BI, and the terminal SN(3) determines that the response to the transmission block b(3) is a correct response ACK.
  • the terminal SN (4) determines that the response of the transport block b (4) is an error response NACK; if the terminal SN (4) decodes successfully, the correct transport block identification set BI is obtained, and the terminal SN (4) ) determines that the tag index 1 of the random access tag included in the transport block b(4) does not belong to the correct transport block identification set BI, and the terminal SN(4) determines that the response to the transport block b(4) is an error response NACK.
  • the number of user identifiers is generally much larger than the number of random access tags.
  • using the tag index as the transmission fast identifier can reduce the length of the feedback information f and further reduce the use of feedback resources.
  • a pseudo-random number generator is used to generate random access tags, which can avoid tag collisions.
  • the first node is the base station and the second node is the terminal. Since there are multiple terminals, the terminal sequence transmission block identifier is a tag index.
  • Figure 22 is a schematic diagram of the relationship between the second node, the transmission block, the random access label and the label index provided in the example of this application.
  • the signal containing the transport block set B includes a signal containing the transport block b(1), a signal containing the transport block b(2), a signal containing the transport block b(3) and a signal containing the transport block b(4).
  • the transmission blocks b(1), b(2), b(3), and b(4) in the transmission block set B are respectively configured by the terminals SN(1), SN(2), and SN in the terminal sequence.
  • SN(1) sends to the base station
  • the transmission blocks b(1), b(2), b(3), b(4) in the transmission block set B include random access labels; where, random access Labeled Interleaver.
  • the interleaver is an element of an ordered set of random access tags.
  • the random access tags included in the transmission blocks b(1), b(2), b(3), and b(4) are generated by terminals SN(1), SN(2), SN(3), SN (1) According to the higher layer parameters (higher layer parameters), they are determined as r(4), r(3), r(2), r(1), among which, the transmission blocks b(1), b(2), b( 3),
  • the tag indexes of the random access tags included in b(4) are 4, 3, 2, and 1 respectively.
  • the correct transmission block identification set refers to the set of tag indexes of random access tags included in correctly received transmission blocks in the transmission block set.
  • the bit “ack” is a bit “1” and the bit “nack” is a bit "0".
  • the base station determines the feedback information f according to the following method:
  • the terminal sequence ⁇ SN(1), SN(2), SN(3), SN(1)> receives a signal containing feedback information f.
  • the terminals SN(1), SN(2), SN(3), and SN(1) respectively decode the signal containing the feedback information f, and determine the transmission blocks b(1), b(2), b( 3), response to b(4):
  • the terminal SN (1) determines that the responses of the transport blocks b (1) and b (4) are error responses NACK; if the terminal SN (1) decodes successfully, the correct transport block identification set BI is obtained , the terminal SN(1) determines that the tag index 4 of the random access tag included in the transmission block b(1) does not belong to the correct transmission block identification set BI, and the terminal SN(1) determines that the response of the transmission block b(1) is an error response NACK ; The terminal SN (1) determines that the tag index 1 of the random access tag included in the transmission block b (4) does not belong to the correct transmission block identification set BI, and the terminal SN (1) determines that the response to the transmission block b (4) is an error response NACK .
  • the terminal SN (2) determines that the response of the transport block b (2) is an error response NACK; if the terminal SN (2) decodes successfully, the correct transport block identification set BI is obtained, and the terminal SN (2) ) determines that the tag index 3 of the random access tag included in the transmission block b(2) belongs to the correct transmission block identification set BI, and the terminal SN(2) determines that the response to the transmission block b(2) is a correct response ACK.
  • the terminal SN (3) determines that the response of the transport block b (3) is an error response NACK; if the terminal SN (3) decodes successfully, the correct transport block identification set BI is obtained, and the terminal SN (3) ) determines that the tag index 2 of the random access tag included in the transmission block b(3) belongs to the correct transmission block identification set BI, and the terminal SN(3) determines that the response to the transmission block b(3) is a correct response ACK.
  • the terminal SN(1) sends two transmission blocks b(1) and b(4), but selects different random access tags; the base station determines the randomness of the correctly decoded transmission block.
  • the tag index of the access tag is used to determine the feedback information f, so that the terminal SN(1) can distinguish whether the two transmission blocks b(1) and b(4) are received correctly.
  • the length of the feedback information f can also be reduced.
  • the random access label is a spread spectrum sequence (Spread Spectrum Sequence).
  • Figure 25 is a schematic flow chart of determining feedback information from the correct transmission block identification set provided in the example of this application.
  • the length Nf of the feedback information f is further shortened.
  • Example 8 The difference between this example and Example 8 is that in this example, the random access label is a sparse code sequence (Sparse Code Sequence).
  • the random access label is a scrambling sequence (Scrambling Sequence).
  • a scrambling sequence is an element of an ordered collection of random access tags.
  • the label indexes of r(2), r(3), r(4), and r(5) are 0,1,2,3,4 respectively.
  • the tag indexes of the random access tags included in the transmission blocks b(1), b(2), b(3), and b(4) are 3, 2, 1, and 0 respectively, as shown in Figure 28.
  • the bit “ack” is a bit “1” and the bit “nack” is a bit "0".
  • the base station sends a zero-power signal containing feedback information f to the terminal sequence ⁇ SN(1), SN(2), SN(3), SN(1)>.
  • the terminal sequence ⁇ SN(1), SN(2), SN(3), SN(1)> receives a zero-power signal containing feedback information f.
  • Terminal SN(1) fails to decode, and determines that the responses to transport blocks b(1) and b(4) are error responses NACK;
  • terminal SN(2) fails to decode, and determines that the responses to transport block b(2) are error responses NACK;
  • the terminal The decoding of SN(3) fails, and it is determined that the response of transport block b(3) is an error response NACK.
  • the correct transmission block identification set is an empty set, and the base station sends a zero-power signal containing feedback information f, that is, no signal is sent, which reduces the power consumption of the base station.
  • the transmission block identifier is the index value of the user identifier.
  • Figure 29 is a schematic diagram of the relationship between the second node, the transport block, the user identification and the index value of the user identification provided by the example of this application.
  • the signal containing the transport block set B includes a signal containing the transport block b(1), a signal containing the transport block b(2), a signal containing the transport block b(3) and a signal containing the transport block b(4).
  • the transmission block b(t) in the transmission block set B is sent by the terminal SN(t) in the terminal sequence.
  • the transmission block b(t) in the transmission block set B includes the user identification of the terminal SN(t), and the user identification of the terminal SN(t) is Random Access RNTI (RA-RNTI).
  • the user IDs of terminals SN(1), SN(2), SN(3), and SN(4) are 13, 10, 6, and 51 respectively. Among them, user IDs 13, 10, 6, and 51 are ordered sets of user IDs.
  • the index values of the user IDs of user IDs 13,10,6,51 are 4,3,2,5 respectively.
  • the correct transmission block identification set refers to the set of index values of user identifications included in correctly received transmission blocks in the transmission block set.
  • the terminal sequence ⁇ SN(1), SN(2), SN(3), SN(4)> receives a signal containing feedback information f.
  • the terminals SN(1), SN(2), SN(3), and SN(4) respectively decode the signal containing the feedback information f, and determine the transmission blocks b(1), b(2), b( 3), response to b(4):
  • the terminal SN(1) determines that the response of the transport block b(1) is an error response NACK; if the terminal SN(1) decodes successfully, the correct transport block identification set BI is obtained, and the terminal SN(1) ) determines that the index value 4 of the user identification of the terminal SN(1) does not belong to the correct transmission block identification set BI, and the terminal SN(1) determines that the response of the transmission block b(1) is an error response NACK.
  • the terminal SN (2) determines that the response of the transport block b (2) is an error response NACK; if the terminal SN (2) decodes successfully, the correct transport block identification set BI is obtained, and the terminal SN (2) ) determines that the index value 3 of the user identification of the terminal SN(2) belongs to the correct transmission block identification set BI, and the terminal SN(2) determines that the response of the transmission block b(2) is the correct response ACK.
  • the terminal SN (3) determines that the response of the transport block b (3) is an error response NACK; if the terminal SN (3) decodes successfully, the correct transport block identification set BI is obtained, and the terminal SN (3) ) determines that the index value 2 of the user ID of the terminal SN(3) belongs to the correct transmission block identification set BI, and the terminal SN(3) determines that the response of the transmission block b(3) is the correct response ACK.
  • the terminal SN (4) determines that the response of the transport block b (4) is an error response NACK; if the terminal SN (4) decodes successfully, the correct transport block identification set BI is obtained, and the terminal SN (4) ) determines that the index value 5 of the user identification of the terminal SN (4) does not belong to the correct transmission block identification set BI, and the terminal SN (4) determines that the response of the transmission block b (4) is an error response NACK.
  • Figure 30 is an information transmission method provided by an embodiment of the present application, specifically including step S5000 and step S6000.
  • Step S5000 Send the transport block to the first node.
  • Step S6000 Receive feedback information sent by the first node; wherein the feedback information is used to characterize the reception of the transport block.
  • a second node sends a signal containing one or more transport blocks to the first node, and the one or more transport blocks constitute a transport block set at the first node.
  • two or more second nodes may send one or more transport blocks to the first node, and these transport blocks form a transport block set.
  • these second nodes sending the transport block set constitute a second node sequence.
  • the second node sequence includes Nu second nodes, and the transport block set includes Nb transport blocks; where Nu and Nb are positive integers, and Nu is less than or equal to Nb.
  • one transport block in the transport block set includes a transport block identifier
  • the ordered set of transport block identifiers includes Na transport block identifiers I(1), I(2),...,I(Na), Na
  • 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); where, the i-th element of the ordered set of transport block identifiers is The i element I(i) can be an integer i or an integer i-1.
  • a transport block is indicated by a transport block identification.
  • the transport block identifier may be one of the following: a user identifier, an index value of the user identifier, or a tag index.
  • 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.
  • the user identifier can be used for the first node.
  • the transport block identifier is a user identifier
  • the elements of the ordered set of transport block identifiers are user identifiers.
  • the transmission block identifier is the index value of the user identifier
  • the user identifier is an element in an ordered set of user identifiers.
  • the index value of the user ID corresponding to the identification ID(i) is the i-th element I(i) in the ordered set of transmission block identification elements.
  • the transmission block identifier is a label index
  • the label index is a label index of a random access label (signature). That is, one transmission block in the transmission block set includes a random access label, and the random access label is a random access label.
  • the ordered set of random access tags includes Na random access tags r(1), r(2),...,r(Na); where Na is the number of random access tags.
  • the tag index of the i-th random access tag r(i) in the ordered set of random access tags is The transport block identifies the i-th element I(i) of the ordered set, where the transport block identifies the i-th element I(i) of the ordered set, which may be an integer i or an integer i-1.
  • the user identification can be a Subscription Permanent Identifier (SUPI), a Generic Public Subscription Identifier (GPSI), a Permanent Equipment Identifier (PEI), or a network access identifier.
  • Identifier Network Access Identifier, NAI
  • Subscription Concealed Identifier SUCI
  • GTI Globally Unique Temporary Identity
  • RNTI System Information RNTI
  • SI-RNTI System Information RNTI
  • Paging RNTI Paging RNTI
  • P-RNTI random access RNTI
  • Random Access RNTI Random Access RNTI
  • RA-RNTI random access RNTI
  • temporary cell RNTI Temporary Cell RNTI, TC-RNTI
  • cell RNTI Cell RNTI, C-RNTI
  • uplink control channel transmit power control RNTI Transmit Power Control-PUCCH RNTI, TPC-PUCCH-RNTI
  • random access tags can be Pilot, Reference Signal, Preamble, Spread Spectrum Sequence, Interleaver, and Interleaver Pattern. ), interleaver sequence (Interleaver Sequence), scrambling sequence (Scrambling Sequence), sparse code sequence (Sparse Code Sequence), etc.
  • the second node determines a random access label of a transmission block according to its user identity as a random access label included in a transmission block in the transmission block set, and these random access labels can be used by the first node in the transmission block set.
  • Different transport blocks in the transport block set are distinguished in the signal of the transport block set.
  • the second node determines a random access label included in a transmission block according to higher layer parameters as a random access label included in a transmission block in the transmission block set, and these random access labels can be used for
  • the first node distinguishes different transport blocks in the set of transport blocks in a signal containing the set of transport blocks.
  • first node and the second node may be base stations, relays, terminals, or any other network element capable of data reception and signaling transmission.
  • the information of the correct transmission block set includes the maximum number of correct transmission blocks Pmax, the ordered set of transmission block identifications, the size of the ordered set of transmission block identifications Na, the correct transmission block identification set, the number of correct transmission blocks P, and the intermediate code word.
  • Transport block error pattern a. Ordered set Q of offset values. It should be noted that the feedback information can be obtained based on the information on one or more of the above correct transmission blocks, that is, the generation of the feedback information does not necessarily require all the above information.
  • the maximum number of correct transmission blocks Pmax is equal to the size of the ordered set of transmission block identifiers Na; in other embodiments, the maximum number of correct transmission blocks Pmax is configured by the first node; in still other embodiments, the maximum number of correct transmission blocks Pmax is The number of transport blocks Pmax is pre-configured by high-level parameters.
  • the information of the correct transmission block set is a correct transmission block identification set
  • the correct transmission block identification set is a set of user identifications included in correctly received transmission blocks in the transmission block set.
  • a correctly received transport block refers to a transport block whose response status is Correct Response ACK.
  • a user identification belongs to the correct transmission block identification set. It is used to indicate that the response status of the transmission block corresponding to this user identification is Correct Response ACK.
  • a user identification does not belong to the correct transmission block identification set.
  • the transport block identifier set is used to indicate that the response status of the transport block corresponding to the user identifier is an error response NACK.
  • the information of the correct transmission block set is a correct transmission block identification set
  • the correct transmission block identification set is a set of index values of user identifications.
  • a correctly received transport block refers to a transport block whose response status is correct response ACK.
  • the index value of a user ID belongs to the correct transmission block ID set and is used to indicate that the response status of the transport block corresponding to the index value of the user ID is correct response ACK.
  • the index value of a user ID does not belong to the set of correct transport block IDs to indicate that the response status of the transport block corresponding to the index value of the user ID is an error response NACK.
  • the information of the correct transmission block set is a set of correct transmission block identifiers
  • the correct transmission block identification set is a set of tag indexes of random access tags corresponding to correctly received transmission blocks in the transmission block set.
  • a correctly received transport block refers to a transport block whose response status is Correct Response ACK.
  • the label index of a random access tag belongs to the correct transmission block identification set and is used to indicate that the response status of the transmission block corresponding to this random access label is Correct Response ACK.
  • the tag index of a random access tag does not belong to the correct transmission block identification set and is used to indicate the response status of the transmission block corresponding to the random access tag.
  • the status is error response NACK.
  • Figure 31 is a flow chart of a decoding result judgment method provided by an embodiment of the present application, specifically including step S7100, step S7200, step S7300, step S7310, and step S7320.
  • Step S7100 Decode the feedback signal corresponding to the feedback information to obtain the decoding result.
  • Step S7200 Based on the decoding result, determine whether the decoding is successful.
  • Step S7300 If the decoding is successful and a correct set of transport block identifiers is obtained, determine whether the decoding result contains the transport block identifier of the transport block sent by the second node.
  • Step S7310 If the decoding result does not include the transport block identifier of the transport block sent by the second node, determine that the response to the transport block sent by the second node is an error response NACK.
  • Step S7320 If the decoding result contains the transport block identifier of the transport block sent by the second node, determine that the response to the transport block sent by the second node is the correct response ACK.
  • Figure 32 is a schematic structural diagram of an information transmission device provided by an embodiment of the present application.
  • the information transmission device 200 provided by the embodiment of the present application is applied to the base station and can execute the information transmission method provided by the embodiment of the present application.
  • the terminal has corresponding functional modules and technical effects for executing the method.
  • the device can be implemented by software, hardware, or a combination of software and hardware, and includes: 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;
  • the correct transmission block information obtaining module 202 is configured to obtain the information of the correct transmission block set according to the transmission block set.
  • the feedback information generation module 203 is configured to obtain feedback information by encoding the information of the correct transmission block set; wherein the feedback information is used to characterize the reception of the transmission block sent by at least one second node; the encoding process includes correct transmission Block set information is compressed and encoded.
  • the sending module 204 is configured to send feedback information to the second node sequence.
  • Figure 33 is a schematic structural diagram of an information transmission device provided by an embodiment of the present application.
  • the information transmission device 300 provided by the embodiment of the present application is applied to user equipment and can execute the information transmission method provided by the embodiment of the present application.
  • the terminal has corresponding functional modules and technical effects for executing the method.
  • the device can be implemented through software, hardware, or a combination of software and hardware, including:
  • the sending module 301 is configured to send a transport block to the first node; wherein the transport blocks form a transport block set at the first node;
  • 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 transport block.
  • Figure 34 is a schematic structural diagram of a base station provided by an embodiment of the present application.
  • the base station 400 includes a memory 401, a processor 402, a receiver 403 and a transmitter 404.
  • the number of memories 401 and processors 402 can be one or more.
  • one memory 401 and one processor 402 are taken as an example.
  • the memory 401 and processor 402 in the base station can be connected through a bus or other means.
  • Figure 34 Take the example of connecting via a bus.
  • the memory 401 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 information transmission method by running software programs, instructions and modules stored in the memory 401.
  • the memory 401 may mainly include a program storage area and a data storage area, where the program storage area may store an operating system and an application program required for at least one function.
  • the memory 401 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device.
  • memory 401 further includes memory located remotely from processor 402, and these remote memories may be connected to the device through a network. Examples of the above-mentioned networks include but are not limited to the Internet, intranets, local area networks, mobile communication networks and combinations thereof.
  • the receiver 403 is configured to receive information; the transmitter 404 is configured to send feedback information according to the control of the processor 402.
  • Figure 35 is a schematic structural diagram of a user equipment provided by an embodiment of the present application.
  • the user equipment 500 includes a memory 501, a processor 502, a receiver 503 and a transmitter 504.
  • the number of memories 501 and processors 502 can be one or more.
  • one memory 501 and one processor 502 are taken as an example; the memory 501 and processor 502 in the user equipment can be connected through a bus or other means, Figure 35 In the example, connection via bus is used.
  • the memory 501 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 information transmission method by running software programs, instructions and modules stored in the memory 501 .
  • the memory 501 may mainly include a program storage area and a data storage area, where the program storage area may store an operating system and an application program required for at least one function.
  • the memory 501 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device.
  • memory 501 further includes memory located remotely from processor 502, and these remote memories may be connected to the device through a network. Examples of the above-mentioned networks include but are not limited to the Internet, intranets, local area networks, mobile communication networks and combinations thereof.
  • the receiver 503 is configured to receive feedback information; the transmitter 504 is configured to transmit transmission blocks according to the control of the processor 502 .
  • An embodiment of the present application also provides a computer-readable storage medium that stores computer-executable instructions.
  • the computer-executable instructions are used to execute the information transmission method provided by any embodiment of the present application.
  • An embodiment of the present application also provides a computer program product, including a computer program or computer instructions, the calculation
  • the computer program or computer instructions are stored in a computer-readable storage medium.
  • the processor of the computer device reads the computer program or computer instructions from the computer-readable storage medium.
  • the processor executes the computer program or computer instructions, causing the computer device to perform any of the tasks described in this application.
  • An information transmission method provided by an embodiment.
  • the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may consist of several physical components. Components execute cooperatively. Some or all of the 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 as hardware, or as an integrated circuit, such as an application specific integrated circuit . Such software may be distributed on computer-readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media).
  • computer storage media includes volatile and nonvolatile media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. removable, removable and non-removable media.
  • Computer storage media includes, but is 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, tapes, disk storage or other magnetic storage devices, or may Any other medium used to store the desired information and that can be accessed by a computer.
  • 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 .
  • a component may be, but is not limited to, a process, processor, object, executable file, thread of execution, program or computer running on a processor.
  • applications running on the computing device and the computing device may be components.
  • One or more components can reside in a process or thread of execution, and the component can be localized on one computer or distributed between 2 or more computers. Additionally, these components can execute from various computer-readable media having various data structures stored thereon.
  • a component may, for example, be based on a signal having one or more data packets (eg, data from two components interacting with another component, such as a local system, a distributed system, or a network, such as the Internet, which interacts with other systems via signals) Communicate through local or remote processes.
  • data packets eg, data from two components interacting with another component, such as a local system, a distributed system, or a network, such as the Internet, which interacts with other systems via signals

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本申请实施例提供了一种信息传输方法，包括：一种接收至少一个第二节点发送的传输块；所述传输块形成传输块集合；根据所述传输块集合，得到正确传输块集合的信息；将所述正确传输块集合的信息进行编码处理，得到反馈信息；其中，所述反馈信息用于表征所述至少一个第二节点发送的传输块的接收情况；所述编码处理包括将所述正确传输块集合的信息进行压缩编码；发送所述反馈信息给所述至少一个第二节点。

Description

信息传输方法、装置、基站、设备、存储介质及程序产品
相关申请的交叉引用
本申请基于申请号为202210675040.0、申请日为2022年6月15日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本申请实施例涉及通信技术领域，尤其是一种信息传输方法、装置、基站、用户设备、存储介质及程序产品。
背景技术
随着无线通信技术的发展，每个基站(Base Station，BS)需要支持数以万计用户设备(User Equipment，UE)的连接。以竞争式免调度(Contention-Based Grant-Free,CBGF)随机接入(Random Access)传输方案为例，基站无需对发送数据的UE事先进行调度和资源分配，也不能预先知道哪些UE有数据发送需求，这样就存在多个UE使用相同时频资源(Time and Frequency Resource)进行传输的可能性。为了基站能够在接收检测过程中区分不同UE，发送数据的UE将从***提供的随机接入资源集合(如扩频序列、导频序列等)中随机选取一个资源(也称为signature)进行数据发送。
由于基站没有对UE进行调度，因此需要对数据包是否成功接收向每个UE反馈应答信号(Acknowledgement signaling)，而一个基站需要同时服务成千上万个UE，若给每个被服务的UE都反馈1比特应答信号，则需反馈成千上万个比特应答信号。这样的反馈开销过大，导致频谱资源的浪费。
发明内容
本申请实施例提供一种信息传输方法、装置、基站、用户设备、计算机可读存储介质及计算机程序产品，旨在节约频谱资源，提高数据传输效率。
第一方面，本申请实施例提供一种信息传输方法，所述方法包括：接收至少一个第二节点发送的传输块；所述传输块形成传输块集合；根据所述传输块集合，得到正确传输块集合的信息；将所述正确传输块集合的信息进行编码处理，得到反馈信息；其中，所述反馈信息用于表征所述至少一个第二节点发送的传输块的接收情况；所述编码处理包括将所述正确传输块集合的信息进行压缩编码；发送所述反馈信息给所述至少一个第二节点。
第二方面，本申请实施例提供一种信息传输方法，应用于第二节点，所述方法包括：所述方法包括：发送传输块给第一节点；接收所述第一节点发送的反馈信息；其中，所述反馈信息用于表征所述传输块的接收情况。
第三方面，本申请实施例提供一种信息传输装置，包括：接收模块，设置为接收至少一 个第二节点发送的传输块；所述传输块形成传输块集合；正确传输块信息获得模块，设置为根据所述传输块集合，得到正确传输块集合的信息；反馈信息生成模块，设置为通过对所述正确传输块集合的信息进行编码处理，得到反馈信息；其中，所述反馈信息用于表征所述至少一个第二节点发送的传输块的接收情况；所述编码处理包括将所述正确传输块集合的信息进行压缩编码；发送模块，设置为发送所述反馈信息至所述至少一个第二节点。
第四方面，本申请实施例提供一种信息传输装置，包括：发送模块，设置为发送传输块给第一节点；接收模块，设置为接收所述第一节点发送的反馈信息；其中，所述反馈信息用于表征所述传输块的接收情况。
第五方面，本申请实施例提供一种基站，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现如第一方面或第二方面任意一项所述的信息传输方法。
第六方面，本申请实施例提供一种用户设备，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现如第一方面或第二方面任意一项所述的信息传输方法。
第七方面，本申请实施例提供一种计算机可读存储介质，所述计算机可读存储介质存储有计算机可执行指令，所述计算机可执行指令用于执行如第一方面或第二方面任意一项所述的信息传输方法。
第八方面，本申请实施例提供一种计算机程序产品，包括计算机程序或计算机指令，所述计算机程序或所述计算机指令存储在计算机可读存储介质中，计算机设备的处理器从所述计算机可读存储介质读取所述计算机程序或所述计算机指令，所述处理器执行所述计算机程序或所述计算机指令，使得所述计算机设备执行如第一方面或第二方面任意一项所述的信息传输方法。
附图说明
图1为本申请一实施例提供的信息传输方法的应用场景***架构示意图；
图2为本申请一实施例提供的信息传输方法的流程图；
图3为本申请一实施例提供的由正确传输块标识集合确定反馈信息的流程示意图；
图4为本申请另一实施例提供的由正确传输块标识集合确定反馈信息的流程示意图；
图5为本申请一实施例提供的传输块差错图样的确定方法的流程示意图；
图6是本申请另一实施例提供的传输块差错图样的确定方法的流程示意图；
图7是本申请一实施例提供的由传输块差错图样确定反馈信息的流程示意图；
图8是本申请另一实施例提供的由传输块差错图样确定反馈信息的流程示意图；
图9是本申请一实施例提供的由正确传输块标识集合确定中间码字的流程示意图；
图10是本申请另一实施例提供的由正确传输块标识集合确定中间码字的流程示意图；
图11是本申请一实施例提供的由传输块差错图样确定中间码字的流程示意图；
图12是本申请另一实施例提供的由传输块差错图样确定中间码字的流程示意图；
图13是本申请一实施例提供的根据中间码字确定反馈信息的程序流程图；
图14是本申请一示例提供的第二节点、传输块和用户标识的关系的示意图；
图15是本申请一示例提供的正确传输块数目、正确传输块集合、传输块错误图样、中间码字、偏移值比特序列和反馈信息的映射关系图；
图16是本申请一示例提供的正确传输块数目、正确传输块集合、传输块错误图样、中间码字、偏移值比特序列和反馈信息的映射关系图；
图17是本申请一示例提供的正确传输块数目、正确传输块集合、传输块错误图样、中间码字、偏移值比特序列和反馈信息的映射关系图；
图18是本申请示例提供的第二节点、传输块、用户标识、随机接入标签和标签索引的关系示意图；
图19是本申请一示例提供的正确传输块数目、正确传输块集合、传输块错误图样、中间码字、偏移值比特序列和反馈信息的映射关系图；
图20是本申请一示例提供的第二节点、传输块、用户标识、随机接入标签和标签索引的关系示意图；
图21是本申请一示例提供的正确传输块数目、正确传输块集合、传输块错误图样、中间码字、偏移值比特序列和反馈信息的映射关系图；
图22是本申请一示例提供的第二节点、传输块、随机接入标签和标签索引的关系示意图；
图23是本申请一示例提供的正确传输块数目、正确传输块集合、传输块错误图样、中间码字、偏移值比特序列和反馈信息的映射关系图；
图24是本申请一示例提供的正确传输块数目、正确传输块集合、传输块错误图样、偏移值和反馈信息的映射关系图；
图25是本申请一示例提供的由正确传输块标识集合确定反馈信息的流程示意图；
图26是本申请一示例提供的正确传输块数目、正确传输块集合、传输块错误图样、偏移值和反馈信息的映射关系图；
图27是本申请另一示例提供的由正确传输块标识集合确定反馈信息的流程示意图；
图28是本申请一示例提供的第二节点、传输块、随机接入标签和标签索引的关系示意图；
图29是本申请一示例提供的第二节点、传输块、用户标识和用户标识的索引值的关系示意图；
图30为本申请实施例提供的信息传输方法的流程示意图；
图31为本申请实施例提供的解码结果判断方法流程图；
图32是本申请一实施例提供的一种信息传输装置结构示意图；
图33是本申请一实施例提供的一种信息传输装置结构示意图；
图34是本申请一实施例提供的基站的结构示意图；
图35是本申请一实施例提供的用户设备的结构示意图。
具体实施方式
需要说明的是，虽然在装置示意图中进行了功能模块划分，在流程图中示出了逻辑顺序，但是在某些情况下，可以以不同于装置中的模块划分，或流程图中的顺序执行所示出或描述 的步骤。说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
本申请实施例的描述中，除非另有明确的限定，设置、安装、连接等词语应做广义理解，所属技术领域技术人员可以结合技术方案的具体内容合理确定上述词语在本申请实施例中的具体含义。本申请实施例中，“进一步地”、“示例性地”或者“可选地”等词用于表示作为例子、例证或说明，不应被解释为比其它实施例或设计方案更优选或更具有优势。使用“进一步地”、“示例性地”或者“可选地”等词旨在以具体方式呈现相关概念。
图1为本申请一实施例提供的信息传输方法的应用场景***架构示意图。如图1所示，在无线通信***100中，一个基站110服务多种类型的用户设备(120、130、140)，每种类型的用户设备可以有一个或多个，因此，基站110服务多个用户设备。
本申请提供的信息传输方法可以应用于各类无线通信***中，例如，可以是物联网(internet of things，IoT)、窄带物联网(narrow band internet of things，NB-IoT)、长期演进(long term evolution，LTE)，也可以是第五代(5G)通信***，还可以是LTE与5G混合架构、也可以是5G新无线(new radio，NR)***，以及未来通信发展中出现的新的通信***等。只要通信***中存在一个实体可以接收传输块(Transport Block，TB)以及发送对传输块接收情况的反馈信息，另一个实体可以发送传输块以及接收传输块接收情况的反馈信息，均可以采用本申请实施例提供的信息传输方法。
本申请实施例中涉及的用户设备，是一种向用户提供语音和/或数据连通性的设备，例如，具有无线连接功能的手持式设备、车载设备等。用户设备也可以是连接到无线调制解调器的其他处理设备。用户设备可以通过无线接入网(radio access network，RAN)与一个或多个核心网进行通信。用户设备也可以称为无线终端、订户单元(subscriber unit)、订户站(subscriber station)，移动站(mobile station)、移动台(mobile)、远程站(remote station)、接入点(access point)、远程终端(remote terminal)、接入终端(access terminal)、用户终端(user terminal)、用户代理(user agent)。用户设备可以是移动终端，如移动电话(或称为“蜂窝”电话)和具有移动终端的计算机，例如，可以是便携式、袖珍式、手持式、计算机内置的或者车载的移动装置，它们与无线接入网交换语言和/或数据。例如，用户设备还可以是个人通信业务(personal communication service，PCS)电话、无绳电话、会话发起协议(session initiation protocol，SIP)话机、无线本地环路(wireless local loop，WLL)站、个人数字助理(personal digital assistant，PDA)等设备。常见的用户设备例如包括：手机、平板电脑、笔记本电脑、掌上电脑、移动互联网设备(mobile internet device，MID)、可穿戴设备，例如智能手表、智能手环、计步器等，但本申请实施例不限于此。
本申请实施例中所涉及的基站，可以是全球移动通信***(global system for mobile communication，GSM)或码分多址(code division multiple access，CDMA)中的基站(base transceiver station，BTS)，也可以是宽带码分多址(wideband code division multiple access，WCDMA)中的基站(NodeB)，还可以是LTE中的演进型基站(evolutional Node B，eNB或e-NodeB)，还可以是新无线控制器(new radio controller，NR controller)，可以是5G***中的gNode B(gNB)，可以是集中式网元(centralized unit)，可以是新无线基站，可以是射频拉远模 块，可以是微基站，可以是中继(relay)，可以是分布式网元(distributed unit)，可以是接收点(transmission reception point，TRP)或传输点(transmission point，TP)或者任何其它无线接入设备，但本申请实施例不限于此。网络设备可以覆盖1个或多个小区。
以在第三代合作伙伴计划(The 3rd Generation Partnership Project，3GPP)的5G技术规范(Technical Specification，TS)为例，UE的传输是由基站调度的，因此下行链路(Downlink)不需要反馈应答信号(Acknowledgement signaling)。在上行链路(Uplink)，UE收到基站发送的传输块信号，使用传输块的循环冗余校验(Cyclic Redundancy Check,CRC)码来判断当前传输块是否正确接收。如果传输块通过CRC校验，则认为接收正确，UE在基站指定的时频资源上向基站反馈正确应答(positive Acknowledgement，ACK)状态(使用比特“1”表示)；否则，UE向基站反馈错误应答(Negative Acknowledgement，NACK)状态(使用比特“0”表示)。根据不同场景的需要，应答状态可在5G标准定义的5种物理上行控制信道(Physical Uplink Control Channel，PUCCH)格式上传输。这5种格式分别是：PUCCH格式0、PUCCH格式1、PUCCH格式2、PUCCH格式3和PUCCH格式4，其中，PUCCH格式0～1用于传输1或2比特混合自动请求重传(Hybrid Automatic Repeat-reQuest,HARQ)应答(HARQ-ACK)信息和调度请求(Scheduling Request)，PUCCH格式2～4用于传输信道状态信息(Channel State Information,CSI)报告或多比特的HARQ-ACK信息。
表1不同PUCCH格式占用的资源数量、传输比特数和用途的示例
表1示出了不同PUCCH格式下的负载比特数(payload size)、占用资源数和用途，其中OFDM表示正交频分复用(Orthogonal Frequency-Division Multiplexing)，RB表示资源块(Resource Block)，RE表示资源元素(Resource Element)。
PUCCH格式0和格式1的负载比特数不大于2，使用相移键控(Phase-Shift Keying)对负载进行调制后与序列相乘和扩频得到发送信号。PUCCH格式2～格式4则使用极化码信道编码和相移键控的方式得到发送信号。
从表1中可以看出，平均每传输1比特应答信号最少需要6个RE。对于未来大规模免调度***，即使基站只服务1000个UE，也至少需要6000个RE进行应答信号反馈(约36个RB，每个RB有12*14＝168个RE)。这将占用大量频谱资源。但实际上，同一时刻有数据传输的UE数量远远小于1000个(往往只有几十个)，应答信号反馈效率较低。
基于此，本申请实施例提供了一种信息传输方法、装置、基站、设备、存储介质及程序产品，通过对正确接收的传输块集合的信息进行压缩编码，使得多个正确接收的UE的应答信号得到压缩，使得信道编码的输入比特数达到最小化，然后再进行信道编码和调制后发送 出去；每个UE对接收到的应答信号进行解码和解压缩，提取对应的应答信号，进而实现节约频谱资源，提高数据传输效率的目的。
图2为本申请一实施例提供的信息传输方法的流程图。如图2所示，本申请实施例提供的信息传输方法可用于基站、中继、终端等任何具备数据接收和信令发送功能的网元，包括但不限于步骤S1000、步骤S2000、步骤S3000以及步骤S4000。
步骤S1000：接收至少一个第二节点发送的传输块，传输块形成传输块集合。
在一些实施例中，第一节点(First Node)接收一个第二节点发送的包含传输块的信号。
在一些实施例中，第一节点接收多个第二节点发送包含传输块的信号时，这些第二节点形成了第二节点序列(A Sequence of Second Nodes)，多个第二节点发送的传输块形成了传输块集合。其中，第二节点序列包括Nu个第二节点，传输块集合包括Nb个传输块；其中，Nu和Nb是正整数，Nu小于或等于Nb。
需要说明的是，在一些实施例中，一个第二节点可以向第一节点发送一个或多个传输块，一个或多个传输块形成传输块集合。在另一些实施例中，两个及以上第二节点可以向第一节点发送一个或多个传输块，这些传输块形成传输块集合。
在一些实施例中，传输块集合中的一个传输块包括传输块标识(Transport Block Identifier)，传输块标识有序集合包括Na个传输块标识I(1),I(2),..,I(Na)，Na为传输块标识有序集合大小；对于i＝1,2,....,Na，传输块标识有序集合的第i个元素为I(i)；其中，传输块标识有序集合的第i个元素I(i)可以是整数i或整数i-1。
在一些实施例中，传输块通过传输块标识指示。
在一些实施例中，传输块标识可以是以下的其中一种：用户标识(User Equipment Identifier)、用户标识的索引值、标签索引(signature index)。
在一些实施例中，用户标识是第二节点序列的一个第二节点的用户标识，第二节点序列中的两个不同的第二节点的用户标识是不相同的，用户标识可用于第一节点在包含传输块集合的信号中区分传输块集合中的不同传输块，用户标识为整数。
需要说明的是，用户标识可以是订阅永久标识符(Subscription Permanent Identifier，SUPI)、通用公共订阅标识符(Generic Public Subscription Identifier，GPSI)、永久设备标识符(Permanent Equipment Identifier，PEI)、网络接入标识(Network Access Identifier，NAI)、订阅隐藏标识符(Subscription Concealed Identifier，SUCI)、全球唯一临时标识(Globally Unique Temporary Identity，GUTI)、无线网络临时标识(Radio Network Temporary Identifier，RNTI)、***信息RNTI(System Information RNTI,SI-RNTI)、寻呼RNTI(Paging RNTI，P-RNTI)、随机接入RNTI(Random Access RNTI,RA-RNTI)、临时小区RNTI(Temporary Cell RNTI，TC-RNTI)、小区RNTI(Cell RNTI，C-RNTI)、上行控制信道发射功率控制RNTI(Transmit Power Control-PUCCH RNTI，TPC-PUCCH-RNTI)、上行共享信道发射功率控制RNTI(Transmit Power Control-PUSCH RNTI,TPC-PUSCH-RNTI)、信道探测参考信号发射功率控制RNTI(Transmit Power Control-Sounding Reference Symbols RNTI,TPC-SRS-RNTI)、中断RNTI(Interruption RNTI，INT-RNTI)、调制编码方式小区RNTI(Modulcation Coding Scheme Cell RNTI，MCS-C-RNTI)、配置调度RNTI(Configured Scheduling RNTI，CS-RNTI)、时 隙格式指示RNTI(Slot Format Indication RNTI，SFI-RNTI)、半持续RNTI(Semi-Persistent CSI RNTI，SP-CSI-RNTI)等。
在一些实施例中，传输块标识为用户标识，传输块标识有序集合的元素为用户标识。一个具体的例子是：传输块标识有序集合I＝<I(1),I(2),I(3),I(4),I(5)>＝<0,1,2,3,4>；其中，传输块标识有序集合大小为Na＝5，传输块标识有序集合中的第2个元素I(2)对应的用户标识为1。另一个具体的例子是：传输块标识有序集合I＝<I(1),I(2),I(3),I(4),I(5)>＝<1,2,3,4,5>；其中，传输块标识有序集合大小为Na＝5，传输块标识有序集合中的第2个元素I(2)对应的用户标识为2。又一个具体的例子是：传输块标识有序集合I＝<I(1),I(2),I(3),I(4)>＝<0,11,20,30>；其中，传输块标识有序集合大小为Na＝4，传输块标识有序集合中的第2个元素I(2)对应的用户标识为11。
在一些实施例中，用户标识的索引值是指传输块标识有序集合I＝<I(1),I(2),.,I(Na)>中的元素I(i)的索引i，i＝1,2,....,Na，用户标识的索引值为整数。
在一些实施例中，传输块标识为用户标识的索引值，用户标识为用户标识有序集合中的元素，用户标识有序集合包括Na个用户标识ID(1),ID(2),...,ID(Na)；其中，Na为用户标识有序集合大小，也是传输块标识有序集合大小，i＝1,2,...,Na，用户标识有序集合中的第i个用户标识ID(i)对应的用户标识的索引值为传输块标识有序集合元素中的第i个元素I(i)。一个具体的例子是：用户标识有序集合ID＝<ID(1),ID(2),ID(3),ID(4)>＝<0,11,20,30>，对应的传输块标识有序集合I＝<I(1),I(2),I(3),I(4)>＝<0,1,2,3>；其中，用户标识有序集合大小和传输块标识有序集合大小都为Na＝4，用户标识有序集合中的元素ID(2)＝11的用户标识的索引值是传输块标识有序集合中的元素I(2)＝1。
在一些实施例中，传输块标识为标签索引，标签索引是随机接入标签(signature)的标签索引，即，传输块集合中的一个传输块包括随机接入标签，随机接入标签为随机接入标签有序集合的元素，随机接入标签有序集合包括Na个随机接入标签r(1),r(2),...,r(Na)；其中，Na为随机接入标签有序集合大小，也是传输块标识有序集合大小，i＝1,2,....,Na，随机接入标签有序集合中的第i个随机接入标签r(i)的标签索引为传输块标识有序集合的第i个元素I(i)，其中，传输块标识有序集合的第i个元素I(i)可以是整数i或整数i-1。
需要说明的是，随机接入标签可以是导频(Pilot)、参考信号(Reference Signal)、前导码(Preamble)、扩频序列(Spread Spectrum Sequence)、交织器(Interleaver)、交织图样(Interleaver Pattern)、交织序列(Interleaver Sequence)、加扰序列(Scrambling Sequence)、稀疏码序列(Sparse Code Sequence)等。
在一些实施例中，第二节点根据其用户标识确定一个传输块的随机接入标签作为传输块集合中的一个传输块包括的随机接入标签，这些随机接入标签可用于第一节点在包含传输块集合的信号中区分传输块集合中的不同传输块。
在一些实施例中，第二节点根据高层参数(higher layer parameters)确定一个传输块包括的随机接入标签作为传输块集合中的一个传输块包括的随机接入标签，这些随机接入标签可用于第一节点在包含传输块集合的信号中区分传输块集合中的不同传输块。
需要说明的是，第一节点和第二节点可以是基站、中继、终端等任何具备数据接收和信 令发送功能的网元。
步骤S2000：根据传输块集合，得到正确传输块集合的信息。
需要说明的是，正确传输块集合的信息包括最大正确传输块数目Pmax、传输块标识有序集合、传输块标识有序集合大小Na、正确传输块标识集合、正确传输块数目P、中间码字c、传输块差错图样a、偏移值有序集合Q。需要说明的是，根据上述一种或多种正确传输块的信息即可得到反馈信息，即，反馈信息的生成不是一定需要上述全部信息。
在一些实施例中，最大正确传输块数目Pmax等于传输块标识有序集合大小Na；在另一些实施例中，最大正确传输块数目Pmax由第一节点配置；在又一些实施例中，最大正确传输块数目Pmax由高层参数预先配置。
还需要说明的是，根据最大正确传输块数目Pmax确定偏移值有序集合Q的元素数目。偏移值有序集合Q中元素的数值根据传输块标识有序集合大小Na和偏移值有序集合Q中元素在偏移值有序集合Q中的索引确定。
在一些实施例中，偏移值有序集合Q包括Pmax个非负整数Q(1),Q(2),...,Q(Pmax)，其中，对于i＝1,2,...,Pmax，偏移值有序集合Q的第i个元素为大于或等于的最小整数，为Na取j的组合数。
在一些实施例中，偏移值有序集合Q包括Pmax个非负整数Q(1),Q(2),...,Q(Pmax)，其中，对于i＝1,2,...,Pmax，偏移值有序集合Q的第i个元素为大于或等于的最小整数，为Na取j的组合数。
在一些实施例中，偏移值有序集合Q包括Pmax+2个非负整数Q(1),Q(2),...,Q(Pmax),Q(Pmax+1),Q(Pmax+2)，其中，Q(1)＝0，对于i＝2,...,Pmax,Pmax+1,Pmax+2，偏移值有序集合Q的第i个元素为Na取j的组合数。
在一些实施例中，偏移值有序集合Q包括Pmax+1个非负整数Q(1),Q(2),...,Q(Pmax),Q(Pmax+1)，其中，Q(1)＝0，对于i＝2,...,Pmax,Pmax+1，偏移值有序集合Q的第i个元素为Na取j的组合数。
在一些实施例中，正确传输块集合的信息为正确传输块标识集合，正确传输块标识集合为传输块集合中正确接收的传输块所包括的用户标识的集合。正确接收的传输块是指应答状态为正确应答ACK的传输块，一个用户标识属于正确传输块标识集合用于指示对应该用户标识的传输块的应答状态为正确应答ACK，一个用户标识不属于正确传输块标识集合用于指示对应该用户标识的传输块的应答状态为错误应答NACK。
在一些实施例中，正确传输块集合的信息为正确传输块标识集合，正确传输块标识集合为用户标识的索引值的集合。正确接收的传输块是指应答状态为正确应答ACK的传输块，一个用户标识的索引值属于正确传输块标识集合用于指示对应该用户标识的索引值的传输块的 应答状态为正确应答ACK，一个用户标识的索引值不属于正确传输块标识集合用于指示对应该用户标识的索引值的传输块的应答状态为错误应答NACK。
在一些实施例中，正确传输块集合的信息为正确传输块标识集合，正确传输块标识集合为传输块集合中正确接收的传输块所对应的随机接入标签的标签索引的集合。正确接收的传输块是指应答状态为正确应答ACK的传输块，一个随机接入标签的标签索引属于正确传输块标识集合用于指示对应该随机接入标签的传输块的应答状态为正确应答ACK，一个随机接入标签的标签索引不属于正确传输块标识集合用于指示对应该随机接入标签的传输块的应答状态为错误应答NACK。
步骤S3000：对正确传输块集合的信息进行编码处理，得到反馈信息；其中，反馈信息用于表征至少一个第二节点发送的传输块的接收情况；编码处理包括将正确传输块集合的信息进行压缩编码。
在一些实施例中，将偏移值有序集合中的偏移值元素进行二进制表示，得到与反馈信息长度相同的偏移值比特序列，通过对正确传输块标识集合进行映射处理，将偏移值比特序列与映射处理后的正确传输块标识集合进行二进制加法计算，得到反馈信息。
在一些实施例中，将正确传输块标识集合进行压缩编码，得到中间码字，再将中间码字与偏移值比特序列进行加和，得到反馈信息。
在一些实施例中，根据正确传输块集合的信息，得到传输块差错图样，再将传输块差错图样映射至反馈信息比特序列，并将反馈信息比特序列确定为反馈信息。
在一些实施例中，将传输块差错图样进行压缩编码，得到中间码字，再将中间码字与偏移值比特序列进行加和，得到反馈信息。
在后文中，将通过实施例及附图详细阐述对正确传输块集合的信息进行编码处理的过程。
步骤S4000：发送反馈信息给至少一个第二节点。
在一些实施例中，第一节点发送反馈信息给一个或多个第二节点序列，这些反馈信息能够表征至少一个第二节点发送的传输块在第一节点的接收情况。
上述实施例提供的信息传输方法能够使得信道编码的输入比特数达到最小化，进而实现节约频谱资源，提高数据传输效率的目的。
在一些实施例中，第一节点没有正确接收的传输块，正确传输块标识集合为空集时，即P＝0时，第一节点确定反馈信息f的长度Nf＝0，即反馈信息f为空序列。第一节点确定包含为空序列的反馈信息f的信号为空信号，即第一节点确定包含反馈信息f的信号为零功率信号。
上述实施例提供的信息传输方法中由于第一节点发送零功率信号，使得能量开销降低，而第二节点序列中的一个第二节点对包含反馈信息f的信号(即零功率信号)接收不会成功，因此第二节点序列中的一个第二节点可以判断反馈信息为错误应答NACK。
接下来，提供计算偏移值有序集合的具体实施例。
在一些实施例中，反馈信息f的长度Nf根据最大正确传输块数目Pmax和传输块标识有序集合大小Na确定。
在一些实施例中，反馈信息f的长度Nf大于或等于
在一些实施例中，反馈信息f的长度Nf大于或等于
在一些实施例中，反馈信息f的长度Nf大于或等于
在一些实施例中，反馈信息f的长度Nf大于或等于
在一些实施例中，当时，偏移值有序集合Q包括Pmax个非负整数Q(1),Q(2),...,Q(Pmax)，其中，对于i＝1,2,...,Pmax，偏移值有序集合Q的第i个元素
在一些实施例中，当时，偏移值有序集合Q包括Pmax个非负整数Q(1),Q(2),...,Q(Pmax)，其中，Q(1)＝0，对于i＝2,...,Pmax，偏移值有序集合Q的第i个元素
在一些实施例中，当时，偏移值有序集合Q包括Pmax+2个非负整数Q(1),Q(2),...,Q(Pmax),Q(Pmax+1),Q(Pmax+2)，其中，Q(1)＝0，对于i＝2,3,...,Pmax+1,Pmax+2，偏移值有序集合Q的第i个元素
在一些实施例中，时，偏移值有序集合Q包括Pmax+1个非负整数Q(1),Q(2),...,Q(Pmax),Q(Pmax+1)，其中，Q(1)＝0，对于i＝2,3,...,Pmax+1，偏移值有序集合Q的第i个元素
需要说明的是，在本申请的全部实施例中，为大于或等于x的最小整数，为x取y的组合数，mod表示取余函数，例如：0mod 2＝0，1mod 2＝1，3mod 2＝1，5mod 3＝2，在后文中不再赘述。
基于获得的偏移值有序集合，提供对正确传输块集合的信息进行编码处理，得到反馈信息的具体实施例。
图3是本申请实施例提供的由正确传输块标识集合确定反馈信息的流程示意图，在一个 具体的实施例中，第一节点对正确传输块集合的信息进行压缩编码处理是指把个至多包含Pmax个元素的正确传输块标识集合映射到长度为Nf的比特序列的编码过程。当 时，如图3所示的流程中，P为正确传输块数目，Na为传输块标识有序集合大小，I(1),I(2),...,I(Na)为传输块标识有序集合包括的Na个元素，BI为正确传输块标识集合，f(j)为反馈信息f的第j个比特；对于i＝1,2,...,Pmax，比特序列[q(i,1),q(i,2),...,q(i,Nf)]是偏移值有序集合Q的第i个元素Q(i)的Nf个比特的二进制表示，即比特序列[q(i,1),q(i,2),...,q(i,Nf)]是偏移值元素Q(i)对应的偏移值比特序列，其中，q(i,1)是最高可靠位(Most Significant Bit)，q(i,Nf)是最低可靠位(Least Significant Bit)。
图4是本申请另一实施例提供的由正确传输块标识集合确定反馈信息的流程示意图，在一个具体的实施例中，第一节点对正确传输块标识集合进行压缩编码是指把个包含至多Pmax个元素且至少1个元素的正确传输块标识集合映射到长度为Nf的比特序列的编码过程。当时，如图4所示的流程中，P为正确传输块数目，Na为传输块标识有序集合大小，I(1),I(2),...,I(Na)为传输块标识有序集合包括的Na个元素，BI为正确传输块标识集合，f(j)为反馈信息f的第j个比特；对于i＝1,2,...,Pmax，比特序列[q(i,1),q(i,2),...,q(i,Nf)]是偏移值有序集合Q的第i个元素Q(i)的Nf个比特的二进制表示，即比特序列[q(i,1),q(i,2),...,q(i,Nf)]是偏移值元素Q(i)对应的偏移值比特序列，其中，q(i,1)是最高可靠位，q(i,Nf)是最低可靠位。
接下来，提供计算传输块错误图样的具体实施例。
在一些实施例中，传输块差错图样a根据以下至少之一确定：传输块标识有序集合、传输块标识有序集合大小Na、正确传输块标识集合、正确传输块数目P。
图5是本申请一实施例提供的传输块差错图样的确定方法的流程图。如图5所示，传输块差错图样a通过下述步骤S3510、步骤S3521以及步骤S3522确定。
步骤S3510：判断每个传输块标识有序集合中的元素是否属于正确传输块标识集合。
步骤S3521：如果属于正确传输块标识集合，则传输块差错图样的第i个比特a(i)＝ack。
步骤S3522：如果不属于正确传输块标识集合，传输块差错图样的第i个比特a(i)＝nack。
可以理解的是比特“ack”用于指示传输块的应答状态为正确应答ACK，比特“nack”用于指示传输块的应答状态为错误应答NACK，即，对于a(i)＝ack，说明传输块标识有序集合中的第i个元素对应的传输块的应答状态为正确应答ACK，对于a(i)＝nack，说明传输块标识有序集合中的第i个元素对应的传输块的应答状态为正确应答NACK。
在一些实施例中，比特“ack”为比特“1”，比特“nack”为比特“0”。
在一些实施例中，比特“ack”为比特“0”，比特“nack”为比特“1”。
图6是本申请另一实施例提供的传输块差错图样的确定方法的流程图。如图6所示，传输块差错图样a通过下述步骤S3610、步骤S3620、步骤S3630确定。
步骤S3610：根据传输块差错图样的预设长度，得到与预设长度对应的传输块差错图样初始图样，其中，传输块差错图样初始图样中的每个元素对应错误应答比特。
在一些实施例中，设置传输块差错图样为长度Na且每个元素都是比特“nack”的序列，其中，Na为传输块标识有序集合大小。
步骤S3620：根据正确传输块集合，在传输块差错图样初始图样中，将序号等于所述正确传输块集合中元素的比特设置为正确应答比特。
步骤S3630：将传输块差错图样初始图样确定为传输块差错图样。
在一些实施例中，根据正确传输块集合BI＝{BI(1),B(2),...,BI(P)}，对于i＝1,2,...,P，将传输块差错图样初始图样中的第BI(i)个比特设置为a(BI(i))＝ack，更新后的传输块差错图样初始图样为传输块差错图样，其中，P是正确传输块数目。
可以理解的是比特“ack”用于指示传输块的应答状态为正确应答ACK，比特“nack”用于指示传输块的应答状态为错误应答NACK，即，对于a(i)＝ack，说明传输块标识有序集合中的第i个元素对应的传输块的应答状态为正确应答ACK，对于a(i)＝nack，说明传输块标识有序集合中的第i个元素对应的传输块的应答状态为正确应答NACK。
在一些实施例中，比特“ack”为比特“1”，比特“nack”为比特“0”。
在一些实施例中，比特“ack”为比特“0”，比特“nack”为比特“1”。
基于获得的传输块差错图样，提供对正确传输块集合的信息进行编码处理，得到反馈信息的具体实施例。
图7是本申请一实施例提供的由传输块差错图样确定反馈信息的流程示意图，第一节点对传输块差错图样a进行压缩编码是指把个长度为Na的包含至多Pmax个比特“ack”的传输块差错图样a映射到长度为Nf的比特序列。当时，如图7所示的流程中，P为正确传输块数目，Na为传输块标识有序集合大小，a为传输块差错图样，f(j)为反馈信息f的第j个比特。对于i＝1,2,...,Pmax，比特序列[q(i,1),q(i,2),...,q(i,Nf)]是偏移值有序集合Q的第i个元素Q(i)的Nf个比特的二进制表示，即比特序列[q(i,1),q(i,2),...,q(i,Nf)]是偏移值元素Q(i)对应的偏移值比特序列，其中，q(i,1)是最高可靠位，q(i,Nf)是最低可靠位。
图8是本申请另一实施例提供的由传输块差错图样确定反馈信息的流程示意图，第一节点对传输块差错图样a进行压缩编码是指把个长度为Na的包含至多Pmax个比特“ack”且至少1个比特“ack”的传输块差错图样a映射到长度为Nf的比特序列。当 时，如图8所示的流程中，P为正确传输块数目，Na为传输块标识有序集合大小，a为传输块错误图样，f(j)为反馈信息f的第j个比特，对于i＝1,2,...,Pmax,比特序列[q(i,1),q(i,2),...,q(i,Nf)]是偏移值有序集合Q的第i个元素Q(i)的Nf个比特的二进制表示，即比特序列[q(i,1),q(i,2),...,q(i,Nf)]是偏移值元素Q(i)对应的偏移值比特序列，其中，q(i,1)是最高可靠位，q(i,Nf)是最低可靠位。
在一些实施例中，中间码字c由第一节点至少根据以下参数中任意一个或其任意组合确定：传输块标识有序集合、传输块标识有序集合大小Na、正确传输块标识集合、正确传输块数目P、传输块错误图样a、最大正确传输块数目Pmax。
在一些实施例中，中间码字c的长度Nc大于或等于
在一些实施例中，中间码字c的长度Nc大于或等于反馈信息f的长度。
在一些实施例中，中间码字c包括长度为的全零序列，其中，Nf为反馈信息f的长度。
在一些实施例中，中间码字通过对正确传输块标识集合进行压缩编码得到的，具体通过把个包含P个元素的正确传输块标识集合映射到长度为的比特序列的算术编码实现。接下来，提供计算中间码字的具体实施例。
图9是本申请一实施例提供的由正确传输块标识集合确定中间码字的流程示意图，如图所示，在一些实施例中，P为正确传输块数目，Na为传输块标识有序集合大小，I(1),I(2),...,I(Na)为传输块标识有序集合包括的Na个元素，BI为正确传输块标识集合，c(j)为中间码字c的第j个比特，为中间码字c的长度。
图10是本申请另一实施例提供的由正确传输块标识集合确定中间码字的流程示意图，如图所示，在另一些实施例中，P为正确传输块数目，Na为传输块标识有序集合大小，I(1),I(2),...,I(Na)为传输块标识有序集合包括的Na个元素，BI为正确传输块标识集合，c(j)为中间码字c的第j个比特，Nc＝Nf为中间码字c的长度，Nf为反馈信息f的长度，其中，中间码字c包括Nf-Ni长的全零序列。在图10的流程图中，中间码字c的前Nf-Ni个比特为比特“0”。
在一些实施例中，中间码字通过对传输块错误图样进行压缩编码得到的。具体通过指把个长度为Na的包含P个比特“ack”的比特序列映射到长度为的比特序列的算术编码实现。接下来，提供计算中间码字的具体实施例。
图11是本申请一实施例提供的由传输块差错图样确定中间码字的流程示意图，如图所示， 在一些实施例中，P为正确传输块数目，Na为传输块标识有序集合大小，a(i)为传输块错误图样a的第i个比特，c(j)为中间码字c的第j个比特，为中间码字c的长度。
图12是本申请另一实施例提供的由传输块差错图样确定中间码字的流程示意图，如图所示，P为正确传输块数目，Na为传输块标识有序集合大小，a(i)为传输块错误图样a的第i个比特，c(j)为中间码字c的第j个比特，Nc＝Nf为中间码字c的长度，Nf为反馈信息f的长度，其中，中间码字c包括Nf-Ni长的全零序列。在图12的流程图中，中间码字c的前Nf-Ni个比特为比特“0”。
在确定了中间码字后，根据中间码字确定反馈信息。下面提供根据中间码字确定反馈信息的具体实施例。
图13是本申请实施例提供的根据中间码字确定反馈信息的程序流程图，如图所示，其中，P是正确传输块数目，比特序列[q(P,1),q(P,2),...,q(P,Nf)]是偏移值有序集合Q的第P个元素Q(P)的Nf个比特的二进制表示，即比特序列[q(P,1),q(P,2),...,q(P,Nf)]是偏移值元素Q(P)对应的偏移值比特序列，Nf是反馈信息f的长度，Nc是中间码字c的长度，q(P,1)是最高可靠位，q(P,Nf)时最低可靠位。
在一些实施例中，对反馈信息进行信道编码，得到第一编码序列。
需要说明的是，信道编码可以是但不限于，极化编码(polar coding)、低密度奇偶校验编码(low-density parity check coding)、卷积编码(convolutional coding)、turbo编码(turbo coding)、RM码(Reed-Muller code)、RS码(Reed-Solomon code)、BCH码(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码(Goppa code)、极化调整卷积码(Polarization-Adjusted Convolutional Codes)、预变换极化码(Pre-transformed Polar Codes)、奇偶校验极化码(Parity-Check Polar Codes)。
示例1：
在本示例中，第一节点为基站，第二节点为终端，本示例包括多个终端，这些终端形成了终端序列，传输块标识为用户标识。
图14是本申请示例提供的第二节点、传输块和用户标识的关系的示意图，如图14所示，基站接收终端序列发送的包含传输块集合B的信号，其中，终端序列包括Nu＝4个终端SN(1),SN(2),SN(3),SN(4)，传输块集合B包括Nb＝4个传输块b(1),b(2),b(3),b(4)。包含传输块集合B的信号包括包含传输块b(1)的信号、包含传输块b(2)的信号、包含传输块b(3)的信号和包含传输块b(4)的信号。
在本示例中，对于t＝1,2,3,4，传输块集合B中的传输块b(t)由终端序列中的终端SN(t)向基站发送，传输块集合B中的传输块b(t)包括终端SN(t)的用户标识，终端SN(t)的用户标识为随机接入RNTI(Random Access RNTI,RA-RNTI)。终端SN(1),SN(2),SN(3),SN(4)的用户标识分别为4,3,2,5，其中，用户标识4,3,2,5为传输块标识有序集合I＝<I(1),I(2),I(3),I(4),I(5),I(6),I(7),I(8)>＝<1,2,3,4,5,6,7,8>的元素。传输块标识有序集合I包括Na＝8个用户标识1,2,3,4,5,6,7,8。
在本示例中，最大正确传输块数目Pmax＝3由基站配置。正确传输块标识集合是指传输块集合中正确接收的传输块包括的用户标识的集合。在本示例中，基站根据包含传输块集合B的信号确定：正确传输块标识集合为集合BI＝{2,3}、正确传输块数目P＝2。
在本示例中，反馈信息f由基站根据下面的参数进行压缩编码确定：最大正确传输块数目Pmax＝3、传输块标识有序集合I、传输块标识有序集合大小Na＝8、正确传输块标识集合BI、正确传输块数目P＝2、传输块差错图样a、中间码字c、偏移值有序集合Q，其中，反馈信息f的长度 偏移值有序集合
在本示例中，整数偏移值Q(1)、Q(2)、Q(3)的Nf＝7比特二进制表示对应的偏移值比特序列分别为
[q(1,1),q(1,2),q(1,3),q(1,4),q(1,5),q(1,6),q(1,7)]＝[0,0,0,0,0,0,1]、
[q(2,1),q(2,2),q(2,3),q(2,4),q(2,5),q(2,6),q(2,7)]＝[0,0,0,1,0,0,1]、
[q(3,1),q(3,2),q(3,3),q(3,4),q(3,5),q(3,6),q(3,7)]＝[0,1,0,1,0,0,1]。
中间码字c由基站根据下述参数确定：传输块标识有序集合大小Na＝8、传输块错误图样a、正确传输块数目P＝2和最大正确传输块数目Pmax＝3，其中，中间码字c为长度Nc＝Nf＝7的比特序列。
在本示例中，输块差错图样a由基站根据以下参数传确定：传输块标识有序集合I、传输块标识有序集合大小Na＝8、正确传输块标识集合BI，其中，传输块差错图样a为长度Na＝8的比特序列。
在传输块差错图样中，表示正确应答ACK的比特“ack”为比特“1”，表示错误应答NACK的比特“nack”为比特“0”。
图15是本申请示例提供的正确传输块数目P、正确传输块集合BI、传输块错误图样a、中间码字c、偏移值比特序列[q(P,1),q(P,2),q(P,3),q(P,4),q(P,5),q(P,6),q(P,7)]和反馈信息f的映射关系，如图15所示的映射关系(图中仅示出本示例中涉及的映射关系)，基站按照下述方法确定反馈信息f：
基站根据传输块标识有序集合I、传输块标识有序集合大小Na＝8和述正确传输块标识集合BI确定输块差错图样a＝[0,1,1,0,0,0,0,0]；
如图12所示，基站对传输块错误图样a＝[0,1,1,0,0,0,0,0]进行压缩编码得到中间码字c＝[0,0,1,0,1,1,1]，其中，基站对传输块错误图样a进行压缩编码是指把个长度为Na＝8的包含P＝2个比特“1”的比特序列映射到长度为的比特序列的算术编码，其中，中间码字c包括长度为 的全零序列。
按照下述程序流程执行过程，基站根据中间码字c＝[0,0,1,0,1,1,1]加上整数偏移值Q(2)的Nf＝7比特二进制表示的偏移值比特序列[q(2,1),q(2,2),q(2,3),q(2,4),q(2,5),q(2,6),q(2,7)]，得到反馈信息f＝[0,1,0,0,0,0,0]。
在本示例中，基站发送包含反馈信息f＝[0,1,0,0,0,0,0]的信号给终端序列<SN(1),SN(2),SN(3),SN(4)>。终端序列<SN(1),SN(2),SN(3),SN(4)>接收包含反馈信息f的信号。终端SN(1),SN(2),SN(3),SN(4)分别对包含反馈信息f的信号进行解码，按照下面的方法确定传输块b(1),b(2),b(3),b(4)的应答：
如果终端SN(1)解码失败，则终端SN(1)确定传输块b(1)的应答为错误应答NACK；如果终端SN(1)解码成功，得到正确传输块标识集合BI，终端SN(1)判断终端SN(1)的用户标识4不属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为错误应答NACK。
如果终端SN(2)解码失败，则终端SN(2)确定传输块b(2)的应答为错误应答NACK；如果终端SN(2)解码成功，得到正确传输块标识集合BI，终端SN(2)判断终端SN(2)的用户标识3属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为正确应答ACK。
如果终端SN(3)解码失败，则终端SN(3)确定传输块b(3)的应答为错误应答NACK；如果终端SN(3)解码成功，得到正确传输块标识集合BI，终端SN(3)判断终端SN(3)的用户标识2属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为正确应答ACK。
如果终端SN(4)解码失败，则终端SN(4)确定传输块b(4)的应答为错误应答NACK；如果终端SN(4)解码成功，得到正确传输块标识集合BI，终端SN(4)判断终端SN(4)的用户标识5不属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为错误应答NACK。
示例2：
本示例与示例1的区别在于，在本示例中，对于t＝1,2,3,4，终端SN(t)的用户标识为临时小区RNTI(Temporary Cell RNTI，TC-RNTI)。中间码字c为长度 的比特序列。
本示例与示例1的另一个区别在于，在本示例中，比特“ack”为比特“0”，比特“nack”为比特“1”。图16是本申请示例提供的正确传输块数目P、正确传输块集合BI、传输块错误图样a、中间码字c、偏移值比特序列[q(P,1),q(P,2),q(P,3),q(P,4),q(P,5),q(P,6),q(P,7)]和反馈信息f的映射关系，如图16所示的映射关系(图中仅示出本示例中涉及的映射关系)，基站按照下述方法确定反馈信息f：
基站根据传输块标识有序集合I、传输块标识有序集合大小Na＝8和正确传输块标识集合BI确定输块差错图样a＝[1,0,0,1,1,1,1,1]。
如图11所示，基站对传输块错误图样a＝[1,0,0,1,1,1,1,1]进行压缩编码得到中间码字c＝[0,1,0,0,1]，其中，基站对传输块错误图样a进行压缩编码是指把个长度为Na＝8的包含P＝2个比特“0”的比特序列映射到长度为的比特序列的算术编码；
如图13所示的程序流程图，按照下述流程，基站根据中间码字c＝[0,1,0,0,1]加上整数偏移值Q(2)的Nf＝7比特二进制表示的偏移值比特序列[q(2,1),q(2,2),q(2,3),q(2,4),q(2,5),q(2,6),q(2,7)]得到反馈信息f＝[0,0,1,0,0,1,0]。

基站发送包含反馈信息f＝[0,0,1,0,0,1,0]的信号给终端序列<SN(1),SN(2),SN(3),SN(4)>。
上述示例提供的信息传输方法中，中间码字c没有包括长度为的全零序列，减少了存储开销，节约可存储资源，提高信息传输效率。
示例3：
本示例与示例1的区别在于，本示例中，第一节点为中继。对于t＝1,2,3,4，终端SN(t)的用户标识为小区RNTI(Cell RNTI，C-RNTI)。
本示例与示例1的另一个区别在于，在本示例中，反馈信息f由中继根据下述参数进行压缩编码确定：最大正确传输块数目Pmax＝3、传输块标识有序集合大小Na＝8、正确传输块标识集合BI、正确传输块数目P＝2、传输块差错图样a、偏移值有序集合Q，其中，反馈信息f的长度偏移值有序集合
根据图15所示的映射关系，中继按照下述方法确定反馈信息f：
中继根据传输块标识有序集合大小Na＝8和正确传输块标识集合BI确定输块差错图样a＝[0,1,1,0,0,0,0,0]；
按照如图7所示的程序流程，中继对传输块错误图样a＝[0,1,1,0,0,0,0,0]进行压缩编码得到反馈信息f＝[0,1,0,0,0,0,0]，其中，中继对传输块错误图样a进行压缩编码是指把个长度为Na＝8的至多包含Pmax＝3个比特“1”的传输块差错图样映射到长度为Nf＝7的比特序列的编码方法；其中，图8所示的程序流程图中
上述示例提供的信息传输方法中，没有了中间码字的存储开销，节约可存储资源，提高了传输效率。
示例4：
本示例与示例1的区别在于，在本示例中，对于t＝1,2,3,4，终端SN(t)的用户标识为调制编码方式小区RNTI(Modulcation Coding Scheme Cell RNTI，MCS-C-RNTI)。
在本示例中，反馈信息f由基站根据下述参数进行压缩编码确定：最大正确传输块数目Pmax＝3、传输块标识有序集合I、传输块标识有序集合大小Na＝8、正确传输块标识集合BI、正确传输块数目P＝2、传输块差错图样a、偏移值有序集合Q，其中，反馈信息f的长度偏移值有序集合
整数偏移值Q(1)、Q(2)、Q(3)的Nf＝7比特二进制表示的偏移值比特序列分别为：
[q(1,1),q(1,2),q(1,3),q(1,4),q(1,5),q(1,6),q(1,7)]＝[0,0,0,0,0,0,0]、
[q(2,1),q(2,2),q(2,3),q(2,4),q(2,5),q(2,6),q(2,7)]＝[0,0,0,1,0,0,0]、
[q(3,1),q(3,2),q(3,3),q(3,4),q(3,5),q(3,6),q(3,7)]＝[0,1,0,1,0,0,0]。
图17是本申请示例提供的正确传输块数目P、正确传输块集合BI、传输块错误图样a、中间码字c、偏移值比特序列[q(P,1),q(P,2),q(P,3),q(P,4),q(P,5),q(P,6),q(P,7)]和反馈信息f的映射关系，如图17所示的映射关系(图中仅示出本示例中涉及的映射关系)，基站按照下面的方法确定反馈信息f：
基站根据传输块标识有序集合I、传输块标识有序集合大小Na＝8和正确传输块标识集合BI确定输块差错图样a＝[0,1,1,0,0,0,0,0]。
按照图8所示的程序流程，基站对传输块错误图样a＝[0,1,1,0,0,0,0,0]进行压缩编码得到反馈信息f＝[0,0,1,1,1,1,1]，其中，基站对传输块错误图样a进行压缩编码是指把个长度为Na＝8的包含至多Pmax＝3个比特“1”且至少1个比特“1”的传输块差错图样映射到长度为Nf＝7的比特序列的编码方法，
本示例与示例1的另一个区别在于，在本示例中，如果正确传输块数目P为0，反馈信息f的长度Nf为0，反馈信息f为空序列，包含反馈信息f的信号为零功率信号。
上述示例提供的信息传输方法中，当正确传输块数目P为0，反馈信息f为零功率信号，减少能量消耗。这样做能够在竞争式免调度随机接入中，第一节点不能预先知道当前时隙是否有用户发送信息，因此，第一节点在每个时隙都需要进行信号接收、信号解码和应答反馈处理，因此在第一节点没有正确接收任何一个传输块时，第一节点反馈零功率信号，即不进行应答反馈处理，能够节省第一节点的功耗。
示例5：
本示例与示例1的区别在于，在本示例中，对于t＝1,2,3,4，终端SN(t)的用户标识为配置调度RNTI(Configured Scheduling RNTI，CS-RNTI)。
反馈信息f由基站根据下述参数进行压缩编码确定：最大正确传输块数目Pmax＝3、传输块标识有序集合I、传输块标识有序集合大小Na＝8、正确传输块标识集合BI、正确传输块数目P＝2、中间码字c、偏移值有序集合Q，其中，反馈信息f的长度 偏移值有序集合
本示例与示例1的另一个区别在于，在本示例中，整数偏移值Q(1)、Q(2)、Q(3)的Nf＝7比特二进制表示的偏移值比特序列分别为：
[q(1,1),q(1,2),q(1,3),q(1,4),q(1,5),q(1,6),q(1,7)]＝[0,0,0,0,0,0,0]、
[q(2,1),q(2,2),q(2,3),q(2,4),q(2,5),q(2,6),q(2,7)]＝[0,0,0,1,0,0,0]、
[q(3,1),q(3,2),q(3,3),q(3,4),q(3,5),q(3,6),q(3,7)]＝[0,1,0,1,0,0,0]。
中间码字c由基站根据下面的参数确定：传输块标识有序集合大小Na＝8、正确传输块数目P＝2和最大正确传输块数目Pmax＝3，中间码字c为长度Nc＝Nf＝7的比特序列。
根据图17所示的映射关系，基站按照下述方法确定反馈信息f：
根据图10所示的程序流程，基站对正确传输块标识集合BI＝{2,3}进行压缩编码得到中间码字c＝[0,0,1,0,1,1,1]，其中，基站对正确传输块标识集合BI＝{2,3}进行压缩编码是指把个包含P＝2个元素的正确传输块标识集合映射到长度为 的比特序列的算术编码；其中，中间码字c＝[0,0,1,0,1,1,1]的前 个比特为全零序列。
如图17所示，按照下述方法，基站根据中间码字c＝[0,0,1,0,1,1,1]加上整数偏移值Q(2)的Nf＝7比特二进制表示的偏移值比特序列[q(2,1),q(2,2),q(2,3),q(2,4),q(2,5),q(2,6),q(2,7)]得到反馈信息f＝[0,0,1,1,1,1,1]。

基站发送包含反馈信息f＝[0,0,1,1,1,1,1]的信号给终端序列<SN(1),SN(2),SN(3),SN(4)>。
上述示例提供的信息传输方法中，当正确传输块数目P为0，反馈信息f为零功率信号，减少能量消耗。同时，因为Nf的长度一般远小于Na，本示例直接用正确传输块标识集合确定中间码字c，降低了存储空间。
实例6：
在本示例中，第一节点为基站，第二节点为终端，因为具有多个终端，构成了终端序列，传输块标识为用户标识。
图18是本申请示例提供的第二节点、传输块、用户标识、随机接入标签和标签索引的关系示意图，如图18所示，基站接收终端序列发送的包含传输块集合B的信号，其中，终端序列包括Nu＝4个终端SN(1),SN(2),SN(3),SN(4)，传输块集合B包括Nb＝4个传输块b(1),b(2),b(3),b(4)。包含传输块集合B的信号包括包含传输块b(1)的信号、包含传输块b(2)的信号、包含传输块b(3)的信号和包含传输块b(4)的信号。
在本示例中，对于t＝1,2,3,4，传输块集合B中的传输块b(t)由终端序列中的终端SN(t)向基站发送，其中，传输块集合B中的传输块b(t)包括终端SN(t)的用户标识和随机接入标签。
在本示例中，终端SN(t)的用户标识为永久设备标识符(Permanent Equipment Identifier，PEI)，随机接入标签为参考信号(Reference Signal)。终端SN(1),SN(2),SN(3),SN(4)的用户标识分别为4,3,2,5，其中，用户标识4,3,2,5为传输块标识有序集合I＝<I(1),I(2),I(3),I(4),I(5),I(6),I(7),I(8)>＝<1,2,3,4,5,6,7,8>的元素。传输块标识有序集合I包括Na＝8个用户标识1,2,3,4,5,6,7,8。
在本示例中，参考信号是随机接入标签有序集合的元素。随机接入标签有序集合包括6个参考信号r(1),r(2),r(3),r(4),r(5),r(6)，其中，参考信号r(1),r(2),r(3),r(4),r(5),r(6)的标签索引分别为0,1,2,3,4,5。传输块b(1),b(2),b(3),b(4)包括的随机接入标签由终端SN(1),SN(2),SN(3),SN(4)分别根据终端SN(1),SN(2),SN(3),SN(4)的用户标识4,3,2,5是按照下述方式确定的：
传输块b(t)包括的参考信号的标签索引＝终端SN(t)的用户标识的平方除以6的余数。
把终端SN(1),SN(2),SN(3),SN(4)的用户标识4,3,2,5分别代入上式，得到终端SN(1),SN(2),SN(3),SN(4)的参考信号的标签索引分别为4,3,4,1，最终得到终端SN(1),SN(2),SN(3),SN(4)的参考信号分别为r(5),r(4),r(5),r(2)。
在本示例中，最大正确传输块数目Pmax＝3由基站配置。正确传输块标识集合是指传输块集合中正确接收的传输块所包括的用户标识的集合。基站根据包含传输块集合B的信号确定：正确传输块标识集合为集合BI＝{2,3}、正确传输块数目P＝2。
在本示例中，反馈信息f由基站根据下述参数进行压缩编码确定：最大正确传输块数目Pmax＝3、传输块标识有序集合I、传输块标识有序集合大小Na＝8、正确传输块标识集合BI、正确传输块数目P＝2、中间码字c、偏移值有序集合Q，其中，反馈信息f的长度 偏移值有序集合
在本示例中，整数偏移值Q(1)、Q(2)、Q(3)的Nf＝7比特二进制表示的偏移值比特序列分别为：
[q(1,1),q(1,2),q(1,3),q(1,4),q(1,5),q(1,6),q(1,7)]＝[0,0,0,0,0,0,0]、
[q(2,1),q(2,2),q(2,3),q(2,4),q(2,5),q(2,6),q(2,7)]＝[0,0,0,1,0,0,0]、
[q(3,1),q(3,2),q(3,3),q(3,4),q(3,5),q(3,6),q(3,7)]＝[0,1,0,1,0,0,0]。
在本示例中，中间码字c由基站根据下面的参数确定：传输块标识有序集合大小Na＝8、正确传输块数目P＝2和最大正确传输块数目Pmax＝3，中间码字c为长度 的比特序列。
在本示例中，比特“ack”为比特“1”，比特“nack”为比特“0”。
图19本申请示例提供的正确传输块数目P、正确传输块集合BI、传输块错误图样a、中间码字c、偏移值比特序列[q(P,1),q(P,2),q(P,3),q(P,4),q(P,5),q(P,6),q(P,7)]和反馈信息f的映射关系，如图19所示的映射关系(图中仅示出本示例中涉及的映射关系)，基站按照下述方法确定反馈信息f：
如图9所示，基站对正确传输块标识集合BI＝{2,3}进行压缩编码得到中间码字c＝[1,0,1,1,1]，其中，基站对正确传输块标识集合BI＝{2,3}进行压缩编码是指把个包含P＝2个元素的正确传输块标识集合映射到长度为的比特序列的算术编码。
基站按照下述方法根据中间码字c＝[1,0,1,1,1]加上整数偏移值Q(2)的Nf＝7比特二进制表示的偏移值比特序列[q(2,1),q(2,2),q(2,3),q(2,4),q(2,5),q(2,6),q(2,7)]得到反馈信息f＝[0,0,1,1,1,1,1]。

在本示例中，基站发送包含反馈信息f＝[0,0,1,1,1,1,1]的信号给终端序列<SN(1),SN(2),SN(3),SN(4)>。终端序列<SN(1),SN(2),SN(3),SN(4)>接收包含反馈信息f的信号。终端SN(1),SN(2),SN(3),SN(4)分别对包含反馈信息f的信号进行解码，按照下面的方法确定传输块b(1),b(2),b(3),b(4)的应答：
如果终端SN(1)解码失败，则终端SN(1)确定传输块b(1)的应答为错误应答NACK；如果终端SN(1)解码成功，得到正确传输块标识集合BI，终端SN(1)判断终端SN(1)的用户标识4不属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为错误应答NACK。
如果终端SN(2)解码失败，则终端SN(2)确定传输块b(2)的应答为错误应答NACK；如果终端SN(2)解码成功，得到正确传输块标识集合BI，终端SN(2)判断终端SN(2)的用户标识3属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为正确应答ACK。
如果终端SN(3)解码失败，则终端SN(3)确定传输块b(3)的应答为错误应答NACK；如果终端SN(3)解码成功，得到正确传输块标识集合BI，终端SN(3)判断终端SN(3)的用户标识2属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为正确应答ACK。
如果终端SN(4)解码失败，则终端SN(4)确定传输块b(4)的应答为错误应答NACK；如果终端SN(4)解码成功，得到正确传输块标识集合BI，终端SN(4)判断终端SN(4)的用户标识5不属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为错误应答NACK。
上述示例提供的信息传输方法中，中间码字c没有包括长度为的全零序列，又进一步降低了存储空间。
示例7：
在本示例中，第一节点为基站，第二节点为终端，因为具有多个终端，构成了终端序列，传输块标识为标签索引。
图20是本申请示例提供的第二节点、传输块、用户标识、随机接入标签和标签索引的关系示意图，如图20所示，基站接收终端序列发送的包含传输块集合B的信号，其中，终端 序列包括Nu＝4个终端SN(1),SN(2),SN(3),SN(4)，传输块集合B包括Nb＝4个传输块b(1),b(2),b(3),b(4)。进一步地，包含传输块集合B的信号包括包含传输块b(1)的信号、包含传输块b(2)的信号、包含传输块b(3)的信号和包含传输块b(4)的信号。
在本示例中，对于t＝1,2,3,4，传输块集合B中的传输块b(t)由终端序列中的终端SN(t)向基站发送，其中，传输块集合B中的传输块b(t)包括终端SN(t)的用户标识和随机接入标签。
在本示例中，终端SN(t)的用户标识为通用公共订阅标识符(Generic Public Subscription Identifier，GPSI)，随机接入标签为前导码(Preamble)。进一步地，终端SN(1),SN(2),SN(3),SN(4)的用户标识分别为4,3,2,5。
在本示例中，前导码是随机接入标签有序集合的元素。进一步地，随机接入标签有序集合包括Na＝6个前导码r(1),r(2),r(3),r(4),r(5),r(6)，其中，前导码r(1),r(2),r(3),r(4),r(5),r(6)的标签索引分别为1,2,3,4,5,6。前导码r(1),r(2),r(3),r(4),r(5),r(6)的标签索引1,2,3,4,5,6为传输块标识有序集合I＝<I(1),I(2),I(3),I(4),I(5),I(6)>＝<1,2,3,4,5,6>的元素。传输块标识有序集合I包括Na＝6个标签索引1,2,3,4,5,6。传输块b(1),b(2),b(3),b(4)包括的随机接入标签由终端SN(1),SN(2),SN(3),SN(4)分别根据终端SN(1),SN(2),SN(3),SN(4)的用户标识4,3,2,5按照下述方式确定的前导码：
终端SN(1),SN(2),SN(3),SN(4)分别把终端SN(1),SN(2),SN(3),SN(4)的用户标识4,3,2,5作为伪随机序列发生器(Pseudo-Random Sequence Generator)的随机数种子的一部分得到终端SN(1),SN(2),SN(3),SN(4)的前导码的标签索引分别为4,3,2,1，得到传输块b(1),b(2),b(3),b(4)包括的前导码分别为r(4),r(3),r(2),r(1)。
在本示例中，最大正确传输块数目Pmax＝3由高层参数(higher layer parameters)配置。在本示例中，正确传输块标识集合是指传输块集合中正确接收的传输块所包括的随机接入标签的标签索引的集合。在本示例中，基站根据包含传输块集合B的信号确定：正确传输块标识集合为集合BI＝{2,3}、正确传输块数目P＝2。
在本示例中，反馈信息f由基站根据下述参数进行压缩编码确定：最大正确传输块数目Pmax＝3、传输块标识有序集合I、传输块标识有序集合大小Na＝6、正确传输块标识集合BI、正确传输块数目P＝2、偏移值有序集合Q，其中，反馈信息f的长度Nf＝偏移值有序集合
在本示例中，整数偏移值Q(1)、Q(2)、Q(3)的Nf＝6比特二进制表示的偏移值比特序列分别为：
[q(1,1),q(1,2),q(1,3),q(1,4),q(1,5),q(1,6)]＝[0,0,0,0,0,0]、
[q(2,1),q(2,2),q(2,3),q(2,4),q(2,5),q(2,6)]＝[0,0,1,0,0,0]、
[q(3,1),q(3,2),q(3,3),q(3,4),q(3,5),q(3,6)]＝[0,1,1,0,0,0]。
在本示例中，比特“ack”为比特“1”，比特“nack”为比特“0”。基站按照下述方法确定反馈 信息f：
按照如图4所示的程序流程，基站对正确传输块标识集合BI进行压缩编码得到反馈信息f＝[0,1,0,0,1,0]，其中，正确传输块标识集合BI进行压缩编码是指把 个包含至多Pmax＝3个元素且至少1个元素的正确传输块标识集合映射到长度为Nf＝6的比特序列的编码方法，其中，码字映射关系如图21所示(图中仅示出本示例中涉及的映射关系)，
在本示例中，基站发送包含反馈信息f＝[0,1,0,0,1,0]的信号给终端序列<SN(1),SN(2),SN(3),SN(4)>。终端序列<SN(1),SN(2),SN(3),SN(4)>接收包含反馈信息f的信号。终端SN(1),SN(2),SN(3),SN(4)分别对包含反馈信息f的信号进行解码，按照下面的方法确定传输块b(1),b(2),b(3),b(4)的应答：
如果终端SN(1)解码失败，则终端SN(1)确定传输块b(1)的应答为错误应答NACK；如果终端SN(1)解码成功，得到正确传输块标识集合BI，终端SN(1)判断传输块b(1)包括的随机接入标签的标签索引4不属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为错误应答NACK。
如果终端SN(2)解码失败，则终端SN(2)确定传输块b(2)的应答为错误应答NACK；如果终端SN(2)解码成功，得到正确传输块标识集合BI，终端SN(2)判断传输块b(2)包括的随机接入标签的标签索引3属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为正确应答ACK。
如果终端SN(3)解码失败，则终端SN(3)确定传输块b(3)的应答为错误应答NACK；如果终端SN(3)解码成功，得到正确传输块标识集合BI，终端SN(3)判断传输块b(3)包括的随机接入标签的标签索引2属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为正确应答ACK。
如果终端SN(4)解码失败，则终端SN(4)确定传输块b(4)的应答为错误应答NACK；如果终端SN(4)解码成功，得到正确传输块标识集合BI，终端SN(4)判断述传输块b(4)包括的随机接入标签的标签索引1不属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为错误应答NACK。
上述示例提供的信息传输方法中，没有了中间码字c，又进一步降低了存储空间。在本示例中，用户标识数量一般远大于随机接入标签的数量，在标签碰撞概率满足要求的情况下，使用标签索引作为传输快标识可以减少反馈信息f的长度，进一步降低反馈资源的使用。而本示例中采用的通过伪随机数产生器产生随机接入标签，能够避免标签碰撞。
示例8：
在本示例中，第一节点为基站，第二节点为终端，因为具有多个终端，构成了终端序列传输块标识为标签索引。
图22是本申请示例提供的第二节点、传输块、随机接入标签和标签索引的关系示意图， 如图22所示，基站接收终端序列发送的包含传输块集合B的信号，其中，终端序列包括Nu＝3个终端SN(1),SN(2),SN(3)，传输块集合B包括Nb＝4个传输块b(1),b(2),b(3),b(4)。包含传输块集合B的信号包括包含传输块b(1)的信号、包含传输块b(2)的信号、包含传输块b(3)的信号和包含传输块b(4)的信号。
在本示例中，传输块集合B中的传输块b(1),b(2),b(3),b(4)分别由终端序列中的终端SN(1),SN(2),SN(3),SN(1)向基站发送，传输块集合B中的传输块b(1),b(2),b(3),b(4)包括随机接入标签；其中，随机接入标签为交织器(Interleaver)。
在本示例中，交织器是随机接入标签有序集合的元素。随机接入标签有序集合包括Na＝5个交织器r(1),r(2),r(3),r(4),r(5)，其中，交织器r(1),r(2),r(3),r(4),r(5)的标签索引分别为1,2,3,4,5。交织器r(1),r(2),r(3),r(4),r(5)的标签索引1,2,3,4,5为传输块标识有序集合I＝<I(1),I(2),I(3),I(4),I(5)>＝<1,2,3,4,5>的元素。传输块标识有序集合I包括Na＝5个标签索引1,2,3,4,5。
在本示例中，传输块b(1),b(2),b(3),b(4)包括的随机接入标签由终端SN(1),SN(2),SN(3),SN(1)根据高层参数(higher layer parameters)分别确定为r(4),r(3),r(2),r(1)，其中，传输块b(1),b(2),b(3),b(4)包括的随机接入标签的标签索引分别为4,3,2,1。
在本示例中，最大正确传输块数目Pmax＝2由高层参数配置。在本示例中，正确传输块标识集合是指传输块集合中正确接收的传输块所包括的随机接入标签的标签索引的集合。在本示例中，基站根据包含传输块集合B的信号确定：正确传输块标识集合为集合BI＝{2,3}、正确传输块数目P＝2。
在本示例中，反馈信息f由基站根据下面的参数进行压缩编码确定：最大正确传输块数目Pmax＝2、传输块标识有序集合I、传输块标识有序集合大小Na＝5、正确传输块标识集合BI、正确传输块数目P＝2、偏移值有序集合Q，其中，反馈信息f的长度 偏移值有序集合
在本示例中，整数偏移值Q(1)、Q(2)的Nf＝5比特二进制表示的偏移值比特序列分别为：
[q(1,1),q(1,2),q(1,3),q(1,4),q(1,5)]＝[0,0,0,0,1]、
[q(2,1),q(2,2),q(2,3),q(2,4),q(2,5)]＝[0,1,0,0,1]。
在本示例中，比特“ack”为比特“1”，比特“nack”为比特“0”。基站按照下面的方法确定反馈信息f：
按照如图3所示的程序流程，基站对正确传输块标识集合BI进行压缩编码得到反馈信息f＝[1,0,0,1,0]，其中，正确传输块标识集合BI进行压缩编码是指把 个包含至多Pmax＝2个元素的正确传输块标识集合映射到长度为Nf＝5的比特序列的编 码方法，其中，码字映射关系如图23所示，
在本示例中，基站发送包含反馈信息f＝[1,0,0,1,0]的信号给终端序列<SN(1),SN(2),SN(3),SN(1)>。终端序列<SN(1),SN(2),SN(3),SN(1)>接收包含反馈信息f的信号。终端SN(1),SN(2),SN(3),SN(1)分别对包含反馈信息f的信号进行解码，按照下面的方法确定传输块b(1),b(2),b(3),b(4)的应答：
如果终端SN(1)解码失败，则终端SN(1)确定传输块b(1)和b(4)的应答为错误应答NACK；如果终端SN(1)解码成功，得到正确传输块标识集合BI，终端SN(1)判断传输块b(1)包括的随机接入标签的标签索引4不属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为错误应答NACK；终端SN(1)判断传输块b(4)包括的随机接入标签的标签索引1不属于正确传输块标识集合BI，终端SN(1)确定传输块b(4)的应答为错误应答NACK。
如果终端SN(2)解码失败，则终端SN(2)确定传输块b(2)的应答为错误应答NACK；如果终端SN(2)解码成功，得到正确传输块标识集合BI，终端SN(2)判断传输块b(2)包括的随机接入标签的标签索引3属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为正确应答ACK。
如果终端SN(3)解码失败，则终端SN(3)确定传输块b(3)的应答为错误应答NACK；如果终端SN(3)解码成功，得到正确传输块标识集合BI，终端SN(3)判断传输块b(3)包括的随机接入标签的标签索引2属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为正确应答ACK。
上述示例提供的信息传输方法中，终端SN(1)发送了两个传输块b(1)和b(4)，但选取了不同的随机接入标签；基站根据正确译码的传输块的随机接入标签的标签索引来确定反馈信息f，使得终端SN(1)可以区分两个传输块b(1)和b(4)是否被正确接收。同时，由于标签索引的数目一般小于用户标识的数目，因此也能减少反馈信息f的长度。
示例9：
本示例与示例8的区别在于，在本示例中，随机接入标签为扩频序列(Spread Spectrum Sequence)。
在本示例中，反馈信息f由基站根据下面的参数进行压缩编码确定：最大正确传输块数目Pmax＝2、传输块标识有序集合I、传输块标识有序集合大小Na＝5、正确传输块标识集合BI、正确传输块数目P＝2、偏移值有序集合Q，其中，反馈信息f的长度 偏移值有序集合
在本示例中，如图24所示的映射关系，基站按照下面的方法确定反馈信息f：图25是本申请示例提供的由正确传输块标识集合确定反馈信息的流程示意图，按照如图25所示的程序 流程，基站对正确传输块标识集合BI进行压缩编码得到反馈信息f＝[1,0,1,1]，其中，正确传输块标识集合BI进行压缩编码是指把个包含至多Pmax＝2个元素的正确传输块标识集合映射到长度为Nf＝4的比特序列的编码方法，floor(F/2)表示小于或等于F/2的最大整数。
基站发送包含反馈信息f＝[1,0,1,1]的信号给终端序列<SN(1),SN(2),SN(3),SN(1)>。
上述示例提供的信息传输方法中，反馈信息f的长度Nf进一步得到了缩短。
示例10：
本示例与示例8的区别在于，在本示例中，随机接入标签为稀疏码序列(Sparse Code Sequence)。
反馈信息f由基站根据下面的参数进行压缩编码确定：最大正确传输块数目Pmax＝2、传输块标识有序集合I、传输块标识有序集合大小Na＝5、正确传输块标识集合BI、正确传输块数目P＝2、偏移值有序集合Q，其中，反馈信息f的长度 偏移值有序集合
本示例与示例8的又一个区别在于，在本示例中，根据图26所示的映射关系，基站按照下面的方法确定反馈信息f：按照如图27所示的程序流程，基站对正确传输块标识集合BI进行压缩编码得到反馈信息f＝[1,0,1,0]，其中，正确传输块标识集合BI进行压缩编码是指把个包含至多Pmax＝2个元素且至少1个元素的正确传输块标识集合映射到长度为Nf＝4的比特序列的编码方法。
基站发送包含反馈信息f＝[1,0,1,0]的信号给终端序列<SN(1),SN(2),SN(3),SN(1)>。
上述示例提供的信息传输方法中，使得反馈信息f的长度Nf进一步得到了缩短，并且当正确传输块数目等于0时，反馈信息f的长度Nf＝0，包含反馈信息f的信号是零功率信号，节省发送能量。
示例11：
本示例与示例8的区别在于，在本示例中，随机接入标签为加扰序列(Scrambling Sequence)。加扰序列是随机接入标签有序集合的元素。随机接入标签有序集合包括Na＝5个加扰序列r(1),r(2),r(3),r(4),r(5)，其中，加扰序列r(1),r(2),r(3),r(4),r(5)的标签索引分别为0,1,2,3,4。加扰序列r(1),r(2),r(3),r(4),r(5)的标签索引0,1,2,3,4为传输块标识有序集合I＝<I(1),I(2),I(3),I(4),I(5)>＝<0,1,2,3,4>的元素。传输块标识有序集合I包括Na＝5个标签索引0,1,2,3,4。传输块b(1),b(2),b(3),b(4)包括的随机接入标签的标签索引分别为3,2,1,0，如图28所示。
本示例与示例8的又一个区别在于，在本示例中，基站根据包含传输块集合B的信号确定：正确传输块标识集合为空集Φ、正确传输块数目P＝0。
反馈信息f由基站根据下面的参数进行压缩编码确定：正确传输块标识集合Φ、正确传输块数目P＝0，其中，反馈信息f的长度Nf＝0。
在本示例中，比特“ack”为比特“1”，比特“nack”为比特“0”。基站按照下面的方法确定反馈信息f：基站根据正确传输块标识集合为空集Φ(或者正确传输块数目P＝0)确定反馈信息f为空序列。基站确定包含反馈信息f的信号为零功率信号。
在本示例中，基站发送包含反馈信息f的零功率信号给终端序列<SN(1),SN(2),SN(3),SN(1)>。终端序列<SN(1),SN(2),SN(3),SN(1)>接收包含反馈信息f的零功率信号。终端SN(1)解码失败，确定传输块b(1)和b(4)的应答为错误应答NACK；终端SN(2)解码失败，确定传输块b(2)的应答为错误应答NACK；终端SN(3)解码失败，确定传输块b(3)的应答为错误应答NACK。
上述示例提供的信息传输方法中，正确传输块标识集合为空集，基站发送包含反馈信息f的零功率信号，即不发送信号，减少了基站的功耗。
示例12：
本示例与示例1的区别在于，在本示例中，传输块标识为用户标识的索引值。图29是本申请示例提供的第二节点、传输块、用户标识和用户标识的索引值的关系的示意图，如图29所示，基站接收终端序列发送的包含传输块集合B的信号，其中，终端序列包括Nu＝4个终端SN(1),SN(2),SN(3),SN(4)，传输块集合B包括Nb＝4个传输块b(1),b(2),b(3),b(4)。包含传输块集合B的信号包括包含传输块b(1)的信号、包含传输块b(2)的信号、包含传输块b(3)的信号和包含传输块b(4)的信号。
本示例与示例1的另一个区别在于，在本示例中，对于t＝1,2,3,4，传输块集合B中的传输块b(t)由终端序列中的终端SN(t)向基站发送，传输块集合B中的传输块b(t)包括终端SN(t)的用户标识，终端SN(t)的用户标识为随机接入RNTI(Random Access RNTI,RA-RNTI)。终端SN(1),SN(2),SN(3),SN(4)的用户标识分别为13,10,6,51，其中，用户标识13,10,6,51为用户标识有序集合ID＝<ID(1),ID(2),ID(3),ID(4),ID(5),ID(6),ID(7),ID(8)>＝<7,42,6,10,13,51,19,63>的元素，用户标识13,10,6,51的用户标识的索引值分别为4,3,2,5。进一步地，用户标识有序集合ID中的用户标识7,42,6,10,13,51,19,63的索引值分别为传输块标识有序集合I＝<I(1),I(2),I(3),I(4),I(5),I(6),I(7),I(8)>＝<1,2,3,4,5,6,7,8>的元素I(1),I(2),I(3),I(4),I(5),I(6),I(7),I(8)，其中，Na＝8是传输块标识有序集合大小，也是用户标识有序集合大小。
本示例与示例1的又一个区别在于，在本示例中，正确传输块标识集合是指传输块集合中正确接收的传输块包括的用户标识的索引值的集合。
本示例与示例1的再一个区别在于，在本示例中，终端序列<SN(1),SN(2),SN(3),SN(4)>接收包含反馈信息f的信号。终端SN(1),SN(2),SN(3),SN(4)分别对包含反馈信息f的信号进行解码，按照下面的方法确定传输块b(1),b(2),b(3),b(4)的应答：
如果终端SN(1)解码失败，则终端SN(1)确定传输块b(1)的应答为错误应答NACK；如果终端SN(1)解码成功，得到正确传输块标识集合BI，终端SN(1)判断终端SN(1)的用户标识的索引值4不属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为错误应答NACK。
如果终端SN(2)解码失败，则终端SN(2)确定传输块b(2)的应答为错误应答NACK；如果终端SN(2)解码成功，得到正确传输块标识集合BI，终端SN(2)判断终端SN(2)的用户标识的索引值3属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为正确应答ACK。
如果终端SN(3)解码失败，则终端SN(3)确定传输块b(3)的应答为错误应答NACK；如果终端SN(3)解码成功，得到正确传输块标识集合BI，终端SN(3)判断终端SN(3)的用户标识的索引值2属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为正确应答ACK。
如果终端SN(4)解码失败，则终端SN(4)确定传输块b(4)的应答为错误应答NACK；如果终端SN(4)解码成功，得到正确传输块标识集合BI，终端SN(4)判断终端SN(4)的用户标识的索引值5不属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为错误应答NACK。
本示例的好处是，传输块标识使用用户标识的索引值，可以减少传输块标识有序集合大小。因为用户标识集合中的最大元素为63，若使用用户标识作为传输块标识，则需要传输块标识有序集合大小则需要Na＝63以涵盖所有小于或等于63的正整数表示的用户标识。但实际上，本示例中，用户标识取自于大小为8的用户标识有序集合ID，使用用户标识的索引值作为传输块标识可以大大减少传输块标识有序集合大小。
图30为本申请实施例提供的信息传输方法，具体包括步骤S5000以及步骤S6000。
步骤S5000：发送传输块给第一节点。
步骤S6000：接收第一节点发送的反馈信息；其中，反馈信息用于表征传输块的接收情况。
在一些实施例中，一个第二节点发送包含一个或多个传输块的信号给第一节点，一个或多个传输块在第一节点处构成传输块集合。在另一些实施例中，两个及以上第二节点可以向第一节点发送一个或多个传输块，这些传输块形成传输块集合。
在一些实施例中，当有多个第二节点向第一节点发送传输块时，这些发送传输块集合的第二节点构成第二节点序列。其中，第二节点序列包括Nu个第二节点，传输块集合包括Nb个传输块；其中，Nu和Nb是正整数，Nu小于或等于Nb。
在一些实施例中，传输块集合中的一个传输块包括传输块标识，传输块标识有序集合包括Na个传输块标识I(1),I(2),..,I(Na)，Na为传输块标识有序集合大小；对于i＝1,2,....,Na，传输块标识有序集合的第i个元素为I(i)；其中，传输块标识有序集合的第i个元素I(i)可以是整数i或整数i-1。
在一些实施例中，传输块通过传输块标识指示。
在一些实施例中，传输块标识可以是以下的其中一种：用户标识、用户标识的索引值、标签索引。
在一些实施例中，用户标识是第二节点序列的一个第二节点的用户标识，第二节点序列中的两个不同的第二节点的用户标识是不相同的，用户标识可用于第一节点在包含传输块集 合的信号中区分传输块集合中的不同传输块，用户标识为整数。
在一些实施例中，传输块标识为用户标识，传输块标识有序集合的元素为用户标识。一个具体的例子是：传输块标识有序集合I＝<I(1),I(2),I(3),I(4),I(5)>＝<0,1,2,3,4>；其中，传输块标识有序集合大小为Na＝5，传输块标识有序集合中的第2个元素I(2)对应的用户标识为1。另一个具体的例子是：传输块标识有序集合I＝<I(1),I(2),I(3),I(4),I(5)>＝<1,2,3,4,5>；其中，传输块标识有序集合大小为Na＝5，传输块标识有序集合中的第2个元素I(2)对应的用户标识为2。又一个具体的例子是：传输块标识有序集合I＝<I(1),I(2),I(3),I(4)>＝<0,11,20,30>；其中，传输块标识有序集合大小为Na＝4，传输块标识有序集合中的第2个元素I(2)对应的用户标识为11。
在一些实施例中，用户标识的索引值是指传输块标识有序集合I＝<I(1),I(2),.,I(Na)>中的元素I(k)的索引i，i＝1,2,....,Na，用户标识的索引值为整数。
在一些实施例中，传输块标识为用户标识的索引值，用户标识为用户标识有序集合中的元素，用户标识有序集合包括Na个用户标识ID(1),ID(2),...,ID(Na)；其中，Na为用户标识有序集合大小，也是传输块标识有序集合大小，i＝1,2,...,Na，用户标识有序集合中的第i个用户标识ID(i)对应的用户标识的索引值为传输块标识有序集合元素中的第i个元素I(i)。一个具体的例子是：用户标识有序集合ID＝<ID(1),ID(2),ID(3),ID(4)>＝<0,11,20,30>，对应的传输块标识有序集合I＝<I(1),I(2),I(3),I(4)>＝<0,1,2,3>；其中，用户标识有序集合大小和传输块标识有序集合大小都为Na＝4，用户标识有序集合中的元素ID(2)＝11的用户标识的索引值是传输块标识有序集合中的元素I(2)＝1。
在一些实施例中，传输块标识为标签索引，标签索引是随机接入标签(signature)的标签索引，即，传输块集合中的一个传输块包括随机接入标签，随机接入标签为随机接入标签有序集合的元素，随机接入标签有序集合包括Na个随机接入标签r(1),r(2),...,r(Na)；其中，Na为随机接入标签有序集合大小，也是传输块标识有序集合大小，i＝1,2,....,Na，随机接入标签有序集合中的第i个随机接入标签r(i)的标签索引为传输块标识有序集合的第i个元素I(i)，其中，传输块标识有序集合的第i个元素I(i)可以是整数i或整数i-1。
需要说明的是，用户标识可以是订阅永久标识符(Subscription Permanent Identifier，SUPI)、通用公共订阅标识符(Generic Public Subscription Identifier，GPSI)、永久设备标识符(Permanent Equipment Identifier，PEI)、网络接入标识(Network Access Identifier，NAI)、订阅隐藏标识符(Subscription Concealed Identifier，SUCI)、全球唯一临时标识(Globally Unique Temporary Identity，GUTI)、无线网络临时标识(Radio Network Temporary Identifier，RNTI)、***信息RNTI(System Information RNTI,SI-RNTI)、寻呼RNTI(Paging RNTI，P-RNTI)、随机接入RNTI(Random Access RNTI,RA-RNTI)、临时小区RNTI(Temporary Cell RNTI，TC-RNTI)、小区RNTI(Cell RNTI，C-RNTI)、上行控制信道发射功率控制RNTI(Transmit Power Control-PUCCH RNTI，TPC-PUCCH-RNTI)、上行共享信道发射功率控制RNTI(Transmit Power Control-PUSCH RNTI,TPC-PUSCH-RNTI)、信道探测参考信号发射功率控制RNTI(Transmit Power Control-Sounding Reference Symbols RNTI,TPC-SRS-RNTI)、中断RNTI(Interruption RNTI，INT-RNTI)、调制编码方式小区RNTI(Modulcation Coding Scheme  Cell RNTI，MCS-C-RNTI)、配置调度RNTI(Configured Scheduling RNTI，CS-RNTI)、时隙格式指示RNTI(Slot Format Indication RNTI，SFI-RNTI)、半持续RNTI(Semi-Persistent CSI RNTI，SP-CSI-RNTI)等。
需要说明的是，随机接入标签可以是导频(Pilot)、参考信号(Reference Signal)、前导码(Preamble)、扩频序列(Spread Spectrum Sequence)、交织器(Interleaver)、交织图样(Interleaver Pattern)、交织序列(Interleaver Sequence)、加扰序列(Scrambling Sequence)、稀疏码序列(Sparse Code Sequence)等。
在一些实施例中，第二节点根据其用户标识确定一个传输块的随机接入标签作为传输块集合中的一个传输块包括的随机接入标签，这些随机接入标签可用于第一节点在包含传输块集合的信号中区分传输块集合中的不同传输块。
在一些实施例中，第二节点根据高层参数(higher layer parameters)确定一个传输块包括的随机接入标签作为传输块集合中的一个传输块包括的随机接入标签，这些随机接入标签可用于第一节点在包含传输块集合的信号中区分传输块集合中的不同传输块。
需要说明的是，第一节点和第二节点可以是基站、中继、终端等任何具备数据接收和信令发送功能的网元。
需要说明的是，正确传输块集合的信息包括最大正确传输块数目Pmax、传输块标识有序集合、传输块标识有序集合大小Na、正确传输块标识集合、正确传输块数目P、中间码字c、传输块差错图样a、偏移值有序集合Q。需要说明的是，根据上述一种或多种正确传输块的信息即可得到反馈信息，即，反馈信息的生成不是一定需要上述全部信息。
在一些实施例中，最大正确传输块数目Pmax等于传输块标识有序集合大小Na；在另一些实施例中，最大正确传输块数目Pmax由第一节点配置；在又一些实施例中，最大正确传输块数目Pmax由高层参数预先配置。
在一些实施例中，正确传输块集合的信息为正确传输块标识集合，正确传输块标识集合为传输块集合中正确接收的传输块所包括的用户标识的集合。正确接收的传输块是指应答状态为正确应答ACK的传输块，一个用户标识属于正确传输块标识集合用于指示对应该用户标识的传输块的应答状态为正确应答ACK，一个用户标识不属于正确传输块标识集合用于指示对应该用户标识的传输块的应答状态为错误应答NACK。
在一些实施例中，正确传输块集合的信息为正确传输块标识集合，正确传输块标识集合为用户标识的索引值的集合。正确接收的传输块是指应答状态为正确应答ACK的传输块，一个用户标识的索引值属于正确传输块标识集合用于指示对应该用户标识的索引值的传输块的应答状态为正确应答ACK，一个用户标识的索引值不属于正确传输块标识集合用于指示对应该用户标识的索引值的传输块的应答状态为错误应答NACK。
在一些实施例中，正确传输块集合的信息为正确传输块标识集合，正确传输块标识集合为传输块集合中正确接收的传输块所对应的随机接入标签的标签索引的集合。正确接收的传输块是指应答状态为正确应答ACK的传输块，一个随机接入标签的标签索引属于正确传输块标识集合用于指示对应该随机接入标签的传输块的应答状态为正确应答ACK，一个随机接入标签的标签索引不属于正确传输块标识集合用于指示对应该随机接入标签的传输块的应答状 态为错误应答NACK。
示例13：
本示例中，从终端的角度来描述获得反馈信息f的过程。
在本示例中，如图22所示，终端序列接收基站发送的包含反馈信息f的信号，其中，终端序列包括Nu＝3个终端SN(1),SN(2),SN(3)，反馈信息f为传输块集合B的反馈信息；其中，反馈信息f为长度的比特序列；其中，传输块集合B由终端序列发送给基站，Na＝5为传输块标识有序集合的大小，Pmax＝2为最大正确传输块数目；其中，传输块集B包括Nb＝4个传输块b(1),b(2),b(3),b(4)；其中，反馈信息f由基站根据终端序列发送的包含传输块集合B的信号确定。
图31为本申请实施例提供的解码结果判断方法流程图，具体包括步骤S7100、步骤S7200、步骤S7300、步骤S7310、步骤S7320。
步骤S7100：将反馈信息对应的反馈信号进行解码，得到解码结果。
步骤S7200：根据解码结果，判断解码是否成功。
步骤S7300：如果解码成功，得到正确传输块标识集合，判断解码结果中是否包含第二节点发送的传输块的传输块标识。
步骤S7310：如果解码结果中不包含第二节点发送的传输块的传输块标识，则确定与第二节点发送的传输块的应答为错误应答NACK。
步骤S7320：如果解码结果中包含第二节点发送的传输块的传输块标识，则确定与第二节点发送的传输块的应答为正确应答ACK。
图32是本申请一实施例提供的一种信息传输装置结构示意图。如图32所示，本申请实施例提供的信息传输装置200应用于基站，可以执行本申请实施例提供的信息传输方法，终端具备执行方法相应的功能模块和技术效果。该装置可以通过软件、硬件或者软硬结合的方式实现，包括：接收模块201，设置为接收至少一个第二节点发送的传输块；其中，传输块形成传输块集合；
正确传输块信息获得模块202，设置为根据传输块集合，得到正确传输块集合的信息。
反馈信息生成模块203，设置为通过对正确传输块集合的信息进行编码处理，得到反馈信息；其中，反馈信息用于表征至少一个第二节点发送的传输块的接收情况；编码处理包括将正确传输块集合的信息进行压缩编码。
发送模块204，设置为发送反馈信息给第二节点序列。
图33是本申请一实施例提供的一种信息传输装置结构示意图。如图33所示，本申请实施例提供的信息传输装置300应用于用户设备，可以执行本申请实施例提供的信息传输方法，终端具备执行方法相应的功能模块和技术效果。该装置可以通过软件、硬件或者软硬结合的方式实现，包括：
发送模块301，设置为发送传输块给第一节点；其中，传输块在第一节点处形成传输块集合；
接收模块302，设置为接收第一节点发送的反馈信息；其中，反馈信息用于表征传输块的接收情况。
图34是本申请一实施例提供的基站的结构示意图，如图34所示，该基站400包括存储器401、处理器402、接收器403以及发送器404。存储器401、处理器402的数量可以是一个或多个，图34中以一个存储器401和一个处理器402为例；基站中的存储器401和处理器402可以通过总线或其他方式连接，图34中以通过总线连接为例。
存储器401作为一种计算机可读存储介质，可用于存储软件程序、计算机可执行程序以及模块，如本申请任一实施例提供的信息传输方法对应的程序指令/模块。处理器402通过运行存储在存储器401中的软件程序、指令以及模块实现上述信息传输方法。
存储器401可主要包括存储程序区和存储数据区，其中，存储程序区可存储操作***、至少一个功能所需的应用程序。此外，存储器401可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件或其他非易失性固态存储器件。在一些实例中，存储器401进一步包括相对于处理器402远程设置的存储器，这些远程存储器可以通过网络连接至设备。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
接收器403设置为进行信息接收；发送器404设置为根据处理器402的控制进行反馈信息的发送。
图35是本申请一实施例提供的用户设备的结构示意图，如图35所示，该用户设备500包括存储器501、处理器502、接收器503以及发送器504。存储器501、处理器502的数量可以是一个或多个，图35中以一个存储器501和一个处理器502为例；用户设备中的存储器501和处理器502可以通过总线或其他方式连接，图35中以通过总线连接为例。
存储器501作为一种计算机可读存储介质，可用于存储软件程序、计算机可执行程序以及模块，如本申请任一实施例提供的信息传输方法对应的程序指令/模块。处理器502通过运行存储在存储器501中的软件程序、指令以及模块实现上述信息传输方法。
存储器501可主要包括存储程序区和存储数据区，其中，存储程序区可存储操作***、至少一个功能所需的应用程序。此外，存储器501可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件或其他非易失性固态存储器件。在一些实例中，存储器501进一步包括相对于处理器502远程设置的存储器，这些远程存储器可以通过网络连接至设备。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
接收器503设置为进行反馈信息的接收；发送器504设置为根据处理器502的控制进行传输块的发送。
本申请一实施例还提供了一种计算机可读存储介质，存储有计算机可执行指令，该计算机可执行指令用于执行如本申请任一实施例提供的信息传输方法。
本申请一实施例还提供了一种计算机程序产品，包括计算机程序或计算机指令，该计算 机程序或计算机指令存储在计算机可读存储介质中，计算机设备的处理器从计算机可读存储介质读取计算机程序或计算机指令，处理器执行计算机程序或计算机指令，使得计算机设备执行如本申请任一实施例提供的信息传输方法。
本申请实施例描述的***架构以及应用场景是为了更加清楚的说明本申请实施例的技术方案，并不构成对于本申请实施例提供的技术方案的限定，本领域技术人员可知，随着***架构的演变和新应用场景的出现，本申请实施例提供的技术方案对于类似的技术问题，同样适用。
本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、***、设备中的功能模块/单元可以被实施为软件、固件、硬件及其适当的组合。
在硬件实施方式中，在以上描述中提及的功能模块/单元之间的划分不一定对应于物理组件的划分；例如，一个物理组件可以具有多个功能，或者一个功能或步骤可以由若干物理组件合作执行。某些物理组件或所有物理组件可以被实施为由处理器，如中央处理器、数字信号处理器或微处理器执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在计算机可读介质上，计算机可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、程序模块或其他数据)的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于RAM、ROM、EEPROM、闪存或其他存储器技术、CD-ROM、数字多功能盘(DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。此外，本领域普通技术人员公知的是，通信介质通常包含计算机可读指令、数据结构、程序模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据，并且可包括任何信息递送介质。
在本说明书中使用的术语“部件”、“模块”、“***”等用于表示计算机相关的实体、硬件、固件、硬件和软件的组合、软件、或执行中的软件。例如，部件可以是但不限于，在处理器上运行的进程、处理器、对象、可执行文件、执行线程、程序或计算机。通过图示，在计算设备上运行的应用和计算设备都可以是部件。一个或多个部件可驻留在进程或执行线程中，部件可位于一个计算机上或分布在2个或更多个计算机之间。此外，这些部件可从在上面存储有各种数据结构的各种计算机可读介质执行。部件可例如根据具有一个或多个数据分组(例如来自于自与本地***、分布式***或网络间的另一部件交互的二个部件的数据，例如通过信号与其它***交互的互联网)的信号通过本地或远程进程来通信。
以上参照附图说明了本申请的一些实施例，并非因此局限本申请的权利范围。本领域技术人员不脱离本申请的范围和实质内所作的任何修改、等同替换和改进，均应在本申请的权利范围之内。

Claims (27)

  1. 一种信息传输方法，包括：
    接收至少一个第二节点发送的传输块，所述传输块形成传输块集合；
    根据所述传输块集合，得到正确传输块集合的信息；
    将所述正确传输块集合的信息进行编码处理，得到反馈信息；其中，所述反馈信息用于表征所述至少一个第二节点发送的传输块的接收情况；所述编码处理包括将所述正确传输块集合的信息进行压缩编码；
    发送所述反馈信息给所述至少一个第二节点。
  2. 根据权利要求1所述的方法，其中，所述传输块通过传输块标识指示，所述传输块标识至少包括以下之一：
    用户标识、用户标识的索引值、标签索引。
  3. 根据权利要求1所述的方法，其中，所述正确传输块集合为空集；
    所述对所述正确传输块集合的信息进行编码处理，得到反馈信息，包括：
    确定所述反馈信息为空序列；其中，包括所述反馈信息的反馈信号为零功率信号。
  4. 根据权利要求2或3所述的方法，其中，所述正确传输块集合的信息包括正确传输块标识集合、传输块标识有序集合与最大正确传输数目；
    所述对所述正确传输块集合的信息进行编码处理，得到反馈信息，包括：
    根据所述传输块标识有序集合与所述最大正确传输数目，得到所述偏移值有序集合；
    将所述偏移值有序集合中的偏移值元素进行二进制表示，得到与所述反馈信息长度相同的所述偏移值比特序列；
    对所述正确传输块标识集合进行映射处理；
    将所述偏移值比特序列与映射处理后的所述正确传输块标识集合进行二进制加法计算，得到所述反馈信息。
  5. 根据权利要求2或3所述的方法，其中，所述正确传输块集合的信息包括正确传输块标识集合、传输块标识有序集合与最大正确传输数目；
    所述对所述正确传输块集合的信息进行编码处理，得到反馈信息，包括：
    根据所述传输块标识有序集合与所述最大正确传输数目，得到所述偏移值有序集合；
    将所述偏移值有序集合中的偏移值元素进行二进制表示，得到与所述反馈信息长度相同的所述偏移值比特序列；
    将所述正确传输块标识集合进行压缩编码，得到所述中间码字；
    将所述中间码字与所述偏移值比特序列进行加和，得到所述反馈信息。
  6. 根据权利要求2或3所述的方法，其中，所述将所述正确传输块集合的信息进行编码处理，得到反馈信息，包括：
    根据所述正确传输块集合的信息，得到传输块差错图样；
    将所述传输块差错图样进行映射处理，得到所述反馈信息。
  7. 根据权利要求6所述的方法，其中，所述正确传输块集合的信息包括传输块标识有序集合与最大正确传输数目；
    所述将所述传输块差错图样进行映射处理，得到所述反馈信息，包括：
    根据所述传输块标识有序集合与所述最大正确传输数目，得到所述偏移值有序集合；
    将所述偏移值有序集合中的偏移值元素进行二进制表示，得到与所述反馈信息长度相同的所述偏移值比特序列；
    将所述传输块差错图样进行压缩编码，得到中间码字；
    将所述中间码字与所述偏移值比特序列进行加和，得到所述反馈信息。
  8. 根据权利要求6所述的方法，其中，所述正确传输块集合的信息包括正确传输块标识集合与传输块标识有序集合；
    所述根据所述正确传输块集合的信息，得到传输块差错图样，包括：
    判断每个所述传输块标识有序集合中的元素是否属于所述正确传输块标识集合；
    根据判断结果，构成所述传输块差错图样。
  9. 根据权利要求6所述的方法，其中，所述正确传输块集合的信息包括正确传输块标识集合；
    所述根据所述正确传输块集合的信息，得到传输块差错图样，包括：
    根据传输块差错图样的预设长度，得到与所述预设长度对应的传输块差错图样初始图样，其中，所述传输块差错图样初始图样中的每个元素对应错误应答比特；
    根据所述正确传输块集合，在所述传输块差错图样初始图样中，将序号等于所述正确传输块集合中元素的比特设置为正确应答比特；
    将所述传输块差错图样初始图样确定为所述传输块差错图样。
  10. 根据权利要求1所述的方法，还包括：
    对所述反馈信息进行信道编码，得到第一编码序列。
  11. 根据权利要求1所述的方法，其中，所述压缩编码包括至少以下之一的信源编码算法：
    算术编码、霍夫曼编码、香农-费诺编码。
  12. 根据权利要求1所述的方法，其中，所述正确传输块集合的信息至少包括以下之一：
    最大正确传输块数目、传输块标识有序集合、传输块标识有序集合元素数目、正确传输 块标识集合、正确传输块数目、中间码字、传输块差错图样、偏移值有序集合。
  13. 根据权利要求12所述的方法，其中，所述最大正确传输块数目由高层参数预先配置。
  14. 根据权利要求2所述的方法，其中，所述用户标识至少包括以下之一：
    订阅永久标识符、通用公共订阅标识符、永久设备标识符、网络接入标识、订阅隐藏标识符、全球唯一临时标识、无线网络临时标识、***信息无线网络临时标识、寻呼无线网络临时标识、随机接入无线网络临时标识、临时小区无线网络临时标识、小区无线网络临时标识、上行控制信道发射功率控制无线网络临时标识、上行共享信道发射功率控制无线网络临时标识、信道探测参考信号发射功率控制无线网络临时标识、中断无线网络临时标识、调制编码方式小区无线网络临时标识、配置调度无线网络临时标识、时隙格式指示无线网络临时标识、半持续无线网络临时标识。
  15. 根据权利要求2所述的方法，其中，所述标签索引为随机接入标签的标签索引，所述随机接入标签至少包括以下之一：
    导频、参考信号、前导码、扩频序列、交织器、交织图样、交织序列、加扰序列、稀疏码序列。
  16. 根据权利要求10所述的方法，其中，所述信道编码至少包括以下之一：
    极化编码、低密度奇偶校验编码、卷积编码、turbo编码、RM码、RS码、BCH码、级联编码、循环码、分组编码、汉明编码、哥雷码、重复编码、单奇偶校验码、循环冗余校验码、叠加编码、稀疏叠加编码、稀疏回归编码、格编码、代数几何码、Goppa码、极化调整卷积码、预变换极化码、奇偶校验极化码。
  17. 一种信息传输方法，应用于第二节点，包括：
    发送传输块给第一节点；
    接收所述第一节点发送的反馈信息；其中，所述反馈信息用于表征所述传输块的接收情况。
  18. 根据权利要求17所述的方法，其中，所述传输块通过传输块标识指示，所述传输块标识至少包括以下之一：
    用户标识、用户标识的索引值、标签索引。
  19. 根据权利要求17所述的方法，还包括：
    将所述反馈信息对应的反馈信号进行解码，得到解码结果；
    根据所述解码结果，判断所述第二节点发送的传输块的接收情况。
  20. 根据权利要求19所述的方法，其中，所述根据所述解码结果，判断所述第二节点发送的传输块的接收情况，包括：
    若解码失败，确定与所述第二节点发送的传输块的应答为错误应答NACK。
  21. 根据权利要求19所述的方法，其中，所述根据所述解码结果，判断所述第二节点发 送的传输块的接收情况，包括：
    若解码成功，判断所述解码结果中的传输块标识是否属于正确传输块标识集合。
  22. 一种信息传输装置，包括：
    接收模块，设置为接收至少一个第二节点发送的传输块；所述传输块形成传输块集合；
    正确传输块信息获得模块，设置为根据所述传输块集合，得到正确传输块集合的信息；
    反馈信息生成模块，设置为通过对所述正确传输块集合的信息进行编码处理，得到反馈信息；其中，所述反馈信息用于表征所述至少一个第二节点发送的传输块的接收情况；所述编码处理包括将所述正确传输块集合的信息进行压缩编码；
    发送模块，设置为发送所述反馈信息至所述至少一个第二节点。
  23. 一种信息传输装置，包括：
    发送模块，设置为发送传输块给第一节点；
    接收模块，设置为接收所述第一节点发送的反馈信息；其中，所述反馈信息用于表征所述传输块的接收情况。
  24. 一种基站，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现如权利要求1至21中任意一项所述的信息传输方法。
  25. 一种用户设备，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现如权利要求1至21中任意一项所述的信息传输方法。
  26. 一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行如权利要求1至21中任意一项所述的信息传输方法。
  27. 一种计算机程序产品，包括计算机程序或计算机指令，所述计算机程序或所述计算机指令存储在计算机可读存储介质中，计算机设备的处理器从所述计算机可读存储介质读取所述计算机程序或所述计算机指令，所述处理器执行所述计算机程序或所述计算机指令，使得所述计算机设备执行如权利要求1至21任意一项所述的信息传输方法。
PCT/CN2023/094340 2022-06-15 2023-05-15 信息传输方法、装置、基站、设备、存储介质及程序产品 WO2023241287A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210675040.0 2022-06-15
CN202210675040.0A CN117295109A (zh) 2022-06-15 2022-06-15 信息传输方法、装置、基站、设备、存储介质及程序产品

Publications (1)

Publication Number Publication Date
WO2023241287A1 true WO2023241287A1 (zh) 2023-12-21

Family

ID=89192187

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/094340 WO2023241287A1 (zh) 2022-06-15 2023-05-15 信息传输方法、装置、基站、设备、存储介质及程序产品

Country Status (2)

Country Link
CN (1) CN117295109A (zh)
WO (1) WO2023241287A1 (zh)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110032925A1 (en) * 2008-03-17 2011-02-10 Lg Electronics Inc. Method of transmitting group ack/nack in a communication system
US20150256298A1 (en) * 2012-09-28 2015-09-10 Telefonaktiebolaget L M Ericsson (Publ) Encoding Hybrid Automatic Repeat Request Acknowledgements in a Multi-Antenna Wireless Communications System
CN106301703A (zh) * 2015-05-15 2017-01-04 中兴通讯股份有限公司 Harq发送、接收方法、装置及节点
CN110012678A (zh) * 2017-11-10 2019-07-12 Oppo广东移动通信有限公司 无线通信方法和设备
CN112398597A (zh) * 2019-08-16 2021-02-23 华为技术有限公司 一种反馈信息传输方法及装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110032925A1 (en) * 2008-03-17 2011-02-10 Lg Electronics Inc. Method of transmitting group ack/nack in a communication system
US20150256298A1 (en) * 2012-09-28 2015-09-10 Telefonaktiebolaget L M Ericsson (Publ) Encoding Hybrid Automatic Repeat Request Acknowledgements in a Multi-Antenna Wireless Communications System
CN106301703A (zh) * 2015-05-15 2017-01-04 中兴通讯股份有限公司 Harq发送、接收方法、装置及节点
CN110012678A (zh) * 2017-11-10 2019-07-12 Oppo广东移动通信有限公司 无线通信方法和设备
CN112398597A (zh) * 2019-08-16 2021-02-23 华为技术有限公司 一种反馈信息传输方法及装置

Also Published As

Publication number Publication date
CN117295109A (zh) 2023-12-26

Similar Documents

Publication Publication Date Title
EP3657721B1 (en) Harq-ack feedback codebook sending method, apparatus and device
CN107113110B (zh) 控制信息的发送方法和通信设备
US10516505B2 (en) Baseband processors, base station, user device, and methods thereof
US11695506B2 (en) Method and apparatus for transmission or reception of data in communication system
EP3709723B1 (en) Terminal device, base station device, and communication method
US20170111145A1 (en) Apparatus and Method for Handling the Configuration of Bundle Sizes in Communications Involving the Transmission and/or Reception of More than One Bundle in a Transmission and/or Reception Attempt
US20230370195A1 (en) Method and apparatus for transmission or reception of data in communication system
US11902943B2 (en) Communication method and communications apparatus
CN111133817B (zh) 通信方法和装置
JP2020518202A (ja) データ処理方法およびデータ処理装置
CN114731229A (zh) 用于确定单次harq-ack码本的方法及设备
WO2019047676A1 (zh) 数据反馈、发送、接收方法及装置，接收设备，发送设备
CN115918011A (zh) 生成混合自动重复请求harq码本的方法和装置
US11412532B2 (en) Method and device for determining whether data is damaged
EP3576327B1 (en) Information transmission method, network device, and terminal device
WO2023241287A1 (zh) 信息传输方法、装置、基站、设备、存储介质及程序产品
CN108322285B (zh) 数据的发送方法、接收方法和装置
WO2023241286A1 (zh) 信息传输方法、装置、基站、设备、存储介质及程序产品
US20200128530A1 (en) Communication method, terminal device and network device
WO2023241284A1 (zh) 信息传输方法、装置、基站、设备、存储介质及程序产品
WO2022236719A1 (zh) 无线通信方法、终端设备和网络设备
WO2023010425A1 (en) Methods and devices for scheduling codebook
EP4346139A1 (en) Feedback per code block group
WO2022236752A1 (zh) 无线通信方法、第一设备和第二设备
WO2024098555A1 (en) Control information transmission techniques

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23822857

Country of ref document: EP

Kind code of ref document: A1