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

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

Info

Publication number
WO2023241284A1
WO2023241284A1 PCT/CN2023/094334 CN2023094334W WO2023241284A1 WO 2023241284 A1 WO2023241284 A1 WO 2023241284A1 CN 2023094334 W CN2023094334 W CN 2023094334W WO 2023241284 A1 WO2023241284 A1 WO 2023241284A1
Authority
WO
WIPO (PCT)
Prior art keywords
sequence
transport block
feedback information
correct
terminal
Prior art date
Application number
PCT/CN2023/094334
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 WO2023241284A1 publication Critical patent/WO2023241284A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • 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/12—Wireless traffic scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access

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 forming a transmission block set; and obtaining feedback information according to the transmission block set. ; Wherein, the feedback information is used to characterize the reception status of the transport block sent by the at least one second node; and the feedback information is sent 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 a transmission block sent by at least one second node, where the transmission block forms a transmission block set; a feedback information generation module configured to described A transport block set to obtain feedback information; wherein the feedback information is used to characterize the reception of transport blocks sent by the at least one second node; a sending module configured to send the feedback information to the at least one second node .
  • embodiments of the present application provide an information transmission device, including: a sending module configured to send a transmission block to a first node; a receiving module configured to receive feedback information sent by the first node; wherein, Feedback information is used to characterize the reception of the transport block.
  • embodiments of the present application provide a base station, including: a memory, a processor, and a computer program stored in the memory and executable on the processor.
  • the processor executes the computer program, the first aspect is implemented. Or the information transmission method described in any one of the second aspects.
  • embodiments of the present application provide a user equipment, including: a memory, a processor, and a computer program stored in the memory and executable on the processor.
  • the processor executes the computer program, the first The information transmission method described in any one of the aspects or the second aspect.
  • embodiments of the present application provide a computer-readable storage medium that stores computer-executable instructions, and the computer-executable instructions are used to execute any one of the first aspect or the second aspect.
  • the information transmission method described in the item is not limited to:
  • embodiments of the present application provide a computer program product, including a computer program or computer instructions.
  • the computer program or computer instructions are stored in a computer-readable storage medium.
  • the processor of the computer device can read the computer program from the computer. Reading the storage medium reads the computer program or the computer instructions, and the processor executes the computer program or the computer instructions, so that the computer device executes the method described in any one of the first aspect or the second aspect. Information transmission method.
  • Figure 1 is a schematic system architecture diagram of an application scenario of an information transmission method provided by an embodiment of the present application
  • Figure 2 is a flow chart of an information transmission method provided by an embodiment of the present application.
  • Figure 3 is a 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 of an information transmission method provided by an embodiment of the present application.
  • Figure 7 is a flow chart of an information transmission method provided by an embodiment of the present application.
  • Figure 8 is a flow chart of an information transmission method provided by an embodiment of the present application.
  • Figure 9 is a flow chart of an information transmission method provided by an embodiment of the present application.
  • Figure 10 is a schematic diagram of the relationship between the second node, the transport block and the user identification provided by an embodiment of the present application;
  • Figure 11 is a schematic diagram of determining the feedback information f by superposing the correct transmission block identification set BI and the transmission block sequence ordered set provided by an embodiment of the present application;
  • Figure 12 is a schematic diagram of determining feedback information f from the correct transmission block identification set BI through superposition according to an embodiment of the present application
  • Figure 13 is a schematic diagram of determining feedback information f from the correct transmission block identification set BI through superposition according to another embodiment of the present application;
  • Figure 14 is a schematic diagram of determining the feedback information f from the correct transmission block identification set BI through superposition according to another embodiment of the present application;
  • Figure 15 is a schematic diagram of determining the feedback information f by splicing the correct transmission block identification set BI and the transmission block sequence ordered set provided by the embodiment of the present application;
  • Figure 16 is a schematic diagram of the relationship between a second node, a transport block, a user identifier, a random access tag and a tag index provided by an embodiment of the present application;
  • Figure 17 is a schematic diagram of determining the feedback information f by splicing the correct transmission block identification set BI and the transmission block sequence ordered set provided by an embodiment of the present application;
  • Figure 18 is a schematic diagram of the relationship between a second node, a transport block, a user identifier, a random access tag and a tag index provided by another embodiment of the present application;
  • Figure 19 is a schematic diagram of determining feedback information f by splicing the correct transmission block identification set BI and the correct transmission block number P according to another embodiment of the present application;
  • Figure 20 is a schematic diagram of the relationship between a second node, a transmission block, a random access tag and a tag index provided by an embodiment of the present application;
  • Figure 21 is a schematic diagram of determining the feedback information f by splicing the correct transmission block identification set BI and the correct transmission block number P according to another embodiment of the present application;
  • Figure 22 is a schematic diagram of determining the feedback information f by splicing the correct transmission block identification set BI, the number of correct transmission blocks P and the maximum correct transmission block Pmax provided by the embodiment of the present application;
  • Figure 23 is a schematic diagram of determining the complex sequence s(p) from the element BI(p) in the correct transmission block identification set BI and the size Na of the ordered set of transmission block identifications provided by the embodiment of the present application;
  • Figure 24 is a schematic diagram of determining the feedback information f by the number of correct transmission blocks P, the maximum correct transmission block Pmax, the length Nf of the feedback information f and the complex sequence s(p) provided by the embodiment of the present application;
  • Figure 25 is a diagram illustrating the complex sequence s(p) and placement vector z(p) determined by the element BI(p) in the correct transmission block identification set BI, the maximum correct transmission block Pmax, and the length Nf of the feedback information f provided by the embodiment of the present application. schematic diagram;
  • Figure 26 is a schematic diagram of the base station provided by the embodiment of the present application superposing the complex sequence s(1), s(2) and the placement vector z(1), z(2) to determine the feedback information f;
  • Figure 27 is a schematic diagram of the relationship between the second node, the transport block, the random access tag and the tag index provided by an embodiment of the present application;
  • Figure 28 is a schematic diagram of the relationship between the second node, the transport block, the user identifier, and the index value of the user identifier provided by an embodiment of the present application;
  • Figure 29 is a schematic diagram of determining the feedback information f by superposing the correct transmission block identification set BI and the transmission block sequence ordered set provided by an embodiment of the present application;
  • Figure 30 is a flow chart of an information transmission method provided by an embodiment of the present application.
  • Figure 31 is a schematic structural diagram of an information transmission device provided by an embodiment of the present application.
  • Figure 32 is a schematic structural diagram of an information transmission device provided by an embodiment of the present application.
  • Figure 33 is a schematic structural diagram of a base station provided by an embodiment of the present application.
  • Figure 34 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 concrete 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 (radio access network, RAN).
  • Radio access network radio access network, RAN
  • User equipment may also be called a wireless terminal, a subscriber unit, a subscriber station, a mobile station, a mobile station, a remote station, or an 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.
  • Common user devices include, for example: mobile phones, tablets, laptops, PDAs, mobile internet devices (MIDs), wearable devices such as smart watches, smart bracelets, pedometers, etc. However, this application implements Examples are not limited to this.
  • the base station involved in the embodiment of this application can be a base transceiver station (BTS) in the global system for mobile communication (GSM) or code division multiple access (code division multiple access, CDMA), or It can be a base station (NodeB) in wideband code division multiple access (WCDMA), an evolutionary base station (eNB or e-NodeB) in LTE, or a new wireless control
  • the controller (new radio controller, NR controller) can be the 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 radio frequency remote module, it can be a micro base station , can be a relay (relay), a distributed network element (distributed unit), a reception point (transmission reception point, TRP) or a transmission point (transmission point, TP) or any other wireless access device, but this The application embodiment is not limited to this.
  • 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 Format 2 ⁇ 4 is used to transmit channel state information (Channel State Information, CSI) report 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 product, by superimposing or splicing the correctly received response signals of multiple UEs and sending them out; each UE The received response signal is decoded and the corresponding response signal is extracted, 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, and terminals, including but not limited to step S1000, step S2000, and step S3000.
  • Step S1000 Receive a transport block sent by at least one second node (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.
  • these second nodes when multiple second nodes send signals containing transmission blocks to the first node, these second nodes form a sequence of second nodes (A Sequence of Second Nodes), and the transmissions sent by the multiple second nodes
  • the blocks form a set of transport blocks.
  • 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.
  • 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 label index of the k-th random access tag r(k) in the ordered set of random access tags is The transport block identifies the k-th element I(k) of the ordered set.
  • 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.
  • Step S2000 Obtain feedback information according to the transport block set; wherein the feedback information is used to characterize the reception status of the transport block sent by at least one second node.
  • feedback information is obtained based on information about correct transmission blocks in the transmission block set.
  • the information of correct transmission blocks includes the maximum number of correct transmission blocks Pmax, an ordered set of transmission block identifiers, an ordered set of transmission block sequences, a predefined complex sequence set, an ordered set size of transmission block identifiers Na, a set of correct transmission block identifiers, and correct The set of transport block sequences, the number of correct transport blocks P, and the length Nf of the feedback information f. It should be noted that the feedback information can be obtained based on the information on one or more of the above correct transmission blocks, that is, the generation of the feedback information does not necessarily require all the above information.
  • the ordered set of transport block sequences is a predefined set of complex sequences.
  • the first node determines the feedback information f based on a signal containing a set of transport blocks sent by at least one second node.
  • the feedback information can be determined based on one or more of the following parameters, which include: maximum number of correct transmission blocks Pmax, transmission block identification ordered set, transmission block sequence ordered set, transmission block identification ordered set size Na, correct The set of transmission block identifiers, the set of correct transmission block sequences, the number of correct transmission blocks P, and the length Nf of the feedback information f. It should be noted that the feedback information can be obtained based on the information on one or more of the above correct transmission blocks, that is, the generation of the feedback information does not necessarily require all the above information.
  • the size Na of the ordered set of transmission block identifiers is the number of elements in the ordered set of transmission block identifiers
  • the number of correct transmission blocks P is the number of elements of the correct set of transmission block identifiers
  • the ordered set of transmission block sequences includes Na plural sequences.
  • the correct transmission block identification set includes P transmission block identifications BI(1), BI(2),...,BI(P), correct
  • the maximum number of correct transmission blocks Pmax is less than or equal to the size Na of the ordered set of transmission block identifiers.
  • the maximum number of correct transmission blocks Pmax is configured by the first node; in other embodiments, the maximum number of correct transmission blocks Pmax is pre-configured by high layer parameters (high layer parameters).
  • the set of correct transport block identifiers refers to the set of user identifiers included in correctly received transport blocks in the transport block set.
  • a correctly received transport block refers to a transport block whose response status is correct response ACK.
  • a user ID belongs to the correct transmission block ID set to indicate that the response status of the transport block corresponding to the user ID is correct response ACK.
  • a user ID does not Belonging to the correct 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. Therefore, the correct transport block identifier set is a subset of the ordered set of transport block identifiers.
  • the correct transmission block identification set refers to the set of index values of user identifications included in correctly received transmission blocks in the transmission block set.
  • 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 correct transmission block ID
  • the set is used to indicate that the response status of the transport block corresponding to the index value of the user identifier is an error response NACK. Therefore, the correct transport block identifier set is a subset of the ordered set of transport block identifiers.
  • 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 correctly received transmission block refers to the transmission 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 the random access label is correct.
  • Response ACK the tag index of a random access tag does not belong to the correct transmission block identification set is used to indicate that the response status of the transmission block corresponding to the random access tag is an error response NACK. Therefore, the correct transmission block identification set is a transmission block identification set. A subset of an ordered set.
  • the set of correct transmission block sequences is a subset of the ordered set of transmission block sequences.
  • the k-th complex sequence t(k) in the ordered set of transmission block sequences corresponds to the k-th element I(k) of the ordered set of transmission block identities, where , the length of the k-th complex sequence t(k) in the ordered set of transport block sequences is Nt(k), Nt(k) is a non-negative integer, and Nt(k) is less than or equal to Nf.
  • the following describes the process in which the first node determines the feedback information f according to any one of the following parameters or any combination thereof.
  • the first node at least assigns P transport block identifiers BI(1), BI(2),...,BI(P) in the correct transport block identifier set according to any one or any combination of the following parameters.
  • the first node at least transmits the P target complex sequences s(1), s(2),...,s(P) in the correct transmission block sequence set according to any one of the following parameters or any combination thereof. ) is determined as feedback information f.
  • the target complex sequence s(k) in the correct transmission block sequence set is determined by the first node based on the transmission block identification BI(k) in the correct transmission block identification set.
  • the complex sequence of the ordered set of transport block sequences can be various direct sequence spread spectrum sequences (Direct Spread Spectrum Sequence) used in non-orthogonal multiple access (Non-Orthogonal Multiple-Access).
  • Direct Spread Spectrum Sequence used in non-orthogonal multiple access (Non-Orthogonal Multiple-Access).
  • Step S3000 Send feedback information to at least one second node.
  • 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 minimize the number of input bits for channel coding, thereby achieving the purpose of saving spectrum resources and improving data transmission efficiency.
  • the energy overhead is reduced, and a second node in the second node sequence will not receive the signal containing the feedback information f (i.e., the zero-power signal). success, Therefore, a second node in the second node sequence can determine that the feedback information is an error response NACK.
  • Figure 3 is a flow chart of an information transmission method provided by an embodiment of the present application, which specifically includes step S2110 and step S2120, specifically describing the process of obtaining feedback information based on the correct transmission block identifier.
  • Step S2110 Determine the target complex sequence in the predefined complex sequence set according to the transport block identifier of the correct transport block.
  • Step S2120 Obtain feedback information according to the target complex sequence.
  • the first node at least assigns P transport block identifiers BI(1), BI(2),...,BI(P) in the correct transport block identifier set according to any one or any combination of the following parameters.
  • the first node determines the target complex sequence t(m(k)) based on the transport block identifier BI(k) in the correct transport block identifier set.
  • the first node determines the target complex sequence t(m(k)).
  • the node determines the feedback information f according to the target complex sequence t(m(1)),t(m(2)),...,t(m(P)), where m(k) is the transmission block identifier BI(k ) is the sequence number in the ordered set of transport block identifiers, that is, m(k) is an integer such that I(m(k)) is equal to BI(k).
  • the first node at least assigns P transport block identifiers BI(1), BI(2),...,BI(P) in the correct transport block identifier set according to any one or any combination of the following parameters.
  • the first node determines the target complex sequence t(BI(k)) based on the transport block identifier BI(k) in the correct transport block identifier set.
  • the first node determines the target complex sequence t(BI(k)).
  • the node determines the feedback information f according to the target complex sequence t(BI(1)),t(BI(2)),...,t(BI(P)), where BI(k) is an ordered set of transmission block identifiers An element of I.
  • the first node at least transmits the P target complex sequences s(1), s(2),...,s(P) in the correct transmission block sequence set according to any one of the following parameters or any combination thereof.
  • ) is determined as feedback information f.
  • These parameters include: maximum number of correct transmission blocks Pmax, transmission block identification ordered set, transmission block sequence ordered set, transmission block identification ordered set size Na, correct transmission block identification set, correct transmission block Sequence set, number of correct transmission blocks P;
  • the target complex sequence s(k) in the correct transmission block sequence set is determined by the first node based on the transmission block identification BI(k) in the correct transmission block identification set. More specifically, the first node determines that the target complex sequence s(k) of length Ns(k) is the target complex sequence in the ordered set of transport block sequences based on the transport block identifier BI(k) in the correct transport block identifier set.
  • the first node at least transmits the P target complex sequences s(1), s(2),...,s(P) in the correct transmission block sequence set according to any one of the following parameters or any combination thereof. ) is determined as feedback information f.
  • the target complex sequence s(k) in the column set is determined by the first node based on the transport block identifier BI(k) in the correct transport block identifier set.
  • the first node determines that the target complex sequence s(k) of length Ns(k) is the target complex sequence in the ordered set of transport block sequences based on the transport block identifier BI(k) in the correct transport block identifier set.
  • Figure 4 is a flow chart of an information transmission method provided by an embodiment of the present application, which specifically includes step S2210, step S2220 and step S2230, specifically describing the process of obtaining feedback information based on the correct transmission block identifier.
  • Step S2210 Use the transport block identifier of the correct transport block as part or all of the random number seeds of the pseudo-random number generator to generate a pseudo-random complex number sequence.
  • Step S2220 Determine the pseudo-random complex number sequence as the target complex number sequence.
  • Step S2230 Obtain feedback information according to the target complex sequence.
  • the first node uses the transport block identifier BI(k) in the correct transport block identifier set as a random number seed for a pseudo-random number generator (pseudo-random number generator) to generate a pseudo-random number of length Ns(k).
  • the pseudo-random number generator can generate random numbers with Gaussian distribution (Gaussian Distribution), and the pseudo-random complex number sequence s(k) is a sequence generated based on Gaussian distribution (Gaussian Distribution).
  • the transmission block identifier of the correct transmission block can be used as part of the random number seed of the pseudo-random number generator, or can be used as the entire random number seed of the pseudo-random number generator.
  • the pseudo-random number generator can also generate random numbers in other distribution forms other than Gaussian distribution, which is not limited in this application.
  • Figure 5 is a flow chart of an information transmission method provided by an embodiment of the present application, which specifically includes step S2310, step S2320 and step S2330, specifically describing the process of obtaining feedback information based on the correct transmission block identifier.
  • Step S2310 Use the transport block identifier of the correct transport block as part or all of the random number seeds of the pseudo-random sequence generator to generate a pseudo-random bit sequence.
  • Step S2320 Modulate the pseudo-random bit sequence to obtain the target complex sequence.
  • Step S2330 Obtain feedback information according to the target complex sequence.
  • the first node uses the transport block identifier BI(k) in the correct transport block identifier set as a random number seed for a pseudo-random sequence generator (pseudo-random sequence generator) to generate a pseudo-random sequence of length Np(k).
  • a pseudo-random sequence generator prudo-random sequence generator
  • the first node modulates a pseudo-random bit sequence of length Np(k) to obtain a target complex sequence s(k) of length Ns(k), where Np(k) is greater than or equal to Ns(k) .
  • the transmission block identifier of the correct transmission block can be used as part of the random number seed of the pseudo-random sequence generator, or can be used as the entire random number seed of the pseudo-random sequence generator.
  • Figure 6 is a flowchart of an information transmission method provided by an embodiment of the present application, specifically including step S2410, step S2420, step S2430 and step S2440, specifically describing the process of obtaining feedback information based on the correct transmission block identifier.
  • Step S2410 Perform a binary representation of the transport block identifier of the correct transport block to obtain a binary representation of the transport block identifier.
  • Step S2420 Perform channel coding on at least one bit of the binary representation of the transport block identifier to obtain a first coding sequence.
  • Step S2430 Modulate the first coding sequence to obtain the target complex sequence.
  • Step S2440 Obtain feedback information according to the target complex sequence.
  • the first node obtains a binary representation of the transport block identity BI(k) in the set of correct transport block identities.
  • Channel coding is performed on bits to obtain a coding sequence of length Nc(k).
  • the first node modulates the coding sequence of length Nc(k) to obtain a target complex sequence s(k) of length Ns(k), where, Nc (k) is greater than or equal to Ns(k), is the smallest integer greater than or equal to log 2 (Na).
  • the first node obtains a binary representation of the transport block identity BI(k) in the set of correct transport block identities.
  • Channel coding is performed on bits to obtain a coding sequence of length Nc(k).
  • the first node modulates the coding sequence of length Nc(k) to obtain a target complex sequence s(k) of length Ns(k), where, Nc (k) is greater than or equal to Ns(k), It is the smallest integer greater than or equal to log 2 (Imax), which is the maximum value of the elements in the ordered set I of the transmission fast identifier.
  • Imax log 2
  • Figure 7 is a flow chart of an information transmission method provided by an embodiment of the present application, which specifically includes step S2510, step S2520, and step S2530, specifically describing the process of obtaining feedback information based on the correct transmission block identifier.
  • Step S2510 Perform a binary representation of the transport block identifier of the correct transport block to obtain a binary representation of the transport block identifier.
  • Step S2520 Perform channel coding on at least one bit in the binary representation of the transport block identifier to obtain the target complex sequence.
  • Step S2530 Obtain feedback information according to the target complex sequence.
  • the first node obtains a binary representation of the transport block identity BI(k) in the set of correct transport block identities.
  • Channel coding is performed on bits to obtain the target complex sequence s(k) of length Ns(k), where, is the smallest integer greater than or equal to log 2 (Na).
  • the first node obtains a binary representation of the transport block identity BI(k) in the set of correct transport block identities.
  • Channel coding is performed on bits to obtain the target complex sequence s(k) of length Ns(k), where, It is the smallest integer greater than or equal to log 2 (Imax), which is the maximum value of the elements in the ordered set I of the transmission fast identifier.
  • Imax log 2
  • Ns(k) is equal to Ns(k'), where Ns(k) is in the set of correct transport block sequences.
  • the length of the complex sequence s(k), Ns(k') is the length of the complex sequence s(k') in the correct transmission block sequence set.
  • Ns(k) there are two positive integers k and k' that are less than or equal to P and not equal such that Ns(k) is not equal to Ns(k'), where Ns(k) is the correct transmission block sequence set.
  • the length of the complex sequence s(k), Ns(k') is the length of the complex sequence s(k') in the correct transmission block sequence set.
  • Nt(k) is equal to Nt(k'), where Nt(k) is an ordered set of transport block sequences.
  • the length of the complex sequence t(k) in , Nt(k') is the length of the complex sequence t(k') in the ordered set of transport block sequences.
  • Nt(k) is not equal to Nt(k'), where Nt(k) is an ordered set of transport block sequences.
  • the length of the complex sequence t(k'), Nt(k') is the length of the complex sequence t(k') in the ordered set of transport block sequences.
  • the length of the complex sequence s(k) in the set of correct transport block sequences is equal to Nf.
  • the length of the complex sequence s(k) in the set of correct transport block sequences is less than Nf.
  • the length of the complex sequence s(k) in the set of correct transport block sequences is equal to or Among them, R is a positive integer less than or equal to P.
  • the length of the complex sequence s(k) in the set of correct transport block sequences is equal to or Among them, R is a positive integer less than or equal to P, means less than or equal to The largest integer, means greater than or equal to the smallest integer.
  • the length of the complex sequence s(k) in the set of correct transport block sequences is equal to Among them, R is a positive integer less than or equal to P, for right The integer to be rounded.
  • the length of the complex sequence s(k) in the set of correct transport block sequences is equal to Among them, R is a positive integer less than or equal to P, means less than or equal to the largest integer.
  • the feedback information f includes a length of An all-zero subsequence of , where, means less than or equal to the largest integer.
  • the length of the complex sequence s(k) in the set of correct transport block sequences is equal to Among them, R is a positive integer less than or equal to Pmax.
  • the length of the complex sequence s(k) in the set of correct transport block sequences is equal to or Among them, R is a positive integer less than or equal to Pmax, means less than or equal to The largest integer, means greater than or equal to the smallest integer.
  • the length of the complex sequence s(k) in the set of correct transport block sequences is equal to Among them, R is a positive integer less than or equal to Pmax, for right The integer to be rounded.
  • the length of the complex sequence s(k) in the set of correct transport block sequences is equal to Among them, R is a positive integer less than or equal to Pmax, means less than or equal to the largest integer.
  • the element, BI(k) is also an element in the ordered set of transport identifiers.
  • the channel coding in the embodiments corresponding to Figures 6 and 7 can be polar coding, low-density parity check coding, or convolutional coding.
  • turbo 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 Hamming code
  • Golay code repetition coding, single-parity-check code, cyclic redundancy check 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 modulation in the embodiments corresponding to Figures 5 and 6 can be ⁇ /2-binary phase shift keying modulation ( ⁇ /2 binary phase shift keying ( ⁇ /2-BPSK), binary phase shift keying (BPSK), quadrature phase shift keying (QPSK), quadrature amplitude modulation (quadrature amplitude modulation (QAM), phase shift keying (PSK), amplitude shift keying (ASK), amplitude phase shift keying (APSK).
  • ⁇ /2-BPSK binary phase shift keying
  • BPSK binary phase shift keying
  • QPSK quadrature phase shift keying
  • QAM quadrature amplitude modulation
  • QAM quadrature amplitude modulation
  • PSK phase shift keying
  • ASK amplitude shift keying
  • APSK amplitude phase shift keying
  • steps S2120, S2230, S2330, S2440, and S2530 feedback information is obtained according to the target complex sequence.
  • the specific process is described in detail in the embodiments provided in Figures 8 and 9.
  • Figure 8 is a flow chart of an information transmission method provided by an embodiment of the present application, in which the feedback information is obtained by superpositioning the target complex sequence in the correct transmission block sequence set, specifically including step S2610, step S2620, and step S2630. Specifically, Describes the process of obtaining feedback information based on the target complex number sequence.
  • Step S2610 Obtain a target complex sequence set based on each target complex sequence.
  • Step S2620 Select at least one target complex sequence from the target complex sequence set.
  • Step S2630 Select one element from the selected target complex sequence for linear superposition to obtain a feedback information element; where the feedback information includes a feedback information element.
  • the feedback information f is obtained by superposing P target complex sequences s(1), s(2),...,s(P) in the correct transmission block sequence set, that is, there is 2 ⁇ D +1 positive integer n',d(1),n(1),d(2),n(2),...,d(D),n(D), the n'th piece of feedback information f Element f(n') consists of 2D complex numbers s(d(1)) in D target complex number sequences s(d(1)), s(d(2)),...,s(d(D)) ,n(1)),s(d(2),n(2)),...,s(d(D),n(D)) is determined, where D is less than or equal to P and greater than or equal to 2 , n' is less than or equal to Nf, where Nf is the length of feedback information f.
  • d(k) is less than or equal to P
  • n(k) is less than or equal to Ns(k )
  • Ns(k) is the length of the target complex sequence s(k)
  • the complex number s(d(k),n(k)) is the n(k)th element of the target complex sequence s(d(k)).
  • the feedback information f is obtained by superposing P target complex sequences s(1), s(2),...,s(P) in the correct transmission block sequence set, where, Among them, ⁇ (1), ⁇ (2),..., ⁇ (D) are any complex numbers.
  • the feedback information f is performed by P target complex sequences t(m(1)), t(m(2)),...,t(m(P)) in the correct transmission block sequence set Superposition results, that is, there are 2 ⁇ D+1 positive integers n',d(1),n(1),d(2),n(2),...,d(D),n(D)
  • the feedback information f is performed by P target complex sequences t(m(1)), t(m(2)),...,t(m(P)) in the correct transmission block sequence set By superposition, we get, where, Among them, ⁇ (1), ⁇ (2),..., ⁇ (D) are any complex numbers.
  • the feedback information f is performed by P target complex sequences t(BI(1)), t(BI(2)),...,t(BI(P)) in the correct transmission block sequence set Superposition results, that is, there are 2 ⁇ D+1 positive integers n',d(1),n(1),d(2),n(2),...,d(D), n(D), the n'th element f(n') of the feedback information f is composed of D target complex number sequences t(BI(d(1))),t(BI(d(2))),... , D complex numbers in t(BI(d(D))) t(BI(d(1)),n(1)),t(BI(d(2)),n(2)),..
  • the feedback information f is performed by P target complex sequences t(BI(1)), t(BI(2)),...,t(BI(P)) in the correct transmission block sequence set
  • ⁇ (1), ⁇ (2),..., ⁇ (D) are any complex numbers.
  • Figure 9 is a flow chart of an information transmission method provided by an embodiment of the present application, in which the feedback information is obtained by concatenation (concatenation) of the target complex sequence in the correct transmission block sequence set, specifically including step S2710, step S2720, and step S2730. Specifically, Describes the process of obtaining feedback information based on the target complex number sequence.
  • Step S2710 Obtain a target complex sequence set based on each target complex sequence.
  • Step S2720 According to each target complex sequence, obtain the target complex numbers in the target complex sequence respectively.
  • Step S2730 Configure all target complex numbers into a target complex number set; any element in the feedback information comes from the target complex number set.
  • the i-th element f(i) of f is determined only by the complex number s(k(i),n(i)), where k(i) is less than or equal to P and n(i) is less than or equal to Ns(k(i) )), the first constant C can be any complex number, and the complex number s(k(i),n(i)) is the n(i)th element of the target complex number sequence s(k(i)).
  • 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.
  • Figure 10 is a schematic diagram of the relationship between the second node, the transport block and the user identification provided by an embodiment of the present application.
  • the signal containing the transport block set B includes a signal containing the transport block b(1), a signal containing the transport block b(2), a signal containing the transport block b(3) and a signal containing the transport block b(4). .
  • the transport block b(t) in the transport block set B is sent to the base station by the terminal SN(t) in the terminal sequence, where
  • the transmission block b(t) includes the user identification of the terminal SN(t).
  • the user identification of the terminal SN(t) is Random Access RNTI (RA-RNTI).
  • the terminals SN(1), SN(2), The user IDs of SN(3) and SN(4) are 4,3,2,5 respectively.
  • the correct transmission block identification set refers to the set of user identifications included in the correctly received transmission blocks in the transmission block set B.
  • Figure 11 is a schematic diagram of determining the feedback information f by superposing the correct transmission block identification set BI and the transmission block sequence ordered set provided by an embodiment of the present application. As shown in Figure 11, 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.
  • terminals SN(1), SN(2), SN(3), and SN(4) respectively determine the transmission blocks b(1), b(2), b(3), and b(4) according to the following method Answer:
  • the terminal SN(1) performs an inner product of the sequence t(4) determined by the user identification 4 and the signal containing the feedback information f. If the absolute value of the inner product is greater than half of the L2 norm of the sequence t(4), the terminal SN(1) determines that the user identification 4 of the terminal SN(1) belongs to the correct transmission block identification set BI, and the terminal SN(1) determines the transmission The response of block b(1) is the correct response ACK; if the absolute value of the inner product is less than half of the L2 norm of the sequence t(4), the terminal SN(1) determines that the user identification 4 of the terminal SN(1) is not correct. Transport block identification set BI, terminal SN(1) determines that the response of transport block b(1) is an error response NACK;
  • the terminal SN(2) performs an inner product of the sequence t(3) determined by the user identification 3 and the signal containing the feedback information f. If the absolute value of the inner product is greater than half of the L2 norm of the sequence t(3), the terminal SN(2) determines that the user identification 3 of the terminal SN(2) belongs to the correct transmission block identification set BI, and the terminal SN(2) determines the transmission The response of block b(2) is the correct response ACK; if the absolute value of the inner product is less than half of the L2 norm of the sequence t(3), the terminal SN(2) determines that the user identification 3 of the terminal SN(2) is not correct. Transport block identification set BI, terminal SN(2) determines that the response of transport block b(2) is an error response NACK.
  • the terminal SN(3) performs an inner product of the sequence t(2) determined by the user identification 2 and the signal containing the feedback information f. If the absolute value of the inner product is greater than half of the L2 norm of the sequence t(2), the terminal SN(3) determines that the user identification 2 of the terminal SN(3) belongs to the correct transmission block identification set BI, and the terminal SN(3) determines the transmission The response of block b(3) is the correct response ACK; if the absolute value of the inner product is less than half of the L2 norm of the sequence t(2), the terminal SN(3) determines that the user identification 2 of the terminal SN(3) is not correct. Transport block identification set BI, terminal SN(3) determines that the response of transport block b(3) is an error response NACK.
  • the terminal SN(4) performs an inner product of the sequence t(5) determined by the user identification 5 and the signal containing the feedback information f. If the absolute value of the inner product is greater than half of the L2 norm of the sequence t(5), the terminal SN(5) determines that the user identification 5 of the terminal SN(5) belongs to the correct transmission block identification set BI, and the terminal SN(4) determines the transmission The response of block b(4) is the correct response ACK; if the absolute value of the inner product is less than half of the L2 norm of the sequence t(5), the terminal SN(4) determines that the user identification 5 of the terminal SN(4) is not correct. Transport block identification set BI, terminal SN(4) determines that the response of transport block b(4) is an error response NACK.
  • the feedback information f is an empty sequence, and the signal containing the feedback information f is a zero-power signal.
  • Figure 12 is a schematic diagram of determining feedback information f from the correct transmission block identification set BI through superposition according to another embodiment of the present application. As shown in Figure 12, the base station determines the feedback information f according to the following method:
  • One implementation method of the pseudo-random number generator is as follows:
  • mod is the remainder function
  • floor(x) is the largest integer less than or equal to x
  • Example 1 Another difference between this example and Example 1 is that in this example, the terminals SN(1), SN(2), SN(3), and SN(4) respectively determine the transmission blocks b(1), b according to the following method Answers to (2), b(3), b(4):
  • the terminal SN(1) uses the user identification 4 as the random number seed of the pseudo-random number generator to generate the complex sequence v(1).
  • the terminal SN(1) performs an inner product on v(1) and the signal containing the feedback information f. If the absolute value of the inner product is greater than half of the L2 norm of the complex sequence v(1), the terminal SN(1) determines the terminal SN
  • the user identification 4 of (1) belongs to the correct transmission block identification set BI, and the terminal SN (1) determines that the response of the transmission block b (1) is the correct response ACK; if the absolute value of the inner product is less than the L2 range of the complex sequence v (1) half of the number, then the terminal SN(1) determines that the user identification 4 of the terminal SN(1) does not belong to the correct transmission block identification set BI, and the terminal SN(1) determines that the response of the transmission block b(1) is an error response NACK.
  • the terminal SN(2) uses the user identification 3 as the random number seed of the pseudo-random number generator to generate the complex sequence v(2).
  • the terminal SN(2) performs an inner product on v(2) and the signal containing the feedback information f. If the absolute value of the inner product is greater than half of the L2 norm of the complex sequence v(2), the terminal SN(2) determines the terminal SN
  • the user identification 3 of (2) belongs to the correct transmission block identification set BI, and the terminal SN (2) determines that the response of the transmission block b (2) is the correct response ACK; if the absolute value of the inner product is less than the L2 range of the complex sequence v (2) half of the number, then the terminal SN(2) determines that the user identification 3 of the terminal SN(2) does not belong to the correct transmission block identification set BI, and the terminal SN(2) confirms that The response to transport block b(2) is assumed to be an error response NACK.
  • the terminal SN(3) uses the user identification 2 as the random number seed of the pseudo-random number generator to generate the complex sequence v(3).
  • the terminal SN(3) performs an inner product on v(3) and the signal containing the feedback information f. If the absolute value of the inner product is greater than half of the L2 norm of the complex sequence v(3), the terminal SN(3) determines the terminal SN
  • the user identification 2 of (3) belongs to the correct transmission block identification set BI, and the terminal SN (3) determines that the response of the transmission block b (3) is the correct response ACK; if the absolute value of the inner product is less than the L2 range of the complex sequence v (3) half of the number, then the terminal SN(3) determines that the user identification 2 of the terminal SN(3) does not belong to the correct transmission block identification set BI, and the terminal SN(3) determines that the response of the transmission block b(3) is an error response NACK.
  • the terminal SN(4) uses the user identification 5 as the random number seed of the pseudo-random number generator to generate the complex sequence v(4).
  • the terminal SN (4) performs an inner product on v (4) and the signal containing the feedback information f. If the absolute value of the inner product is greater than half of the L2 norm of the complex sequence v (4), the terminal SN (4) determines the terminal SN
  • the user identification 5 of (4) belongs to the correct transmission block identification set BI, and the terminal SN (4) determines that the response of the transmission block b (4) is the correct response ACK; if the absolute value of the inner product is less than the L2 range of the complex sequence v (4) half of the number, then the terminal SN(4) determines that the user identification 5 of the terminal SN(4) does not belong to the correct transmission block identification set BI, and the terminal SN(4) determines that the response of the transmission block b(4) is an error response NACK.
  • the information transmission method provided in this example can save the storage overhead of transmitting an ordered set of block sequences.
  • Figure 13 is a schematic diagram of determining feedback information f from the correct transmission block identification set BI through superposition according to another embodiment of the present application. As shown in Figure 13, the base station determines the feedback information f according to the following method:
  • QPSK modulation is implemented according to the following formula:
  • the pseudo-random number generator is a Gold sequence of length 31 (length-31 Gold sequence).
  • the information transmission method provided in this example is simpler than generating a Gaussian sequence in Example 2.
  • Figure 14 is a schematic diagram of determining the feedback information f from the correct transmission block identification set BI through superposition according to yet another embodiment of the present application. As shown in Figure 14, the base station determines the feedback information f according to the following method:
  • Complex number sequence s(2) [+1,-1,-1,-1,-1,+1].
  • the base station determines the feedback information f according to the complex sequence s(1) and s(2) as in,
  • the channel coding is a 3 ⁇ 6 generating matrix on the Galois field GF(2)
  • the base station sends a signal containing feedback information f to the terminal sequence ⁇ SN(1), SN(2), SN(3), SN(4)>, and the terminal SN(1), SN(2), SN(3), and SN(4) respectively determine the responses of transmission blocks b(1), b(2), b(3), and b(4) according to the following method:
  • the terminal SN(1) performs an inner product on v(1) and the signal containing the feedback information f.
  • the terminal SN(1) determines the terminal SN
  • the user identification 4 of (1) belongs to the correct transmission block identification set BI, and the terminal SN (1) determines that the response of the transmission block b (1) is the correct response ACK; if the absolute value of the inner product is less than the L2 range of the complex sequence v (1) half of the number, then the terminal SN(1) determines that the user identification 4 of the terminal SN(1) does not belong to the correct transmission block identification set BI, and the terminal SN(1) determines that the response of the transmission block b(1) is an error response NACK.
  • the terminal SN(2) performs an inner product on v(2) and the signal containing the feedback information f.
  • the terminal SN(2) determines the terminal SN
  • the user identification 3 of (2) belongs to the correct transmission block identification set BI, and the terminal SN (2) determines that the response of the transmission block b (2) is the correct response ACK; if the absolute value of the inner product is less than the L2 range of the complex sequence v (2) half of the number, then the terminal SN(2) determines that the user identification 3 of the terminal SN(2) does not belong to the correct transmission block identification set BI, and the terminal SN(2) determines that the response of the transmission block b(2) is an error response NACK.
  • the terminal SN(3) performs an inner product on v(3) and the signal containing the feedback information f.
  • the terminal SN(3) determines the terminal SN
  • the user identification 2 of (3) belongs to the correct transmission block identification set BI, and the terminal SN (3) determines that the response of the transmission block b (3) is the correct response ACK; if the absolute value of the inner product is less than the L2 range of the complex sequence v (3) half of the number, then the terminal SN(3) determines that the user identification 2 of the terminal SN(3) does not belong to the correct transmission block identification set BI, and the terminal SN(3) determines that the response of the transmission block b(3) is an error response NACK.
  • the terminal SN (4) determines the terminal SN
  • the user identification 5 of (4) belongs to the correct transmission block identification set BI, and the terminal SN (4) determines that the response of the transmission block b (4) is the correct response ACK; if the absolute value of the inner product is less than the L2 range of the complex sequence v (4) half of the number, then the terminal SN(4) determines that the user identification 5 of the terminal SN(4) does not belong to the correct transmission block identification set BI, and the terminal SN(4) determines that the response of the transmission block b(4) is an error response NACK.
  • the information transmission method provided in this example can improve the reliability of response reception by selecting channel coding with superior performance.
  • CS-RNTI Configured Scheduling RNTI
  • Figure 15 is a schematic diagram of determining the feedback information f by splicing the correct transmission block identification set BI and the transmission block sequence ordered set provided by the embodiment of the present 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 determine the transmission blocks b(1), b(2), b(3), and b(4) according to the following method response.
  • the information transmission method provided in this example does not overlap between different user identifiers, which increases the terminal's detection signal-to-noise ratio and improves information transmission efficiency.
  • the first node is a base station
  • the second node is a terminal.
  • This example includes multiple terminals, these terminals form a second node sequence, and the transmission block identifier is a user identifier.
  • Figure 16 is a schematic diagram of the relationship between a second node, a transport block, a user identifier, a random access tag and a tag index provided by an embodiment of the present application.
  • the signal containing the transport block set B includes a signal containing the transport block b(1), a signal containing the transport block b(2), a signal containing the transport block b(3) and a signal containing the transport block b(4). .
  • the transport block b(t) in the transport block set B is sent to the base station by the terminal SN(t) in the terminal sequence, where
  • the transmission block b(t) includes the user identification and random access tag of the terminal SN(t).
  • the user identity of terminal SN(t) is the permanent equipment identifier (Permanent Equipment Identifier, PEI), and the random access label is the reference signal (Reference Signal).
  • the user IDs of terminals SN(1), SN(2), SN(3), and SN(4) are 4, 3, 2, and 5 respectively, where user IDs 4, 3, 2, and 5 are transmission blocks.
  • the reference signal is an element of an ordered set of random access tags.
  • the ordered set of random access tags includes 6 reference signals r(1), r(2), r(3), r(4), r(5), r(6), where the reference signal r
  • the label indexes of (1), 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 generated by the terminals SN(1), SN(2), SN(3), SN(4). ) are determined according to the user IDs 4, 3, 2, and 5 of terminals SN(1), SN(2), SN(3), and SN(4) respectively in the following manner:
  • the tag index of the reference signal included in the transport block b(t) the remainder of the square of the user identification of the terminal SN(t) divided by 6.
  • terminals SN(1), SN(2), SN(3), and SN(4) Substituting the user IDs 4, 3, 2, and 5 of terminals SN(1), SN(2), SN(3), and SN(4) into the above equation respectively, we get terminals SN(1), SN(2), SN( 3), the tag indexes of the reference signals of SN(4) are 4, 3, 4, and 1 respectively.
  • the final reference signals of the terminals SN(1), SN(2), SN(3), and SN(4) are respectively r(5),r(4),r(5),r(2).
  • the correct transmission block identification set refers to the set of user identifications included in the correctly received transmission blocks in the transmission block set.
  • Figure 17 is a schematic diagram of determining the feedback information f by splicing the correct transmission block identification set BI and the transmission block sequence ordered set according to an embodiment of the present application. As shown in the block diagram in Figure 17, the base station determines the feedback information f according to the following method:
  • the pseudo-random number generator generates random numbers with Gaussian distribution.
  • One implementation method of the pseudo-random number generator is as follows:
  • mod is the remainder function
  • floor(x) is the largest integer less than or equal to x
  • S is the state of the pseudo-random number generator
  • the terminal sequence ⁇ SN(1), SN(2), SN(3), SN(4)> receives a signal containing feedback information f.
  • the terminal SN(1), SN(2), SN(3), SN(4) respectively decode the signal containing the feedback information f, and determine the transmission blocks b(1), b(2), b(3) according to the following method ), response to b(4).
  • the terminal SN(1) uses the user identification 4 as the random number seed of the pseudo-random number generator to generate a complex sequence v(1) of length 3.
  • the terminal SN(1) performs an inner product between v(1) and every 3 symbols in the signal containing the feedback information f.
  • the terminal SN(1) determines that the user identification 4 of the terminal SN(1) belongs to the correct transmission block identification set BI, and the terminal SN(1) determines that the response of the transmission block b(1) is the correct response ACK; if the absolute values of the inner products are less than the complex number half of the L2 norm of the sequence v(1), then the terminal SN(1) determines that the user identification 4 of the terminal SN(1) does not belong to the correct transmission block identification set BI, and the terminal SN(1) determines that the user identification 4 of the transmission block b(1) The response is an error response NACK.
  • the terminal SN(2) uses the user identification 3 as the random number seed of the pseudo-random number generator to generate a complex sequence v(2) of length 3.
  • the terminal SN(2) performs an inner product on v(2) and every 3 symbols in the signal containing the feedback information f.
  • the terminal SN(2) determines that the user identification 3 of the terminal SN(2) belongs to the correct transmission block identification set BI, and the terminal SN(2) determines that the response of the transmission block b(2) is the correct response ACK; if the absolute values of the inner products are less than the complex number half of the L2 norm of the sequence v(2), then the terminal SN(2) determines that the user identification 3 of the terminal SN(2) does not belong to the correct transmission block identification set BI, and the terminal SN(2) determines that the user identification 3 of the transmission block b(2)
  • the response is an error response NACK.
  • the terminal SN(3) uses the user identification 2 as the random number seed of the pseudo-random number generator to generate a complex sequence v(3) of length 3.
  • the terminal SN(3) performs an inner product between v(3) and every 3 symbols in the signal containing the feedback information f.
  • the terminal SN(3) determines that the user identification 2 of the terminal SN(3) belongs to the correct transmission block identification set BI, and the terminal SN(3) determines that the response of the transmission block b(3) is the correct response ACK; if the absolute values of the inner products are less than the complex number half of the L2 norm of the sequence v(3), then the terminal SN(3) determines that the user identification 2 of the terminal SN(3) does not belong to the correct transmission block identification set BI, and the terminal SN(3) determines that the user identification 2 of the transmission block b(3) The response is an error response NACK.
  • the terminal SN(4) uses the user identification 5 as the random number seed of the pseudo-random number generator to generate a complex number sequence v(4) with a length of 3.
  • the terminal SN(4) performs an inner product between v(4) and every 3 symbols in the signal containing the feedback information f.
  • the terminal SN(4) determines that the user identification 5 of the terminal SN(4) belongs to the correct transmission block identification set BI, and the terminal SN(4) determines that the response of the transmission block b(4) is the correct response ACK; if the absolute values of the inner products are less than the complex number half of the L2 norm of the sequence v(4), then the terminal SN(4) determines that the user identification 5 of the terminal SN(4) does not belong to the correct transmission block identification set BI, and the terminal SN(4) determines that the user identification 5 of the transmission block b(4) The response is an error response NACK.
  • Example 5 Compared with Example 5, the information transmission method provided in this example saves the storage overhead of transmitting an ordered set of block sequences.
  • the first node is a base station
  • the second node is a terminal.
  • This example includes multiple terminals. These terminals form a second node sequence, and the transmission block identifier is a label index.
  • Figure 18 is a schematic diagram illustrating the relationship between a second node, a transport block, a user identifier, a random access tag, and a tag index provided by another embodiment of the present application.
  • the signal containing the transport block set B includes a signal containing the transport block b(1), a signal containing the transport block b(2), a signal containing the transport block b(3) and a signal containing the transport block b(4). .
  • the transport block b(k) in the transport block set B is sent to the base station by the terminal SN(k) in the terminal sequence, where The transmission block b(k) includes the user ID corresponding to the terminal SN(k) and the random access Enter tag.
  • the user identification of the terminal SN(k) is the Generic Public Subscription Identifier (GPSI), and the random access label is the preamble (Preamble).
  • the user IDs of terminals SN(1), SN(2), SN(3), and SN(4) are 4, 6, 2, and 1 respectively.
  • the preamble is an element of an ordered set of random access tags.
  • the label indexes of codes r(1), r(2), r(3), r(4), r(5), and r(6) are 1, 2, 3, 4, 5, and 6 respectively.
  • the random access tags included in the transmission blocks b(1), b(2), b(3), and b(4) are generated by the terminals SN(1), SN(2), SN(3), SN(4).
  • the preambles are determined in the following manner according to the user IDs 4, 6, 2, and 1 of the terminals SN(1), SN(2), SN(3), and SN(4) respectively:
  • Terminals SN(1), SN(2), SN(3), and SN(4) respectively set the user IDs 4, 6, and 2 of terminals SN(1), SN(2), SN(3), and SN(4).
  • the pseudo-random number generator is a Gold sequence of length 31 (length-31 Gold sequence).
  • the terminals SN(1), SN(2), SN(3), and SN(4) are respectively according to the formula
  • the terminals SN(1), SN(2), SN(3), SN(4) determine the transmission blocks b(1), b(2), b(3), b according to the tag index 4, 3, 2, 1 respectively.
  • the preambles included are r(4), r(3), r(2), r(1) respectively.
  • the correct transmission block identification set refers to the set of tag indexes of random access tags included in correctly received transmission blocks in the transmission block set.
  • Figure 19 is a schematic diagram of determining the feedback information f by splicing the correct transmission block identification set BI and the correct transmission block number P according to another embodiment of the present application.
  • the base station determines the feedback information f according to the following method:
  • the base station determines the feedback information by splicing the complex sequences s(1) and s(2)
  • 16QAM modulation is implemented according to the following formula:
  • the pseudo-random sequence generator is a Gold sequence of length 31 (length-31 Gold sequence).
  • the base station sends feedback information containing The signal is given to the terminal sequence ⁇ SN(1), SN(2), SN(3), SN(4)>.
  • the terminal sequence ⁇ SN(1), SN(2), SN(3), SN(4)> receives the feedback information f Signal. Further, 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) according to the following method ,b(3),b(4) response.
  • Terminal SN(1) uses user identification 4 as the random number seed of the pseudo-random sequence generator and uses the same method as the base station to obtain tag index 4, and uses tag index 4 to generate a complex sequence v(1) of length 3 using the same method as the base station.
  • the terminal SN(1) performs an inner product between v(1) and every 3 symbols in the signal containing the feedback information f.
  • the terminal SN(1) determines that the user identification 4 of the terminal SN(1) belongs to the correct transmission block identification set BI, and the terminal SN(1) determines that the response of the transmission block b(1) is the correct response ACK; if the absolute values of the inner products are less than the complex number half of the L2 norm of the sequence v(1), then the terminal SN(1) determines that the user identification 4 of the terminal SN(1) does not belong to the correct transmission block identification set BI, and the terminal SN(1) determines that the user identification 4 of the transmission block b(1) The response is an error response NACK.
  • the terminal SN(2) uses the user identification 6 as the random number seed of the pseudo-random sequence generator and uses the same method as the base station to obtain the tag index 3, and uses the tag index 3 as input and uses the same method as the base station to generate a complex sequence v(2) of length 3. ).
  • the terminal SN(2) performs an inner product on v(2) and every 3 symbols in the signal containing the feedback information f.
  • the terminal SN(2) determines that the user identification 6 of the terminal SN(2) belongs to the correct transmission block identification set BI, and the terminal SN(2) determines that the response of the transmission block b(2) is the correct response ACK; if the absolute values of the inner products are less than the complex number half of the L2 norm of the sequence v(2), then the terminal SN(2) determines that the user identification 6 of the terminal SN(2) does not belong to the correct transmission block identification set BI, and the terminal SN(2) determines that the user identification 6 of the transmission block b(2)
  • the response is an error response NACK.
  • Terminal SN(3) uses user identification 2 as the random number seed of the pseudo-random sequence generator and uses the same method as the base station to obtain tag index 2, and uses tag index 2 to generate a complex sequence v(3) of length 3 using the same method as the base station. .
  • the terminal SN(3) performs an inner product between v(3) and every 3 symbols in the signal containing the feedback information f.
  • the terminal SN(3) determines that the user identification 2 of the terminal SN(3) belongs to the correct transmission block identification set BI, and the terminal SN(3) determines that the response of the transmission block b(3) is the correct response ACK; if the absolute values of the inner products are less than the complex number half of the L2 norm of the sequence v(3), then the terminal SN(3) determines that the user identification 2 of the terminal SN(3) does not belong to the correct transmission block identification set BI, and the terminal SN(3) determines that the user identification 2 of the transmission block b(3) The response is an error response NACK.
  • the terminal SN(4) uses the user identification 1 as the random number seed of the pseudo-random sequence generator and uses the same method as the base station to obtain the tag index 1, and uses the tag index 1 to generate a complex sequence v(4) of length 3 using the same method as the base station. .
  • the terminal SN(4) performs an inner product between v(4) and every 3 symbols in the signal containing the feedback information f.
  • the terminal SN(4) determines that user identification 1 of terminal SN(4) belongs to the correct transmission block identification set BI, and terminal SN(4) determines that the response of transmission block b(4) is the correct response ACK; if the absolute values of the inner products are less than complex numbers half of the L2 norm of the sequence v(4), then the terminal SN(4) determines that the user identification 1 of the terminal SN(4) does not belong to the correct transmission block identification set BI, and the terminal SN(4) determines that the user identification 1 of the transmission block b(4) The response is an error response NACK.
  • the information transmission method provided in this example uses a pseudo-random sequence generator to obtain the tag index to determine that the random access tag will not conflict with the situation in Example 6.
  • the bit sequence generated by the random sequence generator is better than the Gaussian sequence generated in Example 6. Simpler and more efficient to process.
  • the first node is a base station
  • the second node is a terminal.
  • This example includes multiple terminals. These terminals form a second node sequence, and the transmission block identifier is a label index.
  • Figure 20 is a schematic diagram of the relationship between the second node, the transport block, the random access label and the label index provided by an embodiment of the present application. picture.
  • the signal containing the transport block set B includes a signal containing the transport block b(1), a signal containing the transport block b(2), a signal containing the transport block b(3) and a signal containing the transport block b(4). .
  • the transmission blocks b(1), b(2), b(3), and b(4) in the transmission block set B are respectively configured by the terminals SN(1), SN(2), and SN in the terminal sequence.
  • SN(1) sends to the base station, where the transmission blocks b(1), b(2), b(3), and b(4) in the transmission block set B include random access tags, where The access label is Pilot.
  • the pilot is an element of an ordered set of random access tags.
  • the tag indexes 1, 2, 3, 4, 5, and 6 of the pilots r(1), r(2), r(3), r(4), and r(5) are the ordered sets of transport block identifiers.
  • the random access tags included in the transmission blocks b(1), b(2), b(3), and b(4) are generated by terminals SN(1), SN(2), SN(3), SN (1) According to the higher layer parameters (higher layer parameters), they are determined as r(4), r(3), r(2), r(1), among which, the transmission blocks b(1), b(2), b( 3),
  • the tag indexes of the random access tags included in b(4) are 4, 3, 2, and 1 respectively.
  • the correct transmission block identification set refers to the set of tag indexes of random access tags included in correctly received transmission blocks in the transmission block set.
  • Figure 21 is a schematic diagram of determining the feedback information f by splicing the correct transmission block identification set BI and the correct transmission block number P according to another embodiment of the present application.
  • the base station determines the feedback information f according to the following method:
  • the base station determines the feedback information f by splicing the complex sequence s(1) and s(2) as
  • QPSK modulation is implemented according to the following formula:
  • the channel coding is a 3 ⁇ 6 generating matrix on GF(2)
  • the base station sends feedback information containing The signal is given to the terminal sequence ⁇ SN(1), SN(2), SN(3), SN(4)>, and the terminal SN(1), SN(2), SN(3), SN(4) are as follows respectively The above method determines the response of transmission blocks b(1), b(2), b(3), b(4).
  • Terminal SN(1) is represented in binary with tag index 4 Bits [1,0,0] are encoded using the generator matrix G and then QPSK modulated to determine the complex sequence.
  • the terminal SN(1) performs an inner product between v(1) and every 3 symbols in the signal containing the feedback information f. If there is an absolute value of the inner product greater than half of the L2 norm of the complex sequence v(1), the terminal SN(1) determines that the tag index 4 included in the transmission block b(1) belongs to the correct transmission block identification set BI, and the terminal SN(1) determines that the response of the transmission block b(1) is a correct response ACK; otherwise, the terminal SN(1) It is determined that the response to transport block b(1) is an error response NACK.
  • Terminal SN(2) is represented in binary with tag index 3 Bits [0,1,1] are encoded using the generator matrix G and then QPSK modulated to determine the complex sequence.
  • the terminal SN(2) performs an inner product on v(2) and every 3 symbols in the signal containing the feedback information f. If the absolute value of the inner product is greater than half of the L2 norm of the complex sequence v(2), the terminal SN(2) determines that the tag index 3 included in the transmission block b(2) belongs to the correct transmission block identification set BI, and the terminal SN(2) determines that the response of the transmission block b(2) is the correct response ACK; otherwise, the terminal SN(2) It is determined that the response to transport block b(2) is an error response NACK.
  • Terminal SN(3) is represented in binary with tag index 2 Bits [0,1,0] are encoded using the generator matrix G and then QPSK modulated to determine the complex sequence.
  • the terminal SN(3) performs an inner product between v(3) and every 3 symbols in the signal containing the feedback information f. If there is an absolute value of the inner product greater than half of the L2 norm of the complex sequence v(3), the terminal SN(3) determines that the tag index 2 included in the transmission block belongs to the correct transmission block identification set BI, and the terminal SN(3) determines that the response of transmission block b(3) is the correct response ACK; otherwise, the terminal SN(3) determines that the transmission block b Response to (3) Respond NACK to errors.
  • Terminal SN(1) is represented in binary with tag index 1 Bits [0,0,1] are encoded using the generator matrix G and then QPSK modulated to determine the complex sequence.
  • the terminal SN(1) performs an inner product on v(4) and every 3 symbols in the signal containing the feedback information f. If there is an absolute value of the inner product greater than half of the L2 norm of the complex sequence v(4), the terminal SN(1) determines that the tag index 1 included in the transmission block belongs to the correct transmission block identification set BI, and the terminal SN(1) determines that the response of transmission block b(4) is the correct response ACK; otherwise, the terminal SN(1) determines that the transmission block b The response to (4) is an error response NACK.
  • Example 6 Compared with Example 6 and Example 7, the information transmission method provided in this example can improve the reliability of response reception by selecting channel coding with superior performance.
  • the first node is a base station
  • the second node is a terminal.
  • This example includes multiple terminals. These terminals form a second node sequence, and the transmission block identifier is a label index.
  • the transmission blocks b(1), b(2), b(3), and b(4) in the transmission block set B are respectively configured by the terminals SN(1), SN(2), and SN in the terminal sequence.
  • SN(1) sends to the base station, where the transmission blocks b(1), b(2), b(3), and b(4) in the transmission block set B include random access tags, where The access label is Interleaver.
  • the interleaver is an element of an ordered set of random access tags.
  • the label indexes of devices r(1), r(2), r(3), r(4), r(5), and r(6) are 1, 2, 3, 4, 5, and 6 respectively.
  • the random access tags included in the transmission blocks b(1), b(2), b(3), and b(4) are generated by terminals SN(1), SN(2), SN(3), SN (1) According to the higher layer parameters (higher layer parameters), they are determined as r(4), r(3), r(2), r(1), among which, the transmission blocks b(1), b(2), b( 3),
  • the tag indexes of the random access tags included in b(4) are 4, 3, 2, and 1 respectively.
  • the correct transmission block identification set refers to the set of tag indexes of random access tags included in correctly received transmission blocks in the transmission block set.
  • Figure 22 is a schematic diagram of the feedback information f determined by splicing the correct transmission block identification set BI, the number of correct transmission blocks P and the maximum correct transmission block Pmax provided by the embodiment of the present application.
  • the base station is as follows Method to determine feedback information f:
  • the binary representation of the transport block identification BI(2) 3 in the set
  • s(p,k) is the k-th element of s(p)
  • c(p,k) is the k-th element of c(p).
  • the base station consists of complex sequence s(1), s(2) and the length is
  • the all-zero sequence splicing determines the feedback information Among them, max(x,y) means taking the larger value of x and y.
  • the base station sends feedback information containing The signal is given to the terminal sequence ⁇ SN(1), SN(2), SN(3)>.
  • Terminals SN(1), SN(2), and SN(3) respectively determine the responses of transmission blocks b(1), b(2), b(3), and b(4) according to the following method:
  • Terminal SN(1) is represented in binary with tag index 4 Single parity check encoding is performed on each bit and then QPSK modulation is performed to determine the complex sequence.
  • the terminal SN(1) performs an inner product between v(1) and every 2 symbols in the signal containing the feedback information f. If there is an absolute value of the inner product greater than half of the L2 norm of the complex sequence v(1), the terminal SN(1) determines that the tag index 4 included in the transmission block b(1) belongs to the correct transmission block identification set BI, and the terminal SN(1) determines that the response of the transmission block b(1) is the correct response ACK; otherwise, the terminal SN(1) It is determined that the response to transport block b(1) is an error response NACK.
  • Terminal SN(2) is represented in binary with tag index 3 Single parity check encoding is performed on each bit and then QPSK modulation is performed to determine the complex sequence.
  • the terminal SN(2) performs an inner product between v(2) and every 2 symbols in the signal containing the feedback information f. If there is an absolute value of the inner product greater than half of the L2 norm of the complex sequence v(2), the terminal SN(2) determines that the tag index 3 included in the transmission block b(2) belongs to the correct transmission block identification set BI, and the terminal SN(2) determines that the response of the transmission block b(2) is the correct response ACK; otherwise, the terminal SN(2) The response to transport block b(2) is determined to be Error response NACK.
  • Terminal SN(3) is represented in binary with tag index 2 Single parity check encoding is performed on each bit and then QPSK modulation is performed to determine the complex sequence.
  • the terminal SN(3) performs an inner product between v(3) and every 2 symbols in the signal containing the feedback information f. If there is an absolute value of the inner product greater than half of the L2 norm of the complex sequence v(3), the terminal SN(3) determines that the tag index 2 included in the transmission block belongs to the correct transmission block identification set BI, and the terminal SN(3) determines that the response of transmission block b(3) is the correct response ACK; otherwise, the terminal SN(3) determines that the transmission block b The response to (3) is an error response NACK.
  • Terminal SN(1) is represented in binary with tag index 1 Single parity check encoding is performed on each bit and then QPSK modulation is performed to determine the complex sequence.
  • the terminal SN(1) performs an inner product between v(4) and every 2 symbols in the signal containing the feedback information f. If there is an absolute value of the inner product greater than half of the L2 norm of the complex sequence v(4), the terminal SN(1) determines that the tag index 1 included in the transmission block belongs to the correct transmission block identification set BI, and the terminal SN(1) determines that the response of transmission block b(4) is the correct response ACK; otherwise, the terminal SN(1) determines that the transmission block b The response to (4) is an error response NACK.
  • the terminal SN(1) sends two transmission blocks b(1) and b(4), but selects different random access labels; the base station determines the random access label of the correctly decoded transmission block.
  • the tag index 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.
  • using channel coding to obtain feedback information f can increase the minimum distance between different transmission block sequences and improve feedback detection performance.
  • the random access label is a spread spectrum sequence (Spread Spectrum Sequence)
  • Figure 23 is a schematic diagram of determining the complex sequence s(p) based on the transport block identifier ordered set size Na of the element BI(p) in the correct transport block identifier set BI provided by the embodiment of the present application.
  • the base station determines the feedback information f as follows:
  • Figure 24 is provided by the embodiment of the present application and is determined by the number of correct transmission blocks P, the maximum correct transmission block Pmax, the length Nf of the feedback information f and the complex sequence s(1), s(2), ..., s(P) Schematic diagram of feedback information f.
  • the base station consists of complex sequence s(1), s(2) and the length is The all-zero sequence sequence is superimposed in the following way to determine the feedback information f:
  • the base station sends feedback information including +3,-2,+2,+1,+3] signal to the terminal sequence ⁇ SN(1), SN(2), SN(3)>.
  • the terminals SN(1), SN(2), and SN(3) respectively determine the responses of the transmission blocks b(1), b(2), b(3), and b(4) according to the following methods.
  • the terminal SN(1) determines that the response of the transport block b(1) is a correct response ACK; otherwise, the terminal SN(1) determines that the response of the transport block b(1) is an incorrect response NACK.
  • the terminal SN(2) determines that the response of the transport block b(2) is a correct response ACK; otherwise, the terminal SN(2) determines that the response of the transport block b(2) is an incorrect response NACK.
  • Block identification set BI the terminal SN(1) determines that the response of the transmission block b(4) is a correct response ACK; otherwise, the terminal SN(1) determines that the response of the transmission block b(4) is an error response NACK.
  • the random access tag is a sparse code sequence (Sparse Code Sequence).
  • Figure 25 is a diagram illustrating the determination of the complex sequence s(1) and the placement vector z(p) by the element BI(p) in the correct transmission block identification set BI, the maximum correct transmission block Pmax, and the length Nf of the feedback information f provided by the embodiment of the present application.
  • the base station determines the feedback information f as follows:
  • the base station determines the feedback information f by superposing the complex sequences s(1) and s(2) in the following way:
  • Table 2 Mapping table from 1 bit to position vector z(p)
  • Figure 26 is a schematic diagram of the base station provided by the embodiment of the present application superposing the complex sequence s(1), s(2) and the placement vector z(1), z(2) to determine the feedback information f. As shown in Figure 26, the base station determines the feedback information f based on the complex sequence s(1), s(2), and the placement vector z(1), z(2) according to the following pseudo code:
  • floor(x) represents the largest positive integer less than or equal to x
  • f(k) is the k-th element of the feedback information f
  • z(p,i) is the i-th element of the placement vector z(p)
  • ks (p) is the p-th element of the vector ks
  • s(p,ks(p)) is the ks(p)-th element of the complex sequence s(p)
  • Obtain feedback information f [2,-2,+1,-1,+1,-1].
  • the terminals SN(1), SN(2), and SN(3) respectively determine the responses of the transmission blocks b(1), b(2), b(3), and b(4) according to the following method.
  • Terminal SN(1) is represented in binary with tag index 4
  • the terminal SN(1) performs an inner product on v(1) and the signal containing the feedback information f. If the absolute value of the inner product is greater than half of the L2 norm of the complex sequence v(1), the terminal SN(1) determines the transmission block.
  • the tag index 4 included in b(1) belongs to the correct transmission block identification set BI, and the terminal SN(1) determines that the response to the transmission block b(1) is the correct response ACK; otherwise, the terminal SN(1) determines that the transmission block b(1) The response is an error response NACK.
  • Terminal SN(2) is represented in binary with tag index 3
  • the terminal SN(2) performs an inner product on v(2) and the signal containing the feedback information f. If the absolute value of the inner product is greater than half of the L2 norm of the complex sequence v(2), the terminal SN(2) determines the transmission block.
  • the tag index 3 included in b(2) belongs to the correct transmission block identification set BI, and the terminal SN(2) determines that the response to the transmission block b(2) is the correct response ACK; otherwise, the terminal SN(2) determines that the transmission block b(2) The response is an error response NACK.
  • Terminal SN(3) is represented in binary with tag index 2
  • the terminal SN(3) performs an inner product on v(3) and the signal containing the feedback information f. If the absolute value of the inner product is greater than half of the L2 norm of the complex sequence v(3), the terminal SN(3) determines the transmission block.
  • the included tag index 2 belongs to the correct transmission block identification set BI, and the terminal SN (3) determines that the response of the transmission block b (3) is a correct response ACK; otherwise, the terminal SN (3) determines that the response of the transmission block b (3) is an error.
  • the terminal SN(3) performs an inner product on v(3) and the signal
  • Terminal SN(1) is represented in binary with tag index 1
  • the terminal SN(1) performs an inner product on v(4) and the signal containing the feedback information f. If the absolute value of the inner product is greater than half of the L2 norm of the complex sequence v(4), the terminal SN(1) determines the transmission block.
  • the included tag index 1 belongs to the correct transmission block identification set BI, and the terminal SN (1) determines that the response of the transmission block b (4) is a correct response ACK; otherwise, the terminal SN (1) determines that the response of the transmission block b (4) is an error.
  • Reply NACK The included tag index 1 belongs to the correct transmission block identification set BI, and the terminal SN (1) determines that the response of the transmission block b (4) is a correct response ACK; otherwise, the terminal SN (1) determines that the response of the transmission block
  • the random access tag is a scrambling sequence (Scrambling Sequence)
  • the scrambling sequence is an element of an ordered set of random access tags.
  • Figure 27 is a schematic diagram of the relationship between the second node, transmission block, random access label and label index provided by an embodiment of the present application. In this example, as shown in the figure, transmission blocks b(1), b(2), The tag indexes of the random access tags included in b(3) and b(4) are 3, 2, 1, and 0 respectively.
  • the base station determines the feedback information f according to the following method:
  • the base station sends a zero-power signal containing feedback information f to the terminal sequence ⁇ SN(1), SN(2), SN(3), SN(1)> .
  • the terminal sequence ⁇ SN(1), SN(2), SN(3), SN(1)> receives a zero-power signal containing feedback information f.
  • terminal SN(1) fails to decode and determines that the response of transport blocks b(1) and b(4) is Error response NACK;
  • terminal SN(2) fails to decode and determines that the response to transport block b(2) is an error response NACK;
  • terminal SN(3) fails to decode and determines that the response to transport block b(3) is an error response NACK.
  • the first node is a base station
  • the second node is a terminal.
  • This example includes multiple terminals. These terminals form a second node sequence, and the transmission block identifier is the index value of the user identifier.
  • Figure 28 is a schematic diagram illustrating the relationship between the second node, the transport block, the user identifier and the index value of the user identifier provided by an embodiment of the present application.
  • the signal containing the transport block set B includes a signal containing the transport block b(1), a signal containing the transport block b(2), a signal containing the transport block b(3) and a signal containing the transport block b(4). .
  • the transport block b(t) in the transport block set B is sent to the base station by the terminal SN(t) in the terminal sequence, where
  • the transmission block b(t) includes the user identification of the terminal SN(t).
  • the user identification of the terminal SN(t) is Random Access RNTI (RA-RNTI).
  • the terminals SN(1), SN(2), The user IDs of SN(3) and SN(4) are 4,3,2,5 respectively.
  • the index values of ID(3), ID(4), and ID(5) are 1, 2, 3, 4, and 5 respectively; among them, the index values 1, 2, 3, 4, and 5 of the user ID are the transmission block IDs.
  • the correct transmission block identification set refers to the set of user identifications included in the correctly received transmission blocks in the transmission block set B.
  • Figure 29 is a schematic diagram of determining the feedback information f by superposing the correct transmission block identification set BI and the transmission block sequence ordered set provided by an embodiment of the present 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.
  • terminals SN(1), SN(2), SN(3), and SN(4) respectively determine the transmission blocks b(1), b(2), b(3), and b(4) according to the following method 's response:
  • the terminal SN(1) determines the sequence t(1) from the index value 1 of the user identification corresponding to the user identification 4 and performs an inner product with the signal containing the feedback information f. If the absolute value of the inner product is greater than half of the L2 norm of the sequence t(1), the terminal SN(1) determines that the index value 1 of the user identification corresponding to the user identification 4 of the terminal SN(1) belongs to the correct transmission block identification set BI.
  • the terminal SN(1) determines that the response of the transmission block b(1) is the correct response ACK; if the absolute value of the inner product is less than half of the L2 norm of the sequence t(1), the terminal SN(1) determines that the terminal SN(1) The index value 1 of the user ID corresponding to the user ID 4 of ) does not belong to the correct transmission block identification set BI, and the terminal SN (1) determines that the response of the transmission block b (1) is an error response NACK;
  • the terminal SN(2) determines the sequence t(2) from the index value 2 of the user identification corresponding to the user identification 3 and performs an inner product with the signal containing the feedback information f. If the absolute value of the inner product is greater than half of the L2 norm of the sequence t(2), the terminal SN(2) determines that the index value 2 of the user identification corresponding to the user identification 3 of the terminal SN(2) belongs to the correct transmission block identification set BI.
  • the terminal SN(2) determines that the response of the transmission block b(2) is the correct response ACK; if the absolute value of the inner product is less than half of the L2 norm of the sequence t(2), the terminal SN(2) determines that the terminal SN(2) The index value 2 of the user ID corresponding to the user ID 3 of ) does not belong to the correct transmission block identification set BI, and the terminal SN(2) determines that the response of the transmission block b(2) is an error response NACK.
  • the terminal SN(3) determines the sequence t(3) from the index value 3 of the user identification corresponding to the user identification 2 and performs an inner product with the signal containing the feedback information f. If the absolute value of the inner product is greater than half of the L2 norm of the sequence t(3), the terminal SN(3) determines that the index value 3 of the user identification corresponding to the user identification 2 of the terminal SN(3) belongs to the correct transmission block identification set BI.
  • the terminal SN(3) determines that the response of the transmission block b(3) is the correct response ACK; if the absolute value of the inner product is less than half of the L2 norm of the sequence t(3), the terminal SN(3) determines that the terminal SN(3) The index value 3 of the user ID corresponding to the user ID 2 of ) does not belong to the correct transmission block identification set BI, and the terminal SN(3) determines that the response of the transmission block b(3) is an error response NACK.
  • the terminal SN(4) determines the sequence t(4) from the index value 4 of the user identification corresponding to the user identification 5 and performs an inner product with the signal containing the feedback information f. If the absolute value of the inner product is greater than half of the L2 norm of the sequence t(4), the terminal SN(5) determines that the index value 4 of the user identification corresponding to the user identification 5 of the terminal SN(5) belongs to the correct transmission block identification set BI.
  • the terminal SN(4) determines that the response of the transmission block b(4) is the correct response ACK; if the absolute value of the inner product is less than half of the L2 norm of the sequence t(4), the terminal SN(4) determines that the terminal SN(4) The index value 4 of the user identification corresponding to the user identification 5 of ) does not belong to the correct transmission block identification set BI, and the terminal SN(4) determines that the response of the transmission block b(4) is an error response NACK.
  • the feedback information f is an empty sequence, and the signal containing the feedback information f is a zero-power signal.
  • Figure 30 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 S4000 and step S5000.
  • Step S4000 Send the transport block to the first node.
  • Step S5000 Receive feedback information sent by the first node; wherein the feedback information is used to characterize the reception of the transport block.
  • the second node sends a signal containing transport blocks to the first node, the one or more transport blocks being A set of transport blocks is formed at a node.
  • 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 k elements I(k) can be integers k or integers k-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 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. 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 label index of the kth random access label r(k) in the ordered set of random access labels is the transmission block identifier.
  • 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 sequence 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 Different transport blocks within the transport block set are distinguished in a signal containing a transport block set.
  • the second node sequence 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 are available
  • the first node distinguishes different transport blocks in the transport block set in a signal including 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.
  • the information of correct transmission blocks includes the maximum number of correct transmission blocks Pmax, an ordered set of transmission block identifications, an ordered set of transmission block sequences, a predefined complex sequence set, an ordered set size of transmission block identifications Na, correct The set of transmission block identifiers, the set of correct transmission block sequences, the number of correct transmission blocks P, and the length Nf of the feedback information f.
  • the second node sequence receives feedback information sent by the first node; wherein the feedback information is used to characterize the reception of the transport block, and the feedback information is obtained according to the transport block set.
  • the feedback information may be determined based on one or more of the following parameters, which include: the maximum number of correct transport blocks Pmax, an ordered set of transport block identifiers, an ordered set of transport block sequences, a predefined complex sequence set, and a transport block identifier.
  • the ordered set of transport block sequences is a predefined set of complex sequences.
  • the size Na of the ordered set of transmission block identifiers is the number of elements in the ordered set of transmission block identifiers
  • the number of correct transmission blocks P is the number of elements of the correct set of transmission block identifiers
  • the ordered set of transmission block sequences includes Na plural sequences.
  • the correct transmission block identification set includes P transmission block identifications BI(1), BI(2),...,BI(P), correct
  • the maximum number of correct transmission blocks Pmax is less than or equal to the size Na of the ordered set of transmission block identifiers.
  • the maximum number of correct transmission blocks Pmax is configured by the first node; in other embodiments, the maximum number of correct transmission blocks Pmax is pre-configured by high layer parameters (high layer parameters).
  • the set of correct transport block identifiers refers to the set of user identifiers included in correctly received transport blocks in the transport block set.
  • a correctly received transport block refers to a transport block whose response status is correct response ACK.
  • a user ID belongs to the correct transmission block ID set to indicate that the response status of the transport block corresponding to the user ID is correct response ACK.
  • a user ID does not Belonging to the correct 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. Therefore, the correct transport block identifier set is a subset of the ordered set of transport block identifiers.
  • the correct transmission block identification set refers to the set of index values of user identifications included in correctly received transmission blocks in the transmission block set.
  • the correctly received transmission block means that the response status is correct response ACK transmission block
  • the index value of a user identification belongs to the correct transmission block identification set, used to indicate that the response status of the transmission block corresponding to the index value of the user identification is correct response ACK
  • the index value of a user identification does not belong to the correct transmission block identification
  • the set is used to indicate that the response status of the transport block corresponding to the index value of the user identifier is an error response NACK. Therefore, the correct transport block identifier set is a subset of the ordered set of transport block identifiers.
  • the correct transmission block identification set refers to the set of tag indexes of random access tags corresponding to correctly received transmission blocks in the transmission block set.
  • the correctly received transmission block refers to the transmission 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 including the random access label is correct.
  • Response ACK the tag index of a random access tag does not belong to the correct transmission block identification set is used to indicate that the response status of the transmission block corresponding to the random access tag is an error response NACK. Therefore, the correct transmission block identification set is a transmission block identification set. A subset of an ordered set.
  • the set of correct transmission block sequences is a subset of the ordered set of transmission block sequences.
  • the k-th complex sequence t(k) in the ordered set of transmission block sequences corresponds to the k-th element I(k) of the ordered set of transmission block identities, where , the length of the k-th complex sequence t(k) in the ordered set of transport block sequences is Nt(k), Nt(k) is a non-negative integer, and Nt(k) is less than or equal to Nf.
  • Figure 31 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 a 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 feedback information generation module 202 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 203 is configured to send feedback information to the second node sequence.
  • Figure 32 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 33 is a schematic structural diagram of a base station provided by an embodiment of the present application.
  • the base station 400 includes a storage 401, processor 402, receiver 403 and 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 33 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 34 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 34 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 volatile and nonvolatile media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. removable, removable and non-removable media.
  • Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disk (DVD) or other optical disk storage, magnetic cassettes, tapes, disk storage or other magnetic storage devices, or may Any other medium used to store the desired information and that can be accessed by a computer.
  • communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media .
  • a component may be, but is not limited to, a process, processor, object, executable file, thread of execution, program or computer running on a processor.
  • applications running on the computing device and the computing device may be components.
  • One or more components can reside in a process or thread of execution, and the component can be localized on one computer or distributed between 2 or more computers. Additionally, these components can execute from various computer-readable media having various data structures stored thereon.
  • a component may, for example, be based on a signal having one or more data packets (eg, data from two components interacting with another component, such as a local system, a distributed system, or a network, such as the Internet, which interacts with other systems via signals) Communicate through local or remote processes.
  • data packets eg, data from two components interacting with another component, such as a local system, a distributed system, or a network, such as the Internet, which interacts with other systems via signals

