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

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

Info

Publication number
WO2023241286A1
WO2023241286A1 PCT/CN2023/094339 CN2023094339W WO2023241286A1 WO 2023241286 A1 WO2023241286 A1 WO 2023241286A1 CN 2023094339 W CN2023094339 W CN 2023094339W WO 2023241286 A1 WO2023241286 A1 WO 2023241286A1
Authority
WO
WIPO (PCT)
Prior art keywords
transport block
correct
information
feedback information
transmission block
Prior art date
Application number
PCT/CN2023/094339
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 WO2023241286A1 publication Critical patent/WO2023241286A1/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
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access, e.g. scheduled or random access
    • H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access, e.g. scheduled or random access
    • H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
    • H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure

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
  • Random Access Random Access
  • the UE sending data will randomly select a resource (also called a signature) from the set of random access resources (such as spreading sequences, pilot sequences, etc.) provided by the system. ) to send data.
  • a resource also called a 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 ; encoding the information of the correct transmission block set 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 performing a binary representation of the information of the correct transmission block set; and sending the feedback information to the at least one second node.
  • embodiments of the present application provide an information transmission method, applied to a second node.
  • the method includes: sending a transmission block to a first node; receiving feedback information sent by the first node; wherein the feedback The information is used to characterize the reception 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 represented in binary, or the information of the correct 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.
  • spectrum resources can be saved and data transmission efficiency can be improved.
  • 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 flow chart of an information transmission method provided by an embodiment of the present application.
  • Figure 4 is a flow chart of an information transmission method provided by an embodiment of the present application.
  • Figure 5 is a flow chart of an information transmission method provided by an embodiment of the present application.
  • Figure 6 is a flow chart for determining a transport block error pattern provided by an embodiment of the present application.
  • Figure 7 is a flow chart for determining a transport block error pattern provided by another embodiment of the present application.
  • Figure 8 is a flow chart for determining compression codewords based on a correct set of transport block identifiers provided by an embodiment of the present application
  • Figure 9 is a flow chart for determining compressed codewords based on transport block error patterns provided for another embodiment of the present application.
  • Figure 10 is a flow chart of a method for determining feedback information provided by an embodiment of the present application.
  • Figure 11 is a schematic diagram of the relationship between the second node, the transport block and the user identifier provided in the example of this application;
  • Figure 12 is a schematic diagram of the relationship between the second node, the transmission block, the random access tag and the tag index provided in the example of this application;
  • Figure 13 is a schematic diagram of determining feedback information based on the correct transmission block identification set provided by the example of this application;
  • Figure 14 is a schematic diagram of the relationship between the second node, the transmission block, the random access tag and the tag index provided in the example of this application;
  • Figure 15 is a schematic diagram of the relationship between the second node, the transmission block, the user ID, the random access tag and the tag index provided in the example of this application;
  • Figure 16 is a schematic diagram of determining feedback information based on the correct transmission block identification set provided by the example of this application.
  • Figure 17 is a schematic diagram of the relationship between the second node, the transmission block, the user identifier, the random access tag and the tag index provided in the example of this application;
  • Figure 18 is a schematic diagram of determining feedback information based on the correct transmission block identification set provided by the example of this application.
  • Figure 19 is a schematic diagram of determining feedback information through arithmetic coding according to the transport block error pattern provided by the example of this application;
  • Figure 20 is a mapping chart between transport block error patterns and compression codewords provided in the example of this application.
  • Figure 21 is a schematic diagram of determining feedback information through arithmetic coding according to the transport block error pattern provided by the example of this application;
  • Figure 22 is a schematic diagram of determining feedback information through arithmetic coding according to the transport block error pattern provided by the example of this application;
  • Figure 23 is a mapping chart between transport block error patterns and compressed codewords provided in the example of this application.
  • Figure 24 is a schematic diagram of determining feedback information through arithmetic coding according to the transport block error pattern provided by the example of this application;
  • Figure 25 is a schematic diagram of the relationship between the second node, the transmission block, the random access tag and the tag index provided in the example of this application;
  • Figure 26 is a schematic diagram of determining feedback information through arithmetic coding according to the transport block error pattern provided by the example of this application;
  • Figure 27 is a mapping chart between transport block error patterns and compressed codewords provided in the example of this application.
  • Figure 28 is a schematic diagram of the relationship between the second node, the transmission block, the random access tag and the tag index provided in the example of this application;
  • Figure 29 is a schematic diagram of determining feedback information through arithmetic coding according to the transport block error pattern provided by the example of this application;
  • Figure 30 is a mapping chart of transport block error patterns, compressed codewords and feedback information provided in the example of this application;
  • Figure 31 is a schematic diagram of determining feedback information through arithmetic coding according to the correct transmission block identification set provided by the example of this application;
  • Figure 32 is a schematic diagram of determining feedback information through arithmetic coding according to the correct transmission block identification set provided by the example of this application;
  • Figure 33 is an information transmission method provided by an embodiment of the present application.
  • Figure 34 is a flow chart of a decoding result judgment method provided by an embodiment of the present application.
  • Figure 35 is a schematic structural diagram of an information transmission device provided by an embodiment of the present application.
  • Figure 36 is a schematic structural diagram of an information transmission device provided by an embodiment of the present application.
  • Figure 37 is a schematic structural diagram of a base station provided by an embodiment of the present application.
  • Figure 38 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 information transmission method provided by this application can be applied to various wireless communication systems, for example, it can be the Internet of things (IoT), narrowband Internet of things (NB-IoT), long-term evolution (long-term evolution) term evolution (LTE), it can also be the fifth generation (5G) communication system, it can also be a hybrid architecture of LTE and 5G, it can also be a 5G new radio (NR) system, as well as new ones that will emerge in future communication development. Communication systems, etc. As long as there is an entity in the communication system that can receive Transport Block (TB) and send feedback information on the reception of the Transport Block, and another entity can send the Transport Block and receive feedback information on the reception of the Transport Block, this application can be used.
  • the information transmission method provided by the embodiment can be the Internet of things (IoT), narrowband Internet of things (NB-IoT), long-term evolution (long-term evolution) term evolution (LTE), it can also be the fifth generation (5G) communication system, it can also be a hybrid architecture of LTE and 5G
  • 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), or an evolutionary base station (eNB or eNB) in LTE.
  • BTS base transceiver station
  • GSM global system for mobile communication
  • CDMA code division multiple access
  • NodeB base station
  • WCDMA wideband code division multiple access
  • eNB evolutionary base station
  • e-NodeB can also be a new radio controller (NR controller), it can be a gNode B (gNB) in the 5G system, it can be a centralized network element (centralized unit), it can be a new wireless base station, It can be a remote radio module, 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 thereto.
  • Network equipment can cover 1 or multiple cells.
  • the UE's transmission is scheduled by the base station, so the downlink (Downlink) does not require feedback response Signaling.
  • the UE receives the transport block signal sent by the base station and uses the Cyclic Redundancy Check (CRC) code of the transport block to determine whether the current transport block has been received correctly.
  • CRC Cyclic Redundancy Check
  • the transmission block passes the CRC check, the reception is considered correct, and the UE feeds back the correct response (positive Acknowledgment, ACK) status (represented by bit “1") to the base station on the time-frequency resource designated by the base station; otherwise, the UE feeds back an error to the base station Negative Acknowledgment (NACK) status (represented by bit “0").
  • the response status can be transmitted on the five physical uplink control channel (PUCCH) formats defined by the 5G standard. These five formats are: PUCCH format 0, PUCCH format 1, PUCCH format 2, PUCCH format 3 and PUCCH format 4.
  • PUCCH format 0 ⁇ 1 is used to transmit 1 or 2-bit hybrid automatic request retransmission (Hybrid Automatic Repeat) -reQuest, HARQ) response (HARQ-ACK) information and scheduling request (Scheduling Request).
  • PUCCH formats 2 to 4 are used to transmit channel state information (Channel State Information, CSI) reports or multi-bit HARQ-ACK information.
  • Table 1 Examples of the number of resources, number of transmission bits and uses occupied by different PUCCH formats
  • Table 1 shows the number of payload bits (payload size), number of occupied resources and usage under different PUCCH formats, where OFDM represents orthogonal frequency division multiplexing (Orthogonal Frequency-Division Multiplexing), RB represents resource block (Resource Block), RE stands for Resource Element.
  • OFDM represents orthogonal frequency division multiplexing (Orthogonal Frequency-Division Multiplexing)
  • RB represents resource block (Resource Block)
  • RE stands for Resource Element.
  • 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
  • the product by encoding the information of the correctly received transport block set, compresses the response signals of multiple correctly received UEs, greatly reducing or even minimizing the number of input bits for channel coding, and then performs channel coding and modulation. and then sends it 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 S3100 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.
  • a transport block is indicated by a transport block identification.
  • 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 ID ID(k) is the k-th element I(k) in the ordered set of transmission block ID 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 as a random access label included in a transmission block in the transmission block set according to higher layer parameters, and these random access labels may Used by the first node to distinguish different transport blocks in the transport block set in a signal containing the transport block set.
  • first node and the second node may be base stations, relays, terminals, or any other network element capable of data reception and signaling transmission.
  • 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 transmission block errors.
  • 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 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 S3100 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 binary encoding of the information of the correct transport block set express.
  • the first node after performing a binary representation of the P elements in the correct transmission block identification set, the first node will perform zero-padding processing, that is, splicing with an all-zero sequence of a certain length to obtain feedback information.
  • Figure 3 is a flow chart of an information transmission method provided by an embodiment of the present application. It specifically includes steps S3111, S3112 and S3113. It specifically describes the process of splicing the binary representation of the correct transmission block identification set with an all-zero sequence to obtain feedback information. process.
  • Step S3111 Obtain the number of binary representation digits of the feedback information according to the number of elements in the ordered set of transport block identifiers; the ordered set of transport block identifiers is an ordered set of all transport block identifiers.
  • the method adopted can be determined.
  • Use binary to represent the number of bits required for the transmission block identification that is, when the ordered set of transmission block identification includes Na elements, it is required Bits are represented in binary, where Represents the smallest integer greater than or equal to log 2 (Na). More specifically, when the user ID is 1, 2, 3, 4, 5, 6, or 7, at least 3 digits are required for binary representation.
  • Step S3112 Obtain the binary representation corresponding to each element in the correct transmission block identification set based on the number of binary representation digits of the feedback information.
  • the first node performs binary representation on P elements in the correct transmission block identification set, and obtains a length of sequence, where, Represents the smallest integer greater than or equal to log 2 (Na).
  • Step S3113 Splice the binary representations corresponding to all elements in the correct transmission block identification set with the all-zero sequence to obtain feedback information.
  • the first node performs zero-padding processing on P elements of the binary representation, that is, when the length is The splicing length of the sequence is An all-zero sequence, the length of which is feedback information; among them, Represents the smallest integer greater than or equal to log 2 (Na).
  • Step S3121 Obtain the number of binary representation digits of the feedback information according to the number of elements in the ordered set of transport block identifiers; the ordered set of transport block identifiers is an ordered set of all transport block identifiers.
  • the number of bits required to represent the transmission block identification in binary can be determined, that is, when the ordered set of transmission block identification includes Na elements, it is necessary Bits are represented in binary, where Represents the smallest integer greater than or equal to log 2 (Na). More specifically, when the user ID is 1, 2, 3, 4, 5, 6, or 7, at least 3 digits are required for binary representation.
  • the first node performs binary representation on P elements in the correct transmission block identification set, and obtains a length of sequence, where, Represents the smallest integer greater than or equal to log 2 (Na).
  • the tag index corresponding to the transmission block can be obtained, and the user identifier and the tag index have a mapping relationship.
  • the user identification is used as a partial random number seed of a pseudo-random number generator to generate a pseudo-random label. Index, these pseudo-random label indexes will be used as the label index corresponding to the transmission block.
  • the user identifier is used as all random number seeds of the pseudo-random number generator to generate pseudo-random tag indexes, and these pseudo-random tag indexes will be used as tag indexes corresponding to the transmission blocks.
  • the first node sends feedback information to one or more second nodes, 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 greatly reduce 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.
  • FIG. 5 is a flow chart of an information transmission method provided by another 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 S3200 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.
  • Step S2000 Obtain the information of the correct transport block set according to the transport block set.
  • Step S3200 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.
  • Step S4000 Send feedback information to at least one second node.
  • the compression coding can be at least one of the following source coding algorithms: arithmetic coding (Arithmetic coding), Huffman coding (Huffman coding), Shannon-Fano coding (Shanno-Fano coding).
  • the compression codeword c is directly determined according to the information of the correct transmission block set, where the compression codeword c is a bit sequence of length Nc, and the information of the correct transmission block set includes at least one of the following: maximum correct transmission block Number Pmax, transport block identification ordered set, transport block identification ordered set size Na, correct transmission block identification set, correct transmission block number P, transmission block error pattern a.
  • compression encoding is performed on the correct transmission block identification set to determine the compression codeword c.
  • the compressed codeword c can be determined according to the transport block error pattern a.
  • the transport block error pattern a is determined based on at least one of the following: an ordered set of transport block identifiers, a transmission The size of the ordered set of block identifiers Na, the set of correct transmission block identifications, and the number of correct transmission blocks P.
  • FIG. 6 is a flowchart of a method for determining a transport block error pattern a provided by an embodiment of the present application. As shown in FIG. 6 , the transport block error pattern a is determined through the following steps S3610, S3621 and S3622.
  • Step S3610 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 error response NACK.
  • bit “ack” is bit “1” and bit “nack” is bit “0”.
  • bit “ack” is bit “0” and bit “nack” is bit “1”.
  • Figure 7 is a flow chart of a method for determining a transport block error pattern a provided by another embodiment of the present application. As shown in Figure 7, the transport block error pattern a is determined through the following steps S3710, S3720 and S3730.
  • Step S3710 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 S3720 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 S3730 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 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 error response NACK.
  • bit “ack” is bit “1” and bit “nack” is bit “0”.
  • bit “ack” is bit “0” and bit “nack” is bit “1”.
  • the length of the compressed codeword is determined according to the size of the ordered set of transport block identifiers and the number of correct transport blocks.
  • the length Nc of the compressed codeword c is greater than or equal to Among them, Na means passing
  • the transmission block identifies the size of the ordered set, and P represents the number of correct transmission blocks. is greater than or equal to the smallest integer, Take the number of combinations of P for Na.
  • the compressed codeword c is obtained by converting A bit sequence of length Na containing P bits "ack" is mapped to a length of obtained by arithmetic coding of the bit sequence.
  • the length of the compressed codeword is determined according to the length of the transport block error pattern and the number of correct transport blocks.
  • the length Nc of the compressed codeword c is equal to Among them, Na represents the length of the transmission block error pattern a, P represents the number of correct transmission blocks, is greater than or equal to the smallest integer, Take the number of combinations of P for Na.
  • the feedback information f includes bits are used to indicate the number of correct transmission blocks P, where, is the smallest integer greater than or equal to log 2 (Pmax).
  • the feedback information f when the number of correct transmission blocks P is less than or equal to 1, the feedback information f includes a length of an all-zero sequence, where, is the smallest integer greater than or equal to log 2 (Pmax).
  • the feedback information f includes bits are used to indicate the number of correct transmission blocks P, where, is the smallest integer greater than or equal to log 2 (Pmax+1).
  • the feedback information f includes a length of an all-zero sequence, where, is greater than or equal to the smallest integer, Get the number of combinations of Pmax for Na, is greater than or equal to the smallest integer, Take the number of combinations of P for Na.
  • the length Nf of the feedback information f is determined according to at least one of the following parameters: the maximum number of correct transmission blocks, the number of correct transmission blocks, the size of the ordered set of transmission block identifiers, and the length of the error pattern of the transmission block.
  • the length of the feedback information f is
  • the length of the feedback information f is
  • the length of the feedback information f is
  • the length of the feedback information f is
  • the length of the feedback information f is
  • Figure 8 is a flow chart for determining compression codewords based on a correct set of transport block identifiers provided by an embodiment of the present application.
  • BI is the set of correct transmission block identifiers
  • P is the number of correct transmission blocks
  • I(Na) is the Na elements included in the ordered set of transmission block identifiers
  • Na Identifies the ordered set size for the transfer block.
  • the final output length of the method block diagram is The bit representation of the compressed codeword c, where, is greater than or equal to the smallest integer, Take the number of combinations of P for Na.
  • FIG. 9 is a flow chart for determining a compressed codeword based on a transport block error pattern according to another embodiment of the present application.
  • Na is the length of the transmission block error pattern a
  • P is the number of correct transmission blocks
  • the final output length of the method block diagram is The bit representation of the compressed codeword c, where, is greater than or equal to the smallest integer, Take the number of combinations of P for Na.
  • the above compressed codeword is determined as feedback information.
  • the compressed codeword is concatenated with an all-zero sequence to obtain feedback information.
  • the correct transmission block number bit sequence, the compressed codeword and the all-zero sequence are spliced to obtain feedback information, wherein the correct transmission block number bit sequence is obtained by the following method, specifically as follows:
  • FIG. 10 is a flow chart of a method for determining feedback information provided by an embodiment of the present application. As shown in FIG. 10 , the feedback information f is determined through the following steps S3310, S3320, and S3330.
  • Step S3310 According to the maximum number of correct transmission blocks, obtain the number of binary representation digits of the number of correct transmission blocks.
  • Step S3320 According to the number of binary representation bits of the correct transmission block number, perform a binary representation of the correct transmission block number to obtain a correct transmission block number bit sequence.
  • Step S3330 Splice the correct transmission block number bit sequence, the compressed codeword and the all-zero sequence to obtain feedback information.
  • 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, and these terminals form The second node sequence is obtained, and the transmission block identifier is the user identifier.
  • the following example describes the specific process of not sending feedback information f when the number of correct transmission blocks P is 0.
  • 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) corresponds to 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 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 is a set of user identifications included in correctly received transmission blocks in the transmission block set.
  • the base station determines that the signal containing the feedback information f is a zero-power signal.
  • the transmission block identifier is the index value of the user identifier
  • Example 1 Another difference between this example and Example 1 is that in this example, the user IDs of terminals SN(1), SN(2), SN(3), and SN(4) are 0, 11, 20, and 30 respectively, where , user IDs 0, 11, 20, and 30 are elements of the user ID ordered set ID.
  • the transmission block identifier is a label index
  • the label index is an element of the ordered set of transmission block identifiers.
  • the correct transmission block identification set is a set of tag indexes of random access tags included in correctly received transmission blocks in the transmission block set.
  • the random access labels included in the transmission blocks b(1), b(2), b(3), and b(4) are respectively terminal SN(1), SN(2), SN(3), and SN(4) according to The preamble r(4), r(3), r(2), r(1) determined by the high-level parameters.
  • the preamble r(4), r(3), r(2), r(1) are elements of the ordered set of random access tags.
  • Figure 13 is a schematic diagram of determining feedback information based on the correct transmission block identification set provided by the example of this application. As shown in Figure 13, the specific method of determining feedback information f is as follows:
  • the binary representation of bits is [0,1,0] and [0,1,1] respectively;
  • the base station concatenates [0,1,0] and [0,1,1] to obtain the length
  • the compressed sequence d [0,1,0,0,1,1];
  • the terminal sequences SN(1), SN(2), SN(3), and SN(4) receive signals containing feedback information f; the terminals SN(1), SN(2), SN(3), and SN(4) respectively
  • the signal containing the feedback information f is decoded and the responses of the transmission blocks b(1), b(2), b(3), and b(4) are determined as follows.
  • the terminal SN(1) determines that the response to the transport block b(1) is an error response NACK; if the terminal SN(1) decodes successfully and obtains feedback information f, the terminal SN(1) decodes Get feedback information f every Bits determine that there is no user identification 4 of the terminal SN(1), and the terminal SN(1) determines that the response of the transport block b(1) is an error response NACK.
  • the terminal SN (2) determines that the response to the transport block b (2) is an error response NACK; if the terminal SN (2) decodes successfully, the feedback information f is obtained, and the terminal SN (2) decodes Get feedback information f every Bits 4 to 6 are judged to contain the user identification 3 of the terminal SN(2), and the terminal SN(2) determines that the response of the transport 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 feedback information f is obtained, and the terminal SN (3) decodes Get feedback information f every Bits 1 to 3 are judged to contain the user identification 2 of the terminal SN(3), and the terminal SN(3) determines that the response of the transport 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 and obtains the feedback information f, the terminal SN (4) decodes Get feedback information f every Bits determine that there is no user identification 5 of the terminal SN (4), and the terminal SN (4) determines that the response to the transport block b (4) is an error response NACK.
  • the user identifier does not include the value 0 to prevent that when P ⁇ Pmax, the feedback information f will always include
  • the all-zero sequence of bits causes the feedback information f to include the user identifier 0 regardless of whether the transport block containing the user identifier 0 is decoded correctly, causing the terminal to always judge that the response containing the transport block containing the user identifier 0 is the correct response ACK , leading to terminal misjudgment.
  • Figure 14 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.
  • Reference Signal a reference signal
  • the random access labels included in the transmission blocks b(1), b(2), b(3), and b(4) are respectively terminal SN(1), SN(2), SN(3), and SN(4) according to
  • the reference signals r(1), r(5), r(3), r(2) determined by high-level parameters, where the reference signals r(1), r(5), r(3), r(2) are Randomly access elements of an ordered collection of tags.
  • Na 7 tag indexes 1,2,3,4,5,6,7.
  • 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 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),b(4)’s response:
  • the terminal SN(1) determines that the response to the transport block b(1) is an error response NACK; if the terminal SN(1) decodes successfully and obtains feedback information f, the terminal SN(1) decodes Get feedback information f every Bits determine that there is no tag index 1 of the random access tag included in the transmission block b(1), and the terminal SN(1) determines that the response to the transmission block b(1) is an error response NACK.
  • the terminal SN (2) determines that the response to the transport block b (2) is an error response NACK; if the terminal SN (2) decodes successfully, the feedback information f is obtained, and the terminal SN (2) decodes Get feedback information f every Bits determine that there is no tag index 5 of the random access tag included in the transmission block b(2), and the terminal SN(2) determines that the response to transport block b(2) is an error response NACK.
  • 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 feedback information f is obtained, and the terminal SN (3) decodes Get feedback information f every bits determine that the 4th to 6th bits contain the tag index 3 of the random access tag included in the transport block b(3), and the terminal SN(3) determines that the response to the transport 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 and obtains the feedback information f, the terminal SN (4) decodes Get feedback information f every Bits determine that the 1st to 3rd bits contain the tag index 2 of the random access tag included in the transport block b(4), and the terminal SN(4) determines that the response to the transport block b(4) is a correct response ACK.
  • the first node is a relay and the second node is a terminal.
  • This example includes multiple terminals, these terminals form a second node sequence, and the transmission block identifier is a user identifier.
  • Figure 15 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 transmission block b(t) in the transmission block set B is sent to the relay by the terminal SN(t) in the terminal sequence, where the transmission block b(t) in the transmission block set B ( t) includes the random access label and the user identification of the terminal SN(t); where the user identification of the terminal SN(t) is the cell RNTI (Cell RNTI, C-RNTI).
  • the user IDs of terminals SN(1), SN(2), SN(3), and SN(4) are 4,3,2,0 respectively. Among them, user IDs 4,3,2,0 are transmission block IDs in order.
  • the random access tag included in the transmission block b(t) is a spread spectrum sequence (Spread Spectrum Sequence), where the spread spectrum sequence is an element of an ordered set of random access tags.
  • the ordered set of random access tags includes 6 spreading sequences r(1), r(2), r(3), r(4), r(5), r(6), where the spreading sequence r( 1), the label indexes of r(2), r(3), r(4), r(5), and 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 identifiers 4,3,2,0 of terminals SN(1), SN(2), SN(3), and SN(4) are spread spectrum sequences determined according to the following formula:
  • the tag index of the spreading sequence included in the transport block b(t) the remainder of the square of the user identification of the terminal SN(t) divided by 6.
  • the correct transmission block identification set refers to the set of user identifications included in correctly received transmission blocks in the transmission block set.
  • Figure 16 is a schematic diagram of determining feedback information based on the correct transmission block identification set provided by the example of this application. As shown in Figure 16, the specific method for determining feedback information f is as follows:
  • the binary representations of bits are [1,0,0] and [0,0,0] respectively;
  • the relay concatenates [1,0,0] and [0,0,0] to obtain the length.
  • the feedback information f [1,0,0,0,0,0].
  • 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 to the transport block b(1) is an error response NACK; if the terminal SN(1) decodes successfully and obtains feedback information f, the terminal SN(1) decodes
  • the feedback information f obtained is Bits 1 to 3 are judged to contain the user identification 4 of the terminal SN(1), and the terminal SN(1) determines that the response of the transport block b(1) is the correct response ACK.
  • the terminal SN (2) determines that the response to the transport block b (2) is an error response NACK; if the terminal SN (2) decodes successfully, the feedback information f is obtained, and the terminal SN (2) decodes The feedback information f obtained is It is judged that the bits do not contain the user identification 3 of the terminal SN(2), and the terminal SN(2) determines that the response of the transport block b(2) is an error response NACK.
  • 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 feedback information f is obtained, and the terminal SN (3) decodes The feedback information f obtained is It is judged that the bits do not contain the user identification 2 of the terminal SN (3), and the terminal SN (3) determines that the response of the transport block b (3) is an error response NACK.
  • 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 and obtains the feedback information f, the terminal SN (4) decodes
  • the feedback information f obtained is Bits 4 to 6 are judged to be the user identification 0 of the terminal SN (4), and the terminal SN (4) determines that the response of the transport block b (4) is the correct response ACK.
  • the advantage of using the transmission block identifier as the user identifier is that when the random access labels of terminals SN(1) and SN(3) are the same, the transmission blocks of different terminals can still be distinguished in the feedback information f. response signal.
  • the feedback information f since the feedback information f does not have zero padding, under the condition that one user identification occupies 3 bits, the length of the feedback information f is reduced from 9 to 6, and the user identification 0 can also be used but the feedback information f cannot A misjudgment occurred.
  • the receiving power of the terminal can be reduced and coverage improved.
  • This example directly feeds back the user ID included in the correct transmission block without zero padding.
  • the advantage is that the compression process is simple and the encoding bit rate is further reduced, improving performance.
  • the random access tag included in the transmission block b(t) is a scrambling sequence (Scrambling Sequence), where the scrambling sequence is an element of an ordered set of random access tags.
  • the label indexes of r(1), r(2), r(3), r(4), r(5), and r(6) are the transmission block identifiers 0, 1, and 2 of the transport block identifier ordered set respectively. 3,4,5.
  • the random access tags included in the transmission blocks b(1), b(2), b(3), and b(4) are scrambling sequences determined according to the user identification of the terminal SN(t) according to the following method. :
  • 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).
  • 0 is used as part of the random number seed of the pseudo-random sequence generator (Pseudo-Random Sequence Generator) to obtain the tag index of the random access tag of the terminal SN(1), SN(2), SN(3), SN(4). are 4, 3, 1, 0 respectively, and the random access tags included in the transmission blocks b(1), b(2), b(3), and b(4) are respectively r(5), r(4), r(2),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.
  • Figure 18 is a schematic diagram of determining feedback information based on the correct transmission block identification set provided by the example of this application. As shown in Figure 18, the specific method of determining feedback information f is as follows:
  • the binary representation of bits is [0,0,1] and [0,0,0] respectively;
  • the relay concatenates [0,0,1] and [0,0,0] to obtain the length
  • the feedback information f [0,0,0,0,0,1].
  • the terminals SN(1), SN(2), SN(3), and SN(4) respectively receive the signal containing the feedback information f and decode it, and determine the transmission blocks b(1), b(2), b according to the following method (3), response to b(4):
  • the terminal SN(1) determines that the response to the transport block b(1) is an error response NACK; if the terminal SN(1) decodes successfully and obtains feedback information f, the terminal SN(1) decodes
  • the feedback information f obtained is bits determine that the tag index 4 of the random access tag r(5) included in the transport block b(1) is not included, and the terminal SN(1) determines that the response to the transport block b(1) is an error response NACK.
  • the terminal SN (2) determines that the response to the transport block b (2) is an error response NACK; if the terminal SN (2) decodes successfully, the feedback information f is obtained, and the terminal SN (2) decodes
  • the feedback information f obtained is bits determine that the tag index 3 of the random access tag r(4) included in the transport block b(2) is not included, and the terminal SN(2) determines that the response to the transport block b(2) is an error response NACK.
  • 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 feedback information f is obtained, and the terminal SN (3) decodes
  • the feedback information f obtained is Bits determine that the 4th to 6th bits contain the random access tag r(2) included in the transmission block b(3)
  • the tag index 1 is 1, and the terminal SN(3) determines that the response of the transport 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 and obtains the feedback information f, the terminal SN (4) decodes
  • the feedback information f obtained is Bits 1 to 3 are judged to contain tag index 0 of the random access tag r(1) included in the transport block b(4), and the terminal SN(4) determines that the response to the transport block b(4) is a correct response ACK.
  • the probability that random access labels between different users are the same is reduced by using a pseudo-random sequence to select random access labels.
  • the length of the feedback information f is reduced from 9 to 6 under the condition that one tag index occupies 3 bits.
  • the channel coding rate is reduced, which can reduce the receiving power of the relay and improve coverage.
  • the position of the elements in the correct transmission block identification set BI in the feedback information f can be arbitrary.
  • the tag index of the random access tag included in the correct transmission block is directly fed back and the advantage of not padding zeros is that the compression process is simple and the channel coding rate is further reduced, improving performance.
  • the first node is the base station, and the second node is the terminal.
  • 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 of the terminal SN(t).
  • the user identification of the terminal SN(t) is the configured scheduling RNTI (CS-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 ordered set of transport block identifiers includes Na user identifiers 0,1,2,3,4,5,6,7.
  • the correct transmission block identification set refers to the set of user identifications corresponding to correctly received transmission blocks in the transmission block set.
  • the transport block error pattern a is determined by the base station according to the following parameters: the correct transport block identifier set BI, the transport block identifier ordered set I, and the transport block identifier ordered set size Na.
  • the bit “ack” of the correct response ACK is bit "1"
  • the bit “nack” of the incorrect response NACK is "0”.
  • Figure 19 is a schematic diagram of determining the feedback information f through arithmetic coding according to the transport block error pattern provided by the example of this application.
  • 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 to the transport block b(1) is an error response NACK; if the terminal SN(1) decodes successfully and obtains feedback information f, the terminal SN(1) decodes The obtained feedback information f is arithmetic decoded to obtain the transport block error pattern a.
  • the terminal SN(1) determines that the response of the transport block b(1) is an error. Reply NACK.
  • This example provides an information transmission method by converting the correct transmission block identification set BI into a transmission block error pattern a. And the feedback information f is obtained through arithmetic coding, where the added length is The all-zero sequence ensures that the length of the feedback information f does not change with the size of the correct transmission block identification set BI, which can reduce the decoding complexity. It should be noted that although in this example the feedback information f is the same length as the transmission block error pattern a, in actual applications, the length Na of the transmission block error pattern a is very large, and the feedback information f will be longer than the length of the transmission block error pattern a. short.
  • the solution provided in this example has a lower channel coding code rate than directly transmitting the transport block error pattern a, so that the terminal can use a lower receiving signal-to-noise ratio and enhance coverage.
  • Figure 21 is a schematic diagram of determining feedback information through arithmetic coding according to the transport block error pattern provided by the example of this application.
  • saving 1 bit to represent the value of P thereby shortening the length of the feedback information f and reducing the control signaling resource overhead.
  • Example 8 The difference between this example and Example 8 is that in this example, the bit ack of the correct response ACK is bit "0", and the error The nack bit of the NACK response is "1".
  • the base station determines the length of the compressed codeword c as
  • the terminal sequence ⁇ SN(1), SN(2), SN(3), SN(4)> receives the signal containing the feedback information f and decodes it, and determines the transmission block b(1), b(2) according to the following method ,b(3),b(4)’s response:
  • the terminal SN(1) determines that the response to the transport block b(1) is an error response NACK; if the terminal SN(1) decodes successfully and obtains feedback information f, the terminal SN(1) decodes The obtained feedback information f is arithmetic decoded to obtain the transport block error pattern a.
  • the terminal SN(1) determines that the response of the transport block b(1) is an error. Reply NACK.
  • the feedback information f is not padded with zeros after the compressed codeword c, making the length of the feedback information f shorter, further saving resources; or under the same resources, the terminal receiving signal-to-noise ratio can be lower.
  • the receiving end decodes the feedback information f of different lengths to obtain the number of correct transmission blocks P.
  • the first node is a base station
  • the second node is a terminal.
  • the transmission block identifier is a label index.
  • Figure 25 is a schematic diagram of the relationship between the second node, the transport 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). .
  • transport block b(t) in the transport block set B is sent by the terminal SN(t) to the base station.
  • Transport block b(4) in transport block set B is also sent by terminal SN(1) to the base station.
  • the transmission block b(t) in the transmission block set B corresponds to a random access label, where the random access label is an interleaver.
  • the random access labels corresponding to the transmission blocks b(1), b(2), b(3), and b(4) are respectively terminal SN(1), SN(2), SN(3), and SN(1) according to Random access tags r(2), r(3), r(4), r(1) determined by high-level parameters, where interleaver r(2), r(3), r(4), r(1) ) is an element of an ordered set of random access tags.
  • 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 base station determines the feedback information f as follows:
  • Figure 26 is a schematic diagram of determining feedback information through arithmetic coding according to the transport block error pattern provided by the example of this application.
  • the terminal sequence ⁇ SN(1), SN(2), SN(3)> receives the signal containing the feedback information f and decodes it, and determines the transmission blocks b(1), b(2), b(3) according to the following method ,response of b(4):
  • terminal SN(1) determines that the responses of transport block b(1) and transport block b(4) are both error responses NACK; if terminal SN(1) decodes successfully, it obtains feedback information f , the terminal SN(1) performs arithmetic decoding on the decoded feedback information f to obtain the transport block error pattern a.
  • the terminal SN(1) determines that the response of transport block b(1) is the correct response ACK, and the random access corresponding to transport block b(4)
  • the terminal SN(1) determines that the response of the transport block b(4) is an error response NACK.
  • the terminal SN (2) determines that the response to the transport block b (2) is an error response NACK; if the terminal SN (2) decodes successfully, the feedback information f is obtained, and the terminal SN (2) decodes The obtained feedback information f is arithmetic decoded to obtain the transport block error pattern a.
  • the terminal SN(2) determines the transport block b.
  • the response of (2) is the correct response ACK.
  • the terminal SN (3) determines that the response to the transport block b (3) is an error response NACK; if the terminal SN (3) decodes successfully, the feedback information f is obtained, and the terminal SN (3) responds to the feedback
  • the terminal SN(1) sends two transmission blocks b(1) and b(4), but selects different random access tags; the base station determines the correct decoding of the transmission block based on the The tag index of the random 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 size of the ordered set of random access tags is generally smaller than the size of the ordered set of user identities, it can also reduce the length of feedback information f, reduce control signaling resource overhead, and improve information transmission efficiency.
  • Figure 28 is a schematic diagram of the relationship between the second node, the transport block, the random access label and the label index provided in the example of this application.
  • the difference between this example and Example 12 is that the base station receives the transmission block sent by the terminal sequence
  • the transmission block b(t) in the transmission block set B is sent to the base station by the terminal SN(t) in the terminal sequence, where
  • the transmission blocks in block set B include random access tags; where the random access tags are Sparse Code Sequences.
  • the sparse code sequences included in the transmission blocks b(1), b(2), b(3), and b(4) in the transmission block set B are terminal SN(1), SN(2), and SN(3) respectively.
  • SN(4) is a sparse code sequence r(2), r(3), r(4), r(1) determined based on high-level parameters, where the sparse code sequence r(2), r(3), r(4 ), r(1) is the element of the ordered set of random access tags.
  • Figure 29 is a schematic diagram of determining feedback information through arithmetic coding according to the transport block error pattern provided by the example of this application. As shown in Figure 29, 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 the signal containing the feedback information f and decodes it, and determines the transmission blocks b(1), b(2) according to the following method ,b(3),b(4)’s response:
  • the terminal SN(1) determines that the responses to the transport block b(1) are all error responses NACK; if the terminal SN(1) decodes successfully and obtains feedback information f, the terminal SN(1) The decoded feedback information f is arithmetic decoded to obtain the transport block error pattern a.
  • the terminal SN(1) determines the transport block.
  • the response of b(1) is the correct response ACK.
  • the terminal SN (2) determines that the response to the transport block b (2) is an error response NACK; if the terminal SN (2) decodes successfully, the feedback information f is obtained, and the terminal SN (2) decodes The obtained feedback information f is arithmetic decoded to obtain the transport block error pattern a.
  • the terminal SN(2) determines the transport block b.
  • the response of (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 feedback information f is obtained, and the terminal SN (3) decodes The obtained feedback information f is arithmetic decoded to obtain the transport block error pattern a.
  • the terminal SN(3) determines the transport block b.
  • the response to (3) is an error response NACK.
  • the terminal SN (4) determines that the response to the transport block b (4) is an error response NACK; if the terminal SN (4) decodes successfully and obtains the feedback information f, the terminal SN (4) The decoded feedback information f is arithmetic decoded to obtain the transport block error pattern a.
  • the terminal SN(4) determines the transport block.
  • the response of b(4) is an error response NACK.
  • the length of the feedback information f changes with P, so that the average length of the feedback information f is shorter than that in Example 12.
  • the terminal can use a lower signal-to-noise ratio. Receive feedback information f to improve coverage.
  • the random access tag included in the transmission block b(t) in the transmission block set B is the pilot sequence (Pilot Sequence)
  • the pilot sequence is an element of an ordered set of random access tags.
  • Figure 31 is a schematic diagram of determining feedback information through arithmetic coding according to the correct transmission block identification set provided by the example of this application. As shown in Figure 31, the base station determines the feedback information f according to the following method:
  • Figure 32 is a schematic diagram of determining feedback information through arithmetic coding based on the correct transmission block identification set provided by the example of this application.
  • the terminal sequence ⁇ SN(1), SN(2), SN(3), SN(4)> receives the signal containing the feedback information f and decodes it, and determines the transmission blocks b(1), b(2) according to the following method ,b(3),b(4)’s response:
  • the terminal SN(1) determines that the responses to the transport block b(1) are all error responses NACK; if the terminal SN(1) decodes successfully and obtains feedback information f, the terminal SN(1) The decoded feedback information f is arithmetic decoded to obtain the correct transmission block identification set BI.
  • the tag index of the random access tag included in the transmission block b(1) is 2 and belongs to the correct transmission block identification set BI.
  • the terminal SN(1) determines the transmission The response of block b(1) is the correct response ACK.
  • the terminal SN (2) determines that the response to the transport block b (2) is an error response NACK; if the terminal SN (2) decodes successfully, the feedback information f is obtained, and the terminal SN (2) decodes The obtained feedback information f is arithmetic decoded to obtain the correct transmission block identification set BI.
  • the tag index of the random access tag included in the transmission block b(2) is 3, which belongs to the correct transmission block identification set BI.
  • the terminal SN(2) determines the transmission block.
  • the response of 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 feedback information f is obtained, and the terminal SN (3) decodes The obtained feedback information f is arithmetic decoded to obtain the correct transmission block identification set BI.
  • the tag index of the random access tag included in the transmission block b(3) is 4 and does not belong to the correct transmission block identification set BI.
  • the terminal SN(3) determines the transmission The response of block b(3) is the error response NACK.
  • the terminal SN (4) determines that the response to the transport block b (4) is an error response NACK; if the terminal SN (4) decodes successfully and obtains the feedback information f, the terminal SN (4) The decoded feedback information f is arithmetic decoded to obtain the correct transmission block identification set BI.
  • the tag index of the random access tag included in the transmission block b (4) is 1 and does not belong to the correct transmission block identification set BI.
  • the terminal SN (4) determines The response to transport block b(4) is the error response NACK.
  • the feedback information f is directly the compressed codeword c, making the feedback information f the shortest.
  • the length of feedback information f is The signal containing feedback information f is Empty signal.
  • P is different, the length of the feedback information f is different, so different P can be distinguished at the receiving end, thereby restoring the correct transmission block identification set BI.
  • Figure 33 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 user identifier is an integer.
  • 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 (Permanent Equipment Identifier, PEI), or a network access identifier.
  • SUPI Subscription Permanent Identifier
  • GPSI Generic Public Subscription Identifier
  • PEI Permanent Equipment Identifier
  • PEI Permanent Equipment Identifier
  • Network Access Identifier Network Access Identifier, NAI), Subscription Concealed Identifier (SUCI), Globally Unique Temporary Identity (GUTI), Wireless Network Temporary Identifier (RNTI), System Information RNTI (System Information RNTI, SI-RNTI), paging RNTI (Paging RNTI, P-RNTI), random access RNTI (Random Access RNTI, RA-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), uplink shared channel transmit power control RNTI (Transmit Power Control-PUSCH RNTI, TPC-PUSCH -RNTI), channel sounding reference signal transmit power control RNTI (Transmit Power Control-Sounding Reference Symbols RNTI, TPC-SRS-RNTI), interruption RNTI (Interruption RN
  • 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 transmission block errors.
  • 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 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.
  • the feedback information f is the feedback information of the transport block set B;
  • the feedback information f is the length bit sequence;
  • the feedback information f is determined by the base station according to the signal containing the transport block set B sent by the terminal sequence.
  • Figure 34 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, determine whether the decoding result contains a bit sequence corresponding to the transport block identifier of the transport block sent by the second node based on the number of binary representation bits of the information of the correct transport block set.
  • Step S7310 If the decoding result does not contain a bit sequence corresponding to 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 a bit sequence corresponding to 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 a correct response ACK.
  • Figure 35 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 according to the transport block set; wherein the feedback information is used to characterize the reception of the transport blocks sent by the second node;
  • the sending module 204 is configured to send feedback information to at least one second node.
  • Figure 36 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 37 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 302 in the base station can be connected through a bus or other means.
  • Figure 37 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 38 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 403 and a transmitter 404.
  • the number of memory 501 and processor 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 38 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, which includes 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 reads the computer program from the computer-readable storage medium.
  • Program or computer instructions the processor executes the computer program or computer instructions, so that the computer device performs the information transmission method provided by any embodiment of the present application.
  • 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 media used for storage of information such as computer readable instructions, data structures, program modules or other data. volatile and non-volatile, removable and non-removable media implemented in any method or technology.
  • 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

Abstract

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

Description

信息传输方法、装置、基站、设备、存储介质及程序产品
相关申请的交叉引用
本申请基于申请号为202210675048.7、申请日为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是本申请一实施例提供的一种信息传输装置结构示意图；
图36是本申请一实施例提供的一种信息传输装置结构示意图；
图37是本申请一实施例提供的基站的结构示意图；
图38是本申请一实施例提供的用户设备的结构示意图。
具体实施方式
为了使本申请的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本申请进行进一步详细说明。应当理解，此处所描述的具体实施例仅用以解释本申请，并不用于限定本申请。
需要说明的是，虽然在装置示意图中进行了功能模块划分，在流程图中示出了逻辑顺序，但是在某些情况下，可以以不同于装置中的模块划分，或流程图中的顺序执行所示出或描述的步骤。说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
本申请实施例的描述中，除非另有明确的限定，设置、安装、连接等词语应做广义理解，所属技术领域技术人员可以结合技术方案的具体内容合理确定上述词语在本申请实施例中的具体含义。本申请实施例中，“进一步地”、“示例性地”或者“可选地”等词用于表示作为例子、例证或说明，不应被解释为比其它实施例或设计方案更优选或更具有优势。使用“进一步地”、“示例性地”或者“可选地”等词旨在以具体方式呈现相关概念。
图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、步骤S3100以及步骤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(k)的索引k，k＝1,2,....,Na，用户标识的索引值为整数。
在一些实施例中，传输块标识为用户标识的索引值，用户标识为用户标识有序集合中的元素，用户标识有序集合包括Na个用户标识ID(1),ID(2),...,ID(Na)；其中，Na为用户标识有序集合大小，也是传输块标识有序集合大小，k＝1,2,...,Na，用户标识有序集合中的第k个用户标识ID(k)对应的用户标识的索引值为传输块标识有序集合元素中的第k个元素I(k)。一个具体的例子是：用户标识有序集合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、传输块差错图样a、反馈信息f的长度Nf。需要说明的是，根据上述一种或多种正确传输块的信息即可得到反馈信息，即，反馈信息的生成不是一定需要上述全部信息。
在一些实施例中，最大正确传输块数目Pmax等于传输块标识有序集合大小Na；在另一些实施例中，最大正确传输块数目Pmax由第一节点配置；在又一些实施例中，最大正确传输块数目Pmax由高层参数预先配置。
在一些实施例中，正确传输块集合的信息为正确传输块标识集合，正确传输块标识集合为传输块集合中正确接收的传输块所包括的用户标识的集合。正确接收的传输块是指应答状态为正确应答ACK的传输块，一个用户标识属于正确传输块标识集合用于指示对应该用户标识的传输块的应答状态为正确应答ACK，一个用户标识不属于正确传输块标识集合用于指示对应该用户标识的传输块的应答状态为错误应答NACK。
在一些实施例中，正确传输块集合的信息为正确传输块标识集合，正确传输块标识集合为用户标识的索引值的集合。正确接收的传输块是指应答状态为正确应答ACK的传输块，一个用户标识的索引值属于正确传输块标识集合用于指示对应该用户标识的索引值的传输块的应答状态为正确应答ACK，一个用户标识的索引值不属于正确传输块标识集合用于指示对应该用户标识的索引值的传输块的应答状态为错误应答NACK。
在一些实施例中，正确传输块集合的信息为正确传输块标识集合，正确传输块标识集合为传输块集合中正确接收的传输块所对应的随机接入标签的标签索引的集合。正确接收的传输块是指应答状态为正确应答ACK的传输块，一个随机接入标签的标签索引属于正确传输块标识集合用于指示对应该随机接入标签的传输块的应答状态为正确应答ACK，一个随机接入标签的标签索引不属于正确传输块标识集合用于指示对应该随机接入标签的传输块的应答状态为错误应答NACK。
步骤S3100：对正确传输块集合的信息进行编码处理，得到反馈信息；其中，反馈信息用于表征至少一个第二节点发送的传输块的接收情况；编码处理包括对正确传输块集合的信息进行二进制表示。
在一些实施例中，在对正确传输块标识集合中的P个元素分别进行二进制表示后，第一节点会进行补零处理，即与一定长度的全零序列进行拼接，得到反馈信息。图3为本申请一实施例提供的信息传输方法的流程图，具体包括步骤S3111、步骤S3112以及步骤S3113，具体描述了将正确传输块标识集合的二进制表示与全零序列拼接，得到反馈信息的过程。
步骤S3111：根据传输块标识有序集合中元素数量，得到反馈信息二进制表示位数；传输块标识有序集合为所有传输块标识的有序集合。
可以理解的是，根据传输块标识有序集合中元素数量与二进制表示的规则，可以确定采 用二进制表示传输块标识所需的位数，即在传输块标识有序集合包括Na个元素时，需要位进行二进制表示，其中表示大于或等于log2(Na)的最小整数。更为具体的，当用户标识有1,2,3,4,5,6,7时，需要至少3位来进行二进制表示。
步骤S3112：根据反馈信息二进制表示位数，得到正确传输块标识集合中每个元素对应的二进制表示。
在一些实施例中，第一节点对正确传输块标识集合中的P个元素分别进行二进制表示，得到长度为的序列，其中，表示大于或等于log2(Na)的最小整数。
步骤S3113：将正确传输块标识集合中所有元素对应的二进制表示与全零序列进行拼接，得到反馈信息。
在一些实施例中，第一节点对二进制表示的P个元素进行补零处理，即在长度为的序列后拼接长度为的全零序列，构成长度为 的反馈信息；其中，表示大于或等于log2(Na)的最小整数。
在一些实施例中，在对正确传输块标识集合中的P个元素分别进行二进制表示后，第一节点将正确传输块标识集合中所有元素对应的二进制表示进行拼接，得到反馈信息。图4为本申请一实施例提供的信息传输方法的流程图，具体包括步骤S3121、步骤S3122以及步骤S3123，具体描述了将正确传输块标识集合的二进制表示直接作为反馈信息的过程。
步骤S3121：根据传输块标识有序集合中元素数量，得到反馈信息二进制表示位数；传输块标识有序集合为所有传输块标识的有序集合。
可以理解的是，根据传输块标识有序集合中元素数量与二进制表示的规则，可以确定采用二进制表示传输块标识所需的位数，即在传输块标识有序集合包括Na个元素时，需要位进行二进制表示，其中表示大于或等于log2(Na)的最小整数。更为具体的，当用户标识有1,2,3,4,5,6,7时，需要至少3位来进行二进制表示。
步骤S3122：根据反馈信息二进制表示位数，得到正确传输块标识集合中每个元素对应的二进制表示。
在一些实施例中，第一节点对正确传输块标识集合中的P个元素分别进行二进制表示，得到长度为的序列，其中，表示大于或等于log2(Na)的最小整数。
步骤S3123：将正确传输块标识集合中所有元素对应的二进制表示进行拼接，得到反馈信息。
在一些实施例中，第一节点不对二进制表示的P个元素进行补零处理，直接将长度为的反馈信息发送给至少一个第二节点。
需要说明的是，在实际应用中，可以采用用户标识、用户标识的索引值、标签索引作为传输块标识对第二节点发送的传输块进行标识，第一节点在接收到这些具有传输块标识的传输块后，均可以采用补零或不补零的方式构建反馈信息，也就是说，传输块标识与是否补零没有必然联系。
在一些实施例中，根据用户标识，可以得到传输块对应的标签索引，用户标识与标签索引具有映射关系。
在一些实施例中，将用户标识作为伪随机数发生器的部分随机数种子，生成伪随机标签 索引，这些伪随机标签索引将作为传输块对应的标签索引。
在一些实施例中，将用户标识作为伪随机数发生器的全部随机数种子，生成伪随机标签索引，这些伪随机标签索引将作为传输块对应的标签索引。
步骤S4000：发送反馈信息给至少一个第二节点。
在一些实施例中，第一节点发送反馈信息给一个或多个第二节点，这些反馈信息能够表征至少一个第二节点发送的传输块在第一节点的接收情况。
上述实施例提供的信息传输方法能够使得信道编码的输入比特数大大减少，进而实现节约频谱资源，提高数据传输效率的目的。
在一些实施例中，第一节点没有正确接收的传输块，正确传输块标识集合为空集时，即P＝0时，第一节点确定反馈信息f的长度Nf＝0，即反馈信息f为空序列。第一节点确定包含为空序列的反馈信息f的信号为空信号，即第一节点确定包含反馈信息f的信号为零功率信号。
上述实施例提供的信息传输方法中由于第一节点发送零功率信号，使得能量开销降低，而第二节点序列中的一个第二节点对包含反馈信息f的信号(即零功率信号)接收不会成功，因此第二节点序列中的一个第二节点可以判断反馈信息为错误应答NACK。
图5为本申请另一实施例提供的信息传输方法的流程图。如图5所示，本申请实施例提供的信息传输方法可用于基站、中继、终端等任何具备数据接收和信令发送功能的网元，包括但不限于步骤S1000、步骤S2000、步骤S3200以及步骤S4000。
步骤S1000：接收至少一个第二节点发送的传输块，传输块形成传输块集合。
步骤S2000：根据传输块集合，得到正确传输块集合的信息。
步骤S3200：对正确传输块集合的信息进行编码处理，得到反馈信息；其中，反馈信息用于表征至少一个第二节点发送的传输块的接收情况；编码处理包括对正确传输块集合的信息进行压缩编码。
步骤S4000：发送反馈信息给至少一个第二节点。
图5对应的实施例与图2对应的实施例的区别在于，编码处理为对正确传输块集合的信息进行压缩编码，因此，对步骤S1000、S2000、S4000涉及的内容不再赘述。
可以理解的是，压缩编码可以为至少以下之一的信源编码算法：算术编码(Arithmetic coding)、霍夫曼编码(Huffman coding)、香农-费诺编码(Shanno-Fano coding)。
在一些实施例中，根据正确传输块集合的信息，直接确定压缩码字c，其中，压缩码字c为长度Nc的比特序列，正确传输块集合的信息包括至少以下之一：最大正确传输块数目Pmax、传输块标识有序集合、传输块标识有序集合大小Na、正确传输块标识集合、正确传输块数目P、传输块差错图样a。
在一些实施例中，当正确传输块集合的信息为正确传输块标识集合时，对正确传输块标识集合进行压缩编码，确定压缩码字c。
在一些实施例中，当正确传输块集合的信息为传输块差错图样a时，可以根据传输块差错图样a，确定压缩码字c。
需要说明的是，传输块差错图样a根据以下至少之一确定：传输块标识有序集合、传输 块标识有序集合大小Na、正确传输块标识集合、正确传输块数目P。
图6是本申请一实施例提供的传输块差错图样a的确定方法的流程图。如图6所示，传输块差错图样a通过下述步骤S3610、步骤S3621以及步骤S3622确定。
步骤S3610：判断每个传输块标识有序集合中的元素是否属于正确传输块标识集合。
步骤S3621：如果传输块标识有序集合中的第i个元素属于正确传输块标识集合，则传输块差错图样的第i个比特a(i)＝ack。
步骤S3622：如果传输块标识有序集合中的第i个元素不属于正确传输块标识集合，传输块差错图样的第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”。
图7是本申请另一实施例提供的传输块差错图样a的确定方法的流程图。如图7所示，传输块差错图样a通过下述步骤S3710、步骤S3720以及步骤S3730确定。
步骤S3710：根据传输块差错图样的预设长度，得到与预设长度对应的传输块差错图样初始图样，其中，传输块差错图样初始图样中的每个元素对应错误应答比特。
在一些实施例中，设置传输块差错图样为长度Na且每个元素都是比特“nack”的序列，其中，Na为传输块标识有序集合大小。
步骤S3720：根据正确传输块集合，在传输块差错图样初始图样中，将序号等于所述正确传输块集合中元素的比特设置为正确应答比特。
步骤S3730：将传输块差错图样初始图样确定为传输块差错图样。
在一些实施例中，根据正确传输块集合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”。
在一些实施例中，根据传输块标识有序集合的大小与正确传输块数目，确定压缩码字的长度。
在一具体的实施例中，压缩码字c的长度Nc大于或等于其中，Na表示传 输块标识有序集合的大小，P表示正确传输块数目，为大于或等于的最小整数，为Na取P的组合数。压缩码字c是通过将个长度为Na的包含P个比特“ack”的比特序列映射到长度为的比特序列的算术编码得到的。
在一些实施例中，根据传输块差错图样的长度与正确传输块数目，确定压缩码字的长度。
在一具体的实施例中，压缩码字c的长度Nc等于其中，Na表示传输块差错图样a的长度，P表示正确传输块数目，为大于或等于的最小整数，为Na取P的组合数。
在一些实施例中，反馈信息f包括个比特用于指示正确传输块数目P，其中，为大于或等于log2(Pmax)的最小整数。
在一些实施例中，当正确传输块数目P小于或等于1时，反馈信息f包括长度为的全零序列，其中，为大于或等于log2(Pmax)的最小整数。
在一些实施例中，反馈信息f包括个比特用于指示正确传输块数目P，其中，为大于或等于log2(Pmax+1)的最小整数。
在一些实施例中，反馈信息f包括长度为的全零序列，其中，为大于或等于的最小整数，为Na取Pmax的组合数，为大于或等于的最小整数，为Na取P的组合数。
在一些实施例中，反馈信息f的长度Nf至少根据下述参数之一确定：最大正确传输块数目、正确传输块数目、传输块标识有序集合大小、传输块差错图样的长度。
在一些实施例中，反馈信息f的长度为
在一些实施例中，反馈信息f的长度为
在一些实施例中，反馈信息f的长度为
在一些实施例中，反馈信息f的长度为
在一些实施例中，反馈信息f的长度为
图8为本申请一实施例提供的根据正确传输块标识集合确定压缩码字的流程图。如图8 所示，BI为正确传输块标识集合，P为正确传输块数目，I(1),I(2),...,I(Na)为传输块标识有序集合包括的Na个元素，Na为传输块标识有序集合大小，该方法程序框图最终输出长度为的压缩码字c的比特表示，其中，为大于或等于的最小整数，为Na取P的组合数。
图9为本申请另一实施例提供的根据传输块差错图样确定压缩码字的流程图。如图9所示，Na为传输块差错图样a的长度，P为正确传输块数目，该方法程序框图最终输出长度的压缩码字c的比特表示，其中，为大于或等于的最小整数，为Na取P的组合数。
在一些实施例中，将上述压缩码字确定为反馈信息。
在一些实施例中，将压缩码字与全零序列进行拼接，得到反馈信息。
在一些实施例中，将正确传输块数目比特序列、压缩码字与全零序列进行拼接，得到反馈信息，其中，正确传输块数目比特序列通过下述方法得到，具体如下：
图10为本申请一实施例提供的确定反馈信息的方法流程图。如图10所示，反馈信息f通过下述步骤S3310、步骤S3320以及步骤S3330确定。
步骤S3310：根据最大正确传输块数目，得到正确传输块数目二进制表示位数。
步骤S3320：根据正确传输块数目二进制表示位数，将正确传输块数目进行二进制表示，得到正确传输块数目比特序列。
步骤S3330：将正确传输块数目比特序列、压缩码字与全零序列进行拼接，得到反馈信息。
在一些实施例中，对反馈信息进行信道编码，得到第一编码序列。
需要说明的是，信道编码可以是但不限于，极化编码(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：
在本示例中，第一节点为基站，第二节点为终端，本示例包括多个终端，这些终端形成 了第二节点序列，传输块标识为用户标识，下述示例描述了正确传输块数目P为0不发送反馈信息f的具体过程。
图11是本申请示例提供的第二节点、传输块和用户标识的关系示意图，如图11所示，基站接收终端序列发送的包含传输块集合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为传输块标识有序集合的元素，传输块标识有序集合包括Na＝8个用户标识0,1,2,3,4,5,6,7。
在本示例中，最大正确传输块数目Pmax＝3由基站配置。正确传输块标识集合为传输块集合中正确接收的传输块所包括的用户标识的集合。在本示例中，基站根据包含传输块集合B的信号确定了正确传输块标识集合为空集Φ，即，正确传输块数目P＝0，进而基站根据正确传输块标识集合为空集Φ(或者正确传输块数目P＝0)确定反馈信息f的长度为Nf＝0且反馈信息f为空序列，与之对应的，基站确定包含反馈信息f的信号为零功率信号。
随后基站发送包含反馈信息f的零功率信号给终端序列SN(1),SN(2),SN(3),SN(4)。终端序列SN(1),SN(2),SN(3),SN(4)接收包含反馈信息f的零功率信号，本领域技术人员可以理解，对于t＝1,2,3,4，终端SN(t)解码失败，确定传输块b(t)的应答为错误应答NACK。
示例2：
本示例与示例1的区别在于，在本示例中，传输块标识为用户标识的索引值，用户标识有序集合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>，用户标识有序集合中的元素ID(1)＝0的用户标识的索引值是传输块标识有序集合中的元素I(1)＝0，用户标识有序集合中的元素ID(2)＝11的用户标识的索引值是传输块标识有序集合中的元素I(2)＝1，用户标识有序集合中的元素ID(3)＝20的用户标识的索引值是传输块标识有序集合中的元素I(3)＝2，用户标识有序集合中的元素ID(4)＝30的用户标识的索引值是传输块标识有序集合中的元素I(4)＝3，其中，传输块标识有序集合大小为Na＝4。
本示例与示例1的另一个区别在于，在本示例中，终端SN(1),SN(2),SN(3),SN(4)的用户标识分别为0,11,20,30，其中，用户标识0,11,20,30为用户标识有序集合ID的元素。
示例3：
本示例与示例1的区别在于，在本示例中，传输块标识为标签索引，标签索引是传输块标识有序集合的元素，传输块标识有序集合包括Na＝6个标签索引0,1,2,3,4,5，正确传输块标识集合为传输块集合中正确接收的传输块所包括的随机接入标签的标签索引的集合。
图12是本申请示例提供的第二节点、传输块、随机接入标签和标签索引的关系示意图。本示例与示例1的另一个区别在于，在本示例中，如图12所示，对于t＝1，2，3，4，传输块集合B中的传输块b(t)包括随机接入标签，其中，随机接入标签为前导码(Preamble)。传输块b(1),b(2),b(3),b(4)包括的随机接入标签分别为终端SN(1),SN(2),SN(3),SN(4)根据高层参数确定的前导码r(4),r(3),r(2),r(1)。其中，前导码r(4),r(3),r(2),r(1)是随机接入标签有序集合的元素。随机接入标签有序集合包括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)的标签索引分别为传输块标识有序集合包括的Na＝6个标签索引0,1,2,3,4,5。
示例4：
本示例与示例1的区别在于，本示例中，对于t＝1,2,3,4，终端SN(t)的用户标识为临时小区RNTI(Temporary Cell RNTI，TC-RNTI)，且传输块标识有序集合包括Na＝7个用户标识1,2,3,4,5,6,7。
本示例与示例1的另一个区别在于，在本示例中，基站根据包含传输块集合B的信号确定：正确传输块标识集合为集合BI＝{2,3}和正确传输块数目P＝2。
本示例与示例1的再一个不同之处在于，在本示例中，反馈信息f由基站根据下述参数确定：正确传输块标识集合BI＝{2,3}、正确传输快数目P＝2、传输块标识有序集合大小Na＝7和最大正确传输块数目Pmax＝3。
图13是本申请示例提供的根据正确传输块标识集合确定反馈信息的示意图。如图13所示，确定反馈信息f的具体方法如下：
基站确定正确传输块标识集合BI＝{2,3}中P＝2个元素的比特的二进制表示分别为[0,1,0]和[0,1,1]；
基站把[0,1,0]和[0,1,1]拼接得到长度的压缩序列d＝[0,1,0,0,1,1]；
基站把压缩序列d＝[0,1,0,0,1,1]和长度为的全零序列[0,0,0]拼接得到长度为的反馈信息f＝[0,1,0,0,1,1,0,0,0]。
本示例与示例1的再一个不同之处在于，在本示例中，基站发送包含反馈信息f＝[0,1,0,0,1,1,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)解码成功，得到反馈信息f，终端SN(1)对解码得到反馈信息f每个比特判断没有终端SN(1)的用户标识4，终端SN(1)确定传输块b(1)的应答为错误应答NACK。
如果终端SN(2)解码失败，则终端SN(2)确定传输块b(2)的应答为错误应答NACK；如果终端SN(2)解码成功，得到反馈信息f，终端SN(2)对解码得到反馈信息f每 个比特判断第4至6个比特包含终端SN(2)的用户标识3，终端SN(2)确定传输块b(2)的应答为正确应答ACK。
如果终端SN(3)解码失败，则终端SN(3)确定传输块b(3)的应答为错误应答NACK；如果终端SN(3)解码成功，得到反馈信息f，终端SN(3)对解码得到反馈信息f每个比特判断第1至3个比特包含终端SN(3)的用户标识2，终端SN(3)确定传输块b(3)的应答为正确应答ACK。
如果终端SN(4)解码失败，则终端SN(4)确定传输块b(4)的应答为错误应答NACK；如果终端SN(4)解码成功，得到反馈信息f，终端SN(4)对解码得到反馈信息f每个比特判断没有终端SN(4)的用户标识5，终端SN(4)确定传输块b(4)的应答为错误应答NACK。
上述示例提供的信息传输方法中用户标识不包括数值0是为了防止P<Pmax时，反馈信息f总会包括个比特的全零序列，导致无论包括用户标识为0的传输块是否正确译码，反馈信息f都会包括用户标识0，导致终端总会判断包括用户标识为0的传输块的应答为正确应答ACK，导致终端误判。
示例5：
本示例与示例4的区别在于，本示例中，传输块标识为标签索引，其中，标签索引是传输块标识有序集合的元素，传输块标识有序集合包括Na＝7个标签索引1,2,3,4,5,6,7。
图14是本申请示例提供的第二节点、传输块、随机接入标签和标签索引的关系示意图，如图14所示，本示例与示例4的另一个区别在于，本示例中，如图14所示，对于t＝1，2，3，4，传输块集合B中的传输块b(t)包括随机接入标签，其中，随机接入标签为参考信号(Reference Signal)。传输块b(1),b(2),b(3),b(4)包括的随机接入标签分别为终端SN(1),SN(2),SN(3),SN(4)根据高层参数确定的参考信号r(1),r(5),r(3),r(2)，其中，参考信号r(1),r(5),r(3),r(2)是随机接入标签有序集合的元素。随机接入标签有序集合包括Na＝7个参考信号r(1),r(2),r(3),r(4),r(5),r(6),r(7)，其中，参考信号r(1),r(2),r(3),r(4),r(5),r(6),r(7)的标签索引分别为传输块标识有序集合包括的Na＝7个标签索引1,2,3,4,5,6,7。
本示例与示例4的又一个区别在于，在本示例中，正确传输块标识集合指传输块集合中正确接收的传输块所包括的随机接入标签的标签索引的集合。
在本示例中，终端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)解码成功，得到反馈信息f，终端SN(1)对解码得到反馈信息f每个比特判断没有传输块b(1)包括的随机接入标签的标签索引1，终端SN(1)确定传输块b(1)的应答为错误应答NACK。
如果终端SN(2)解码失败，则终端SN(2)确定传输块b(2)的应答为错误应答NACK；如果终端SN(2)解码成功，得到反馈信息f，终端SN(2)对解码得到反馈信息f每个比特判断没有传输块b(2)包括的随机接入标签的标签索引5，终端 SN(2)确定传输块b(2)的应答为错误应答NACK。
如果终端SN(3)解码失败，则终端SN(3)确定传输块b(3)的应答为错误应答NACK；如果终端SN(3)解码成功，得到反馈信息f，终端SN(3)对解码得到反馈信息f每个比特判断第4至6个比特包含传输块b(3)包括的随机接入标签的标签索引3，终端SN(3)确定传输块b(3)的应答为正确应答ACK。
如果终端SN(4)解码失败，则终端SN(4)确定传输块b(4)的应答为错误应答NACK；如果终端SN(4)解码成功，得到反馈信息f，终端SN(4)对解码得到反馈信息f每个比特判断第1至3个比特包含传输块b(4)包括的随机接入标签的标签索引2，终端SN(4)确定传输块b(4)的应答为正确应答ACK。
上述示例4和示例5提供的信息传输方法中，通过直接发送正确传输块标识集合中元素的二进制表示，压缩和解码过程复杂度低，能够提高信息传输效率。
示例6：
在本示例中，第一节点为中继，第二节点为终端，本示例包括多个终端，这些终端形成了第二节点序列，传输块标识为用户标识。
图15是本申请示例提供的第二节点、传输块、用户标识、随机接入标签和标签索引的关系示意图，如图15所示，中继接收终端序列发送的包含传输块集合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(Cell RNTI，C-RNTI)。终端SN(1),SN(2),SN(3),SN(4)的用户标识分别为4,3,2,0，其中，用户标识4,3,2,0为传输块标识有序集合的元素，传输块标识有序集合包括Na＝8个用户标识0,1,2,3,4,5,6,7。对于t＝1,2,3,4，传输块b(t)包括的随机接入标签是扩频序列(Spread Spectrum Sequence)，其中，扩频序列是随机接入标签有序集合的元素。随机接入标签有序集合包括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,0按照下面的公式确定的扩频序列：
传输块b(t)包括的扩频序列的标签索引＝终端SN(t)的用户标识的平方除以6的余数。
把终端SN(1),SN(2),SN(3),SN(4)的用户标识4,3,2,0分别代入上式，得到终端SN(1),SN(2),SN(3),SN(4)的扩频序列分别为r(5),r(4),r(5),r(1)。
在本示例中，最大正确传输块数目Pmax＝3由高层参数配置。在本示例中，正确传输块标识集合指传输块集合中正确接收的传输块所包括的用户标识的集合。在本示例中，中继根据包含传输块集合B的信号确定：正确传输块标识集合为集合BI＝{4,0}和正确传输块数目P＝2。反馈信息f由中继根据下面的参数确定：正确传输块标识集合BI、正确传输块数目P＝ 2、传输块标识有序集合大小Na＝8。
图16是本申请示例提供的根据正确传输块标识集合确定反馈信息的示意图，如图16所示，确定反馈信息f的具体方法如下：
中继确定正确传输块标识集合BI＝{4,0}中P＝2个元素的比特的二进制表示分别为[1,0,0]和[0,0,0]；
中继把[1,0,0]和[0,0,0]拼接(concatenation)得到长度的反馈信息f＝[1,0,0,0,0,0]。
中继发送包含反馈信息f＝[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)解码成功，得到反馈信息f，终端SN(1)对解码得到的反馈信息f每个比特判断第1至3个比特包含终端SN(1)的用户标识4，终端SN(1)确定传输块b(1)的应答为正确应答ACK。
如果终端SN(2)解码失败，则终端SN(2)确定传输块b(2)的应答为错误应答NACK；如果终端SN(2)解码成功，得到反馈信息f，终端SN(2)对解码得到的反馈信息f每个比特判断没有包含终端SN(2)的用户标识3，终端SN(2)确定传输块b(2)的应答为错误应答NACK。
如果终端SN(3)解码失败，则终端SN(3)确定传输块b(3)的应答为错误应答NACK；如果终端SN(3)解码成功，得到反馈信息f，终端SN(3)对解码得到的反馈信息f每个比特判断没有包含终端SN(3)的用户标识2，终端SN(3)确定传输块b(3)的应答为错误应答NACK。
如果终端SN(4)解码失败，则终端SN(4)确定传输块b(4)的应答为错误应答NACK；如果终端SN(4)解码成功，得到反馈信息f，终端SN(4)对解码得到的反馈信息f每个比特判断第4至6比特为终端SN(4)的用户标识0，终端SN(4)确定传输块b(4)的应答为正确应答ACK。
本示例提供的信息传输方法中，传输块标识为用户标识的优点是在终端SN(1)和SN(3)的随机接入标签相同时，仍然能够在反馈信息f中区分不同终端的传输块的应答信号。相比于示例4，由于反馈信息f没有补零，在一个用户标识占用3比特的条件下，使得反馈信息f的长度从9减少到6，并且用户标识0也能够使用而反馈信息f不会出现误判。在使用相同的信道资源下可以降低终端的接收功率，提升覆盖。本示例直接反馈正确传输块包括的用户标识且不补零的好处是压缩过程简单且进一步降低了编码码率，提高性能。
示例7：
本示例与示例6的区别在于，本示例中，传输块标识为标签索引，其中，标签索引为传输块标识有序集合的元素，传输块标识有序集合包括Na＝6个传输块标识0,1,2,3,4,5。
图17是本申请示例提供的第二节点、传输块、用户标识、随机接入标签和标签索引的关系的示意图。本示例与示例6的另一个区别在于，如图17所示，对于t＝1 2,3,4,终端SN(t)的用户标识为调制编码方式小区RNTI(Modulcation Coding Scheme Cell RNTI，MCS-C-RNTI)。传输块b(t)包括的随机接入标签为加扰序列(Scrambling Sequence)，其中，加扰序列是随机接入标签有序集合的元素。随机接入标签有序集合包括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)的标签索引分别为传输块标识有序集合的传输块标识0,1,2,3,4,5。进一步地，传输块b(1),b(2),b(3),b(4)包括的随机接入标签分别是根据终端SN(t)的用户标识按照下面的方法确定的加扰序列：
终端SN(1),SN(2),SN(3),SN(4)分别把终端SN(1),SN(2),SN(3),SN(4)的用户标识4,3,2,0作为伪随机序列发生器(Pseudo-Random Sequence Generator)的随机数种子的一部分得到终端SN(1),SN(2),SN(3),SN(4)的随机接入标签的标签索引分别为4,3,1,0，得到传输块b(1),b(2),b(3),b(4)包括的随机接入标签分别为r(5),r(4),r(2),r(1)。
本示例与示例6的又一个区别在于，本示例中，正确传输块标识集合指传输块集合中正确接收的传输块所包括的随机接入标签的标签索引的集合。在本示例中，中继根据包含传输块集合B的信号确定：正确传输块标识集合为集合BI＝{1,0}和正确传输块数目P＝2。反馈信息f由中继根据下面的参数确定：正确传输块标识集合BI、正确传输块数目P＝2、传输块标识有序集合大小Na＝6。
图18是本申请示例提供的根据正确传输块标识集合确定反馈信息的示意图，如图18所示，确定反馈信息f的具体方法如下：
中继确定正确传输块标识集BI＝{1,0}中P＝2个元素的比特的二进制表示分别为[0,0,1]和[0,0,0]；
中继把[0,0,1]和[0,0,0]拼接得到长度的反馈信息f＝[0,0,0,0,0,1]。
本示例与示例6的再一个区别在于，在本示例中，中继发送包含反馈信息f＝[0,0,0,0,0,1]的信号给终端序列<SN(1),SN(2),SN(3),SN(4)>。终端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)解码成功，得到反馈信息f，终端SN(1)对解码得到的反馈信息f每个比特判断没有包含传输块b(1)包括的随机接入标签r(5)的标签索引4，终端SN(1)确定传输块b(1)的应答为错误应答NACK。
如果终端SN(2)解码失败，则终端SN(2)确定传输块b(2)的应答为错误应答NACK；如果终端SN(2)解码成功，得到反馈信息f，终端SN(2)对解码得到的反馈信息f每个比特判断没有包含传输块b(2)包括的随机接入标签r(4)的标签索引3，终端SN(2)确定传输块b(2)的应答为错误应答NACK。
如果终端SN(3)解码失败，则终端SN(3)确定传输块b(3)的应答为错误应答NACK；如果终端SN(3)解码成功，得到反馈信息f，终端SN(3)对解码得到的反馈信息f每个比特判断第4至6个比特包含传输块b(3)包括的随机接入标签r(2) 的标签索引1，终端SN(3)确定传输块b(3)的应答为正确应答ACK。
如果终端SN(4)解码失败，则终端SN(4)确定传输块b(4)的应答为错误应答NACK；如果终端SN(4)解码成功，得到反馈信息f，终端SN(4)对解码得到的反馈信息f每个比特判断第1至3比特包含传输块b(4)包括的随机接入标签r(1)的标签索引0，终端SN(4)确定传输块b(4)的应答为正确应答ACK。
本示例提供的信息传输方法中，通过使用伪随机序列选择随机接入标签降低了不同用户之间的随机接入标签相同的概率。同时，相比于示例5，由于反馈信息f没有补零，在一个标签索引占用3比特的条件下，使得反馈信息f的长度从9减少到6。在使用相同的信道资源下，降低了信道编码码率，可以降低中继的接收功率，提升覆盖。同时，正确传输块标识集合BI中的元素在反馈信息f的位置可以是任意的。本示例中直接反馈正确传输块包括的随机接入标签的标签索引并且不补零的好处是压缩过程简单且进一步降低了信道编码码率，提高性能。
示例8：
在本示例中，第一节点为基站，第二节点为终端，本示例中有多个终端，形成终端序列，传输块标识为用户标识：
如图11所示，基站接收终端序列发送的包含传输块集合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(Configured Scheduling RNTI，CS-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)>＝<0,1,2,3,4,5,6,7>中的元素。传输块标识有序集合包括Na个用户标识0,1,2,3,4,5,6,7。
在本示例中，最大正确传输块数目Pmax＝3由基站配置。正确传输块标识集合指传输块集合中正确接收的传输块所对应的用户标识的集合。基站根据包含传输块集合B的信号确定：正确传输块标识集合为集合BI＝{2,3}、正确传输块数目P＝2。
在本示例中，反馈信息f由基站根据下述参数确定：正确传输块标识集合BI、正确传输块数目P＝2、传输块标识有序集合I、传输块标识有序集合大小Na＝8、最大正确传输块数目Pmax＝3、传输块差错图样a。其中，传输块差错图样a由基站根据下述参数确定：正确传输块标识集合BI、传输块标识有序集合I和传输块标识有序集合大小Na。
在本示例中，正确应答ACK的比特“ack”为比特“1”，错误应答NACK的比特“nack”为“0”。基站按照下述方法对正确传输块标识集合进行压缩编码确定压缩码字c：
基站根据正确传输块标识集合BI＝{2,3}、传输块标识有序集合I和传输块标识有序集合大小Na确定传输块差错图样a＝[0,0,1,1,0,0,0,0]。
图19为本申请示例提供的根据传输块差错图样经过算术编码确定反馈信息f的示意图， 如图19所示，基站对传输块差错图样a＝[0,0,1,1,0,0,0,0]按照下述方法确定反馈信息f：
基站确定将P＝2表示为个比特的二进制比特序列Pb＝[1,0]；
基站根据P＝2和传输块差错图样a＝[0,0,1,1,0,0,0,0]确定压缩码字的长度为
图20是本申请示例提供的传输块错误图样与压缩码字的映射图表，如图20所示，把 个Na＝8长的包含P＝2个比特“ack”＝1的序列映射到长的比特序列的算术编码得到压缩码字c＝[1,0,0,0,1]。
基站把比特序列Pb＝[1,0]、压缩码字c＝[1,0,0,0,1]和长度为的全零序列拼接起来得到反馈信息f＝[1,0,1,0,0,0,1,0]，其中，反馈信息f的长度为
在本示例中，基站发送包含反馈信息f＝[1,0,1,0,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)解码成功，得到反馈信息f，终端SN(1)对解码得到的反馈信息f进行算术解码得到传输块错误图样a，由终端SN(1)的用户标识为4且a(5)＝0，终端SN(1)确定传输块b(1)的应答为错误应答NACK。
如果终端SN(2)解码失败，则终端SN(2)确定传输块b(2)的应答为错误应答NACK；如果终端SN(2)解码成功，得到反馈信息f，终端SN(2)对解码得到的反馈信息f进行算术解码得到传输块错误图样a，由终端SN(2)的用户标识3且a(4)＝1，终端SN(2)确定传输块b(2)的应答为正确应答ACK。
如果终端SN(3)解码失败，则终端SN(3)确定传输块b(3)的应答为错误应答NACK；如果终端SN(3)解码成功，得到反馈信息f，终端SN(3)对解码得到的反馈信息f进行算术解码得到传输块错误图样a，由终端SN(3)的用户标识2且a(3)＝1，终端SN(3)确定传输块b(3)的应答为正确应答ACK。
如果终端SN(4)解码失败，则终端SN(4)确定传输块b(4)的应答为错误应答NACK；如果终端SN(4)解码成功，得到反馈信息f，终端SN(4)对解码得到的反馈信息f进行算术解码得到传输块错误图样a，由终端SN(4)的用户标识5且a(6)＝0，终端SN(4)确定传输块b(4)的应答为错误应答NACK。
本示例提供的信息传输方法，通过将正确传输块标识集合BI转换为传输块错误图样a， 并且通过算术编码得到反馈信息f，其中添加长度为的全零序列，使得反馈信息f的长度不随正确传输块标识集合BI的大小而改变，可以降低译码的复杂度。需要说明的是，虽然本示例中反馈信息f与传输块错误图样a长度一样，但实际应用中，传输块错误图样a的长度Na很大，反馈信息f将比传输块错误图样a的长度要短。例如，当Na＝100，Pmax＝4时，反馈信息f的长度Nf为远小于Na＝100的长度。因此，在相同资源的情况下，本示例提供的方案相比直接传输传输块错误图样a的信道编码码率要低，从而使终端可以使用更低的接收信噪比，增强覆盖。
示例9：
本示例与示例8的区别在于，本示例中，最大正确传输块数目Pmax＝4由基站配置。
图21为本申请示例提供的根据传输块错误图样经过算术编码确定反馈信息的示意图，如图21所示，基站对传输块差错图样a＝[0,0,1,1,0,0,0,0]按照下面的方法确定反馈信息f：
基站确定将P-1＝1表示为个比特的二进制比特序列Pb＝[0,1]，其中，若P＝0，基站确定Pb＝[0,0]。
基站根据P＝2和传输块差错图样a＝[0,0,1,1,0,0,0,0]确定压缩码字c的长度为
如图20所示，把个Na＝8长的包含P＝2个比特ack＝1的序列映射到长的比特序列的算术编码得到压缩码字c。
基站把比特序列Pb＝[0,1]、算术编码码字c＝[1,0,0,0,1]和长度为的全零序列拼接起来得到反馈信息f＝[0,1,1,0,0,0,1,0]，其中，反馈信息f的长度为在本示例提供的信息传输方法中，考虑到压缩码字c不会是全零码字。当P＝0时，反馈信息f为长的全零序列；当P＝1时，反馈信息f的前个比特为全零序列，由于压缩码字c不是全零码字，因此P＝1时反馈信息f不是全零序列，可以实现与P＝0的码字区分。相较于示例8的方式编码(即使用 比特表示P)，节省了1比特来表示P的值，从而缩短了反馈信息f的长度，减少了控制信令资源开销。
示例10：
本示例与示例8的区别在于，在本示例中，正确应答ACK的比特ack为比特“0”，错误 应答NACK的比特nack为“1”。基站根据正确传输块标识集合BI＝{2,3}、传输块标识有序集合I和传输块标识有序集合大小Na确定传输块错误图样a＝[1,1,0,0,1,1,1,1]。
图22为本申请示例提供的根据传输块错误图样经过算术编码确定反馈信息的示意图，如图22所示，基站对传输块错误图样a＝[1,1,0,0,1,1,1,1]按照下面的方法确定反馈信息f：
基站根据P＝2和传输块错误图样长度Na＝8确定压缩码字c的长度为
图23本申请示例提供的传输块差错图样与压缩码字的映射图表，如图23所示，把 个Na＝8长的包含P＝2个比特“ack”＝0的序列映射到长度为的比特序列的算术编码得到压缩码字c＝[0,1,1,1,1]。
基站把压缩码字c＝[0,1,1,1,1]和长度为 的全零序列拼接起来得到反馈信息f＝[0,1,1,1,1,0]，其中，反馈信息f的长度为
本示例与示例8的另一个区别在于，在本示例中，基站发送包含反馈信息f＝[0,1,1,1,1,0]的信号给终端序列<SN(1),SN(2),SN(3),SN(4)>。终端序列<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)解码成功，得到反馈信息f，终端SN(1)对解码得到的反馈信息f进行算术解码得到传输块差错图样a，由终端SN(1)的用户标识为4且a(5)＝1，终端SN(1)确定传输块b(1)的应答为错误应答NACK。
如果终端SN(2)解码失败，则终端SN(2)确定传输块b(2)的应答为错误应答NACK；如果终端SN(2)解码成功，得到反馈信息f，终端SN(2)对解码得到的反馈信息f进行算术解码得到传输块差错图样a，由终端SN(2)的用户标识3且a(4)＝0，终端SN(2)确定传输块b(2)的应答为正确应答ACK。
如果终端SN(3)解码失败，则终端SN(3)确定传输块b(3)的应答为错误应答NACK；如果终端SN(3)解码成功，得到反馈信息f，终端SN(3)对解码得到反馈信息f进行算术解码得到传输块差错图样a，由终端SN(3)的用户标识2且a(3)＝0，终端SN(3)确定传输块b(3)的应答为正确应答ACK。
如果终端SN(4)解码失败，则终端SN(4)确定传输块b(4)的应答为错误应答NACK；如果终端SN(4)解码成功，得到反馈信息f，终端SN(4)对解码得到的反馈信息f进行算术解码得到传输块差错图样a，由终端SN(4)的用户标识5且a(6)＝1，终端SN(4)确定传输块b(4)的应答为错误应答NACK。
在本示例提供的信息传输方法中，反馈信息f没有包含P＝2的2比特二进制表示，使得反馈信息f的长度更短，减少了控制信令资源开销。
示例11：
本示例与示例10的区别在于，在本示例中，最大正确传输块数目Pmax＝Na＝8，其中，Na＝8是传输块标识有序集合大小。
如图24所示，基站对传输块差错图样a＝[1,1,0,0,1,1,1,1]按照下面的方法确定反馈信息f：
基站根据正确传输块数目P＝2和传输块差错图样a＝[1,1,0,0,1,1,1,1]确定压缩码字c的长度为
图23本申请示例提供的传输块差错图样与压缩码字的映射图表，如图23所示，把 个Na＝8长的包含P＝2个比特“ack”＝0的序列映射到长度为的比特序列的算术编码得到压缩码字c＝[0,1,1,1,1]。
基站确定反馈信息f为压缩码字c，即f＝c＝[0,1,1,1,1]，其中，反馈信息f的长度为
在本示例提供的信息传输方法中，反馈信息f没有在压缩码字c后面补零，使得反馈信息f的长度更短，进一步节省了资源；或者在相同资源下，使得终端接收信噪比可以更低。接收端对不同长度的反馈信息f进行解码得到正确传输块数目P。
示例12：
在本示例中，第一节点为基站，第二节点为终端，本示例中有多个终端，形成终端序列，传输块标识为标签索引。
图25是本申请示例提供的第二节点、传输块、随机接入标签和标签索引的关系示意图，如图25所示，基站接收终端序列发送的包含传输块集合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)的信号。
在本示例中，对于t＝1,2,3，传输块集合B中的传输块b(t)由终端SN(t)向基站发送。传输块集合B中的传输块b(4)也由终端SN(1)向基站发送。
对于t＝1,2,3,4，传输块集合B中的传输块b(t)对应了随机接入标签，其中，随机接入标签为交织器(Interleaver)。传输块b(1),b(2),b(3),b(4)对应的随机接入标签分别为终端SN(1),SN(2),SN(3),SN(1)根据高层参数确定的随机接入标签r(2),r(3),r(4),r(1)，其中，交织器r(2),r(3),r(4),r(1)是随机接入标签有序集合的元素。随机接入标签有序集合包括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)的标签索引分别为传输块标识有序集合包括的Na＝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>。
在本示例中，最大正确传输块数目Pmax＝2由基站配置。正确传输块标识集合指传输块集合中正确接收的传输块包括的随机接入标签的标签索引的集合。基站根据包含传输块集合B的信号确定：正确传输块标识集合为BI＝{2,3}、正确传输块数目P＝2。反馈信息f由基站根据下面的参数确定：正确传输块标识集合BI、正确传输块数目P＝2、传输块标识有序集合I、传输块标识有序集合大小Na＝6、最大正确传输块数目Pmax＝2、传输块差错图样a。
在本示例中，正确应答ACK的比特“ack”为比特“1”，错误应答NACK的比特“nack”为“0”。在本实例中，基站按照下述方法确定反馈信息f：
基站根据正确传输块标识集合BI＝{2,3}和传输块标识有序集合大小Na＝6确定传输块差错图样a为a＝[0,1,1,0,0,0]；
图26是本申请示例提供的根据传输块差错图样经过算术编码确定反馈信息的示意图，如图26所示，基站对传输块差错图样a＝[0,1,1,0,0,0]按照下面的方法确定反馈信息f：
基站确定P＝2的个比特的二进制表示为比特序列Pb＝[1,0]。
基站根据P＝2和传输块差错图样a＝[0,1,1,0,0,0]确定压缩码字c的长度为
图27是本申请示例提供的传输块差错图样与压缩码字的映射图表，如图27所示，把 个Na＝6长的包含P＝2个比特“ack”＝1的序列映射到长度为 的比特序列的算术编码得到压缩码字c＝[1,0,1,0]。
基站把比特序列Pb＝[1,0]、压缩码字c＝[1,0,1,0]和长度为 的全零序列拼接起来得到反馈信息f＝[1,0,1,0,1,0,0]，其中，反馈信息f的长度为
在本示例中，基站发送包含反馈信息f＝[1,0,1,0,1,0,0]的信号给终端序列<SN(1),SN(2),SN(3)>。终端序列<SN(1),SN(2),SN(3)>接收包含反馈信息f的信号并进行解码，按照下面的方法确定传输块b(1),b(2),b(3),b(4)的应答：
如果终端SN(1)解码失败，则终端SN(1)确定传输块b(1)和传输块b(4)的应答都为错误应答NACK；如果终端SN(1)解码成功，得到反馈信息f，终端SN(1)对解码得到的反馈信息f进行算术解码得到传输块差错图样a，由传输块b(1)对应的随机接入标签的标签索引为2且a(2)＝1，终端SN(1)确定传输块b(1)的应答为正确应答ACK，由传输块b(4)对应的随机接入 标签的标签索引为1且a(1)＝0，终端SN(1)确定传输块b(4)的应答为错误应答NACK。
如果终端SN(2)解码失败，则终端SN(2)确定传输块b(2)的应答为错误应答NACK；如果终端SN(2)解码成功，得到反馈信息f，终端SN(2)对解码得到的反馈信息f进行算术解码得到传输块差错图样a，由传输块b(2)对应的随机接入标签的标签索引为3且a(3)＝1，终端SN(2)确定传输块b(2)的应答为正确应答ACK。
如果终端SN(3)解码失败，则终端SN(3)确定传输块b(3)的应答为错误应答NACK；如果终端SN(3)解码成功，得到反馈信息f，终端SN(3)对反馈信息f进行算术解码得到的传输块差错图样a，由传输块b(3)对应的随机接入标签的标签索引为4且a(4)＝0，终端SN(3)确定传输块b(3)的应答为错误应答NACK。
在本示例提供的信息传输方法中，终端SN(1)发送了两个传输块b(1)和b(4)，但选取了不同的随机接入标签；基站根据正确译码的传输块的随机接入标签的标签索引来确定反馈信息f，使得终端SN(1)可以区分两个传输块b(1)和b(4)是否被正确接收。同时，由于随机接入标签有序集合大小一般小于用户标识有序集合大小，因此也能减少反馈信息f的长度，减少了控制信令资源开销，提高信息传输效率。
示例13：
图28是本申请示例提供的第二节点、传输块、随机接入标签和标签索引的关系示意图，如图28所示，本示例与示例12的区别在于，基站接收终端序列发送的包含传输块集合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)的信号。
本示例与示例12的另一个区别在于，对于t＝1,2,3,4，传输块集合B中传输块b(t)由终端序列中的终端SN(t)向基站发送，其中，传输块集合B中的传输块包括随机接入标签；其中，随机接入标签为稀疏码序列(Sparse Code Sequence)。传输块集合B中的传输块b(1),b(2),b(3),b(4)包括的稀疏码序列分别为终端SN(1),SN(2),SN(3),SN(4)根据高层参数确定的稀疏码序列r(2),r(3),r(4),r(1)，其中，稀疏码序列r(2),r(3),r(4),r(1)是随机接入标签有序集合的元素。随机接入标签有序集合包括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)的标签索引分别为传输块标识有序集合包括的Na＝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>。
图29是本申请示例提供的根据传输块差错图样经过算术编码确定反馈信息的示意图，如图29所示，基站按照下述方法确定反馈信息f：
基站确定P-1＝1的个比特的二进制表示为比特序列Pb＝[1]，其中，如果P＝0或1，基站确定二进制表示比特序列Pb＝[0]。
基站根据P＝2和传输块差错图样a＝[0,1,1,0,0,0]确定压缩码字c的长度为
图30是本申请示例提供的传输块差错图样、压缩码字与反馈信息f的映射图表，如图30 所示，把个Na＝6长的包含P＝2个比特“ack”＝1的序列映射到长度为的比特序列的算术编码得到压缩码字c＝[1,0,1,0]。
基站把比特序列Pb＝[1]和压缩码字c＝[1,0,1,0]拼接起来得到反馈信息f＝[1,1,0,1,0]，其中，反馈信息f的长度为
本示例与示例12的再一个区别于，在本示例中，基站发送包含反馈信息f＝[1,1,0,1,0]的信号给终端序列<SN(1),SN(2),SN(3),SN(4)>。终端序列<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)解码成功，得到反馈信息f，终端SN(1)对解码得到的反馈信息f进行算术解码得到传输块差错图样a，由传输块b(1)包括的随机接入标签的标签索引为2且a(2)＝1，终端SN(1)确定传输块b(1)的应答为正确应答ACK。
如果终端SN(2)解码失败，则终端SN(2)确定传输块b(2)的应答为错误应答NACK；如果终端SN(2)解码成功，得到反馈信息f，终端SN(2)对解码得到的反馈信息f进行算术解码得到传输块差错图样a，由传输块b(2)包括的随机接入标签的标签索引为3且a(3)＝1，终端SN(2)确定传输块b(2)的应答为正确应答ACK。
如果终端SN(3)解码失败，则终端SN(3)确定传输块b(3)的应答为错误应答NACK；如果终端SN(3)解码成功，得到反馈信息f，终端SN(3)对解码得到的反馈信息f进行算术解码得到传输块差错图样a，由传输块b(3)包括的随机接入标签的标签索引为4且a(4)＝0，终端SN(3)确定传输块b(3)的应答为错误应答NACK。
如果终端SN(4)解码失败，则终端SN(4)确定传输块b(4)的应答为错误应答NACK；如果终端SN(4)解码成功，得到述反馈信息f，终端SN(4)对解码得到的反馈信息f进行算术解码得到传输块差错图样a，由传输块b(4)包括的随机接入标签的标签索引为1且a(1)＝0，终端SN(4)确定传输块b(4)的应答为错误应答NACK。
在本示例提供的信息传输方法中，反馈信息f的长度随P变化，使得反馈信息f的平均长度比示例12的要更短，在相同反馈资源开销下，终端可以使用更低的信噪比接收反馈信息f，提升覆盖范围。
示例14：
本示例与示例13的区别在于，在本示例中，对于t＝1,2,3,4，传输块集合B中传输块b(t)包括的随机接入标签为导频序列(Pilot Sequence)，导频序列是随机接入标签有序集合的元素。随机接入标签有序集合包括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)的标签索引分别为传输块标识有序集合包括的Na＝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>。
本示例与示例13的另一个不同之处在于，最大正确传输块数目Pmax＝3由高层参数确 定。反馈信息f由基站根据下面的参数确定：正确传输块标识集合BI、正确传输块数目P＝2、传输块标识有序集合I、传输块标识有序集合大小Na＝6、最大正确传输块数目Pmax＝2。
图31是本申请示例提供的根据正确传输块标识集合经过算术编码确定反馈信息的示意图，如图31所示，基站按照下述方法确定反馈信息f：
基站根据P＝2和传输块标识有序集合大小Na＝6确定压缩码字c的长度为
图32是本申请示例提供的根据正确传输块标识集合经过算术编码确定反馈信息的示意图，是把个包含P＝2个元素的传输块标识有序集合的子集映射到长度为的比特序列的算术编码得到压缩码字c＝[1,0,1,0]，压缩码字c根据如图32所示。
基站确定压缩码字c＝[1,0,1,0]为反馈信息f＝c＝[1,0,1,0]，其中，反馈信息f的长度为
本示例与示例13的再一个区别在于，在本示例中，基站发送包含反馈信息f＝[1,0,1,0]的信号给终端序列<SN(1),SN(2),SN(3),SN(4)>。终端序列<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)解码成功，得到反馈信息f，终端SN(1)对解码得到的反馈信息f进行算术解码得到正确传输块标识集合BI，由传输块b(1)包括的随机接入标签的标签索引为2属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为正确应答ACK。
如果终端SN(2)解码失败，则终端SN(2)确定传输块b(2)的应答为错误应答NACK；如果终端SN(2)解码成功，得到反馈信息f，终端SN(2)对解码得到的反馈信息f进行算术解码得到正确传输块标识集合BI，由传输块b(2)包括的随机接入标签的标签索引为3属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为正确应答ACK。
如果终端SN(3)解码失败，则终端SN(3)确定传输块b(3)的应答为错误应答NACK；如果终端SN(3)解码成功，得到反馈信息f，终端SN(3)对解码得到的反馈信息f进行算术解码得到正确传输块标识集合BI，由传输块b(3)包括的随机接入标签的标签索引为4不属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为错误应答NACK。
如果终端SN(4)解码失败，则终端SN(4)确定传输块b(4)的应答为错误应答NACK；如果终端SN(4)解码成功，得到述反馈信息f，终端SN(4)对解码得到的反馈信息f进行算术解码得到正确传输块标识集合BI，由传输块b(4)包括的随机接入标签的标签索引为1不属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为错误应答NACK。
在本示例提供的信息传输方法中，反馈信息f直接就是压缩码字c，使得反馈信息f达到最短。并且当P＝0时，反馈信息f的长度为包含反馈信息f的信号为 空信号。当P不相同时，反馈信息f的长度不相同，因此可以在接收端区分不同的P，从而恢复正确传输块标识集合BI。
图33为本申请实施例提供的信息传输方法，具体包括步骤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、传输块差错图样a、反馈信息f的长度Nf。需要说明的是，根据上述一种或多种正确传输块的信息即可得到反馈信息，即，反馈信息的生成不是一定需要上述全部信息。
在一些实施例中，最大正确传输块数目Pmax等于传输块标识有序集合大小Na；在另一些实施例中，最大正确传输块数目Pmax由第一节点配置；在又一些实施例中，最大正确传输块数目Pmax由高层参数预先配置。
在一些实施例中，正确传输块集合的信息为正确传输块标识集合，正确传输块标识集合为传输块集合中正确接收的传输块所包括的用户标识的集合。正确接收的传输块是指应答状态为正确应答ACK的传输块，一个用户标识属于正确传输块标识集合用于指示对应该用户标识的传输块的应答状态为正确应答ACK，一个用户标识不属于正确传输块标识集合用于指示对应该用户标识的传输块的应答状态为错误应答NACK。
在一些实施例中，正确传输块集合的信息为正确传输块标识集合，正确传输块标识集合为用户标识的索引值的集合。正确接收的传输块是指应答状态为正确应答ACK的传输块，一个用户标识的索引值属于正确传输块标识集合用于指示对应该用户标识的索引值的传输块的应答状态为正确应答ACK，一个用户标识的索引值不属于正确传输块标识集合用于指示对应该用户标识的索引值的传输块的应答状态为错误应答NACK。
在一些实施例中，正确传输块集合的信息为正确传输块标识集合，正确传输块标识集合为传输块集合中正确接收的传输块所对应的随机接入标签的标签索引的集合。正确接收的传输块是指应答状态为正确应答ACK的传输块，一个随机接入标签的标签索引属于正确传输块标识集合用于指示对应该随机接入标签的传输块的应答状态为正确应答ACK，一个随机接入标签的标签索引不属于正确传输块标识集合用于指示对应该随机接入标签的传输块的应答状态为错误应答NACK。
示例15：
本示例中，从终端的角度来描述获得反馈信息f的过程。
如图25所示，本示例与示例12的区别在于，终端序列包括的Nu＝3个终端SN(1),SN(2),SN(3)分别接收基站发送的包含反馈信息f的信号，其中，反馈信息f为传输块集合B的反馈信息；反馈信息f为长度的比特序列；传输块集合B包括Nb＝4个传输块b(1),b(2),b(3),b(4)，分别由终端SN(1),SN(2),SN(3),SN(1)发送给基站。反馈信息f由基站根据中终端序列发送的包含传输块集合B的信号确定。
图34为本申请实施例提供的解码结果判断方法流程图，具体包括步骤S7100、步骤S7200、步骤S7300、步骤S7310、步骤S7320。
步骤S7100：将反馈信息对应的反馈信号进行解码，得到解码结果。
步骤S7200：根据解码结果，判断解码是否成功。
步骤S7300：如果解码成功，根据正确传输块集合的信息的二进制表示位数，判断解码结果中是否包含与第二节点发送的传输块的传输块标识对应的比特序列。
步骤S7310：如果解码结果中不包含与第二节点发送的传输块的传输块标识对应的比特序列，则确定与第二节点发送的传输块的应答为错误应答NACK。
步骤S7320：如果解码结果中包含与第二节点发送的传输块的传输块标识对应的比特序列，则确定与第二节点发送的传输块的应答为正确应答ACK。
图35是本申请一实施例提供的一种信息传输装置结构示意图。如图35所示，本申请实施例提供的信息传输装置200应用于基站，可以执行本申请实施例提供的信息传输方法，终端具备执行方法相应的功能模块和技术效果。该装置可以通过软件、硬件或者软硬结合的方式实现，包括：接收模块201，设置为接收至少一个第二节点发送的传输块；其中，传输块形成传输块集合；
正确传输块信息获得模块202，设置为根据传输块集合，得到正确传输块集合的信息。
反馈信息生成模块203，设置为根据传输块集合，得到反馈信息；其中，反馈信息用于表征第二节点发送的传输块的接收情况；
发送模块204，设置为发送反馈信息给至少一个第二节点。
图36是本申请一实施例提供的一种信息传输装置结构示意图。如图36所示，本申请实施例提供的信息传输装置300应用于用户设备，可以执行本申请实施例提供的信息传输方法，终端具备执行方法相应的功能模块和技术效果。该装置可以通过软件、硬件或者软硬结合的方式实现，包括：
发送模块301，设置为发送传输块给第一节点；其中，传输块在第一节点处形成传输块集合；
接收模块302，设置为接收第一节点发送的反馈信息；其中，反馈信息用于表征传输块的接收情况。
图37是本申请一实施例提供的基站的结构示意图，如图37所示，该基站400包括存储器401、处理器402、接收器403以及发送器404。存储器401、处理器402的数量可以是一个或多个，图37中以一个存储器401和一个处理器402为例；基站中的存储器401和处理器302可以通过总线或其他方式连接，图37中以通过总线连接为例。
存储器401作为一种计算机可读存储介质，可用于存储软件程序、计算机可执行程序以及模块，如本申请任一实施例提供的信息传输方法对应的程序指令/模块。处理器402通过运行存储在存储器401中的软件程序、指令以及模块实现上述信息传输方法。
存储器401可主要包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序。此外，存储器401可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件或其他非易失性固态存储器件。在一些实例中，存储器401进一步包括相对于处理器402远程设置的存储器，这些远程存储器可以通过网络连接至设备。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
接收器403设置为进行信息接收；发送器404设置为根据处理器402的控制进行反馈信息的发送。
图38是本申请一实施例提供的用户设备的结构示意图，如图38所示，该用户设备500包括存储器501、处理器502、接收器403以及发送器404。存储器501、处理器502的数量可以是一个或多个，图38中以一个存储器501和一个处理器502为例；用户设备中的存储器501和处理器502可以通过总线或其他方式连接，图38中以通过总线连接为例。
存储器501作为一种计算机可读存储介质，可用于存储软件程序、计算机可执行程序以及模块，如本申请任一实施例提供的信息传输方法对应的程序指令/模块。处理器502通过运行存储在存储器501中的软件程序、指令以及模块实现上述信息传输方法。
存储器501可主要包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序。此外，存储器501可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件或其他非易失性固态存储器件。在一些实例中，存储器501进一步包括相对于处理器502远程设置的存储器，这些远程存储器可以通过网络连接至设备。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
接收器503设置为进行反馈信息的接收；发送器504设置为根据处理器502的控制进行传输块的发送。
本申请一实施例还提供了一种计算机可读存储介质，存储有计算机可执行指令，该计算机可执行指令用于执行如本申请任一实施例提供的信息传输方法。
本申请一实施例还提供了一种计算机程序产品，包括计算机程序或计算机指令，该计算机程序或计算机指令存储在计算机可读存储介质中，计算机设备的处理器从计算机可读存储介质读取计算机程序或计算机指令，处理器执行计算机程序或计算机指令，使得计算机设备执行如本申请任一实施例提供的信息传输方法。
本申请实施例描述的系统架构以及应用场景是为了更加清楚的说明本申请实施例的技术方案，并不构成对于本申请实施例提供的技术方案的限定，本领域技术人员可知，随着系统架构的演变和新应用场景的出现，本申请实施例提供的技术方案对于类似的技术问题，同样适用。
本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、系统、设备中的功能模块/单元可以被实施为软件、固件、硬件及其适当的组合。
在硬件实施方式中，在以上描述中提及的功能模块/单元之间的划分不一定对应于物理组件的划分；例如，一个物理组件可以具有多个功能，或者一个功能或步骤可以由若干物理组件合作执行。某些物理组件或所有物理组件可以被实施为由处理器，如中央处理器、数字信号处理器或微处理器执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在计算机可读介质上，计算机可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、程序模块或其他数据) 的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于RAM、ROM、EEPROM、闪存或其他存储器技术、CD-ROM、数字多功能盘(DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。此外，本领域普通技术人员公知的是，通信介质通常包含计算机可读指令、数据结构、程序模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据，并且可包括任何信息递送介质。
在本说明书中使用的术语“部件”、“模块”、“系统”等用于表示计算机相关的实体、硬件、固件、硬件和软件的组合、软件、或执行中的软件。例如，部件可以是但不限于，在处理器上运行的进程、处理器、对象、可执行文件、执行线程、程序或计算机。通过图示，在计算设备上运行的应用和计算设备都可以是部件。一个或多个部件可驻留在进程或执行线程中，部件可位于一个计算机上或分布在2个或更多个计算机之间。此外，这些部件可从在上面存储有各种数据结构的各种计算机可读介质执行。部件可例如根据具有一个或多个数据分组(例如来自于自与本地系统、分布式系统或网络间的另一部件交互的二个部件的数据，例如通过信号与其它系统交互的互联网)的信号通过本地或远程进程来通信。
以上参照附图说明了本申请的一些实施例，并非因此局限本申请的权利范围。本领域技术人员不脱离本申请的范围和实质内所作的任何修改、等同替换和改进，均应在本申请的权利范围之内。

Claims (35)

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

Applications Claiming Priority (2)

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

Publications (1)

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

Family

ID=89192179

Family Applications (1)

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

Country Status (2)

Country Link
CN (1) CN117295110A (zh)
WO (1) WO2023241286A1 (zh)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105515733A (zh) * 2014-09-24 2016-04-20 中兴通讯股份有限公司 一种反馈方法及装置
US20180006791A1 (en) * 2015-01-28 2018-01-04 Interdigital Patent Holdings, Inc. Uplink feedback methods for operating with a large number of carriers
US20200084004A1 (en) * 2017-03-23 2020-03-12 Ntt Docomo, Inc. Feedback method and communication device
US20210111740A1 (en) * 2019-10-15 2021-04-15 At&T Intellectual Property I, L.P. System and method for decoding encoded messages in a wireless communication system
US20210328722A1 (en) * 2017-11-10 2021-10-21 Guangdong Oppo Mobile Telecommunications Corp., Ltd. Radio Communication Method and Device

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105515733A (zh) * 2014-09-24 2016-04-20 中兴通讯股份有限公司 一种反馈方法及装置
US20180006791A1 (en) * 2015-01-28 2018-01-04 Interdigital Patent Holdings, Inc. Uplink feedback methods for operating with a large number of carriers
US20200084004A1 (en) * 2017-03-23 2020-03-12 Ntt Docomo, Inc. Feedback method and communication device
US20210328722A1 (en) * 2017-11-10 2021-10-21 Guangdong Oppo Mobile Telecommunications Corp., Ltd. Radio Communication Method and Device
US20210111740A1 (en) * 2019-10-15 2021-04-15 At&T Intellectual Property I, L.P. System and method for decoding encoded messages in a wireless communication system

Also Published As

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

Similar Documents

Publication Publication Date Title
US11197281B2 (en) Control information transmission method and apparatus
US11695506B2 (en) Method and apparatus for transmission or reception of data in communication system
CN107113110B (zh) 控制信息的发送方法和通信设备
WO2018049951A1 (zh) 信息传输的方法、发送端设备和接收端设备
EP3709723B1 (en) Terminal device, base station device, and communication method
US20200389873A1 (en) Terminal apparatus, base station apparatus, and communication method
US11418243B2 (en) Control transmission method and apparatus
US20230370195A1 (en) Method and apparatus for transmission or reception of data in communication system
CN111133817B (zh) 通信方法和装置
CN111600677B (zh) 一种数据传输方法及装置
KR102293233B1 (ko) 데이터 처리 방법 및 데이터 처리 장치
CN114731229A (zh) 用于确定单次harq-ack码本的方法及设备
WO2019047676A1 (zh) 数据反馈、发送、接收方法及装置，接收设备，发送设备
CN115918011A (zh) 生成混合自动重复请求harq码本的方法和装置
EP3576327B1 (en) Information transmission method, network device, and terminal device
US11412532B2 (en) Method and device for determining whether data is damaged
WO2023241286A1 (zh) 信息传输方法、装置、基站、设备、存储介质及程序产品
CN108322285B (zh) 数据的发送方法、接收方法和装置
WO2023241287A1 (zh) 信息传输方法、装置、基站、设备、存储介质及程序产品
WO2023241284A1 (zh) 信息传输方法、装置、基站、设备、存储介质及程序产品
WO2022236719A1 (zh) 无线通信方法、终端设备和网络设备
US20230327801A1 (en) Information processing device and information processing method
US20240073894A1 (en) Method and apparatus for harq-ack codebook determination
WO2022236752A1 (zh) 无线通信方法、第一设备和第二设备
JP2022154662A (ja) 拡張された確認応答を用いる端末装置、基地局装置、通信方法、およびプログラム

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: 23822856

Country of ref document: EP

Kind code of ref document: A1