Landscapes

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

Abstract

本申请实施例提供了一种信息传输方法，包括：接收至少一个第二节点发送的传输块，所述传输块形成传输块集合；根据所述传输块集合，获取反馈信息；其中，所述反馈信息用于表征所述至少一个第二节点发送的传输块的接收情况；发送所述反馈信息给所述至少一个第二节点。

Description

信息传输方法、装置、基站、设备、存储介质及程序产品
相关申请的交叉引用
本申请基于申请号为202210672756.5、申请日为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是本申请一实施例提供的由正确传输块标识集合BI和传输块序列有序集合通过叠加确定反馈信息f的示意图；
图12是本申请一实施例提供的由正确传输块标识集合BI通过叠加确定反馈信息f的示意图；
图13是本申请另一实施例提供的由正确传输块标识集合BI通过叠加确定反馈信息f的示意图；
图14是本申请又一实施例提供的由正确传输块标识集合BI通过叠加确定反馈信息f的示意图；
图15是本申请实施例提供的由正确传输块标识集合BI和传输块序列有序集合通过拼接确定反馈信息f的示意图；
图16是本申请一实施例提供的第二节点、传输块、用户标识、随机接入标签和标签索引关系的示意图；
图17是本申请一实施例提供的由正确传输块标识集合BI和传输块序列有序集合通过拼接确定反馈信息f的示意图；
图18是本申请另一实施例提供的第二节点、传输块、用户标识、随机接入标签和标签索引关系的示意图；
图19是本申请另一实施例提供的由正确传输块标识集合BI和正确传输块数目P通过拼接确定反馈信息f的示意图；
图20是本申请一实施例提供的第二节点、传输块、随机接入标签和标签索引关系的示意图；
图21是本申请又一实施例提供的由正确传输块标识集合BI和正确传输块数目P通过拼接确定反馈信息f的示意图；
图22是本申请实施例提供的由正确传输块标识集合BI、正确传输块数目P和最大正确传输块Pmax通过拼接确定反馈信息f的示意图；
图23是本申请实施例提供的由正确传输块标识集合BI中的元素BI(p)以及传输块标识有序集合大小Na确定复数序列s(p)的示意图；
图24是本申请实施例提供的由正确传输块数目P、最大正确传输块Pmax、反馈信息f的长度Nf和复数序列s(p)确定反馈信息f的示意图；
图25是本申请实施例提供的由正确传输块标识集合BI中的元素BI(p)、最大正确传输块Pmax、反馈信息f的长度Nf确定复数序列s(p)和放置向量z(p)的示意图；
图26是本申请实施例提供的基站根据复数序列s(1)、s(2)和放置向量z(1)、z(2)进行叠加确定反馈信息f的的示意图；
图27是本申请一实施例提供的第二节点、传输块、随机接入标签和标签索引关系的示意图；
图28是本申请一实施例提供的第二节点、传输块、用户标识、用户标识的索引值关系的示意图；
图29是本申请一实施例提供的由正确传输块标识集合BI和传输块序列有序集合通过叠加确定反馈信息f的示意图；
图30为本申请一实施例提供的信息传输方法的流程图；
图31是本申请一实施例提供的一种信息传输装置结构示意图；
图32是本申请一实施例提供的一种信息传输装置结构示意图；
图33是本申请一实施例提供的基站的结构示意图；
图34是本申请一实施例提供的用户设备的结构示意图。
具体实施方式
为了使本申请的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本申请进行进一步详细说明。应当理解，此处所描述的具体实施例仅用以解释本申请，并不用于限定本申请。
需要说明的是，虽然在装置示意图中进行了功能模块划分，在流程图中示出了逻辑顺序，但是在某些情况下，可以以不同于装置中的模块划分，或流程图中的顺序执行所示出或描述的步骤。说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
本申请实施例的描述中，除非另有明确的限定，设置、安装、连接等词语应做广义理解，所属技术领域技术人员可以结合技术方案的具体内容合理确定上述词语在本申请实施例中的具体含义。本申请实施例中，“进一步地”、“示例性地”或者“可选地”等词用于表示作为例子、例证或说明，不应被解释为比其它实施例或设计方案更优选或更具有优势。使用“进一步地”、“示例性地”或者“可选地”等词旨在以具体方式呈现相关概念。
图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 Format 2～4用于传输信道状态信息(Channel State Information,CSI)报告或多比特的HARQ-ACK信息。
表1不同PUCCH格式占用的资源数量、传输比特数和用途的示例
表1示出了不同PUCCH格式下的负载比特数(payload size)、占用资源数和用途，其中OFDM表示正交频分复用(Orthogonal Frequency-Division Multiplexing)，RB表示资源块(Resource Block)，RE表示资源元素(Resource Element)。
PUCCH格式0和格式1的负载比特数不大于2，使用相移键控(Phase-Shift Keying)对负载进行调制后与序列相乘和扩频得到发送信号。PUCCH格式2～格式4则使用极化码信道编码和相移键控的方式得到发送信号。
从表1中可以看出，平均每传输1比特应答信号最少需要6个RE。对于未来大规模免调 度系统，即使基站只服务1000个UE，也至少需要6000个RE进行应答信号反馈(约36个RB，每个RB有12*14＝168个RE)。这将占用大量频谱资源。但实际上，同一时刻有数据传输的UE数量远远小于1000个(往往只有几十个)，应答信号反馈效率较低。
基于此，本申请实施例提供了一种信息传输方法、装置、基站、设备、存储介质及程序产品，通过对正确接收的多个UE的应答信号进行叠加或拼接后发送出去；每个UE对接收到的应答信号进行解码，提取对应的应答信号，进而实现节约频谱资源，提高数据传输效率的目的。
图2为本申请一实施例提供的信息传输方法的流程图。如图2所示，本申请实施例提供的信息传输方法可用于基站、中继、终端等任何具备数据接收和信令发送功能的网元，包括但不限于步骤S1000、步骤S2000以及步骤S3000。
步骤S1000：接收至少一个第二节点(Second Node)发送的传输块，传输块形成传输块集合。
在一些实施例中，第一节点(First Node)接收一个第二节点发送的包含传输块的信号。
在一些实施例中，当多个第二节点向第一节点发送包含传输块的信号时，这些第二节点形成了第二节点序列(A Sequence of Second Nodes)，多个第二节点发送的传输块形成了传输块集合。其中，第二节点序列包括Nu个第二节点，传输块集合包括Nb个传输块；其中，Nu和Nb是正整数，Nu小于或等于Nb。
需要说明的是，一个第二节点可以向第一节点发送一个或多个传输块，一个或多个传输块形成传输块集合。
在一些实施例中，传输块集合中的一个传输块包括传输块标识(Transport Block Identifier)，传输块标识有序集合包括Na个传输块标识I(1),I(2),..,I(Na)，Na为传输块标识有序集合大小；对于k＝1,2,....,Na，传输块标识有序集合的第k个元素为I(k)；其中，传输块标识有序集合的第k个元素I(k)可以是整数k或整数k-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为随机接入标签有序集合大小，也是传输块标识有序集合大小，k＝1,2,....,Na，随机接入标签有序集合中的第k个随机接入标签r(k)的标签索引为传输块标识有序集合的第k个元素I(k)。
需要说明的是，随机接入标签可以是导频(Pilot)、参考信号(Reference Signal)、前导码(Preamble)、扩频序列(Spread Spectrum Sequence)、交织器(Interleaver)、交织图样(Interleaver Pattern)、交织序列(Interleaver Sequence)、加扰序列(Scrambling Sequence)、稀疏码序列(Sparse Code Sequence)等。
在一些实施例中，第二节点根据其用户标识确定一个传输块的随机接入标签作为传输块集合中的一个传输块包括的随机接入标签，这些随机接入标签可用于第一节点在包含传输块集合的信号中区分传输块集合中的不同传输块。
在一些实施例中，第二节点根据高层参数(higher layer parameters)确定一个传输块包括的随机接入标签作为传输块集合中的一个传输块包括的随机接入标签，这些随机接入标签可用于第一节点在包含传输块集合的信号中区分传输块集合中的不同传输块。
需要说明的是，第一节点和第二节点可以是基站、中继、终端等任何具备数据接收和信令发送功能的网元。
步骤S2000：根据传输块集合，获取反馈信息；其中，反馈信息用于表征至少一个第二节点发送的传输块的接收情况。
在一些实施例中，根据传输块集合中正确传输块的信息，得到反馈信息。正确传输块的信息包括最大正确传输块数目Pmax、传输块标识有序集合、传输块序列有序集合、预定义的复数序列集合、传输块标识有序集合大小Na、正确传输块标识集合、正确传输块序列集合、正确传输块数目P、反馈信息f的长度Nf。需要说明的是，根据上述一种或多种正确传输块的信息即可得到反馈信息，即，反馈信息的生成不是一定需要上述全部信息。
在一些实施例中，传输块序列有序集合为预定义的复数序列集合。
在一些实施例中，第一节点根据至少一个第二节点发送的包含传输块集合的信号确定反馈信息f。反馈信息可以根据下述参数中的一个或多个确定，这些参数包括：最大正确传输块数目Pmax、传输块标识有序集合、传输块序列有序集合、传输块标识有序集合大小Na、正确传输块标识集合、正确传输块序列集合、正确传输块数目P、反馈信息f的长度Nf。需要说明的是，根据上述一种或多种正确传输块的信息即可得到反馈信息，即，反馈信息的生成不是一定需要上述全部信息。
需要说明的是，传输块标识有序集合大小Na为传输块标识有序集合的元素数目，正确传输块数目P为正确传输块标识集合的元素数目，传输块序列有序集合包括Na个复数序列t(1),t(2),...,t(Na)，正确传输块标识集合包括P个传输块标识BI(1),BI(2),...,BI(P)，正确传输块序列集合包括P个复数序列s(1),s(2),...,s(P)；其中，Na、Pmax是正整数，P是非负整数，P小于或等于Pmax；对于k＝1,2,...,P，复数序列s(k)的长度为Ns(k)，其中，Ns(k)是非负整数，Ns(k)小于或等于Nf。
需要说明的是，最大正确传输块数目Pmax小于或等于传输块标识有序集合大小Na。在一些实施例中，最大正确传输块数目Pmax由第一节点配置；在另一些实施例中，最大正确传输块数目Pmax由高层参数(high layer parameters)预先配置。
需要说明的是，在一些实施例中，正确传输块标识集合是指传输块集合中正确接收的传输块所包括的用户标识的集合。其中，正确接收的传输块是指应答状态为正确应答ACK的传输块，一个用户标识属于正确传输块标识集合用于指示对应该用户标识的传输块的应答状态为正确应答ACK，一个用户标识不属于正确传输块标识集合用于指示对应该用户标识的传输块的应答状态为错误应答NACK，因此，正确传输块标识集合是传输块标识有序集合的子集。
需要说明的是，在一些实施例中，正确传输块标识集合是指传输块集合中正确接收的传输块所包括的用户标识的索引值的集合。其中，正确接收的传输块是指应答状态为正确应答ACK的传输块，一个用户标识的索引值属于正确传输块标识集合用于指示对应该用户标识的索引值的传输块的应答状态为正确应答ACK，一个用户标识的索引值不属于正确传输块标识 集合用于指示对应该用户标识的索引值的传输块的应答状态为错误应答NACK，因此，正确传输块标识集合是传输块标识有序集合的子集。
需要说明的是，在一些实施例中，正确传输块标识集合是指传输块集合中正确接收的传输块所包括的随机接入标签的标签索引的集合。其中，正确接收的传输块是指应答状态为正确应答ACK的传输块，一个随机接入标签的标签索引属于正确传输块标识集合用于指示对应该随机接入标签的传输块的应答状态为正确应答ACK，一个随机接入标签的标签索引不属于正确传输块标识集合用于指示对应该随机接入标签的传输块的应答状态为错误应答NACK，因此，正确传输块标识集合是传输块标识有序集合的子集。
需要说明的是，正确传输块序列集合是传输块序列有序集合的子集。对于k＝1,2,...,Na，传输块序列有序集合的中的第k个复数序列t(k)与传输块标识有序集合的第k个元素I(k)对应，其中，传输块序列有序集合的中的第k个复数序列t(k)的长度为Nt(k)，Nt(k)为非负整数，Nt(k)小于或等于Nf。
下面对第一节点根据以下参数中任意一个或其任意组合确定反馈信息f的过程进行说明。
在一些实施例中，第一节点至少根据以下参数中任意一个或其任意组合把正确传输块标识集合中的P个传输块标识BI(1),BI(2),...,BI(P)确定反馈信息f，这些参数包括：最大正确传输块数目Pmax、传输块标识有序集合、传输块序列有序集合、传输块标识有序集合大小Na、正确传输块标识集合、正确传输块序列集合、正确传输块数目P；反馈信息f包括正确传输块标识集合中的P个传输块标识BI(1),BI(2),...,BI(P)。
在一些实施例中，第一节点至少根据以下参数中任意一个或其任意组合把正确传输块序列集合中的P个目标复数序列s(1),s(2),...,s(P)确定为反馈信息f，这些参数包括：最大正确传输块数目Pmax、传输块标识有序集合、传输块序列有序集合、传输块标识有序集合大小Na、正确传输块标识集合、正确传输块序列集合、正确传输块数目P；反馈信息f包括正确传输块序列集合中的P个目标复数序列s(1),s(2),...,s(P)，其中，对于k＝1,2,...,P，正确传输块序列集合中的目标复数序列s(k)由第一节点根据正确传输块标识集合中的传输块标识BI(k)确定。
需要说明的是，传输块序列有序集合的复数序列可以是非正交多址(Non-Orthogonal Multiple-Access)中使用的各种直接序列扩频序列(Direct Spread Spectrum Sequence)。
步骤S3000：发送反馈信息给至少一个第二节点。
在一些实施例中，第一节点发送反馈信息给一个或多个第二节点，这些反馈信息能够表征至少一个第二节点发送的传输块在第一节点的接收情况。
上述实施例提供的信息传输方法能够使得信道编码的输入比特数达到最小化，进而实现节约频谱资源，提高数据传输效率的目的。
在一些实施例中，第一节点没有正确接收的传输块，正确传输块标识集合为空集时，即P＝0时，第一节点确定反馈信息f的长度Nf＝0，即反馈信息f为空序列。第一节点确定包含为空序列的反馈信息f的信号为空信号，即第一节点确定包含反馈信息f的信号为零功率信号。
上述实施例提供的信息传输方法中由于第一节点发送零功率信号，使得能量开销降低，而第二节点序列中的一个第二节点对包含反馈信息f的信号(即零功率信号)接收不会成功， 因此第二节点序列中的一个第二节点可以判断反馈信息为错误应答NACK。
图3为本申请一实施例提供的信息传输方法的流程图，具体包括步骤S2110以及步骤S2120，具体描述了根据正确传输块标识得到反馈信息的过程。
步骤S2110：根据正确传输块的传输块标识，在预定义的复数序列集合中确定目标复数序列。
步骤S2120：根据目标复数序列，得到反馈信息。
在一些实施例中，第一节点至少根据以下参数中任意一个或其任意组合把正确传输块标识集合中的P个传输块标识BI(1),BI(2),...,BI(P)确定反馈信息f，这些参数包括：最大正确传输块数目Pmax、传输块标识有序集合、传输块序列有序集合、传输块标识有序集合大小Na、正确传输块标识集合、正确传输块序列集合、正确传输块数目P；反馈信息f包括正确传输块标识集合中的P个传输块标识BI(1),BI(2),...,BI(P)。更为具体地，对于k＝1,2,...,P，第一节点根据正确传输块标识集合中的传输块标识BI(k)确定目标复数序列t(m(k))，第一节点根据目标复数序列t(m(1)),t(m(2)),...,t(m(P))确定反馈信息f，其中，m(k)是传输块标识BI(k)在传输块标识有序集合中的序号，即m(k)是使得I(m(k))等于BI(k)的整数。
在一些实施例中，第一节点至少根据以下参数中任意一个或其任意组合把正确传输块标识集合中的P个传输块标识BI(1),BI(2),...,BI(P)确定反馈信息f，这些参数包括：最大正确传输块数目Pmax、传输块标识有序集合、传输块序列有序集合、传输块标识有序集合大小Na、正确传输块标识集合、正确传输块序列集合、正确传输块数目P；反馈信息f包括正确传输块标识集合中的P个传输块标识BI(1),BI(2),...,BI(P)。更为具体地，对于k＝1,2,...,P，第一节点根据正确传输块标识集合中的传输块标识BI(k)确定目标复数序列t(BI(k))，第一节点根据目标复数序列t(BI(1)),t(BI(2)),...,t(BI(P))确定反馈信息f，其中，BI(k)是传输块标识有序集合I的一个元素。
在一些实施例中，第一节点至少根据以下参数中任意一个或其任意组合把正确传输块序列集合中的P个目标复数序列s(1),s(2),...,s(P)确定为反馈信息f，这些参数包括：最大正确传输块数目Pmax、传输块标识有序集合、传输块序列有序集合、传输块标识有序集合大小Na、正确传输块标识集合、正确传输块序列集合、正确传输块数目P；反馈信息f包括正确传输块序列集合中的P个目标复数序列s(1),s(2),...,s(P)，其中，对于k＝1,2,...,P，正确传输块序列集合中的目标复数序列s(k)由第一节点根据正确传输块标识集合中的传输块标识BI(k)确定。更为具体地，第一节点根据正确传输块标识集合中的传输块标识BI(k)确定长度为Ns(k)的目标复数序列s(k)为传输块序列有序集合中的目标复数序列t(m(k))，其中，Ns(k)＝Nt(m(k))，m(k)是传输块标识BI(k)在传输块标识有序集合中的序号，即m(k)是使得I(m(k))等于BI(k)的整数。
在一些实施例中，第一节点至少根据以下参数中任意一个或其任意组合把正确传输块序列集合中的P个目标复数序列s(1),s(2),...,s(P)确定为反馈信息f，这些参数包括：最大正确传输块数目Pmax、传输块标识有序集合、传输块序列有序集合、传输块标识有序集合大小Na、正确传输块标识集合、正确传输块序列集合、正确传输块数目P；反馈信息f包括正确传输块序列集合中的P个目标复数序列s(1),s(2),...,s(P)，其中，对于k＝1,2,...,P，正确传输块序 列集合中的目标复数序列s(k)由第一节点根据正确传输块标识集合中的传输块标识BI(k)确定。更为具体地，第一节点根据正确传输块标识集合中的传输块标识BI(k)确定长度为Ns(k)的目标复数序列s(k)为传输块序列有序集合中的目标复数序列t(BI(k))，其中，Ns(k)＝Nt(BI(k))，BI(k)是传输块标识有序集合I的一个元素。
图4为本申请一实施例提供的信息传输方法的流程图，具体包括步骤S2210、步骤S2220以及步骤S2230，具体描述了根据正确传输块标识得到反馈信息的过程。
步骤S2210：将正确传输块的传输块标识作为伪随机数发生器的部分或全部随机数种子，生成伪随机复数序列。
步骤S2220：将伪随机复数序列确定为目标复数序列。
步骤S2230：根据目标复数序列，得到反馈信息。
在一些实施例中，第一节点以正确传输块标识集合中的传输块标识BI(k)为伪随机数发生器(pseudo-random number generator)的随机数种子产生长度为Ns(k)的伪随机复数序列s(k)。在一些实施例中，伪随机数发生器可以产生高斯分布(Gaussian Distribution)的随机数，则伪随机复数序列s(k)是基于高斯分布(Gaussian Distribution)产生的序列。
需要说明的是，正确传输块的传输块标识可以作为伪随机数发生器的部分随机数种子，也可以作为伪随机数发生器的全部随机数种子。伪随机数发生器也可以产生高斯分布外的其他分布形式的随机数，本申请在此不做限定。
图5为本申请一实施例提供的信息传输方法的流程图，具体包括步骤S2310、步骤S2320以及步骤S2330，具体描述了根据正确传输块标识得到反馈信息的过程。
步骤S2310：将正确传输块的传输块标识作为伪随机序列发生器的部分或全部随机数种子，生成伪随机比特序列。
步骤S2320：将伪随机比特序列进行调制，得到目标复数序列。
步骤S2330：根据目标复数序列，得到反馈信息。
在一些实施例中，第一节点以正确传输块标识集合中的传输块标识BI(k)作为伪随机序列发生器(pseudo-random sequence generator)的随机数种子产生长度为Np(k)的伪随机比特序列，第一节点对长度为Np(k)的伪随机比特序列进行调制得到长度为Ns(k)的目标复数序列s(k)，其中，Np(k)大于或等于Ns(k)。
需要说明的是，正确传输块的传输块标识可以作为伪随机序列发生器的部分随机数种子，也可以作为伪随机序列发生器的全部随机数种子。
图6为本申请一实施例提供的信息传输方法的流程图，具体包括步骤S2410、步骤S2420、步骤S2430以及步骤S2440，具体描述了根据正确传输块标识得到反馈信息的过程。
步骤S2410：将正确传输块的传输块标识进行二进制表示，得到二进制表示的传输块标识。
步骤S2420：将二进制表示的传输块标识中的至少一个比特进行信道编码，得到第一编码序列。
步骤S2430：对第一编码序列进行调制，得到目标复数序列。
步骤S2440：根据目标复数序列，得到反馈信息。
在一些实施例中，第一节点对正确传输块标识集合中的传输块标识BI(k)的二进制表示的个比特进行信道编码得到长度为Nc(k)的编码序列，第一节点对长度为Nc(k)的编码序列进行调制得到长度为Ns(k)的目标复数序列s(k)，其中，Nc(k)大于或等于Ns(k)，为大于或等于log2(Na)的最小整数。
在一些实施例中，第一节点对正确传输块标识集合中的传输块标识BI(k)的二进制表示的个比特进行信道编码得到长度为Nc(k)的编码序列，第一节点对长度为Nc(k)的编码序列进行调制得到长度为Ns(k)的目标复数序列s(k)，其中，Nc(k)大于或等于Ns(k)，为大于或等于log2(Imax)的最小整数，Imax是传输快标识有序集合I中元素的最大值。一个具体例子是：对于传输快标识有序集合I＝<0,11,20,30>,则Imax＝30。
图7为本申请一实施例提供的信息传输方法的流程图，具体包括步骤S2510、步骤S2520、以及步骤S2530，具体描述了根据正确传输块标识得到反馈信息的过程。
步骤S2510：将正确传输块的传输块标识进行二进制表示，得到二进制表示的传输块标识。
步骤S2520：将二进制表示的传输块标识中的至少一个比特进行信道编码，得到目标复数序列。
步骤S2530：根据目标复数序列，得到反馈信息。
在一些实施例中，第一节点对正确传输块标识集合中的传输块标识BI(k)的二进制表示的个比特进行信道编码得到长度为Ns(k)的目标复数序列s(k)，其中，为大于或等于log2(Na)的最小整数。
在一些实施例中，第一节点对正确传输块标识集合中的传输块标识BI(k)的二进制表示的个比特进行信道编码得到长度为Ns(k)的目标复数序列s(k)，其中，为大于或等于log2(Imax)的最小整数，Imax是传输快标识有序集合I中元素的最大值。一个具体例子是：对于传输快标识有序集合I＝<0,11,20,30>,则Imax＝30。
为了描述k与s(k)之间的长度关系，采用以下实施例进行说明。
在一些实施例中，对于任意两个小于或等于Na且不相等的正整数k和k’都有Ns(k)等于Ns(k’)，其中，Ns(k)是正确传输块序列集合中的复数序列s(k)的长度，Ns(k’)是正确传输块序列集合中的复数序列s(k’)的长度。
在一些实施例中，存在两个小于或等于P且不相等的正整数k和k’使得Ns(k)不等于Ns(k’)，其中，Ns(k)是正确传输块序列集合中的复数序列s(k)的长度，Ns(k’)是正确传输块序列集合中的复数序列s(k’)的长度。
在一些实施例中，对于任意两个小于或等于Na且不相等的正整数k和k’都有Nt(k)等于Nt(k’)，其中，Nt(k)是传输块序列有序集合中的复数序列t(k)的长度，Nt(k’)是传输块序列有序集合中的复数序列t(k’)的长度。
在一些实施例中，存在两个小于或等于Na且不相等的正整数k和k’使得Nt(k)不等于Nt(k’)，其中，Nt(k)是传输块序列有序集合中的复数序列t(k')的长度，Nt(k’)是传输块序列有序集合中的复数序列t(k’)的长度。
为了描述s(k)与Nf之间的长度关系，采用以下实施例进行说明。
在一些实施例中，对于k＝1,2,...,P，正确传输块序列集合中的复数序列s(k)的长度等于Nf。
在一些实施例中，对于k＝1,2,...,P，正确传输块序列集合中的复数序列s(k)的长度小于Nf。
为了描述s(k)与P之间的长度关系，采用以下实施例进行说明。
在一些实施例中，对于k＝1,2,...,P，正确传输块序列集合中的复数序列s(k)的长度等于或其中，R为小于或等于P的正整数。
在一些实施例中，对于k＝1,2,...,P，正确传输块序列集合中的复数序列s(k)的长度等于或其中，R为小于或等于P的正整数，表示小于或等于的最大整数，表示大于或等于的最小整数。
在一些实施例中，对于k＝1,2,...,P，正确传输块序列集合中的复数序列s(k)的长度等于其中，R为小于或等于P的正整数，为对进行四舍五入的整数。
在一些实施例中，对于k＝1,2,...,P，正确传输块序列集合中的复数序列s(k)的长度等于其中，R为小于或等于P的正整数，表示小于或等于的最大整数。
在一些实施例中，反馈信息f包括长度为的全零子序列，其中，表示小于或等于的最大整数。
为了描述s(k)与Pmax之间的长度关系，采用以下实施例进行说明。
在一些实施例中，对于k＝1,2,...,P，正确传输块序列集合中的复数序列s(k)的长度等于其中，R为小于或等于Pmax的正整数。
在一些实施例中，对于k＝1,2,...,P，正确传输块序列集合中的复数序列s(k)的长度等于或其中，R为小于或等于Pmax的正整数，表示小于或等于的最大整数，表示大于或等于的最小整数。
在一些实施例中，对于k＝1,2,...,P，正确传输块序列集合中的复数序列s(k)的长度等于其中，R为小于或等于Pmax的正整数，为对进行四舍五入的整数。
在一些实施例中，对于k＝1,2,...,P，正确传输块序列集合中的复数序列s(k)的长度等于其中，R为小于或等于Pmax的正整数，表示小于或等于的最大整数。
为了描述反馈信息f的长度与Pmax、Ns(k)、Nt(k)的长度关系，采用以下实施例进行说明。
在一些实施例中，反馈信息f包括长度小于或等于的全零子序列，其中，max(x,y)表示x和y中较大的值，对于k＝1,2,...,P，Ns(k)为正确传输块序列集合中的复数序列s(k)的长度。
在一些实施例中，反馈信息f包括长度小于或等于的全零子序列，其中，max(x,y)表示x和y中较大的值，对于k＝1,2,...,P，Nt(k)为传输块序列集合中的复数序列t(k)的长度，m(k)是使得BI(k)＝I(m(k))的整数；其中，BI(k)是正确传输标识集合的第k个元素，I(m(k))是传输块标识有序集合的第m(k)个元素。
在一些实施例中，反馈信息f包括长度小于或等于的全零子序列，其中，max(x,y)表示x和y中较大的值，对于k＝1,2,...,P，Nt(k)为传输块序列集合中的复数序列t(k)的长度；其中，BI(k)是正确传输标识集合的第k个元素，BI(k)也是传输标识有序集合中的元素。
在一些实施例中，反馈信息f的长度Nf大于或等于其中，对于k＝1,2,...,P，Ns(k)为正确传输块序列集合中的复数序列s(k)的长度。
在一些实施例中，反馈信息f的长度Nf大于或等于其中，对于k＝1,2,...,P，Nt(k)为传输块序列集合中的复数序列t(k)的长度，m(k)是使得BI(k)＝I(m(k))的整数；其中，BI(k)是正确传输标识集合的第k个元素，I(m(k))是传输块标识有序集合的第m(k)个元素。
在一些实施例中，反馈信息f的长度Nf大于或等于其中，对于k＝1,2,...,P，Nt(k)为传输块序列集合中的复数序列t(k)的长度；其中，BI(k)是正确传输标识集合的第k个元素，BI(k)也是传输标识有序集合中的元素。
需要说明的是，图6、图7对应的实施例中的信道编码可以是极化编码(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)。
还需要说明的是，图5、图6对应的实施例中的调制可以为π/2-二进制相移键控调制(π/2 binary phase shift keying，π/2-BPSK)、二进制相移键控调制(binary phase shift keying，BPSK)、正交相移键控调制(quadrature phase shift keying，QPSK)、正交幅度调制(quadrature amplitude modulation，QAM)、相移键控调制(phase shift keying，PSK)、幅移键控(amplitude shift keying，ASK)、幅相混合键控调制(amplitude phase shift keying，APSK)。
需要说明的是，步骤S2120、步骤S2230、步骤S2330、步骤S2440、步骤S2530中根据目标复数序列，得到反馈信息，具体过程在图8、图9提供的实施例中具体描述。
图8是本申请一实施例提供的信息传输方法的流程图，其中反馈信息由正确传输块序列集合中的目标复数序列叠加(superposition)得到，具体包括步骤S2610、步骤S2620、以及步骤S2630，具体描述了根据目标复数序列，得到反馈信息的过程。
步骤S2610：根据每个目标复数序列，得到目标复数序列集合。
步骤S2620：从目标复数序列集合中选取至少一个目标复数序列。
步骤S2630：分别从被选取的目标复数序列中选取一个元素进行线性叠加，得到一个反馈信息元素；其中，反馈信息包括反馈信息元素。
在一些实施例中，反馈信息f由正确传输块序列集合中的P个目标复数序列s(1),s(2),...,s(P)进行叠加得到，即，存在2×D+1个正整数n’,d(1),n(1),d(2),n(2),...,d(D),n(D)，反馈信息f的第n’个元素f(n’)由D个目标复数序列s(d(1)),s(d(2)),...,s(d(D))中的2D个复数s(d(1),n(1)),s(d(2),n(2)),...,s(d(D),n(D))确定，其中，D小于或等于P且大于或等于2，n’小于或等于Nf，其中，Nf为反馈信息f的长度，对于k＝1,2,...,D，d(k)小于或等于P，n(k)小于或等于Ns(k)，Ns(k)为目标复数序列s(k)的长度，复数s(d(k),n(k))是目标复数序列s(d(k))的第n(k)个元素。
在一些实施例中，反馈信息f由正确传输块序列集合中的P个目标复数序列s(1),s(2),...,s(P)进行叠加得到，其中，其中，α(1),α(2),...,α(D)是任意的复数。
在一些实施例中，反馈信息f由正确传输块序列集合中的P个目标复数序列t(m(1)),t(m(2)),...,t(m(P))进行叠加得到，即，存在2×D+1个正整数n’,d(1),n(1),d(2),n(2),...,d(D),n(D)，反馈信息f的第n’个元素f(n’)由D个目标复数序列t(m(d(1))),t(m(d(2))),...,t(m(d(D)))中的D个复数t(m(d(1)),n(1)),t(m(d(2)),n(2)),...,t(m(d(D)),n(D))确定，其中，D小于或等于P且大于或等于2，n’小于或等于Nf，其中，Nf为反馈信息f的长度，对于k＝1,2,...,D，d(k)小于或等于P，n(k)小于或等于Nt(m(d(k)))，Nt(m(d(k)))为目标复数序列t(m(d(k)))的长度，m(d(k))为使得BI(d(k))＝I(m(d(k)))的整数，复数t(m(d(k)),n(k))是目标复数序列t(m(d(k)))的第n(k)个元素。
在一些实施例中，反馈信息f由正确传输块序列集合中的P个目标复数序列t(m(1)),t(m(2)),...,t(m(P))进行叠加得到，其中，其中，α(1),α(2),...,α(D)是任意的复数。
在一些实施例中，反馈信息f由正确传输块序列集合中的P个目标复数序列t(BI(1)),t(BI(2)),...,t(BI(P))进行叠加得到，即，存在2×D+1个正整数n’,d(1),n(1),d(2),n(2),...,d(D), n(D)，反馈信息f的第n’个元素f(n’)由D个目标复数序列t(BI(d(1))),t(BI(d(2))),...,t(BI(d(D)))中的D个复数t(BI(d(1)),n(1)),t(BI(d(2)),n(2)),...,t(BI(d(D)),n(D))确定，其中，D小于或等于P且大于或等于2，n’小于或等于Nf，其中，Nf为反馈信息f的长度，对于k＝1,2,...,D，d(k)小于或等于P，n(k)小于或等于Nt(BI(d(k)))，Nt(BI(d(k)))为目标复数序列t(BI(d(k)))的长度，BI(d(k))为正确传输块标识集合BI的第d(k)个元素，BI(d(k))也是传输块标识有序集合I的元素，复数t(BI(d(k)),n(k))是目标复数序列t(BI(d(k)))的第n(k)个元素。
在一些实施例中，反馈信息f由正确传输块序列集合中的P个目标复数序列t(BI(1)),t(BI(2)),...,t(BI(P))进行叠加得到，其中，其中，α(1),α(2),...,α(D)是任意的复数。
图9是本申请一实施例提供的信息传输方法的流程图，其中反馈信息由正确传输块序列集合中的目标复数序列拼接(concatenation)得到，具体包括步骤S2710、步骤S2720、以及步骤S2730，具体描述了根据目标复数序列，得到反馈信息的过程。
步骤S2710：根据每个目标复数序列，得到目标复数序列集合。
步骤S2720：根据每个目标复数序列，分别得到目标复数序列中的目标复数。
步骤S2730：将所有目标复数构成目标复数集合；其中，反馈信息中的任一元素都来自于目标复数集合。
在一些实施例中，反馈信息f由正确传输块序列集合中的P个目标复数序列s(1),s(2),...,s(P)进行拼接得到，即，对于i＝1,2,...,Nf，反馈信息f的第i个元素f(i)等于第一常数C或者存在唯一的整数对(integer pair)<k(i),n(i)>使得反馈信息f的第i个元素f(i)仅由复数s(k(i),n(i))确定，其中，k(i)小于或等于P，n(i)小于或等于Ns(k(i))，第一常数C可以为任意复数，复数s(k(i),n(i))是目标复数序列s(k(i))的第n(i)个元素。
在一些实施例中，反馈信息f由正确传输块序列集合中的P个目标复数序列t(m(1)),t(m(2)),...,t(m(P))进行拼接得到，即，对于i＝1,2,...,Nf，反馈信息f的第i个元素f(i)等于第一常数C或者存在唯一的整数对(integer pair)<k(i),n(i)>使得反馈信息f的第i个元素f(i)由复数t(m(k(i)),n(i))确定，其中，k(i)小于或等于P，n(i)小于或等于Nt(m(k(i)))，常数C可以为任意复数，复数t(m(k(i)),n(i))是目标复数序列t(m(k(i)))的第n(i)个元素，m(k(i))为使得BI(k(i))＝I(m(k(i)))的整数。
在一些实施例中，反馈信息f由正确传输块序列集合中的P个目标复数序列t(BI(1)),t(BI(2)),...,t(BI(P))进行拼接得到，即，对于i＝1,2,...,Nf，反馈信息f的第i个元素f(i)等于第一常数C或者存在唯一的整数对(integer pair)<k(i),n(i)>使得反馈信息f的第i个元素f(i)由复数t(BI(k(i)),n(i))确定，其中，k(i)小于或等于P，n(i)小于或等于Nt(BI(k(i)))，常数C可以为任意复数，复数t(BI(k(i)),n(i))是目标复数序列t(BI(k(i)))的第n(i)个元素，BI(k(i))为正确传输块标识集合BI的第k(i)个元素，BI(k(i))也是传输块标识有序集合I的元素。
为了更加清晰地描述本申请实施例提供的信息传输方法，采用以下示例进行具体说明。
示例1:
在本示例中，第一节点为基站，第二节点为终端，本示例包括多个终端，这些终端形成 了第二节点序列，传输块标识为用户标识。
图10是本申请一实施例提供的第二节点、传输块和用户标识关系的示意图。如图10所示，基站接收终端序列发送的包含传输块集合B的信号，其中，终端序列包括Nu＝4个终端SN(1),SN(2),SN(3),SN(4)，传输块集合B包括Nb＝4个传输块b(1),b(2),b(3),b(4)。进一步地，包含传输块集合B的信号包括包含传输块b(1)的信号、包含传输块b(2)的信号、包含传输块b(3)的信号和包含传输块b(4)的信号。
在本示例中，对于t＝1,2,3,4，传输块集合B中的传输块b(t)由终端序列中的终端SN(t)向基站发送，其中，传输块集合B中的传输块b(t)包括终端SN(t)的用户标识，终端SN(t)的用户标识为随机接入RNTI(Random Access RNTI,RA-RNTI)，终端SN(1),SN(2),SN(3),SN(4)的用户标识分别为4,3,2,5，其中，用户标识4,3,2,5为传输块标识有序集合I＝<I(1),I(2),I(3),I(4),I(5),I(6),I(7),I(8)>＝<1,2,3,4,5,6,7,8>的元素，传输块标识有序集合I包括Na＝8个用户标识1,2,3,4,5,6,7,8。
在本示例中，最大正确传输块数目Pmax＝2由基站配置。正确传输块标识集合是指传输块集合B中正确接收的传输块包括的用户标识的集合。基站根据包含传输块集合B的信号确定：正确传输块标识集合为集合BI＝{2,3}、正确传输块数目P＝2。
在本示例中，反馈信息f由基站根据下述参数确定：正确传输块标识集合BI、正确传输块数目P＝2、传输块标识有序集合I、传输序列有序集合，其中，传输序列有序集合包括Na＝8个复数序列，分别为：
t(1)＝[1,1,1,1,1,1],
t(2)＝[1,1,1,-1,-1,-1],
t(3)＝[1,-1,0,1,-1,0],
t(4)＝[1,-1,0,-1,1,0],
t(5)＝[1,1,-1,1,1,-1],
t(6)＝[1,1,-1,-1,-1,1],
t(7)＝[1,-1,0,0,0,0],
t(8)＝[0,0,1,0,0,1]，
其中，对于k＝1,2,3,4,5,6,7,8，复数序列t(k)的长度为Nt(k)＝Nf＝6，Nf为反馈信息f的长度。
图11是本申请一实施例提供的由正确传输块标识集合BI和传输块序列有序集合通过叠加确定反馈信息f的示意图。如图11所示，基站按照下述方法确定反馈信息f：
根据传输块标识有序集合I、传输块标识有序集合大小Na＝8、传输块序列有序集合和正确传输块标识集合BI，基站由BI(1)＝2和I(2)＝BI(1)确定m(1)＝2，得到复数序列t(m(1))＝t(2)；基站由BI(2)＝3和I(3)＝BI(2)确定m(2)＝3，得到复数序列t(m(2))＝t(3)。
基站把复数序列t(2)和t(3)进行叠加确定反馈信息f为f＝α(1)×t(2)+α(2)×t(3)＝[2,0,1,0,-2,-1]，其中，α(1)＝α(2)＝1。
在本示例中，基站发送包含反馈信息f＝[2,0,1,0,-2,-1]的信号给终端序列<SN(1),SN(2),SN(3),SN(4)>；终端序列<SN(1),SN(2),SN(3),SN(4)>接收包含反馈信息f的信号。
进一步地，终端SN(1),SN(2),SN(3),SN(4)分别按照下述方法确定传输块b(1),b(2),b(3),b(4)的应答：
终端SN(1)由用户标识4确定序列t(4)与包含反馈信息f的信号进行内积。如果内积的绝对值大于序列t(4)的L2范数的一半，则终端SN(1)判断终端SN(1)的用户标识4属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为正确应答ACK；如果内积的绝对值小于序列t(4)的L2范数的一半，则终端SN(1)判断终端SN(1)的用户标识4不属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为错误应答NACK；
终端SN(2)由用户标识3确定序列t(3)与包含反馈信息f的信号进行内积。如果内积的绝对值大于序列t(3)的L2范数的一半，则终端SN(2)判断终端SN(2)的用户标识3属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为正确应答ACK；如果内积的绝对值小于序列t(3)的L2范数的一半，则终端SN(2)判断终端SN(2)的用户标识3不属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为错误应答NACK。
终端SN(3)由用户标识2确定序列t(2)与包含反馈信息f的信号进行内积。如果内积的绝对值大于序列t(2)的L2范数的一半，则终端SN(3)判断终端SN(3)的用户标识2属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为正确应答ACK；如果内积的绝对值小于序列t(2)的L2范数的一半，则终端SN(3)判断终端SN(3)的用户标识2不属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为错误应答NACK。
终端SN(4)由用户标识5确定序列t(5)与包含反馈信息f的信号进行内积。如果内积的绝对值大于序列t(5)的L2范数的一半，则终端SN(5)判断终端SN(5)的用户标识5属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为正确应答ACK；如果内积的绝对值小于序列t(5)的L2范数的一半，则终端SN(4)判断终端SN(4)的用户标识5不属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为错误应答NACK。
在本示例中，如果正确传输块数目P为0，则反馈信息f的长度Nf为0，反馈信息f为空序列，包含反馈信息f的信号为零功率信号。
示例2：
本示例与示例1的区别在于，对于t＝1,2,3,4，终端SN(t)的用户标识为临时小区RNTI(Temporary Cell RNTI，TC-RNTI)，且反馈信息f由基站根据下述参数确定：正确传输块标识集合BI、正确传输块数目P＝2。
图12是本申请另一实施例提供的由正确传输块标识集合BI通过叠加确定反馈信息f的示意图。如图12所示，基站按照下述方法确定反馈信息f：
基站以正确传输块标识集合中的传输块标识BI(1)＝2为伪随机数发生器的随机数种子产生长度为Ns(1)＝Nf＝6的伪随机复数序列s(1)＝[2.1539+3.9218j,0.3702-1.7478j,-0.2643+0.2502j,0.7552-2.5389j,-1.1301+0.0923j,1.3457+1.2762j]；基站以正确传输块标识集合中的传输块标识BI(2)＝3为伪随机数发生器的随机数种子产生长度为Ns(2)＝Nf＝6的伪随机复数序列s(2)＝[0.1403+4.3805j,-0.3004-0.5881j,-0.4079-0.1891j,0.3796+1.0345j,0.0840+0.6838j,-0.6795-1.4721j]。
基站根据伪随机复数序列s(1)和s(2)确定反馈信息f为f＝α(1)×s(1)+α(2)×s(2)＝ [1.4238+5.8706j,0.0494-1.6518j,-0.4754+0.0432j,0.8025-1.0638j,-0.7397+0.5488j,0.4711-0.1385j]，其中，其中，Nf＝6是反馈信息f的长度；对于p＝1,2，伪随机数发生器产生高斯分布的随机数，伪随机数发生器的一种实现方法如下：
其中，是虚数单位，log(·)是自然对数函数，k＝1,2,3,4,5,6，s(p,k)是s(p)的第k个元素，u(1),u(2),u(3),u(4),u(5),u(6),u(7),u(8),u(9),u(10),u(11),u(12)根据下述伪代码得到：
其中，mod是取余函数，floor(x)是小于或等于x的最大整数，S是伪随机数发生器的状态，第1行代码中设置S＝BI(p)就是设置伪随机数发生器的种子。
本示例与示例1的另一个区别在于，在本示例中，基站发送包含反馈信息f＝[1.4238+5.8706j,0.0494-1.6518j,-0.4754+0.0432j,0.8025-1.0638j,-0.7397+0.5488j,0.4711-0.1385j]的信号给终端序列<SN(1),SN(2),SN(3),SN(4)>。
本示例与示例1的又一个区别在于，在本示例中，终端SN(1),SN(2),SN(3),SN(4)分别根据下述方法确定传输块b(1),b(2),b(3),b(4)的应答：
终端SN(1)以用户标识4作为伪随机数发生器的随机数种子产生复数序列v(1)。终端SN(1)把v(1)与包含反馈信息f的信号进行内积，如果内积的绝对值大于复数序列v(1)的L2范数的一半，则终端SN(1)判断终端SN(1)的用户标识4属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为正确应答ACK；如果内积的绝对值小于复数序列v(1)的L2范数的一半，则终端SN(1)判断终端SN(1)的用户标识4不属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为错误应答NACK。
终端SN(2)以用户标识3作为伪随机数发生器的随机数种子产生复数序列v(2)。终端SN(2)把v(2)与包含反馈信息f的信号进行内积，如果内积的绝对值大于复数序列v(2)的L2范数的一半，则终端SN(2)判断终端SN(2)的用户标识3属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为正确应答ACK；如果内积的绝对值小于复数序列v(2)的L2范数的一半，则终端SN(2)判断终端SN(2)的用户标识3不属于正确传输块标识集合BI，终端SN(2)确 定传输块b(2)的应答为错误应答NACK。
终端SN(3)以用户标识2作为伪随机数发生器的随机数种子产生复数序列v(3)。终端SN(3)把v(3)与包含反馈信息f的信号进行内积，如果内积的绝对值大于复数序列v(3)的L2范数的一半，则终端SN(3)判断终端SN(3)的用户标识2属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为正确应答ACK；如果内积的绝对值小于复数序列v(3)的L2范数的一半，则终端SN(3)判断终端SN(3)的用户标识2不属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为错误应答NACK。
终端SN(4)以用户标识5作为伪随机数发生器的随机数种子产生复数序列v(4)。终端SN(4)把v(4)与包含反馈信息f的信号进行内积，如果内积的绝对值大于复数序列v(4)的L2范数的一半，则终端SN(4)判断终端SN(4)的用户标识5属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为正确应答ACK；如果内积的绝对值小于复数序列v(4)的L2范数的一半，则终端SN(4)判断终端SN(4)的用户标识5不属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为错误应答NACK。
本示例提供的信息传输方法相较于示例1能够省去传输块序列有序集合的存储开销。
示例3：
本示例与示例2的区别在于，第一节点为中继，且对于t＝1,2,3,4，终端SN(t)的用户标识为小区RNTI(Cell RNTI，C-RNTI)。
图13是本申请又一实施例提供的由正确传输块标识集合BI通过叠加确定反馈信息f的示意图。如图13所示，基站按照下述方法确定反馈信息f：
基站以正确传输块标识集合中的传输块标识BI(1)＝2为伪随机序列发生器的随机数种子产生长度为Np(1)＝12的伪随机比特序列q(1)＝[1,0,0,0,0,0,1,0,1,1,0,0]；基站以正确传输块标识集合中的传输块标识BI(2)＝3为伪随机序列发生器的随机数种子产生长度为Np(2)＝12的伪随机比特序列q(2)＝[1,0,0,0,0,0,1,0,0,1,0,1]。
基站对伪随机比特序列q(1)＝[1,0,0,0,0,0,1,0,1,1,0,0]进行QPSK调制得到长度为Ns(1)＝Nf＝6的复数序列基站对伪随机比特序列q(2)＝[1,0,0,0,0,0,1,0,0,1,0,1]进行QPSK调制得到为Ns(2)＝Nf＝6的复数序列
基站根据复数序列s(1)和s(2)确定反馈信息f为f＝α(1)×s(1)+α(2)×s(2)＝[-1+j,1+j,1+j,-1+j,-j,1]，其中，
其中，对于p＝1,2，QPSK调制按照下式实现：
其中，是虚数单位，s(p,k)是s(p)的第k个元素，q(p,k)是q(p)的第k个元素。本示例中，对于p＝1,2，伪随机数发生器为长度31的Gold序列(length-31 Gold sequence)，具体地，伪随机比特序列q(p)是Gold sequence输出序列，定义如下：
q(p,n+1)＝(x1(n+Nd)+x2(n+Nd))mod 2
x1(n+31)＝(x1(n+3)+x1(n))mod 2
x2(n+31)＝(x2(n+3)+x2(n+2)+x2(n+1)+x2(n))mod 2
其中，n＝0,1,2,...,2Np(p)-1，mod是取余函数，Nd＝1600且第一个m序列(m-sequence)x1(n)初始化为x1(0)＝1,x1(n)＝0,n＝1,2,...,30，第二个m序列x2(n)的初始化满足第二个m序列x2(n)的初始化满足即为把BI(p)设置为产生长度31的Gold序列的伪随机序列发生器的部分种子。
本示例与示例1的一个区别在于，在本示例中，基站发送包含反馈信息f＝[-1+j,1+j,1+j,-1+j,-j,1]的信号给终端序列<SN(1),SN(2),SN(3),SN(4)>。
本示例提供的信息传输方法相较于示例2产生高斯序列更简单。
示例4：
本示例与示例1的区别在于，对于t＝1,2,3,4，终端SN(t)的用户标识为调制编码方式小区RNTI(Modulcation Coding Scheme Cell RNTI，MCS-C-RNTI)；传输块标识有序集合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>，传输块标识有序集合I包括Na＝8个用户标识0,1,2,3,4,5,6,7；反馈信息f由基站根据下述参数确定：正确传输块标识集合BI、正确传输块数目P＝2、传输块标识有序集合大小Na。
图14是本申请又一实施例提供的由正确传输块标识集合BI通过叠加确定反馈信息f的示意图。如图14所示，基站按照下述方法确定反馈信息f：
基站以正确传输块标识集合中的传输块标识BI(1)＝2的二进制表示的 个比特a(1)＝[0,1,0]进行信道编码得到长度为Nc(1)＝6的编码序列c(1)＝[0,1,1,0,0,1]；基站以正确传输块标识集合中的传输块标识BI(2)＝3的二进制表示的 个比特a(2)＝[0,1,1]进行信道编码得到长度为Nc(2)＝6的编码序列c(2)＝[0,1,1,1,1,0]。
基站对编码序列c(1)＝[0,1,1,0,0,1]进行BPSK调制得到长度为Ns(1)＝Nf＝6的复数序列s(1)＝[+1,-1,-1,+1,+1,-1]；基站对编码序列c(2)＝[0,1,1,1,1,0]进行BPSK调制得到为Ns(2)＝Nf＝6的复数序列s(2)＝[+1,-1,-1,-1,-1,+1]。
基站根据复数序列s(1)和s(2)确定反馈信息f为 其中，
其中，对于p＝1,2，BPSK调制按照下式实现：
s(p,k)＝1-2c(p,k),k＝1,2,3,4,5,6；
其中，是虚数单位，s(p,k)是s(p)的第k个元素，c(p,k)是c(p)的第k个元素。本示例中，信道编码为由伽罗华域GF(2)上的3×6的生成矩阵
定义的分组编码，其中，对于p＝1,2，编码序列c(p)＝a(p)·G，其中，矩阵运算定义在 GF(2)上。
本示例与示例1的又一个区别在于，在本示例中，基站发送包含反馈信息f的信号给终端序列<SN(1),SN(2),SN(3),SN(4)>，终端SN(1),SN(2),SN(3),SN(4)分别按照下面的方法确定传输块b(1),b(2),b(3),b(4)的应答：
终端SN(1)以用户标识4的二进制表示的个比特使用生成矩阵G进行信道编码后进行BPSK调制确定复数序列v(1)＝[-1,+1,-1,+1,-1,+1]。终端SN(1)把v(1)与包含反馈信息f的信号进行内积，如果内积的绝对值大于复数序列v(1)的L2范数的一半，则终端SN(1)判断终端SN(1)的用户标识4属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为正确应答ACK；如果内积的绝对值小于复数序列v(1)的L2范数的一半，则终端SN(1)判断终端SN(1)的用户标识4不属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为错误应答NACK。
终端SN(2)以用户标识3的二进制表示的个比特使用生成矩阵G进行信道编码后进行BPSK调制确定复数序列v(2)＝[+1,-1,-1,-1,-1,+1]。终端SN(2)把v(2)与包含反馈信息f的信号进行内积，如果内积的绝对值大于复数序列v(2)的L2范数的一半，则终端SN(2)判断终端SN(2)的用户标识3属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为正确应答ACK；如果内积的绝对值小于复数序列v(2)的L2范数的一半，则终端SN(2)判断终端SN(2)的用户标识3不属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为错误应答NACK。
终端SN(3)以用户标识2的二进制表示的个比特使用生成矩阵G进行信道编码后进行BPSK调制确定复数序列v(3)＝[+1,-1,-1,+1,+1,-1]。终端SN(3)把v(3)与包含反馈信息f的信号进行内积，如果内积的绝对值大于复数序列v(3)的L2范数的一半，则终端SN(3)判断终端SN(3)的用户标识2属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为正确应答ACK；如果内积的绝对值小于复数序列v(3)的L2范数的一半，则终端SN(3)判断终端SN(3)的用户标识2不属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为错误应答NACK。
终端SN(4)以用户标识5的二进制表示的个比特使用生成矩阵G进行信道编码后进行BPSK调制确定复数序列v(4)＝[-1,+1,-1,-1,+1,-1]。终端SN(4)把v(4)与包含反馈信息f的信号进行内积，如果内积的绝对值大于复数序列v(4)的L2范数的一半，则终端SN(4)判断终端SN(4)的用户标识5属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为正确应答ACK；如果内积的绝对值小于复数序列v(4)的L2范数的一半，则终端SN(4)判断终端SN(4)的用户标识5不属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为错误应答NACK。
本示例提供的信息传输方法相较于示例3和示例2，能够通过选择性能优越的信道编码提高应答接收可靠度。
示例5：
本示例与示例1的区别在于，在本示例中，对于t＝1,2,3,4，终端SN(t)的用户标识为配置调度RNTI(Configured Scheduling RNTI，CS-RNTI)。
本示例与示例1的另一个区别在于，在本示例中，传输序列有序集合包括Na＝8个复数序列
t(1)＝[+1,+1,+1,+1],
t(2)＝[+1,-1,+1,-1],
t(3)＝[+1,+1,-1,-1],
t(4)＝[+1,-1,-1,+1],
t(5)＝[-1,-1,-1,-1],
t(6)＝[-1,+1,-1,+1],
t(7)＝[-1,-1,+1,+1],
t(8)＝[-1,+1,+1,-1],
其中，对于k＝1,2,3,4,5,6,7,8，复数序列t(k)的长度为Nt(k)＝4。
图15是本申请实施例提供的由正确传输块标识集合BI和传输块序列有序集合通过拼接确定反馈信息f的示意图。如图15所示，基站按照下述方法确定反馈信息f：根据传输块标识有序集合I、传输块标识有序集合大小Na＝8、传输块序列有序集合和正确传输块标识集合BI，基站由BI(1)＝2和I(2)＝BI(1)确定m(1)等于I(2)的序号2，得到复数序列t(m(1))＝t(2)＝[+1,-1,+1,-1]；基站由BI(2)＝3和I(3)＝BI(2)确定m(2)等于I(3)的序号3，得到复数序列t(m(2))＝t(3)＝[+1,+1,-1,-1]。
基站根据复数序列确定反馈信息f为f＝[t(2),t(3)]＝[+1,-1,+1,-1,+1,+1,-1,-1]，其中，反馈信息的长度Nf＝Nt(m(1))+Nt(m(2))＝Nt(2)+Nt(3)＝4+4＝8。
本示例与示例1的区别之处在于，在本示例中，基站发送包含反馈信息f＝[+1,-1,+1,-1,+1,+1,-1,-1]的信号给终端序列<SN(1),SN(2),SN(3),SN(4)>。终端序列<SN(1),SN(2),SN(3),SN(4)>接收包含反馈信息f的信号。进一步地，终端SN(1),SN(2),SN(3),SN(4)分别按照下面的方法确定传输块b(1),b(2),b(3),b(4)的应答。
终端SN(1)由用户标识4确定序列t(4)与包含反馈信息f的信号中的每Nt(4)＝4个符号进行内积。如果存在内积的绝对值大于序列t(4)的L2范数的一半，则终端SN(1)判断终端SN(1)的用户标识4属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为正确应答ACK；如果内积的绝对值都小于序列t(4)的L2范数的一半，则终端SN(1)判断终端SN(1)的用户标识4不属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为错误应答NACK；
终端SN(2)由用户标识3确定序列t(3)与包含反馈信息f的信号中的每Nt(3)＝4个符号进行内积。如果存在内积的绝对值的情况大于序列t(3)的L2范数的一半，则终端SN(2)判断终端SN(2)的用户标识3属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为正确应答ACK；如果内积的绝对值都小于序列t(3)的L2范数的一半，则终端SN(2)判断终端SN(2)的用户标识3不属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为错误应答NACK。
终端SN(3)由用户标识2确定序列t(2)与包含反馈信息f的信号中的每Nt(2)＝4个符号进行内积。如果存在内积的绝对值大于序列t(2)的L2范数的一半，则终端SN(3)判断终端SN(3)的用户标识2属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为正确应答 ACK；如果内积的绝对值都小于序列t(2)的L2范数的一半，则终端SN(3)判断终端SN(3)的用户标识2不属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为错误应答NACK。
终端SN(4)由用户标识5确定序列t(5)与包含反馈信息f的信号中的每Nt(5)＝4个符号进行内积。如果存在内积的绝对值大于序列t(5)的L2范数的一半，则终端SN(5)判断终端SN(5)的用户标识5属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为正确应答ACK；如果内积的绝对值都小于序列t(5)的L2范数的一半，则终端SN(4)判断终端SN(4)的用户标识5不属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为错误应答NACK。
本示例提供的信息传输方法相较于示例1至示例4，不同用户标识之间的序列是不重叠的，增大了终端的检测信噪比，提高了信息传输效率。
示例6：
在本示例中，第一节点为基站，第二节点为终端，本示例包括多个终端，这些终端形成了第二节点序列，传输块标识为用户标识。
图16是本申请一实施例提供的第二节点、传输块、用户标识、随机接入标签和标签索引关系的示意图。如图16所示，基站接收终端序列发送的包含传输块集合B的信号，其中，终端序列包括Nu＝4个终端SN(1),SN(2),SN(3),SN(4)，传输块集合B包括Nb＝4个传输块b(1),b(2),b(3),b(4)。进一步地，包含传输块集合B的信号包括包含传输块b(1)的信号、包含传输块b(2)的信号、包含传输块b(3)的信号和包含传输块b(4)的信号。
在本示例中，对于t＝1,2,3,4，传输块集合B中的传输块b(t)由终端序列中的终端SN(t)向基站发送，其中，传输块集合B中的传输块b(t)包括终端SN(t)的用户标识和随机接入标签。
在本示例中，终端SN(t)的用户标识为永久设备标识符(Permanent Equipment Identifier，PEI)，随机接入标签为参考信号(Reference Signal)。进一步地，终端SN(1),SN(2),SN(3),SN(4)的用户标识分别为4,3,2,5，其中，用户标识4,3,2,5为传输块标识有序集合I＝<I(1),I(2),I(3),I(4),I(5),I(6),I(7),I(8)>＝<1,2,3,4,5,6,7,8>的元素。进一步地，传输块标识有序集合I包括Na＝8个用户标识1,2,3,4,5,6,7,8。
在本示例中，参考信号是随机接入标签有序集合的元素。进一步地，随机接入标签有序集合包括6个参考信号r(1),r(2),r(3),r(4),r(5),r(6)，其中，参考信号r(1),r(2),r(3),r(4),r(5),r(6)的标签索引分别为0,1,2,3,4,5。进一步地，传输块b(1),b(2),b(3),b(4)包括的随机接入标签由终端SN(1),SN(2),SN(3),SN(4)分别根据终端SN(1),SN(2),SN(3),SN(4)的用户标识4,3,2,5按照下面方式确定的：
传输块b(t)包括的参考信号的标签索引＝终端SN(t)的用户标识的平方除以6的余数。
把终端SN(1),SN(2),SN(3),SN(4)的用户标识4,3,2,5分别代入上式，得到终端SN(1),SN(2),SN(3),SN(4)的参考信号的标签索引分别为4,3,4,1，最终得到终端SN(1),SN(2),SN(3),SN(4)的参考信号分别为r(5),r(4),r(5),r(2)。
在本示例中，最大正确传输块数目Pmax＝2由基站配置。在本示例中，正确传输块标识集合是指传输块集合中正确接收的传输块所包括的用户标识的集合。在本示例中，基站根据 包含传输块集合B的信号确定：正确传输块标识集合为集合BI＝{2,3}、正确传输块数目P＝2。
在本示例中，反馈信息f由基站根据下面的参数确定：正确传输块标识集合BI、正确传输块数目P＝2。
在本示例中，反馈信息f的长度Nf＝6。
图17是本申请一实施例提供的由正确传输块标识集合BI和传输块序列有序集合通过拼接确定反馈信息f的示意图。如图17所示的框图，基站按照下述方法确定反馈信息f：
基站以正确传输块标识集合中的传输块标识BI(1)＝2为伪随机数发生器的随机数种子产生长度为的伪随机复数序列s(1)＝[2.1539+3.9218j,0.3702-1.7478j,-0.2643+0.2502j]；基站以正确传输块标识集合中的传输块标识BI(2)＝3为伪随机数发生器的随机数种子产生长度为的伪随机复数序列s(2)＝[0.1403+4.3805j,-0.3004-0.5881j,-0.4079-0.1891j]，其中，R＝1。
基站由伪随机复数序列s(1)和s(2)拼接确定反馈信息f＝[s(1),s(2)]＝[2.1539+3.9218j,0.3702-1.7478j,-0.2643+0.2502j,0.1403+4.3805j,-0.3004-0.5881j,-0.4079-0.1891j]。
其中，对于p＝1,2，伪随机数发生器产生高斯分布的随机数，伪随机数发生器的一种实现方法如下：
其中，是虚数单位，log(·)是自然对数函数，k＝1,2,3,4,5,6，s(p,k)是s(p)的第k个元素，u(1),u(2),u(3),u(4),u(5),u(6)按照下面的伪代码得到：
其中，mod是取余函数，floor(x)是小于或等于x的最大整数，S是伪随机数发生器的状态，第1行代码中设置S＝BI(p)就是设置伪随机发生器的种子。
在本示例中，基站发送包含反馈信息f＝[2.1539+3.9218j,0.3702-1.7478j,-0.2643+0.2502j,0.1403+4.3805j,-0.3004-0.5881j,-0.4079-0.1891j]的信号给终端序列<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)以用户标识4作为伪随机数发生器的随机数种子产生长度为3的复数序列v(1)。终端SN(1)把v(1)与包含反馈信息f的信号中的每3个符号进行内积，如果存在内积的绝对值大于复数序列v(1)的L2范数的一半，则终端SN(1)判断终端SN(1)的用户标识4属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为正确应答ACK；如果内积的绝对值都小于复数序列v(1)的L2范数的一半，则终端SN(1)判断终端SN(1)的用户标识4不属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为错误应答NACK。
终端SN(2)以用户标识3作为伪随机数发生器的随机数种子产生长度为3的复数序列v(2)。终端SN(2)把v(2)与包含反馈信息f的信号中的每3个符号进行内积，如果存在内积的绝对值大于复数序列v(2)的L2范数的一半，则终端SN(2)判断终端SN(2)的用户标识3属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为正确应答ACK；如果内积的绝对值都小于复数序列v(2)的L2范数的一半，则终端SN(2)判断终端SN(2)的用户标识3不属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为错误应答NACK。
终端SN(3)以用户标识2作为伪随机数发生器的随机数种子产生长度为3的复数序列v(3)。终端SN(3)把v(3)与包含反馈信息f的信号中的每3个符号进行内积，如果存在内积的绝对值大于复数序列v(3)的L2范数的一半，则终端SN(3)判断终端SN(3)的用户标识2属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为正确应答ACK；如果内积的绝对值都小于复数序列v(3)的L2范数的一半，则终端SN(3)判断终端SN(3)的用户标识2不属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为错误应答NACK。
终端SN(4)以用户标识5作为伪随机数发生器的随机数种子产生长度为3的复数序列v(4)。终端SN(4)把v(4)与包含反馈信息f的信号中的每3个符号进行内积，如果存在内积的绝对值大于复数序列v(4)的L2范数的一半，则终端SN(4)判断终端SN(4)的用户标识5属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为正确应答ACK；如果内积的绝对值都小于复数序列v(4)的L2范数的一半，则终端SN(4)判断终端SN(4)的用户标识5不属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为错误应答NACK。
本示例提供的信息传输方法相较于示例5，节省了传输块序列有序集合的存储开销。
示例7：
在本示例中，第一节点为基站，第二节点为终端，本示例包括多个终端，这些终端形成了第二节点序列，传输块标识为标签索引。
图18是本申请另一实施例提供的第二节点、传输块、用户标识、随机接入标签和标签索引关系的示意图。如图18所示，基站接收终端序列发送的包含传输块集合B的信号，其中，终端序列包括Nu＝4个终端SN(1),SN(2),SN(3),SN(4)，传输块集合B包括Nb＝4个传输块b(1),b(2),b(3),b(4)。进一步地，包含传输块集合B的信号包括包含传输块b(1)的信号、包含传输块b(2)的信号、包含传输块b(3)的信号和包含传输块b(4)的信号。
在本示例中，对于k＝1,2,3,4，传输块集合B中的传输块b(k)由终端序列中的终端SN(k)向基站发送，其中，传输块集合B中的传输块b(k)包括终端SN(k)对应的用户标识和随机接 入标签。
在本示例中，终端SN(k)的用户标识为通用公共订阅标识符(Generic Public Subscription Identifier，GPSI)，随机接入标签为前导码(Preamble)。进一步地，终端SN(1),SN(2),SN(3),SN(4)的用户标识分别为4,6,2,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)的标签索引分别为1,2,3,4,5,6。进一步地，前导码r(1),r(2),r(3),r(4),r(5),r(6)的标签索引1,2,3,4,5,6为传输块标识有序集合I＝<I(1),I(2),I(3),I(4),I(5),I(6)>＝<1,2,3,4,5,6>的元素。进一步地，传输块标识有序集合I包括Na＝6个标签索引1,2,3,4,5,6。进一步地，传输块b(1),b(2),b(3),b(4)包括的随机接入标签由终端SN(1),SN(2),SN(3),SN(4)分别根据终端SN(1),SN(2),SN(3),SN(4)的用户标识4,6,2,1按照下面方式确定的前导码：
终端SN(1),SN(2),SN(3),SN(4)分别把终端SN(1),SN(2),SN(3),SN(4)的用户标识4,6,2,1作为伪随机序列发生器(Pseudo-Random Sequence Generator)的随机数种子的一部分分别得到长度为的伪随机比特序列：
o(1)＝[1,1,0]，
o(2)＝[0,1,0]，
o(3)＝[1,0,0]，
o(4)＝[0,0,0]，
其中，表示大于或等于log2(Na)的最小整数。本实例中，对于p＝1,2,3,4，伪随机数发生器为长度31的Gold序列(length-31 Gold sequence)，具体地，伪随机比特序列o(p)是Gold sequence输出序列，按照如下定义：
o(p,n+1)＝(x1(n+Nd)+x2(n+Nd))mod 2
x1(n+31)＝(x1(n+3)+x1(n))mod 2
x2(n+31)＝(x2(n+3)+x2(n+2)+x2(n+1)+x2(n))mod 2
其中，n＝0,1,2,...,2Np(p)-1，mod是取余函数，Nd＝1600且第一个m序列(m-sequence)x1(n)初始化为x1(0)＝1,x1(n)＝0,n＝1,2,...,30，第二个m序列x2(n)的初始化满足第二个m序列x2(n)的初始化满足用户标识等于即为把用户标识设置为Gold序列的伪随机序列发生器的部分种子。
对于p＝1,2,3,4，终端SN(1),SN(2),SN(3),SN(4)分别根据公式进行计算得到的前导码的标签索引分别为4,3,2,1，其中，o(p,k)是序列的第k个元素，Na＝6为传输块标识有序集合大小。
终端SN(1),SN(2),SN(3),SN(4)分别根据标签索引4,3,2,1确定传输块b(1),b(2),b(3),b(4)包括的前导码分别为r(4),r(3),r(2),r(1)。
在本示例中，最大正确传输块数目Pmax＝2由高层参数(higher layer parameters)配置。在本示例中，正确传输块标识集合是指传输块集合中正确接收的传输块所包括的随机接入标签的标签索引的集合。在本示例中，基站根据包含传输块集合B的信号确定：正确传输块标识集合为集合BI＝{2,3}、正确传输块数目P＝2。
在本示例中，反馈信息f由基站根据下面的参数确定：正确传输块标识集合BI和正确传输块数目P＝2，其中，反馈信息f的长度Nf＝6。
图19是本申请另一实施例提供的由正确传输块标识集合BI和正确传输块数目P通过拼接确定反馈信息f的示意图。在本示例中，如图19所示的框图，基站按照下面的方法确定反馈信息f：
基站以正确传输块标识集合中的传输块标识BI(1)＝2为伪随机序列发生器的随机数种子产生长度为的伪随机比特序列q(1)＝[1,0,0,0,0,0,1,0,1,1,0,0]；基站以正确传输块标识集合中的传输块标识BI(2)＝3为伪随机序列发生器的随机数种子产生长度为的伪随机比特序列q(2)＝[1,0,0,0,0,0,1,0,0,1,0,1]，其中，Qm＝4是16QAM的调制阶数(modulation order)， 表示小于或等于的最大整数。
基站对伪随机比特序列q(1)＝[1,0,0,0,0,0,1,0,1,1,0,0]进行16QAM调制得到长度为的复数序列基站对伪随机比特序列q(2)＝[1,0,0,0,0,0,1,0,0,1,0,1]进行16QAM调制得到为 的复数序列其中，R＝1；
基站由复数序列s(1)和s(2)拼接确定反馈信息
其中，对于p＝1,2，16QAM调制按照下式实现：
其中，k＝1，2，3，是虚数单位，s(p,k)是s(p)的第k个元素，q(p,k)是q(p)的第k个元素。本实例中，对于p＝1,2，伪随机序列发生器为长度31的Gold序列(length-31 Gold sequence)，具体地，伪随机比特序列q(p)是Gold sequence输出序列，按照如下定义：
q(p,n+1)＝(x1(n+Nd)+x2(n+Nd))mod2
x1(n+31)＝(x1(n+3)+x1(n))mod2
x2(n+31)＝(x2(n+3)+x2(n+2)+x2(n+1)+x2(n))mod2
其中，n＝0,1,2,...,2Np(p)-1，mod是取余函数，Nd＝1600且第一个m序列(m-sequence)x1(n)初始化为x1(0)＝1,x1(n)＝0,n＝1,2,...,30，第二个m序列x2(n)的初始化满足第二个m序列x2(n)的初始化满足即为把BI(p)设置为Gold序列的伪随机序列发生器的部分种子。
在本示例中，基站发送包含反馈信息 的信号给终端序列<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)以用户标识4作为伪随机序列发生器的随机数种子使用与基站相同的方法得到标签索引4，并用标签索引4使用基站相同的方法产生长度为3复数序列v(1)。终端SN(1)把v(1)与包含反馈信息f的信号中的每3个符号进行内积，如果存在内积的绝对值大于复数序列v(1)的L2范数的一半，则终端SN(1)判断终端SN(1)的用户标识4属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为正确应答ACK；如果内积的绝对值都小于复数序列v(1)的L2范数的一半，则终端SN(1)判断终端SN(1)的用户标识4不属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为错误应答NACK。
终端SN(2)以用户标识6作为伪随机序列发生器的随机数种子使用与基站相同的方法得到标签索引3，并用标签索引3为输入使用基站相同的方法产生长度为3复数序列v(2)。终端SN(2)把v(2)与包含反馈信息f的信号中的每3个符号进行内积，如果存在内积的绝对值大于复数序列v(2)的L2范数的一半，则终端SN(2)判断终端SN(2)的用户标识6属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为正确应答ACK；如果内积的绝对值都小于复数序列v(2)的L2范数的一半，则终端SN(2)判断终端SN(2)的用户标识6不属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为错误应答NACK。
终端SN(3)以用户标识2作为伪随机序列发生器的随机数种子使用与基站相同的方法得到标签索引2，并用标签索引2使用基站相同的方法产生长度为3的复数序列v(3)。终端SN(3)把v(3)与包含反馈信息f的信号中的每3个符号进行内积，如果存在内积的绝对值大于复数序列v(3)的L2范数的一半，则终端SN(3)判断终端SN(3)的用户标识2属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为正确应答ACK；如果内积的绝对值都小于复数序列v(3)的L2范数的一半，则终端SN(3)判断终端SN(3)的用户标识2不属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为错误应答NACK。
终端SN(4)以用户标识1作为伪随机序列发生器的随机数种子使用与基站相同的方法得到标签索引1，并用标签索引1使用基站相同的方法产生长度为3的复数序列v(4)。终端SN(4)把v(4)与包含反馈信息f的信号中的每3个符号进行内积，如果存在内积的绝对值大于复数序列v(4)的L2范数的一半，则终端SN(4)判断终端SN(4)的用户标识1属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为正确应答ACK；如果内积的绝对值都小于复数序列v(4)的L2范数的一半，则终端SN(4)判断终端SN(4)的用户标识1不属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为错误应答NACK。
本示例提供的信息传输方法相较于示例6，通过伪随机序列发生器得到标签索引从而确定随机接入标签不会出现示例6的冲突情况，随机序列发生器产生比特序列比示例6产生高斯序列更简单，处理效率更高。
示例8：
在本示例中，第一节点为基站，第二节点为终端，本示例包括多个终端，这些终端形成了第二节点序列，传输块标识为标签索引。
图20是本申请一实施例提供的第二节点、传输块、随机接入标签和标签索引关系的示意 图。如图20所示，基站接收终端序列发送的包含传输块集合B的信号，其中，终端序列包括Nu＝3个终端SN(1),SN(2),SN(3)，传输块集合B包括Nb＝4个传输块b(1),b(2),b(3),b(4)。进一步地，包含传输块集合B的信号包括包含传输块b(1)的信号、包含传输块b(2)的信号、包含传输块b(3)的信号和包含传输块b(4)的信号。
在本示例中，传输块集合B中的传输块b(1),b(2),b(3),b(4)分别由终端序列中的终端SN(1),SN(2),SN(3),SN(1)向基站发送，其中，传输块集合B中的传输块b(1),b(2),b(3),b(4)包括随机接入标签，其中，随机接入标签为导频(Pilot)。
在本示例中，导频是随机接入标签有序集合的元素。进一步地，随机接入标签有序集合包括Na＝6个导频r(1),r(2),r(3),r(4),r(5),r(6)，其中，导频r(1),r(2),r(3),r(4),r(5),r(6)的标签索引分别为1,2,3,4,5,6。进一步地，导频r(1),r(2),r(3),r(4),r(5)的标签索引1,2,3,4,5,6为传输块标识有序集合I＝<I(1),I(2),I(3),I(4),I(5),I(6)>＝<1,2,3,4,5,6>的元素。进一步地，传输块标识有序集合I包括Na＝6个标签索引1,2,3,4,5,6。
在本示例中，传输块b(1),b(2),b(3),b(4)包括的随机接入标签由终端SN(1),SN(2),SN(3),SN(1)根据高层参数(higher layer parameters)分别确定为r(4),r(3),r(2),r(1)，其中，传输块b(1),b(2),b(3),b(4)包括的随机接入标签的标签索引分别为4,3,2,1。
在本示例中，最大正确传输块数目Pmax＝3由高层参数(higher layer parameters)配置。在本示例中，正确传输块标识集合是指传输块集合中正确接收的传输块所包括的随机接入标签的标签索引的集合。在本示例中，基站根据包含传输块集合B的信号确定：正确传输块标识集合为集合BI＝{2,3}、正确传输块数目P＝2。
在本示例中，反馈信息f由基站根据下面的参数进行压缩编码确定：正确传输块标识集合BI、正确传输块数目P＝2，其中，反馈信息f的长度Nf＝6。
图21是本申请又一实施例提供的由正确传输块标识集合BI和正确传输块数目P通过拼接确定反馈信息f的示意图。在本示例中，如图21所示的框图，基站按照下面的方法确定反馈信息f：
基站以正确传输块标识集合中的传输块标识BI(1)＝2的二进制表示的 个比特a(1)＝[0,1,0]进行信道编码得到长度为 的编码序列c(1)＝[0,1,1,0,0,1]；基站以正确传输块标识集合中的传输块标识BI(2)＝3的二进制表示的个比特a(2)＝[0,1,1]进行信道编码得到长度为的编码序列c(2)＝[0,1,1,1,1,0]。
基站对编码序列c(1)＝[0,1,1,0,0,1]进行QPSK调制得到长度为 的复数序列基站对编码序列c(2)＝[0,1,1,1,1,0]进行QPSK调制得到的复数序列
基站由复数序列s(1)和s(2)拼接确定反馈信息f为
其中，Qm＝2是QPSK的调制阶数，R＝1，表示小于或等于x的最大整数，表示大于或等于x的最小整数，对于p＝1,2，QPSK调制按照下式实现：
其中，是虚数单位，s(p,k)是s(p)的第k个元素，c(p,k)是c(p)的第k个元素。本实例中，信道编码为由GF(2)上的3×6的生成矩阵
定义的分组编码，其中，对于p＝1,2，编码序列c(p)＝a(p)·G；其中，向量与矩阵的乘法运算定义在GF(2)上。
在本示例中，基站发送包含反馈信息的信号给终端序列<SN(1),SN(2),SN(3),SN(4)>，终端SN(1),SN(2),SN(3),SN(4)分别按照下述方法确定传输块b(1),b(2),b(3),b(4)的应答。
终端SN(1)以标签索引4的二进制表示的个比特[1,0,0]使用生成矩阵G编码后进行QPSK调制确定复数序列终端SN(1)把v(1)与包含反馈信息f的信号中的每3个符号进行内积，如果存在内积的绝对值大于复数序列v(1)的L2范数的一半，则终端SN(1)判断传输块b(1)包括的标签索引4属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为正确应答ACK；否则，终端SN(1)确定传输块b(1)的应答为错误应答NACK。
终端SN(2)以标签索引3的二进制表示的个比特[0,1,1]使用生成矩阵G编码后进行QPSK调制确定复数序列终端SN(2)把v(2)与包含反馈信息f的信号中的每3个符号进行内积，如果存在内积的绝对值大于复数序列v(2)的L2范数的一半，则终端SN(2)判断传输块b(2)包括的标签索引3属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为正确应答ACK；否则，终端SN(2)确定传输块b(2)的应答为错误应答NACK。
终端SN(3)以标签索引2的二进制表示的个比特[0,1,0]使用生成矩阵G编码后进行QPSK调制确定复数序列终端SN(3)把v(3)与包含反馈信息f的信号中的每3个符号进行内积，如果存在内积的绝对值大于复数序列v(3)的L2范数的一半，则终端SN(3)判断传输块包括的标签索引2属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为正确应答ACK；否则，终端SN(3)确定传输块b(3)的应答 为错误应答NACK。
终端SN(1)以标签索引1的二进制表示的个比特[0,0,1]使用生成矩阵G编码后进行QPSK调制确定复数序列终端SN(1)把v(4)与包含反馈信息f的信号中的每3个符号进行内积，如果存在内积的绝对值大于复数序列v(4)的L2范数的一半，则终端SN(1)判断传输块包括的标签索引1属于正确传输块标识集合BI，终端SN(1)确定传输块b(4)的应答为正确应答ACK；否则，终端SN(1)确定传输块b(4)的应答为错误应答NACK。
本示例提供的信息传输方法相较于示例6和示例7，可以通过选择性能优越的信道编码提高应答接收可靠度。
示例9：
在本示例中，第一节点为基站，第二节点为终端，本示例包括多个终端，这些终端形成了第二节点序列，传输块标识为标签索引。
如图20所示，基站接收终端序列发送的包含传输块集合B的信号，其中，终端序列包括Nu＝3个终端SN(1),SN(2),SN(3)，传输块集合B包括Nb＝4个传输块b(1),b(2),b(3),b(4)。进一步地，包含传输块集合B的信号包括包含传输块b(1)的信号、包含传输块b(2)的信号、包含传输块b(3)的信号和包含传输块b(4)的信号。
在本示例中，传输块集合B中的传输块b(1),b(2),b(3),b(4)分别由终端序列中的终端SN(1),SN(2),SN(3),SN(1)向基站发送，其中，传输块集合B中的传输块b(1),b(2),b(3),b(4)包括随机接入标签，其中，随机接入标签为交织器(Interleaver)。
在本示例中，交织器是随机接入标签有序集合的元素。进一步地，随机接入标签有序集合包括Na＝6个交织器r(1),r(2),r(3),r(4),r(5),r(6)，其中，交织器r(1),r(2),r(3),r(4),r(5),r(6)的标签索引分别为1,2,3,4,5,6。进一步地，交织器r(1),r(2),r(3),r(4),r(5),r(5)的标签索引1,2,3,4,5,6为传输块标识有序集合I＝<I(1),I(2),I(3),I(4),I(5),I(6)>＝<1,2,3,4,5,6>的元素。进一步地，传输块标识有序集合I包括Na＝6个标签索引1,2,3,4,5,6。
在本示例中，传输块b(1),b(2),b(3),b(4)包括的随机接入标签由终端SN(1),SN(2),SN(3),SN(1)根据高层参数(higher layer parameters)分别确定为r(4),r(3),r(2),r(1)，其中，传输块b(1),b(2),b(3),b(4)包括的随机接入标签的标签索引分别为4,3,2,1。
在本示例中，最大正确传输块数目Pmax＝3由高层参数(higher layer parameters)配置。在本示例中，正确传输块标识集合是指传输块集合中正确接收的传输块所包括的随机接入标签的标签索引的集合。在本示例中，基站根据包含传输块集合B的信号确定，正确传输块标识集合为集合BI＝{2,3}、正确传输块数目P＝2。
在本示例中，反馈信息f由基站根据下面的参数确定：最大正确传输块数目Pmax＝3、正确传输块标识集合BI、传输块标识有序集合大小Na、正确传输块数目P＝2，其中，反馈信息f的长度Nf＝6。
图22是本申请实施例提供的由正确传输块标识集合BI、正确传输块数目P和最大正确传输块Pmax通过拼接确定反馈信息f的示意图。在本示例中，如图22所示，基站按照下述 方法确定反馈信息f：
基站以正确传输块标识集合中的传输块标识BI(1)＝2的二进制表示的 个比特a(1)＝[0,1,0]进行信道编码得到长度为Nc(1)＝4的编码序列c(1)＝[0,1,0,1]；基站以正确传输块标识集合中的传输块标识BI(2)＝3的二进制表示的 个比特a(2)＝[0,1,1]进行信道编码得到长度为Nc(2)＝4的编码序列c(2)＝[0,1,1,0]，其中，信道编码为单奇偶校验编码(single-parity-check coding)，其中，对于p＝1,2，编码序列c(p)的前个比特是a(p)的拷贝，编码序列c(p)的最后一个比特是序列a(p)中的比特的模2和。
基站对编码序列c(1)＝[0,1,0,1]进行QPSK调制得到长度为＝2的复数序列基站对编码序列c(2)＝[0,1,1,0]进行QPSK调制得到为的复数序列其中，对于p＝1,2，QPSK调制按照下式实现：
s(p,k)＝(1-2c(p,2k-1))+j·(1-2c(p,2k)),k＝1,2；
其中，是虚数单位，s(p,k)是s(p)的第k个元素，c(p,k)是c(p)的第k个元素。
基站由复数序列s(1)、s(2)和长度为的全零序列拼接确定反馈信息其中，max(x,y)表示取x和y中较大的值。
在本示例中，基站发送包含反馈信息的信号给终端序列<SN(1),SN(2),SN(3)>。终端SN(1),SN(2),SN(3)分别按照下面的方法确定传输块b(1),b(2),b(3),b(4)的应答：
终端SN(1)以标签索引4的二进制表示的个比特进行单奇偶校验编码后进行QPSK调制确定复数序列终端SN(1)把v(1)与包含反馈信息f的信号中的每2个符号进行内积，如果存在内积的绝对值大于复数序列v(1)的L2范数的一半，则终端SN(1)判断传输块b(1)包括的标签索引4属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为正确应答ACK；否则，终端SN(1)确定传输块b(1)的应答为错误应答NACK。
终端SN(2)以标签索引3的二进制表示的个比特进行单奇偶校验编码后进行QPSK调制确定复数序列终端SN(2)把v(2)与包含反馈信息f的信号中的每2个符号进行内积，如果存在内积的绝对值大于复数序列v(2)的L2范数的一半，则终端SN(2)判断传输块b(2)包括的标签索引3属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为正确应答ACK；否则，终端SN(2)确定传输块b(2)的应答为 错误应答NACK。
终端SN(3)以标签索引2的二进制表示的个比特进行单奇偶校验编码后进行QPSK调制确定复数序列终端SN(3)把v(3)与包含反馈信息f的信号中的每2个符号进行内积，如果存在内积的绝对值大于复数序列v(3)的L2范数的一半，则终端SN(3)判断传输块包括的标签索引2属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为正确应答ACK；否则，终端SN(3)确定传输块b(3)的应答为错误应答NACK。
终端SN(1)以标签索引1的二进制表示的个比特进行单奇偶校验编码后进行QPSK调制确定复数序列终端SN(1)把v(4)与包含反馈信息f的信号中的每2个符号进行内积，如果存在内积的绝对值大于复数序列v(4)的L2范数的一半，则终端SN(1)判断传输块包括的标签索引1属于正确传输块标识集合BI，终端SN(1)确定传输块b(4)的应答为正确应答ACK；否则，终端SN(1)确定传输块b(4)的应答为错误应答NACK。
在本示例中，终端SN(1)发送了两个传输块b(1)和b(4)，但选取了不同的随机接入标签；基站根据正确译码的传输块的随机接入标签的标签索引来确定反馈信息f，使得终端SN(1)可以区分两个传输块b(1)和b(4)是否被正确接收。同时，使用信道编码得到反馈信息f可以增加不同传输块序列之间的最小距离，提高反馈检测性能。
示例10：
本示例与示例8的区别在于，在本示例中，随机接入标签为扩频序列(Spread Spectrum Sequence)，反馈信息f由基站根据下述参数确定：最大正确传输块数目Pmax＝2、正确传输块标识集合BI、正确传输块数目P＝2、传输块标识有序集合大小Na、反馈信息f的长度Nf，其中，反馈信息f的长度Nf＝6。
图23是本申请实施例提供的由正确传输块标识集合BI中的元素BI(p)的传输块标识有序集合大小Na确定复数序列s(p)的示意图。在本示例中，如图23所示，基站按照下述方法确定反馈信息f：
基站以正确传输块标识集合中的传输块标识BI(1)＝2的二进制表示的 个比特a(1)＝[0,1,0]进行信道编码得到长度为 的复数序列基站以正确传输块标识集合中的传输块标识BI(2)＝3的二进制表示的个比特a(2)＝[0,1,1]进行信道编码得到长度为的复数序列+1,+1,+3]，其中，R＝2，信道编码为由如下3×4的复数矩阵A定义的叠加编码：
其中，对于p＝1,2，s(p)＝(1-2a(p))·A；其中，矩阵运算定义在复数域上。
图24是本申请实施例提供的由正确传输块数目P、最大正确传输块Pmax、反馈信息f的长度Nf和复数序列s(1)、s(2)、...、s(P)确定反馈信息f的示意图。如图24所示，基站由复数序列s(1)、s(2)和长度为的全零序序列按照下述方式进行叠加确定反馈信息f：
对于p＝1,2，在s(p)前面补个0且在s(p)后面补个0得到长度为Nf的序列其中，
基站把s’(1)和s’(2)进行叠加得到反馈信息f如下： 其中，α(1)＝α(2)＝1。
本示例与示例8的再一个区别在于，在本示例中，基站发送包含反馈信息+3,-2,+2,+1,+3]的信号给终端序列<SN(1),SN(2),SN(3)>。终端SN(1),SN(2),SN(3)分别按照下述方法确定传输块b(1),b(2),b(3),b(4)的应答。
终端SN(1)以标签索引4的二进制表示的个比特[1,0,0]进行由3×4的复数矩阵A定义的叠加编码确定复数序列对于p＝1,2,...,Pmax，终端SN(1)把v(1)与包含反馈信息f的信号从位置开始的长度为4的子序列进行内积，如果存在内积的绝对值大于复数序列v(1)的L2范数的一半，则终端SN(1)判断传输块b(1)包括的标签索引4属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为正确应答ACK；否则，终端SN(1)确定传输块b(1)的应答为错误应答NACK。
终端SN(2)以标签索引3的二进制表示的个比特[0,1,1]进行由3×4的复数矩阵A定义的叠加编码确定复数序列对于p＝1,2,...,Pmax，终端SN(2)把v(2)与包含反馈信息f的信号从位置开始的长度为4的子序列进行内积，如果存在内积的绝对值大于复数序列v(2)的L2范数的一半，则终端SN(2)判断传输块b(2)包括的标签索引3属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为正确应答ACK；否则，终端SN(2)确定传输块b(2)的应答为错误应答NACK。
终端SN(3)以标签索引2的二进制表示的个比特[0,1,0]进行由3×4的复数矩阵A定义的叠加编码确定复数序列对于p＝1,2,...,Pmax，终端SN(3)把v(3)与包含反馈信息f的信号从位置开始的长度为4 的子序列进行内积，如果存在内积的绝对值大于复数序列v(3)的L2范数的一半，则终端SN(3)判断传输块包括的标签索引2属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为正确应答ACK；否则，终端SN(3)确定传输块b(3)的应答为错误应答NACK。
终端SN(1)以标签索引1的二进制表示的个比特[0,0,1]进行由3×4的复数矩阵A定义的叠加编码确定复数序列对于p＝1,2,...,Pmax，终端SN(1)把v(4)与包含反馈信息f的信号从位置开始的长度为4的子序列进行内积，如果存在内积的绝对值大于复数序列v(4)的L2范数的一半，则终端SN(1)判断传输块包括的标签索引1属于正确传输块标识集合BI，终端SN(1)确定传输块b(4)的应答为正确应答ACK；否则，终端SN(1)确定传输块b(4)的应答为错误应答NACK。
示例11：
本示例与示例10的区别在于，在本示例中，随机接入标签为稀疏码序列(Sparse Code Sequence)。
图25是本申请实施例提供的由正确传输块标识集合BI中的元素BI(p)、最大正确传输块Pmax、反馈信息f的长度Nf确定复数序列s(1)和放置向量z(p)的示意图。在本示例中，如图25所示，基站按照下述方法确定反馈信息f：
基站以正确传输块标识集合中的传输块标识BI(1)＝2的二进制表示的 个比特a(1)＝[0,1,0]中的前个＝3-1＝2个比特a(1,1:2)进行信道编码得到长度为的复数序列s(1)＝[+1,-1,+1,-1]；基站以正确传输块标识集合中的传输块标识BI(2)＝3的二进制表示的个比特a(2)＝[0,1,1]中的前个 个比特a(2,1:2)进行信道编码得到长度为 的复数序列s(2)＝[+1,-1,+1,-1]，其中，R＝2，信道编码为由如下2×4的复数矩阵A定义的叠加编码：
其中，对于p＝1,2，s(p)＝(1-2a(p))·A；其中，矩阵运算定义在复数域上。
基站由复数序列s(1)和s(2)按照下述方式进行叠加确定反馈信息f：
基站把长为Nf的反馈信息f平均划分为长度为的Pmax＝3等份。
对于p＝1,2，基站根据比特a(p)的后面个比特确定选取Pmax＝3个中的R＝2个长度为的等份用于放置复数序列s(p)的位置且剩下的Pmax-R ＝1个等份设置为0的Pmax＝3长的放置向量z(p)，其中，z(p)是只有“0”和“1”的向量且z(p)中的“1”的个数等于R；其中，从1个比特到位置向量z(p)的映射如下表2所示：
表2 1个比特到位置向量z(p)的映射表
参见表格2，可得，z(1)＝[1,1,0]，z(2)＝[1,0,1]。
图26是本申请实施例提供的基站根据复数序列s(1)、s(2)和放置向量z(1)、z(2)进行叠加确定反馈信息f的的示意图。如图26所示，基站根据复数序列s(1)、s(2)、放置向量z(1)、z(2)按照下面的伪代码进行叠加确定反馈信息f：
其中，floor(x)表示小于或等于x的最大正整数，f(k)是反馈信息f的第k个元素，z(p,i)是放置向量z(p)的第i个元素，ks(p)是向量ks的第p个元素，s(p,ks(p))是复数序列s(p)的第ks(p)个元素,α(1)＝α(2)＝1，最终得到反馈信息f＝[2,-2,+1,-1,+1,-1]。
本示例与示例10的再一个区别在于，在本示例中，基站发送包含反馈信息f＝[2,-2,+1,-1,+1,-1]的信号给终端序列<SN(1),SN(2),SN(3)>。终端SN(1),SN(2),SN(3)分别按照下面的方法确定传输块b(1),b(2),b(3),b(4)的应答。
终端SN(1)以标签索引4的二进制表示的个比特进行由2×4的复数矩阵A定义的叠加编码和补0确定复数序列v(1)＝[-1,+1,-1,+1,0,0]。终端SN(1)把v(1)与包含反馈信息f的信号进行内积，如果内积的绝对值大于复数序列v(1)的L2范数的一半，则终端SN(1)判断传输块b(1)包括的标签索引4属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为正确应答ACK；否则，终端SN(1)确定传输块b(1)的应答为错误应答NACK。
终端SN(2)以标签索引3的二进制表示的个比特进行由2×4的复数矩阵A定义的叠加编码和补0确定复数序列v(2)＝[+1,-1,0,0,+1,-1]。终端SN(2)把v(2)与包含反馈信息f的信号进行内积，如果内积的绝对值大于复数序列v(2)的L2范数的一半，则终端SN(2)判断传输块b(2)包括的标签索引3属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为正确应答ACK；否则，终端SN(2)确定传输块b(2)的应答为错误应答NACK。
终端SN(3)以标签索引2的二进制表示的个比特进行由2×4的复数矩阵A定义的叠加编码和补0确定复数序列v(3)＝[+1,-1,+1,-1,0,0]。终端SN(3)把v(3)与包含反馈信息f的信号进行内积，如果内积的绝对值大于复数序列v(3)的L2范数的一半，则终端SN(3)判断传输块包括的标签索引2属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为正确应答ACK；否则，终端SN(3)确定传输块b(3)的应答为错误应答NACK。
终端SN(1)以标签索引1的二进制表示的个比特进行由2×4的复数矩阵A定义的叠加编码确定复数序列v(4)＝[+1,+1,0,0,+1,+1]。终端SN(1)把v(4)与包含反馈信息f的信号进行内积，如果内积的绝对值大于复数序列v(4)的L2范数的一半，则终端SN(1)判断传输块包括的标签索引1属于正确传输块标识集合BI，终端SN(1)确定传输块b(4)的应答为正确应答ACK；否则，终端SN(1)确定传输块b(4)的应答为错误应答NACK。
示例12：
本示例与示例10的区别在于，在本示例中，随机接入标签为加扰序列(Scrambling Sequence)，加扰序列是随机接入标签有序集合的元素。进一步地，随机接入标签有序集合包括Na＝5个加扰序列r(1),r(2),r(3),r(4),r(5)，其中，加扰序列r(1),r(2),r(3),r(4),r(5)的标签索引分别为0,1,2,3,4。进一步地，加扰序列r(1),r(2),r(3),r(4),r(5)的标签索引0,1,2,3,4为传输块标识有序集合I＝<I(1),I(2),I(3),I(4),I(5)>＝<0,1,2,3,4>的元素。进一步地，传输块标识有序集合I包括Na＝5个标签索引0,1,2,3,4。图27是本申请一实施例提供的第二节点、传输块、随机接入标签和标签索引关系的示意图，在本示例中，如图所示，传输块b(1),b(2),b(3),b(4)包括的随机接入标签的标签索引分别为3,2,1,0。
本示例与示例10的又一个区别在于，在本示例中，基站根据包含传输块集合B的信号确定：正确传输块标识集合为空集Φ、正确传输块数目P＝0。
本示例与示例10的再一个区别在于，在本示例中，反馈信息f由基站根据下述参数进行压缩编码确定：正确传输块标识集合Φ、正确传输块数目P＝0，其中，反馈信息f的长度Nf＝0。
基站按照下述方法确定反馈信息f：
基站根据正确传输块标识集合为空集Φ(或者正确传输块数目P＝0)确定反馈信息f为空序列。进一步地，基站确定包含反馈信息f的信号为零功率信号。
本示例与示例10的再一个区别在于，在本示例中，基站发送包含反馈信息f的零功率信号给终端序列<SN(1),SN(2),SN(3),SN(1)>。终端序列<SN(1),SN(2),SN(3),SN(1)>接收包含反馈信息f的零功率信号。进一步地，终端SN(1)解码失败，确定传输块b(1)和b(4)的应答为 错误应答NACK；终端SN(2)解码失败，确定传输块b(2)的应答为错误应答NACK；终端SN(3)解码失败，确定传输块b(3)的应答为错误应答NACK。
示例13：
在本示例中，第一节点为基站，第二节点为终端，本示例包括多个终端，这些终端形成了第二节点序列，传输块标识为用户标识的索引值。
图28是本申请一实施例提供的第二节点、传输块、用户标识和用户标识的索引值关系的示意图。如图28所示，基站接收终端序列发送的包含传输块集合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为用户标识有序集合ID＝<ID(1),ID(2),ID(3),ID(4),ID(5)>＝<4,3,2,5,10>的元素，用户标识有序集合ID中用户标识ID(1),ID(2),ID(3),ID(4),ID(5)的索引值分别为1，2，3，4，5；其中，用户标识的索引值1，2，3，4，5为传输块标识有序集合I＝<I(1),I(2),I(3),I(4),I(5)>＝<1,2,3,4,5>的元素，传输块标识有序集合I包括Na＝5个用户标识的索引值1,2,3,4,5。
在本示例中，最大正确传输块数目Pmax＝2由基站配置。正确传输块标识集合是指传输块集合B中正确接收的传输块包括的用户标识的集合。基站根据包含传输块集合B的信号确定：正确传输块标识集合为集合BI＝{2,3}、正确传输块数目P＝2。
在本示例中，反馈信息f由基站根据下述参数确定：正确传输块标识集合BI、正确传输块数目P＝2、传输块标识有序集合I、传输序列有序集合，其中，传输序列有序集合包括Na＝5个复数序列，分别为：
t(1)＝[1,1,1,1,1,1],
t(2)＝[1,1,1,-1,-1,-1],
t(3)＝[1,-1,0,1,-1,0],
t(4)＝[1,-1,0,-1,1,0],
t(5)＝[1,1,-1,1,1,-1],
其中，对于k＝1,2,3,4,5，复数序列t(k)的长度为Nt(k)＝Nf＝6，Nf为反馈信息f的长度。
图29是本申请一实施例提供的由正确传输块标识集合BI和传输块序列有序集合通过叠加确定反馈信息f的示意图。如图29所示，基站按照下述方法确定反馈信息f：
根据传输块标识有序集合I、传输块标识有序集合大小Na＝5、传输块序列有序集合和正确传输块标识集合BI，基站由BI(1)＝2得到复数序列t(BI(1))＝t(2)；基站由BI(2)＝3得到复数序列t(BI(2))＝t(3)。
基站把复数序列t(2)和t(3)进行叠加确定反馈信息f为f＝α(1)×t(2)+α(2)×t(3)＝[2,0,1,0,-2,-1]，其中，α(1)＝α(2)＝1。
在本示例中，基站发送包含反馈信息f＝[2,0,1,0,-2,-1]的信号给终端序列<SN(1),SN(2),SN(3),SN(4)>；终端序列<SN(1),SN(2),SN(3),SN(4)>接收包含反馈信息f的信号。
进一步地，终端SN(1),SN(2),SN(3),SN(4)分别按照下述方法确定传输块b(1),b(2),b(3),b(4)的应答：
终端SN(1)由用户标识4对应的用户标识的索引值1确定序列t(1)与包含反馈信息f的信号进行内积。如果内积的绝对值大于序列t(1)的L2范数的一半，则终端SN(1)判断终端SN(1)的用户标识4对应的用户标识的索引值1属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为正确应答ACK；如果内积的绝对值小于序列t(1)的L2范数的一半，则终端SN(1)判断终端SN(1)的用户标识4对应的用户标识的索引值1不属于正确传输块标识集合BI，终端SN(1)确定传输块b(1)的应答为错误应答NACK；
终端SN(2)由用户标识3对应的用户标识的索引值2确定序列t(2)与包含反馈信息f的信号进行内积。如果内积的绝对值大于序列t(2)的L2范数的一半，则终端SN(2)判断终端SN(2)的用户标识3对应的用户标识的索引值2属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为正确应答ACK；如果内积的绝对值小于序列t(2)的L2范数的一半，则终端SN(2)判断终端SN(2)的用户标识3对应的用户标识的索引值2不属于正确传输块标识集合BI，终端SN(2)确定传输块b(2)的应答为错误应答NACK。
终端SN(3)由用户标识2对应的用户标识的索引值3确定序列t(3)与包含反馈信息f的信号进行内积。如果内积的绝对值大于序列t(3)的L2范数的一半，则终端SN(3)判断终端SN(3)的用户标识2对应的用户标识的索引值3属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为正确应答ACK；如果内积的绝对值小于序列t(3)的L2范数的一半，则终端SN(3)判断终端SN(3)的用户标识2对应的用户标识的索引值3不属于正确传输块标识集合BI，终端SN(3)确定传输块b(3)的应答为错误应答NACK。
终端SN(4)由用户标识5对应的用户标识的索引值4确定序列t(4)与包含反馈信息f的信号进行内积。如果内积的绝对值大于序列t(4)的L2范数的一半，则终端SN(5)判断终端SN(5)的用户标识5对应的用户标识的索引值4属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为正确应答ACK；如果内积的绝对值小于序列t(4)的L2范数的一半，则终端SN(4)判断终端SN(4)的用户标识5对应的用户标识的索引值4不属于正确传输块标识集合BI，终端SN(4)确定传输块b(4)的应答为错误应答NACK。
在本示例中，如果正确传输块数目P为0，则反馈信息f的长度Nf为0，反馈信息f为空序列，包含反馈信息f的信号为零功率信号。
图30为本申请一实施例提供的信息传输方法的流程图。如图30所示，本申请实施例提供的信息传输方法可用于基站、中继、终端等任何具备数据接收和信令发送功能的网元，包括但不限于步骤S4000以及步骤S5000。
步骤S4000：发送传输块给第一节点。
步骤S5000：接收第一节点发送的反馈信息；其中，反馈信息用于表征传输块的接收情况。
在一些实施例中，第二节点发送包含传输块的信号给第一节点，一个或多个传输块在第 一节点处构成传输块集合。
在一些实施例中，当有多个第二节点向第一节点发送传输块时，这些发送传输块集合的第二节点构成第二节点序列。其中，第二节点序列包括Nu个第二节点，传输块集合包括Nb个传输块；其中，Nu和Nb是正整数，Nu小于或等于Nb。
在一些实施例中，传输块集合中的一个传输块包括传输块标识，传输块标识有序集合包括Na个传输块标识I(1),I(2),..,I(Na)，Na为传输块标识有序集合大小；对于k＝1,2,....,Na，传输块标识有序集合的第k个元素为I(k)；其中，传输块标识有序集合的第k个元素I(k)可以是整数k或整数k-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)的索引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。
在一些实施例中，传输块标识为标签索引，标签索引是随机接入标签的标签索引，即，传输块集合中的一个传输块包括随机接入标签，随机接入标签为随机接入标签有序集合的元素，随机接入标签有序集合包括Na个随机接入标签r(1),r(2),...,r(Na)；其中，Na为随机接入标签有序集合大小，也是传输块标识有序集合大小，k＝1,2,....,Na，随机接入标签有序集合中的第k个随机接入标签r(k)的标签索引为传输块标识有序集合的第k个元素I(k)。
需要说明的是，随机接入标签可以是导频(Pilot)、参考信号(Reference Signal)、前导码(Preamble)、扩频序列(Spread Spectrum Sequence)、交织器(Interleaver)、交织图样(Interleaver Pattern)、交织序列(Interleaver Sequence)、加扰序列(Scrambling Sequence)、稀疏码序列(Sparse Code Sequence)等。
在一些实施例中，第二节点序列根据其用户标识确定一个传输块的随机接入标签作为传输块集合中的一个传输块包括的随机接入标签，这些随机接入标签可用于第一节点在包含传输块集合的信号中区分传输块集合中的不同传输块。
在一些实施例中，第二节点序列根据高层参数(higher layer parameters)确定一个传输块包括的随机接入标签作为传输块集合中的一个传输块包括的随机接入标签，这些随机接入标签可用于第一节点在包含传输块集合的信号中区分传输块集合中的不同传输块。
需要说明的是，第一节点和第二节点可以是基站、中继、终端等任何具备数据接收和信令发送功能的网元。
在一些实施例中，正确传输块的信息包括最大正确传输块数目Pmax、传输块标识有序集合、传输块序列有序集合、预定义的复数序列集合、传输块标识有序集合大小Na、正确传输块标识集合、正确传输块序列集合、正确传输块数目P、反馈信息f的长度Nf。
在一些实施例中，第二节点序列接收第一节点发送的反馈信息；其中，反馈信息用于表征传输块的接收情况，反馈信息根据传输块集合得到。反馈信息可以根据下述参数中的一个或多个确定，这些参数包括：最大正确传输块数目Pmax、传输块标识有序集合、传输块序列有序集合、预定义的复数序列集合、传输块标识有序集合大小Na、正确传输块标识集合、正确传输块序列集合、正确传输块数目P、反馈信息f的长度Nf。
在一些实施例中，传输块序列有序集合为预定义的复数序列集合。
需要说明的是，传输块标识有序集合大小Na为传输块标识有序集合的元素数目，正确传输块数目P为正确传输块标识集合的元素数目，传输块序列有序集合包括Na个复数序列t(1),t(2),...,t(Na)，正确传输块标识集合包括P个传输块标识BI(1),BI(2),...,BI(P)，正确传输块序列集合包括P个复数序列s(1),s(2),...,s(P)；其中，Na、Pmax是正整数，P是非负整数，P小于或等于Pmax；对于k＝1,2,...,P，复数序列s(k)的长度为Ns(k)，其中，Ns(k)是非负整数，Ns(k)小于或等于Nf。
需要说明的是，最大正确传输块数目Pmax小于或等于传输块标识有序集合大小Na。在一些实施例中，最大正确传输块数目Pmax由第一节点配置；在另一些实施例中，最大正确传输块数目Pmax由高层参数(high layer parameters)预先配置。
需要说明的是，在一些实施例中，正确传输块标识集合是指传输块集合中正确接收的传输块所包括的用户标识的集合。其中，正确接收的传输块是指应答状态为正确应答ACK的传输块，一个用户标识属于正确传输块标识集合用于指示对应该用户标识的传输块的应答状态为正确应答ACK，一个用户标识不属于正确传输块标识集合用于指示对应该用户标识的传输块的应答状态为错误应答NACK，因此，正确传输块标识集合是传输块标识有序集合的子集。
需要说明的是，在一些实施例中，正确传输块标识集合是指传输块集合中正确接收的传输块所包括的用户标识的索引值的集合。其中，正确接收的传输块是指应答状态为正确应答 ACK的传输块，一个用户标识的索引值属于正确传输块标识集合用于指示对应该用户标识的索引值的传输块的应答状态为正确应答ACK，一个用户标识的索引值不属于正确传输块标识集合用于指示对应该用户标识的索引值的传输块的应答状态为错误应答NACK，因此，正确传输块标识集合是传输块标识有序集合的子集。
需要说明的是，在一些实施例中，正确传输块标识集合是指传输块集合中正确接收的传输块所对应的随机接入标签的标签索引的集合。其中，正确接收的传输块是指应答状态为正确应答ACK的传输块，一个随机接入标签的标签索引属于正确传输块标识集合用于指示包括该随机接入标签的传输块的应答状态为正确应答ACK，一个随机接入标签的标签索引不属于正确传输块标识集合用于指示对应该随机接入标签的传输块的应答状态为错误应答NACK，因此，正确传输块标识集合是传输块标识有序集合的子集。
需要说明的是，正确传输块序列集合是传输块序列有序集合的子集。对于k＝1,2,...,Na，传输块序列有序集合的中的第k个复数序列t(k)与传输块标识有序集合的第k个元素I(k)对应，其中，传输块序列有序集合的中的第k个复数序列t(k)的长度为Nt(k)，Nt(k)为非负整数，Nt(k)小于或等于Nf。
示例14：
本示例与示例9的区别在于，在本示例中，如图20所示，终端序列接收基站发送的包含反馈信息f的信号，其中，终端序列包括Nu＝3个终端SN(1),SN(2),SN(3)，反馈信息f为传输块集合B的反馈信息，反馈信息f为长度为Nf＝6的复数序列；其中，传输块集合B由终端序列发送给基站；其中，传输块集合B包括Nb＝4个传输块b(1),b(2),b(3),b(4)；其中，反馈信息f由基站根据终端序列发送的包含传输块集合B的信号确定。
图31是本申请一实施例提供的一种信息传输装置结构示意图。如图31所示，本申请实施例提供的信息传输装置200应用于基站，可以执行本申请实施例提供的信息传输方法，终端具备执行方法相应的功能模块和技术效果。该装置可以通过软件、硬件或者软硬结合的方式实现，包括：接收模块201，设置为接收至少一个第二节点发送的传输块；其中，传输块形成传输块集合；
反馈信息生成模块202，设置为根据传输块集合，得到反馈信息；其中，反馈信息用于表征第二节点发送的传输块的接收情况；
发送模块203，设置为发送反馈信息给第二节点序列。
图32是本申请一实施例提供的一种信息传输装置结构示意图。如图32所示，本申请实施例提供的信息传输装置300应用于用户设备，可以执行本申请实施例提供的信息传输方法，终端具备执行方法相应的功能模块和技术效果。该装置可以通过软件、硬件或者软硬结合的方式实现，包括：
发送模块301，设置为发送传输块给第一节点；其中，传输块在第一节点处形成传输块集合；
接收模块302，设置为接收第一节点发送的反馈信息；其中，反馈信息用于表征传输块的接收情况。
图33是本申请一实施例提供的基站的结构示意图，如图33所示，该基站400包括存储 器401、处理器402、接收器403以及发送器404。存储器401、处理器402的数量可以是一个或多个，图33中以一个存储器401和一个处理器402为例；基站中的存储器401和处理器302可以通过总线或其他方式连接，图33中以通过总线连接为例。
存储器401作为一种计算机可读存储介质，可用于存储软件程序、计算机可执行程序以及模块，如本申请任一实施例提供的信息传输方法对应的程序指令/模块。处理器402通过运行存储在存储器401中的软件程序、指令以及模块实现上述信息传输方法。
存储器401可主要包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序。此外，存储器401可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件或其他非易失性固态存储器件。在一些实例中，存储器401进一步包括相对于处理器402远程设置的存储器，这些远程存储器可以通过网络连接至设备。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
接收器403设置为进行信息接收；发送器404设置为根据处理器402的控制进行反馈信息的发送。
图34是本申请一实施例提供的用户设备的结构示意图，如图34所示，该用户设备500包括存储器501、处理器502、接收器403以及发送器404。存储器501、处理器502的数量可以是一个或多个，图34中以一个存储器501和一个处理器502为例；用户设备中的存储器501和处理器502可以通过总线或其他方式连接，图34中以通过总线连接为例。
存储器501作为一种计算机可读存储介质，可用于存储软件程序、计算机可执行程序以及模块，如本申请任一实施例提供的信息传输方法对应的程序指令/模块。处理器502通过运行存储在存储器501中的软件程序、指令以及模块实现上述信息传输方法。
存储器501可主要包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序。此外，存储器501可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件或其他非易失性固态存储器件。在一些实例中，存储器501进一步包括相对于处理器502远程设置的存储器，这些远程存储器可以通过网络连接至设备。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
接收器503设置为进行反馈信息的接收；发送器504设置为根据处理器502的控制进行传输块的发送。
本申请一实施例还提供了一种计算机可读存储介质，存储有计算机可执行指令，该计算机可执行指令用于执行如本申请任一实施例提供的信息传输方法。
本申请一实施例还提供了一种计算机程序产品，包括计算机程序或计算机指令，该计算机程序或计算机指令存储在计算机可读存储介质中，计算机设备的处理器从计算机可读存储介质读取计算机程序或计算机指令，处理器执行计算机程序或计算机指令，使得计算机设备执行如本申请任一实施例提供的信息传输方法。
本申请实施例描述的系统架构以及应用场景是为了更加清楚的说明本申请实施例的技术方案，并不构成对于本申请实施例提供的技术方案的限定，本领域技术人员可知，随着系统 架构的演变和新应用场景的出现，本申请实施例提供的技术方案对于类似的技术问题，同样适用。
本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、系统、设备中的功能模块/单元可以被实施为软件、固件、硬件及其适当的组合。
在硬件实施方式中，在以上描述中提及的功能模块/单元之间的划分不一定对应于物理组件的划分；例如，一个物理组件可以具有多个功能，或者一个功能或步骤可以由若干物理组件合作执行。某些物理组件或所有物理组件可以被实施为由处理器，如中央处理器、数字信号处理器或微处理器执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在计算机可读介质上，计算机可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、程序模块或其他数据)的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于RAM、ROM、EEPROM、闪存或其他存储器技术、CD-ROM、数字多功能盘(DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。此外，本领域普通技术人员公知的是，通信介质通常包含计算机可读指令、数据结构、程序模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据，并且可包括任何信息递送介质。
在本说明书中使用的术语“部件”、“模块”、“系统”等用于表示计算机相关的实体、硬件、固件、硬件和软件的组合、软件、或执行中的软件。例如，部件可以是但不限于，在处理器上运行的进程、处理器、对象、可执行文件、执行线程、程序或计算机。通过图示，在计算设备上运行的应用和计算设备都可以是部件。一个或多个部件可驻留在进程或执行线程中，部件可位于一个计算机上或分布在2个或更多个计算机之间。此外，这些部件可从在上面存储有各种数据结构的各种计算机可读介质执行。部件可例如根据具有一个或多个数据分组(例如来自于自与本地系统、分布式系统或网络间的另一部件交互的二个部件的数据，例如通过信号与其它系统交互的互联网)的信号通过本地或远程进程来通信。
以上参照附图说明了本申请的一些实施例，并非因此局限本申请的权利范围。本领域技术人员不脱离本申请的范围和实质内所作的任何修改、等同替换和改进，均应在本申请的权利范围之内。

Claims (30)

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

Applications Claiming Priority (2)

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

Publications (1)

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

Family

ID=89192170

Family Applications (1)

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

Country Status (2)

Country Link
CN (1) CN117279038A (zh)
WO (1) WO2023241284A1 (zh)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107409014A (zh) * 2015-01-28 2017-11-28 交互数字专利控股公司 用于操作大量载波的上行链路反馈方法
CN107872300A (zh) * 2016-09-28 2018-04-03 中兴通讯股份有限公司 反馈信息处理方法、装置及系统、基站、终端
CN109804698A (zh) * 2016-08-10 2019-05-24 瑞典爱立信有限公司 争用信道的数据传输技术
CN106576249B (zh) * 2015-07-29 2019-11-26 华为技术有限公司 反馈信息的发送装置、接收装置及方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107409014A (zh) * 2015-01-28 2017-11-28 交互数字专利控股公司 用于操作大量载波的上行链路反馈方法
CN106576249B (zh) * 2015-07-29 2019-11-26 华为技术有限公司 反馈信息的发送装置、接收装置及方法
CN109804698A (zh) * 2016-08-10 2019-05-24 瑞典爱立信有限公司 争用信道的数据传输技术
CN107872300A (zh) * 2016-09-28 2018-04-03 中兴通讯股份有限公司 反馈信息处理方法、装置及系统、基站、终端

Also Published As

Publication number Publication date
CN117279038A (zh) 2023-12-22

Similar Documents

Publication Publication Date Title
US10673566B2 (en) Determining DCI format
CN111373689B (zh) 在无线通信系统中发送和接收无线信号的方法和设备
US10638495B2 (en) Terminal apparatus, base station apparatus, and integrated circuit
US9661619B2 (en) Multiplexing of channel state information and hybrid automatic repeat request—acknowledgement information
EP2880802B1 (en) Multiplexing of channel state information and hybrid automatic repeat request - acknowledgement information
US11171748B2 (en) Indicating resources for transmitting modulation symbols
CN107113110B (zh) 控制信息的发送方法和通信设备
EP3709723B1 (en) Terminal device, base station device, and communication method
US20200389873A1 (en) Terminal apparatus, base station apparatus, and communication method
US11968599B2 (en) Method and apparatus for transmission and reception of groupcast and broadcast data in wireless cellular communication system
US11381351B2 (en) Terminal apparatus, base station apparatus, and communication method
JP2017527179A (ja) カバレッジの拡張における必要なｈａｒｑ繰り返し数の伝達
US8514745B2 (en) Method of indicating number of antennas in network broadcast system
US11785566B2 (en) Synchronization method and device for group casting in wireless communication system
US9031002B2 (en) Devices for sending and receiving feedback information
EP3711405A1 (en) Control transmission method and apparatus
CN111066273B (zh) 用户设备、基站和方法
US20190132106A1 (en) Uplink transmission method and apparatus
CN114731229A (zh) 用于确定单次harq-ack码本的方法及设备
US9031090B2 (en) Devices for sending and receiving feedback information
WO2023241284A1 (zh) 信息传输方法、装置、基站、设备、存储介质及程序产品
WO2023241286A1 (zh) 信息传输方法、装置、基站、设备、存储介质及程序产品
WO2023241287A1 (zh) 信息传输方法、装置、基站、设备、存储介质及程序产品
US20240172267A1 (en) Terminal devices, base station devices, and communication methods
US20240073894A1 (en) Method and apparatus for harq-ack codebook determination

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

Country of ref document: EP

Kind code of ref document: A1