CN115225197B

CN115225197B - Method and apparatus for wireless communication

Info

Publication number: CN115225197B
Application number: CN202110409884.6A
Authority: CN
Inventors: 张晓博
Original assignee: Shanghai Langbo Communication Technology Co Ltd
Current assignee: Shanghai Langbo Communication Technology Co Ltd
Priority date: 2021-04-16
Filing date: 2021-04-16
Publication date: 2024-01-23
Anticipated expiration: 2041-04-16
Also published as: CN115225197A

Abstract

The invention discloses a method and a device for wireless communication. A first node receives a first wireless signal carrying a first bit sequence comprising a plurality of bit subsets; transmitting first signaling, the first signaling being used to indicate at least one subset of bits of the plurality of subsets of bits; receiving a second wireless signal, wherein the first signaling is used for determining a bit set carried by the second wireless signal; wherein, for any bit in the plurality of bit subsets where a preamble bit exists, the position of at least one bit subset of the plurality of bit subsets, to which the preamble bit belongs, in the first bit sequence is located before the any bit, and the preamble bit is one bit, which is located before the any bit in the first bit sequence and which belongs to any bit subset of the plurality of bit subsets, different from the any bit. The method and the device can improve retransmission efficiency.

Description

Method and apparatus for wireless communication

Technical Field

The present invention relates to methods and apparatus in a wireless communication system, and more particularly to schemes and apparatus for data retransmission in a wireless communication system.

Background

HARQ (Hybrid Automatic Repeat reQuest ) is a common method in wireless communication systems, and is effective in improving transmission efficiency compared to conventional ARQ (Automatic Repeat reQuest ). One drawback of HARQ, however, is that even if only a small number of bits have transmission errors, the entire Transport Block (Transport Block) needs to be retransmitted; in order to further improve retransmission efficiency, in an NR (New Radio) system, CBG (Code Block Group) based retransmission is introduced, i.e., one transport Block is divided into a plurality of CBGs, and an independent CRC (Cyclic Redundancy Check ) is generated for each CBG, and retransmission is performed with CBG as a minimum unit.

Disclosure of Invention

The inventors have found through research that a further challenge may be faced in future mobile communications based on transport block or CBG retransmissions. For example, a receiver decoding error may result from interference on a particular time-frequency resource, while a transport block or CBG based retransmission cannot be directed to interference on a particular time-frequency resource; furthermore, under some new network topologies, the sender of the retransmission signal may not be limited to the sender of the original signal, and the sender of the retransmission signal may not be able to send the retransmission signal when the transport block or CBG is not decoded correctly.

In view of the above, the present application discloses a solution. The present application can be used in a scenario in which the sender of the retransmission signal is not the sender of the initial signal, or in a scenario in which the sender of the retransmission signal is not the sender of the initial signal. Embodiments and features of embodiments in any node of the present application may be applied to any other node without conflict. The embodiments of the present application and features in the embodiments may be combined with each other arbitrarily without conflict.

The application discloses a method in a first node used for wireless communication, comprising:

receiving a first wireless signal, the first wireless signal carrying a first bit sequence, the first bit sequence comprising a plurality of bit subsets;

transmitting first signaling, the first signaling being used to indicate at least one subset of bits of the plurality of subsets of bits;

receiving a second wireless signal, wherein the first signaling is used for determining a bit set carried by the second wireless signal;

wherein each bit in the bit set carried by the second wireless signal corresponds to a bit in the first bit sequence; for any one bit of the plurality of bit subsets in which a leading bit exists, the position of at least one bit subset of the plurality of bit subsets to which the leading bit belongs in the first bit sequence is located before the any one bit, and the leading bit is one bit of any one bit subset of the plurality of bit subsets in which the position in the first bit sequence is located before the any one bit and is different from the any one bit; any one bit subset of the plurality of bit subsets belongs to a set formed by all bits in the first bit sequence, wherein the set is used for influencing one check equation, the product of a row vector and a first column vector of the one check equation is zero, the row vector of the one check equation is one row vector of a channel coding check matrix for generating the first bit sequence, any element of the channel coding check matrix for generating the first bit sequence is 0 or 1, and any bit in the first bit sequence belongs to the first column vector.

As an embodiment, the first bit sequence is obtained after at least some bits in a transport block have undergone at least channel coding and rate matching.

As an embodiment, if 1 bit in the first column vector corresponds to element 1 in a row vector in one check equation, the 1 bit in the first column vector affects the one check equation; if 1 bit in the first column vector corresponds to element 0 in a row vector in one check equation, the 1 bit in the first column vector does not affect the one check equation.

As an embodiment, the rate matching comprises bit selection.

As an embodiment, the rate matching comprises bit interleaving.

As a sub-embodiment of the foregoing embodiment, the first radio signal is an output after the first bit sequence passes through a modulation Mapper (Modulation Mapper), a Layer Mapper (Layer Mapper), a Precoding (Precoding), a resource element Mapper (Resource Element Mapper), and a wideband symbol Generation (Generation) in order.

As a sub-embodiment of the foregoing embodiment, the first radio signal is an output of the first bit sequence after passing through at least a modulation mapper, a resource element mapper, and a wideband symbol occurrence in order.

As an embodiment, the wideband symbol comprises an OFDM (orthogonal frequency division multiplexing) symbol.

As an embodiment, the wideband symbol comprises a DFT-S-OFDM (fourier spread orthogonal frequency division multiplexing) symbol.

In the above method, the first bit sequence is obtained after (rather than before) channel coding, and thus, the sender of the second wireless signal is not limited to the sender of the first signal, nor is it necessary to decode the first wireless signal correctly.

As an embodiment, the channel coding is based on a linear block code.

As an embodiment, the channel coding is based on LDPC (Low Density Parity Check Code ).

As an embodiment, the channel coding is based on a Turbo code.

As an embodiment, the channel coding is based on Polar (Polar) codes.

As one embodiment, the first signaling is used to determine the second wireless signal, which can effectively improve the decoding performance of the receiver; especially when the likelihood ratios of the subsets of bits affecting the same check equation are unreliable, e.g. due to bursty interference, or channel deep fading, etc.

In particular, according to one aspect of the invention, the method in the first node used for wireless communication is characterized by comprising:

Channel coding is performed in conjunction with the first wireless signal and the second wireless signal.

As an embodiment, the above channel decoding is the inverse of the channel coding used to generate the first bit sequence, and the specific channel decoding algorithm is implementation dependent (i.e. does not need to be standardized) for the first node.

As one embodiment, the act of performing channel coding in conjunction with the first wireless signal and the second wireless signal comprises: the first node firstly performs first channel decoding on the bit set carried by the second wireless signal, and then performs second channel decoding on the first wireless signal by using correctly decoded bits; the second wireless signal is obtained after at least channel coding of the bit set carried by the second wireless signal.

As a sub-embodiment of the foregoing embodiment, the second radio signal is obtained after at least channel coding, rate matching, and modulation are sequentially performed on the bit set carried by the second radio signal.

As a sub-embodiment of the foregoing embodiment, the second radio signal is an output after the bit set carried by the second radio signal is sequentially subjected to Channel Coding (Channel Coding), scrambling (Scrambling), modulation Mapper (Modulation Mapper), layer Mapper (Layer Mapper), precoding (Precoding), resource element Mapper (Resource Element Mapper), and wideband symbol Generation (Generation).

As a sub-embodiment of the foregoing embodiment, the second radio signal is an output after the bit set carried by the second radio signal is sequentially subjected to channel coding, scrambling, modulation mapper, layer mapper, conversion precoder (transform precoder) for generating a complex-valued signal, precoding, resource element mapper, and wideband symbol occurrence.

Classical algorithms that may be adopted for any of the above-described channel decoding, the first channel decoding, the second channel decoding include probabilistic Belief Propagation (BP) algorithms as well as various simplified BP algorithms, log Likelihood Ratio (LLR) BP algorithms, iterative APP (APosteriori Probability, posterior probability) algorithms, weighted bit flipping algorithms (WBF, weighted Bit Flipping), and the like.

As an embodiment, in the second channel coding, the set of bits carried by the second radio signal is used to initialize a probability that a bit in the corresponding first bit sequence is 0 or 1.

As a sub-embodiment of the above embodiment, in the second channel decoding, the first wireless signal is used to initialize a probability that a bit in the corresponding first bit sequence is 0 or 1.

As one embodiment, the act of performing channel coding in conjunction with the first wireless signal and the second wireless signal comprises: the first node firstly performs channel estimation and channel equalization on the second wireless signal, and then initializes the probability that the bit in the first bit sequence corresponding to the bit set carried by the second wireless signal is 0 or 1 by using the second wireless signal after channel equalization.

As a sub-embodiment of the foregoing embodiment, the second radio signal is obtained after at least rate matching and modulation are sequentially performed on the bit set carried by the second radio signal.

As a sub-embodiment of the foregoing embodiment, the second radio signal is an output after the bit set carried by the second radio signal sequentially passes through a Scrambling (Scrambling), a modulation Mapper (Modulation Mapper), a Layer Mapper (Layer Mapper), a Precoding (Precoding), a resource element Mapper (Resource Element Mapper), and a wideband symbol Generation (Generation).

As a sub-embodiment of the foregoing embodiment, the second radio signal is an output after the bit set carried by the second radio signal sequentially passes through a modulation mapper, a layer mapper, a conversion precoder (transform precoder) for generating a complex-valued signal, a precoding, a resource element mapper, and a wideband symbol occurrence.

receiving second signaling indicating, from the at least one of the plurality of bit subsets, a corresponding bit of the set of bits carried by the second wireless signal in the first bit sequence, or the second signaling indicating a first degree of reliability; the reliability of any bit in the bit set carried by the second wireless signal is not lower than the first reliability.

As one embodiment, the first confidence level is a quantized value of a probability domain, the first confidence level being not greater than 1 and not less than 0.

As an embodiment, the first confidence level is a quantized value of the logarithmic domain, and the first confidence level is not less than 0.

As an embodiment, the first confidence level assists the first node in calculating an initialization probability that the corresponding bit of the set of bits carried by the second wireless signal in the first bit sequence is 0 or 1.

In particular, according to an aspect of the present invention, the method in the first node used for wireless communication is characterized in that bits in the first bit sequence are mapped sequentially into available REs according to a rule of a first, RE group index second within a RE (Resource Element) group, the RE group including at least one RE.

As an embodiment, the first signaling indicates a first set of REs, any one of the at least one of the plurality of bit subsets being mapped to at least one RE of the first set of REs.

In particular, according to one aspect of the invention, the method in the first node used for wireless communication is characterized in that the check matrix used for generating the channel coding of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

The application discloses a method in a second node for wireless communication, comprising:

receiving first signaling, the first signaling being used to indicate at least one subset of bits of a plurality of subsets of bits, the plurality of subsets of bits belonging to the first bit sequence, the first bit sequence being carried by a first wireless signal;

Transmitting a second wireless signal, wherein the first signaling is used for determining a bit set carried by the second wireless signal;

In particular, according to one aspect of the invention, the method in the second node used for wireless communication is characterized by comprising:

and transmitting the first wireless signal.

the first wireless signal is received.

transmitting second signaling indicating, from the at least one of the plurality of bit subsets, a corresponding bit of the set of bits carried by the second wireless signal in the first bit sequence or indicating a first degree of reliability; the reliability of any bit in the bit set carried by the second wireless signal is not lower than the first reliability.

In particular, according to an aspect of the present invention, the method in the second node used for wireless communication is characterized in that bits in the first bit sequence are mapped sequentially into available REs according to a rule of a first, RE group index second within a RE group, the RE group including at least one RE.

In particular, according to one aspect of the invention, the method in the second node used for wireless communication is characterized in that the check matrix for generating the channel coding of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

In particular, according to one aspect of the present invention, the method in the second node used for wireless communication is characterized in that the check matrix for generating the channel code of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

The invention discloses a first node used for wireless communication, which comprises:

a first receiver that receives a first wireless signal, the first wireless signal carrying a first bit sequence, the first bit sequence comprising a plurality of bit subsets;

A first transmitter that transmits first signaling, the first signaling being used to indicate at least one of the plurality of subsets of bits;

the first receiver receives a second wireless signal, and the first signaling is used for determining a bit set carried by the second wireless signal;

The invention discloses a second node used for wireless communication, which comprises:

a second receiver receiving first signaling, the first signaling being used to indicate at least one subset of bits of a plurality of subsets of bits, the plurality of subsets of bits belonging to the first bit sequence, the first bit sequence being carried by a first wireless signal;

a second transmitter that transmits a second wireless signal, the first signaling being used to determine a set of bits carried by the second wireless signal;

Drawings

Other features, objects and advantages of the present invention will become more apparent upon reading of the detailed description of non-limiting embodiments, made with reference to the following drawings in which:

fig. 1 shows a flow chart of transmitting a first wireless signal and a second wireless signal according to an embodiment of the invention;

FIG. 2 shows a schematic diagram of a network architecture according to one embodiment of the invention;

fig. 3 shows a schematic diagram of an embodiment of a radio protocol architecture of a user plane and a control plane according to an embodiment of the invention;

FIG. 4 shows a hardware block diagram of a communication node according to one embodiment of the invention;

FIG. 5 illustrates a transmission flow diagram between a first node and a second node according to one embodiment of the invention;

fig. 6 shows a transmission flow diagram between a first node and a second node according to a further embodiment of the invention;

FIG. 7 shows a schematic diagram of a first bit sequence according to one embodiment of the invention;

FIG. 8 shows a schematic diagram of mapping between RE groups, according to one embodiment of the invention;

FIG. 9 shows a schematic diagram of intra-RE group mapping, according to one embodiment of the invention;

Fig. 10 shows a flow chart of channel decoding in combination with a first wireless signal and a second wireless signal according to an embodiment of the invention;

FIG. 11 shows a block diagram of a processing arrangement for use in a first node according to an embodiment of the invention;

fig. 12 shows a block diagram of a processing arrangement for use in a second node according to an embodiment of the invention.

Detailed Description

The technical solution of the present application will be further described in detail with reference to the accompanying drawings, and it should be noted that, without conflict, the embodiments and features of the embodiments in the present application may be arbitrarily combined with each other.

Example 1

Embodiment 1 illustrates a flow chart for transmitting a first wireless signal and a second wireless signal according to one embodiment of the present application, as shown in fig. 1.

In embodiment 1, a first node 100 receives a first wireless signal in step 101, the first wireless signal carrying a first bit sequence, the first bit sequence comprising a plurality of bit subsets; transmitting first signaling in step 102, the first signaling being used to indicate at least one of the plurality of subsets of bits; receiving a second wireless signal in step 103, the first signaling being used to determine a set of bits carried by the second wireless signal;

In embodiment 1, each bit in the bit set carried by the second wireless signal corresponds to one bit in the first bit sequence; for any one bit of the plurality of bit subsets in which a leading bit exists, the position of at least one bit subset of the plurality of bit subsets to which the leading bit belongs in the first bit sequence is located before the any one bit, and the leading bit is one bit of any one bit subset of the plurality of bit subsets in which the position in the first bit sequence is located before the any one bit and is different from the any one bit; any one bit subset of the plurality of bit subsets belongs to a set formed by all bits in the first bit sequence, wherein the set is used for influencing one check equation, the product of a row vector and a first column vector of the one check equation is zero, the row vector of the one check equation is one row vector of a channel coding check matrix for generating the first bit sequence, any element of the channel coding check matrix for generating the first bit sequence is 0 or 1, and any bit in the first bit sequence belongs to the first column vector.

As an embodiment, the preamble bit is any one bit belonging to any one of the plurality of bit subsets, which is located before and different from the any one bit in the first bit sequence.

As an embodiment, the preamble bit is present in at least one bit of the plurality of bit subsets.

As an embodiment, the first signaling explicitly indicates the at least one of the plurality of subsets of bits.

As an embodiment, the first signaling implicitly indicates the at least one of the plurality of subsets of bits.

As an embodiment, any one of the plurality of bit subsets consists of all bits in the first bit sequence affecting a check equation.

As a sub-embodiment of the above embodiment, at least 2 bit subsets of the plurality of bit subsets comprise the same bit.

As an embodiment, any one of the plurality of bit subsets consists of all bits in the first bit sequence affecting a check equation and not belonging to the bit subset arranged before the Ren Yibi bit subset in the first bit sequence.

As a sub-embodiment of the above embodiment, there is no one bit belonging to 2 of the plurality of bit subsets at the same time.

As an embodiment, the first wireless signal and the second wireless signal are the same communication node, and each bit in the bit set carried by the second wireless signal is a corresponding bit in the first bit sequence.

As an embodiment, the first wireless signal and the second wireless signal are not the same communication node, and each bit in the bit set carried by the second wireless signal is a bit after a corresponding bit in the first bit sequence is subjected to hard decision.

As an embodiment, the first wireless signal and the second wireless signal are not the same communication node, and each bit in the bit set carried by the second wireless signal includes likelihood ratio information of a corresponding bit in the first bit sequence.

As a sub-embodiment of the foregoing embodiment, the plurality of bits in the bit set carried by the second wireless signal includes likelihood ratio information of the same bit in the first bit sequence.

As one embodiment, the check matrix for generating the channel code of the first bit sequence includes Q1 row vector groups, where Q1 is a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

As an embodiment, the plurality of bit subsets comprises Q1 bit subset groups, each of the Q1 bit subset groups comprising Q2 bit subsets; the Q1 subset of bits affects the Q1 set of row vectors, respectively.

As an embodiment, the first signaling indicates at least one subset of bits from the Q1 subset of bits.

As an embodiment, one advantage of the above embodiment is that the redundancy overhead of the first signaling is reduced.

As an embodiment, the first signaling indicates at least one bit subset group from the Q1 bit subset groups in a bit map manner, and each bit in the bit map corresponds to one bit subset group in the Q1 bit subset groups.

As an embodiment, any one of said at least one of said plurality of bit subsets is mapped onto at least one RE of said first set of REs.

As an embodiment, the number of bits included in at least one bit subset to which the preamble bits belong is not greater than the number of bits included in at least one bit subset to which the arbitrary bit belongs, and the number of bits included in at least 2 bit subsets among the plurality of bit subsets is different; alternatively, the number of row vectors of the check matrix for generating the channel code of the first bit sequence affected by the preamble bit is not smaller than the number of row vectors of the check matrix for generating the channel code of the first bit sequence affected by the arbitrary bit, and at least 1 bit in the plurality of bit subsets is different from the number of row vectors of the check matrix for generating the channel code of the first bit sequence affected by the corresponding preamble bit.

Example 2

Embodiment 2 illustrates a schematic diagram of a network architecture according to one embodiment of the present application, as shown in fig. 2. Fig. 2 illustrates V2X communication architecture under 5G NR (new radio, new air interface), LTE (Long-Term Evolution) and LTE-a (Long-Term Evolution Advanced, enhanced Long-Term Evolution) system architecture. The 5G NR or LTE network architecture may be referred to as 5GS (5 GSystem)/EPS (Evolved Packet System ) some other suitable terminology.

The V2X communication architecture of embodiment 2 includes UE (User Equipment) 201, UE241, ng-RAN (next generation radio access network) 202,5GC (5G Core Network)/EPC (Evolved Packet Core, evolved packet core) 210, hss (Home Subscriber Server )/UDM (Unified Data Management, unified data management) 220, proSe function 250, and ProSe application server 230. The V2X communication architecture may be interconnected with other access networks, but these entities/interfaces are not shown for simplicity. As shown, the V2X communication architecture provides packet-switched services, however, those skilled in the art will readily appreciate that the various concepts presented throughout this application may be extended to networks providing circuit-switched services or other cellular networks. The NG-RAN includes NR node bs (gnbs) 203 and other gnbs 204. The gNB203 provides user and control plane protocol termination towards the UE 201. The gNB203 may be connected to other gnbs 204 via an Xn interface (e.g., backhaul). The gNB203 may also be referred to as a base station, a base transceiver station, a radio base station, a radio transceiver, a transceiver function, a Basic Service Set (BSS), an Extended Service Set (ESS), a TRP (transmit receive node), or some other suitable terminology. The gNB203 provides the UE201 with an access point to the 5GC/EPC210. Examples of UE201 include a cellular telephone, a smart phone, a Session Initiation Protocol (SIP) phone, a laptop, a Personal Digital Assistant (PDA), a satellite radio, a non-terrestrial base station communication, a satellite mobile communication, a global positioning system, a multimedia device, a video device, a digital audio player (e.g., MP3 player), a camera, a game console, an drone, an aircraft, a narrowband internet of things device, a machine-type communication device, a land-based vehicle, an automobile, a wearable device, or any other similar functional device. Those of skill in the art may also refer to the UE201 as a mobile station, a subscriber station, a mobile unit, a subscriber unit, a wireless unit, a remote unit, a mobile device, a wireless communication device, a remote device, a mobile subscriber station, an access terminal, a mobile terminal, a wireless terminal, a remote terminal, a handset, a user agent, a mobile client, a client, or some other suitable terminology. gNB203 is connected to 5GC/EPC210 through an S1/NG interface. The 5GC/EPC210 includes MME (Mobility Management Entity )/AMF (Authentication Management Field, authentication management domain)/SMF (Session Management Function ) 211, other MME/AMF/SMF214, S-GW (Service Gateway)/UPF (userplaneflection) 212, and P-GW (Packet Date Network Gateway, packet data network Gateway)/UPF 213. The MME/AMF/SMF211 is a control node that handles signaling between the UE201 and the 5GC/EPC210. In general, the MME/AMF/SMF211 provides bearer and connection management. All user IP (Internet Protocal, internet protocol) packets are transported through the S-GW/UPF212, which S-GW/UPF212 itself is connected to the P-GW/UPF213. The P-GW provides UE IP address assignment as well as other functions. The P-GW/UPF213 is connected to the internet service 230. Internet services 230 include operator-corresponding internet protocol services, which may include, in particular, the internet, intranets, IMS (IP Multimedia Subsystem ) and packet-switched streaming services. The ProSe function 250 is a logic function for network related behavior required for a ProSe (Proximity-based Service); including DPF (Direct Provisioning Function, direct provision function), direct discovery name management function (Direct Discovery Name Management Function), EPC level discovery ProSe function (EPC-level Discovery ProSe Function), and the like. The ProSe application server 230 has the functions of storing EPC ProSe user identities, mapping between application layer user identities and EPC ProSe user identities, allocating ProSe-restricted code suffix pools, etc.

As an embodiment, the UE201 and the UE241 are connected through a PC5 Reference Point (Reference Point).

As an embodiment, the ProSe function 250 is connected to the UE201 and the UE241 through PC3 reference points, respectively.

As an embodiment, the ProSe function 250 is connected to the ProSe application server 230 via a PC2 reference point.

As an embodiment, the ProSe application server 230 is connected to the ProSe application of the UE201 and the ProSe application of the UE241 via PC1 reference points, respectively.

As an embodiment, the first node in the present application is the UE201, and the second node in the present application is the gNB203.

As an embodiment, the first node in the present application is the gNB203, and the second node in the present application is the UE201.

As an embodiment, the first node in the present application is the UE201, and the second node in the present application is the UE241.

As an embodiment, the first node in the present application is the UE241, and the second node in the present application is the UE201.

As an embodiment, the radio link between the UE201 and the UE241 corresponds to a Sidelink (SL) in the present application.

As an embodiment, the radio link from the UE201 to the NR node B is an uplink.

As an embodiment, the radio link from the NR node B to the UE201 is a downlink.

As an embodiment, the gNB203 is a macro cell (marcocelluar) base station.

As one example, the gNB203 is a Micro Cell (Micro Cell) base station.

As an embodiment, the gNB203 is a PicoCell (PicoCell) base station.

As an example, the gNB203 is a home base station (Femtocell).

As an embodiment, the gNB203 is a base station device supporting a large delay difference.

As an embodiment, the gNB203 is a flying platform device.

As one embodiment, the gNB203 is a satellite device.

Example 3

Embodiment 3 shows a schematic diagram of an embodiment of a radio protocol architecture according to one user plane and control plane of the present application, as shown in fig. 3. Fig. 3 is a schematic diagram illustrating an embodiment of a radio protocol architecture for the user plane 350 and the control plane 300, fig. 3 shows the radio protocol architecture for the control plane 300 for a first node device (RSU in UE or V2X, in-vehicle device or in-vehicle communication module) and a second node device (gNB, RSU in UE or V2X, in-vehicle device or in-vehicle communication module), or between two UEs, in three layers: layer 1, layer 2 and layer 3. Layer 1 (L1 layer) is the lowest layer and implements various PHY (physical layer) signal processing functions. The L1 layer will be referred to herein as PHY301. Layer 2 (L2 layer) 305 is above PHY301 and is responsible for the links between the first node device and the second node device and the two UEs through PHY301. The L2 layer 305 includes a MAC (Medium Access Control ) sublayer 302, an RLC (Radio Link Control, radio link layer control protocol) sublayer 303, and a PDCP (Packet Data Convergence Protocol ) sublayer 304, which terminate at the second node device. The PDCP sublayer 304 provides data ciphering and integrity protection, and the PDCP sublayer 304 also provides handover support for the first node device to the second node device. The RLC sublayer 303 provides segmentation and reassembly of data packets, retransmission of lost data packets by ARQ, and RLC sublayer 303 also provides duplicate data packet detection and protocol error detection. The MAC sublayer 302 provides mapping between logical and transport channels and multiplexing of logical channels. The MAC sublayer 302 is also responsible for allocating the various radio resources (e.g., resource blocks) in one cell among the first node devices. The MAC sublayer 302 is also responsible for HARQ operations. The RRC (Radio Resource Control ) sublayer 306 in layer 3 (L3 layer) in the control plane 300 is responsible for obtaining radio resources (i.e., radio bearers) and configuring the lower layers using RRC signaling between the second node device and the first node device. The radio protocol architecture of the user plane 350 includes layer 1 (L1 layer) and layer 2 (L2 layer), and the radio protocol architecture for the first node device and the second node device in the user plane 350 is substantially the same for the physical layer 351, the PDCP sublayer 354 in the L2 layer 355, the RLC sublayer 353 in the L2 layer 355, and the MAC sublayer 352 in the L2 layer 355 as the corresponding layers and sublayers in the control plane 300, but the PDCP sublayer 354 also provides header compression for upper layer data packets to reduce radio transmission overhead. Also included in the L2 layer 355 in the user plane 350 is an SDAP (Service Data Adaptation Protocol ) sublayer 356, the SDAP sublayer 356 being responsible for mapping between QoS flows and data radio bearers (DRBs, data Radio Bearer) to support diversity of traffic. Although not shown, the first node apparatus may have several upper layers above the L2 layer 355, including a network layer (e.g., IP layer) that terminates at the P-GW on the network side and an application layer that terminates at the other end of the connection (e.g., remote UE, server, etc.).

As an embodiment, the radio protocol architecture in fig. 3 is applicable to the first node in the present application.

As an embodiment, the radio protocol architecture in fig. 3 is applicable to the second node in the present application.

As an embodiment, the first signaling in the present application is generated in the PHY301.

As an embodiment, the first signaling in the present application is generated in the MAC sublayer 302.

As an embodiment, the first signaling in the present application is generated in the RRC sublayer 306.

As an embodiment, the channel coding for generating the first bit sequence is performed at the PHY301.

As one embodiment, the act of performing channel decoding in conjunction with the first wireless signal and the second wireless signal is performed at the PHY301.

As an embodiment, the second signaling in the present application is generated in the PHY301.

As an embodiment, the second signaling in the present application is generated in the MAC sublayer 302.

As an embodiment, the second signaling in the present application is generated in the RRC sublayer 306.

Example 4

Embodiment 4 shows a schematic diagram of hardware modules of a communication node according to an embodiment of the present application, as shown in fig. 4. Fig. 4 is a block diagram of a first communication device 450 and a second communication device 410 communicating with each other in an access network.

The first communication device 450 includes a controller/processor 459, a memory 460, a data source 467, a transmit processor 468, a receive processor 456, a multi-antenna transmit processor 457, a multi-antenna receive processor 458, a transmitter/receiver 454, and an antenna 452.

The second communication device 410 includes a controller/processor 475, a memory 476, a receive processor 470, a transmit processor 416, a multi-antenna receive processor 472, a multi-antenna transmit processor 471, a transmitter/receiver 418, and an antenna 420.

In the transmission from the second communication device 410 to the first communication device 450, upper layer data packets from the core network are provided to a controller/processor 475 at the second communication device 410. The controller/processor 475 implements the functionality of the L2 layer. In the transmission from the second communication device 410 to the first communication device 450, a controller/processor 475 provides header compression, encryption, packet segmentation and reordering, multiplexing between logical and transport channels, and radio resource allocation to the first communication device 450 based on various priority metrics. The controller/processor 475 is also responsible for retransmission of lost packets and signaling to the first communication device 450. The transmit processor 416 and the multi-antenna transmit processor 471 implement various signal processing functions for the L1 layer (i.e., physical layer). A transmit processor 416 performs channel coding and interleaving to facilitate Forward Error Correction (FEC) at the second communication device 410, as well as mapping of signal clusters based on various modulation schemes, e.g., binary Phase Shift Keying (BPSK), quadrature Phase Shift Keying (QPSK), M-phase shift keying (M-PSK), M-quadrature amplitude modulation (M-QAM). The multi-antenna transmit processor 471 digitally space-precodes the coded and modulated symbols, including codebook-based precoding and non-codebook-based precoding, and beamforming processing, to generate one or more spatial streams. A transmit processor 416 then maps each spatial stream to a subcarrier, multiplexes with reference signals (e.g., pilots) in the time and/or frequency domain, and then uses an Inverse Fast Fourier Transform (IFFT) to generate a physical channel carrying the time domain multicarrier symbol stream. The multi-antenna transmit processor 471 then performs transmit analog precoding/beamforming operations on the time domain multi-carrier symbol stream. Each transmitter 418 converts the baseband multicarrier symbol stream provided by the multiple antenna transmit processor 471 to a radio frequency stream and then provides it to a different antenna 420.

In a transmission from the second communication device 410 to the first communication device 450, each receiver 454 receives a signal at the first communication device 450 through its respective antenna 452. Each receiver 454 recovers information modulated onto a radio frequency carrier and converts the radio frequency stream into a baseband multicarrier symbol stream that is provided to a receive processor 456. The receive processor 456 and the multi-antenna receive processor 458 implement various signal processing functions for the L1 layer. A multi-antenna receive processor 458 performs receive analog precoding/beamforming operations on the baseband multi-carrier symbol stream from the receiver 454. The receive processor 456 converts the baseband multicarrier symbol stream after receiving the analog precoding/beamforming operation from the time domain to the frequency domain using a Fast Fourier Transform (FFT). In the frequency domain, the physical layer data signal and the reference signal are demultiplexed by the receive processor 456, wherein the reference signal is to be used for channel estimation, and the data signal is subjected to multi-antenna detection in the multi-antenna receive processor 458 to recover any spatial stream destined for the first communication device 450. The symbols on each spatial stream are demodulated and recovered in a receive processor 456 and soft decisions are generated. A receive processor 456 then deinterleaves and channel decodes the soft decisions to recover the upper layer data and control signals that were transmitted by the second communication device 410 on the physical channel. The upper layer data and control signals are then provided to the controller/processor 459. The controller/processor 459 implements the functions of the L2 layer. The controller/processor 459 may be associated with a memory 460 that stores program codes and data. Memory 460 may be referred to as a computer-readable medium. In the transmission from the second communication device 410 to the second node 450, the controller/processor 459 provides demultiplexing between transport and logical channels, packet reassembly, decryption, header decompression, control signal processing to recover upper layer data packets from the core network. The upper layer packets are then provided to all protocol layers above the L2 layer. Various control signals may also be provided to L3 for L3 processing.

In the transmission from the first communication device 450 to the second communication device 410, a data source 467 is used at the first communication device 450 to provide upper layer data packets to a controller/processor 459. Data source 467 represents all protocol layers above the L2 layer. Similar to the transmit functions at the second communication device 410 described in the transmission from the second communication device 410 to the first communication device 450, the controller/processor 459 implements header compression, encryption, packet segmentation and reordering, and multiplexing between logical and transport channels based on radio resource allocations, implementing L2 layer functions for the user and control planes. The controller/processor 459 is also responsible for retransmission of lost packets and signaling to the second communication device 410. The transmit processor 468 performs channel coding, interleaving, modulation mapping, the multi-antenna transmit processor 457 performs digital multi-antenna spatial precoding, including codebook-based precoding and non-codebook-based precoding, and beamforming processing, and then the transmit processor 468 modulates the generated spatial stream into a multi-carrier/single-carrier symbol stream, which is analog precoded/beamformed in the multi-antenna transmit processor 457 before being provided to the different antennas 452 via the transmitter 454. Each transmitter 454 first converts the baseband symbol stream provided by the multi-antenna transmit processor 457 into a radio frequency symbol stream and provides it to an antenna 452.

In the transmission from the first communication device 450 to the second communication device 410, the function at the second communication device 410 is similar to the receiving function at the first communication device 450 described in the transmission from the second communication device 410 to the first communication device 450. Each receiver 418 receives radio frequency signals through its corresponding antenna 420, converts the received radio frequency signals to baseband signals, and provides the baseband signals to a multi-antenna receive processor 472 and a receive processor 470. The receive processor 470 and the multi-antenna receive processor 472 collectively implement the functions of the L1 layer. The controller/processor 475 implements L2 layer functions. The controller/processor 475 may be associated with a memory 476 that stores program codes and data. Memory 476 may be referred to as a computer-readable medium. In the transmission from the first communication device 450 to the second communication device 410, a controller/processor 475 provides demultiplexing between transport and logical channels, packet reassembly, decryption, header decompression, control signal processing to recover upper layer data packets from the UE 450. Upper layer packets from the controller/processor 475 may be provided to the core network.

As an embodiment, the first communication device 450 apparatus includes: at least one processor and at least one memory including computer program code; the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus of the first communication device 450 to at least: receiving a first wireless signal, the first wireless signal carrying a first bit sequence, the first bit sequence comprising a plurality of bit subsets; transmitting first signaling, the first signaling being used to indicate at least one subset of bits of the plurality of subsets of bits; receiving a second wireless signal, wherein the first signaling is used for determining a bit set carried by the second wireless signal; wherein each bit in the bit set carried by the second wireless signal corresponds to a bit in the first bit sequence; for any one bit of the plurality of bit subsets in which a leading bit exists, the position of at least one bit subset of the plurality of bit subsets to which the leading bit belongs in the first bit sequence is located before the any one bit, and the leading bit is one bit of any one bit subset of the plurality of bit subsets in which the position in the first bit sequence is located before the any one bit and is different from the any one bit; any one bit subset of the plurality of bit subsets belongs to a set formed by all bits in the first bit sequence, wherein the set is used for influencing one check equation, the product of a row vector and a first column vector of the one check equation is zero, the row vector of the one check equation is one row vector of a channel coding check matrix for generating the first bit sequence, any element of the channel coding check matrix for generating the first bit sequence is 0 or 1, and any bit in the first bit sequence belongs to the first column vector.

As an embodiment, the first communication device 450 includes: a memory storing a program of computer-readable instructions that, when executed by at least one processor, produce acts comprising: receiving a first wireless signal, the first wireless signal carrying a first bit sequence, the first bit sequence comprising a plurality of bit subsets; transmitting first signaling, the first signaling being used to indicate at least one subset of bits of the plurality of subsets of bits; a second wireless signal is received, the first signaling being used to determine a set of bits carried by the second wireless signal.

As an embodiment, the second communication device 410 apparatus includes: at least one processor and at least one memory including computer program code; the at least one memory and the computer program code are configured for use with the at least one processor. The second communication device 410 means at least: receiving first signaling, the first signaling being used to indicate at least one subset of bits of a plurality of subsets of bits, the plurality of subsets of bits belonging to the first bit sequence, the first bit sequence being carried by a first wireless signal; and transmitting a second wireless signal, wherein the first signaling is used for determining a bit set carried by the second wireless signal.

As an embodiment, the second communication device 410 apparatus includes: a memory storing a program of computer-readable instructions that, when executed by at least one processor, produce acts comprising: receiving first signaling, the first signaling being used to indicate at least one subset of bits of a plurality of subsets of bits, the plurality of subsets of bits belonging to the first bit sequence, the first bit sequence being carried by a first wireless signal; and transmitting a second wireless signal, wherein the first signaling is used for determining a bit set carried by the second wireless signal.

As an embodiment, the first communication device 450 corresponds to a first node in the present application.

As an embodiment, the second communication device 410 corresponds to a second node in the present application.

As an embodiment, the first communication device 450 is a UE.

As an embodiment, the first communication device 450 is a base station.

As an embodiment, the second communication device 410 is a UE.

As an embodiment, the second communication device 410 is a base station.

As an embodiment, the antenna 452, the receiver 454, the multi-antenna receive processor 458, the receive processor 456, the controller/processor 459 is configured to receive the first wireless signal.

As an embodiment, the antenna 452, the receiver 454, the multi-antenna receive processor 458, the receive processor 456, the controller/processor 459 is configured to receive the second wireless signal.

As an example, the antenna 420, the transmitter 418, the multi-antenna transmit processor 471, the transmit processor 416, the controller/processor 475 are used to transmit the first wireless signal.

As an example, the antenna 420, the transmitter 418, the multi-antenna transmit processor 471, the transmit processor 416, the controller/processor 475 are used to transmit the second wireless signal.

Example 5

Embodiment 5 illustrates a transmission flow diagram between a first node and a second node according to one embodiment of the present application, as shown in fig. 5. In fig. 5, the steps in block F1 are optional.

For the first node U1, receiving a first wireless signal in step S101, the first wireless signal carrying a first bit sequence comprising a plurality of bit subsets; transmitting first signaling in step S102, the first signaling being used to indicate at least one of the plurality of subsets of bits; receiving second signaling from said at least one of said plurality of subsets of bits indicating a corresponding bit of said set of bits carried by said second wireless signal in said first sequence of bits in step S103; receiving a second wireless signal in step S104, wherein the first signaling is used to determine a set of bits carried by the second wireless signal;

For the second node U2, transmitting the first wireless signal in step S201; receiving the first signaling in step S202; transmitting the second signaling in step S203; transmitting the second wireless signal in step S204;

in embodiment 5, each bit in the set of bits carried by the second wireless signal corresponds to a bit in the first bit sequence; for any one bit of the plurality of bit subsets in which a leading bit exists, the position of at least one bit subset of the plurality of bit subsets to which the leading bit belongs in the first bit sequence is located before the any one bit, and the leading bit is one bit of any one bit subset of the plurality of bit subsets in which the position in the first bit sequence is located before the any one bit and is different from the any one bit; any one bit subset of the plurality of bit subsets belongs to a set formed by all bits in the first bit sequence, wherein the set is used for influencing one check equation, the product of a row vector and a first column vector of the one check equation is zero, the row vector of the one check equation is one row vector of a channel coding check matrix for generating the first bit sequence, any element of the channel coding check matrix for generating the first bit sequence is 0 or 1, and any bit in the first bit sequence belongs to the first column vector.

As an embodiment, the transport channel occupied by the first radio signal is DL-SCH (DownLink Shared CHannel ), and the transport channel occupied by the second radio signal is DL-SCH.

As an embodiment, the physical layer channel occupied by the first radio signal is PDSCH (Physical DownLink Shared CHannel ), and the physical layer channel occupied by the second radio signal is PDSCH.

As a sub-embodiment of the above two embodiments, the first node U1 receives the scheduling signaling of the first radio signal in the step S101, and the second node U2 sends the scheduling signaling of the first radio signal in the step S201, where the scheduling signaling of the first radio signal is DCI.

As a sub-embodiment of the above two embodiments, the first node U1 is a UE and the second node U2 is a gNB.

As a sub-embodiment of the two embodiments described above, the first signaling is sent on PUCCH (Physical Uplink Control CHannel ).

As a sub-embodiment of the two embodiments described above, the first signaling is sent on PUSCH (Physical Uplink Shared CHannel ).

As a sub-embodiment of the above two embodiments, the first signaling includes UCI (Uplink Control Signalling, uplink control information).

As a sub-embodiment of the above two embodiments, the second signaling includes a MAC CE (Control Element).

As a sub-embodiment of the two embodiments, the second signaling includes DCI (Downlink Control Signalling, downlink control information).

As an embodiment, the transport channel occupied by the first radio signal is UL-SCH (UpLink Shared CHannel, downlink shared channel), and the transport channel occupied by the second radio signal is UL-SCH.

As an embodiment, the physical layer channel occupied by the first radio signal is PUSCH (Physical UpLink Shared CHannel ), and the physical layer channel occupied by the second radio signal is PUSCH.

As a sub-embodiment of the above two embodiments, the first node U1 is a gNB and the second node U2 is a UE.

As a sub-embodiment of the two embodiments described above, the second signaling is sent on PUCCH.

As a sub-embodiment of the two embodiments described above, the second signaling is sent on PUSCH.

As a sub-embodiment of the above two embodiments, the second signaling includes UCI (Uplink Control Signalling, uplink control information).

As a sub-embodiment of the two embodiments, the first signaling includes a MAC CE.

As a sub-embodiment of the two embodiments, the first signaling includes DCI.

As an embodiment, the second signaling includes scheduling information of the second wireless signal.

Example 6

Embodiment 6 illustrates a transmission flow diagram between a first node and a second node according to yet another embodiment of the present application, as shown in fig. 6. In fig. 6, the steps in block F2 are optional.

For the first node U3, receiving a first wireless signal in step S301, the first wireless signal carrying a first bit sequence comprising a plurality of bit subsets; transmitting first signaling in step S302, the first signaling being used to indicate at least one of the plurality of subsets of bits; receiving second signaling indicating, from the at least one of the plurality of subsets of bits, a corresponding bit of the set of bits carried by the second wireless signal in the first bit sequence in step S303; receiving a second wireless signal in step S304, wherein the first signaling is used to determine a set of bits carried by the second wireless signal;

For the second node U4, receiving the first wireless signal in step S401; receiving the first signaling in step S402; transmitting the second signaling in step S403; transmitting a second wireless signal in step S404;

for the third node U5, transmitting the first wireless signal in step S501;

in embodiment 6, each bit in the set of bits carried by the second wireless signal corresponds to one bit in the first bit sequence; for any one bit of the plurality of bit subsets in which a leading bit exists, the position of at least one bit subset of the plurality of bit subsets to which the leading bit belongs in the first bit sequence is located before the any one bit, and the leading bit is one bit of any one bit subset of the plurality of bit subsets in which the position in the first bit sequence is located before the any one bit and is different from the any one bit; any one bit subset of the plurality of bit subsets belongs to a set formed by all bits in the first bit sequence, wherein the set is used for influencing one check equation, the product of a row vector and a first column vector of the one check equation is zero, the row vector of the one check equation is one row vector of a channel coding check matrix for generating the first bit sequence, any element of the channel coding check matrix for generating the first bit sequence is 0 or 1, and any bit in the first bit sequence belongs to the first column vector.

As an embodiment, all bits of the set of bits carried by the second wireless signal corresponding in the first bit sequence include at least one of the Q1 bit subset groups.

As an embodiment, the second signaling indicates the at least one of the Q1 bit subset groups from the bit subset groups indicated by the first signaling.

As an embodiment, the second signaling indicates at least one subset of bits from the subset of bits indicated by the first signaling in a bit map, each bit in the bit map corresponding to one of the subset of bits indicated by the first signaling.

As one embodiment, the second node U4 does not successfully decode the first bit sequence.

An advantage of the above embodiment is that even if the second node U4 fails to decode the first bit sequence correctly, a second wireless signal can be retransmitted to assist the first node U3 in improving decoding performance.

As an embodiment, all bits of the set of bits carried by the second wireless signal corresponding to the first bit sequence include any subset of bits indicated by the second signaling.

As an embodiment, a check equation affected by any one of the subset of bits in the set of any one of the subset of bits indicated by the second signaling is established.

As one embodiment, the reliability of any bit in the bit set carried by the second wireless signal is not lower than the first reliability.

The advantage of both embodiments described above is that the second node U4 only transmits bits that pass the check equation, reducing error transfer as much as possible.

As an embodiment, the second signaling indicates the first degree of confidence.

As one embodiment, the first confidence level is used to perform channel decoding in conjunction with the first wireless signal and the second wireless signal.

As an embodiment, the first confidence indicates an accuracy of hard decisions for at least one bit.

As an embodiment, the accuracy is a quantized value of a probability domain.

As an embodiment, the accuracy is a quantized value of the logarithmic domain.

As an embodiment, the first confidence level is greater than 0.5.

As an embodiment, the transport channel occupied by the first radio signal is DL-SCH, and the transport channel occupied by the second radio signal is SL-SCH (SideLink Shared CHannel ).

As an embodiment, the physical layer channel occupied by the first radio signal is PDSCH, and the physical layer channel occupied by the second radio signal is PSSCH (Physical Sidelink Shared CHannel ).

As a sub-embodiment of the above two embodiments, the first node U3 receives the scheduling signaling of the first radio signal in the step S301, and the second node U4 sends the scheduling signaling of the first radio signal in the step S401, where the scheduling signaling of the first radio signal is SCI.

As a sub-embodiment of the above two embodiments, the first node U3 is a UE, the second node U4 is a UE, and the third node U5 is a gNB.

As a sub-embodiment of the two embodiments described above, the first signaling is sent on a PSCCH (Physical Sidelink Control CHannel ).

As a sub-embodiment of the two embodiments described above, the first signaling is sent on a PSFCH (Physical Sidelink Feedback CHannel ).

As a sub-embodiment of the two embodiments described above, the first signaling is sent on the PSSCH.

As a sub-embodiment of the two embodiments, the first signaling includes SCI (Sidelink Control Signalling, sidelink control information).

As a sub-embodiment of the two embodiments, the second signaling includes SCI.

As an embodiment, the transport channel occupied by the first radio signal is UL-SCH, and the transport channel occupied by the second radio signal is UL-SCH.

As an embodiment, the physical layer channel occupied by the first radio signal is PUSCH, and the physical layer channel occupied by the second radio signal is PUSCH.

As a sub-embodiment of the above two embodiments, the first node U3 is a gNB, the second node U4 is a UE, and the third node U5 is a UE.

As a sub-embodiment of the two embodiments described above, the first signaling is sent on PDCCH.

As a sub-embodiment of the two embodiments, the first signaling is on PDSCH.

As a sub-embodiment of the two embodiments, the first signaling includes DCI.

As a sub-embodiment of the two embodiments, the second signaling includes a MAC CE.

As a sub-embodiment of the two embodiments, the second signaling includes UCI.

Example 7

Embodiment 7 illustrates a schematic diagram of a first bit sequence, as shown in fig. 7. In fig. 7, b0, b1, b2,..b 11 is a variable node (or bit node, left node), c0, c1,..c 7 is a check node (or function node, right node).

In example 7, suppose V ₁₁ ＝[b0，b1，b2，...，b11]Any one bit in the first bit sequence belongs to the V11; assume that a check matrix for generating channel codes of the first bit sequence is:

it should be noted that the above assumption is only made for convenience in explaining the technical solution described in the present application, and the first bit sequence and the corresponding check matrix in the present application are not limited to the above assumption.

The first column vector is V ₁₁ ^T Wherein the superscript T represents a transpose;

each check node corresponds to a check equation H _i V ₁₁ ^T =0 (i=1, 2,3,.,. 7), where row vector H _i Is the ith row of the H; the bits in the first bit sequence comprise 7 bit subsets, an i (i=1, 2,3,..7) th of the 7 bit subsets comprising H _i V corresponding to bit 1 in (a) ₁₁ ^T At least some of the bits in the sequence.

In embodiment 7, for any bit in the first bit sequence, for example, any bit in b7, [ b0, b1, b3, b5, b6] is a leading bit of b 7; for any bit of [ b0, b1, b3, b5, b6], all bits of the 7 bit subset including at least one bit subset precede the b 7: the 0 th bit subset (b 0, b 1) to which b0 belongs, the 2 nd bit subset (b 1, b4, b5, b 6) to which b1 belongs, the 2 nd bit subset (b 1, b4, b5, b 6) to which b3 belongs, the 1 st bit subset (b 0, b2, b 3) to which b5 belongs, and the 2 nd bit subset (b 1, b4, b5, b 6) to which b6 belongs all precede said b 7.

As an embodiment, an i (i=1, 2,3,) th (7) bit subset of the 7 bit subsets comprises H _i V corresponding to bit 1 in (a) ₁₁ ^T All bits in (a) are used.

As one embodiment, the first bit sequence is the V ₁₁ 。

As one embodiment, the first bit sequence is the V ₁₁ Is composed of partially consecutive bits.

Example 8

Embodiment 8 illustrates a schematic diagram of mapping between RE groups, as shown in fig. 8. In fig. 8, one square indicates one RE group, P (j) indicates one data modulation symbol (j=0, 1, 2., fm + m-1), one modulation symbol is mapped onto one RE, and the number of available REs on each RE group is m. The bits in the first bit sequence are modulated into a data modulation symbol sequence P (0), P (1), P (2), P (fm+m-1), the data modulation symbol sequence P (0), P (1), P (2), P (fm+m-1) according to the rule that the bits in the first bit sequence are mapped onto RE groups #0, #1, # f according to the first and second RE group indexes in RE groups.

As an embodiment, the behavior modulation employs QPSK (quadrature phase shift keying).

As an example, the behavior modulation employs 16QAM (quadrature amplitude modulation).

As an example, the behavior modulation employs 64QAM.

As an example, the behavior modulation uses 256QAM.

As an embodiment, the available REs do not include REs allocated to DMRSs (DeModulation Reference Signal, demodulation reference signals).

For one embodiment, the available REs do not include REs allocated to PRSs (Positioning Reference Signal, positioning reference signals).

As an embodiment, the available REs do not include REs allocated to CSI-RS (Channel Status Information Reference Signal, channel state information reference signal).

As an embodiment, the available REs do not include REs allocated to SRS (Sounding Reference Signal ).

As an embodiment, the available REs do not include REs allocated to PTRS (Phase Tracking Reference Signal ).

As a sub-embodiment of the above embodiment, when PTRS is included in one RE group, the number of mapped data modulation symbols is smaller than m, which is not shown in fig. 8, compared to RE groups not including PTRS.

As an embodiment, the number of wideband symbols occupied by the RE group in the time domain is indicated by the scheduling signaling of the first radio signal.

As one embodiment, the scheduling signaling of the first wireless signal is physical layer signaling.

As an embodiment, the resources occupied by the RE group in the time domain do not exceed 1 Slot (Slot).

As an embodiment, the resources occupied by the RE group in the time domain do not exceed 1 millisecond.

As an embodiment, the resources occupied by the RE group in the frequency domain do not exceed 1 RB (Resource Block).

As an embodiment, the RE group includes at least 1 RB in a frequency domain.

As an embodiment, the RE group belongs to one PRB (Physical Resource Block ).

As an embodiment, the RE group belongs to one PRB Pair (Pair).

As an embodiment, the first REs included in the RE group are mapped in order of frequency domain first and time domain second in the available REs in the RE group.

As an embodiment, the first REs included in the RE group are mapped in order of time-domain-first-frequency-domain among the available REs in the RE group.

As an embodiment, the available REs within one of the RE groups are allocated to one physical layer channel.

As an embodiment, the one physical layer channel is scheduled by the second signaling.

As an embodiment, the first signaling indicates at least one RE group from among RE groups occupied by the first radio signal, and the at least one subset of bits of the plurality of subsets of bits indicated by the first signaling includes a subset of bits mapped onto the at least one RE group.

Example 9

Embodiment 9 illustrates a schematic diagram of intra-RE group mapping according to one embodiment of the present application, as shown in fig. 9. In fig. 9, a small square identifies an RE, the numbers in the small square represent the index of REs within the RE group, and a thick line box identifies an RE group.

And generating a data modulation symbol sequence according to the first bit sequence, wherein the data modulation symbol sequence is mapped on available REs in sequence from small to large according to the indexes in the RE group.

As an embodiment, the X-axis and the Y-axis identify time and frequency, respectively, i.e. map in order of frequency domain first and time domain second.

As an embodiment, the X-axis and the Y-axis identify frequency and time, respectively, i.e. map in order of time domain first and frequency domain second.

Example 10

Embodiment 10 illustrates a flow chart for channel decoding in combination with a first wireless signal and a second wireless signal according to one embodiment of the present application, as shown in fig. 10.

In embodiment 10, the first node receives a second wireless signal in step S1101; performing initialization in step S1102, including initializing soft information for each information bit; performing check node-related information processing in step S1103, including calculating soft information of each check equation in the check matrix from soft information of each information bit; performing variable node-related information processing including updating soft information of each information bit according to soft information of each check equation in step S1104; performing a hard decision on the variable node in step S1105; in step S1106, it is determined whether the variable node after the hard decision passes the verification of the check matrix; if yes, go to step S1108, i.e. stop-decode is successful, if no, go to step S1107 to determine whether the maximum number of decodes is reached; if not, the process advances to step S1103, where stop-decoding fails if it arrives.

As one embodiment, the soft information is a Log Likelihood Ratio (LLR).

As an embodiment, the soft information is a probability.

As an embodiment, the sender of the second wireless signal performs hard decisions on at least one bit subset in the first bit sequence, bits after which the at least one bit subset after hard decisions are performed channel coding are used for generating the second wireless signal, and the step S1101 includes channel decoding the second wireless signal to recover the at least one bit subset after hard decisions.

As a sub-embodiment of the above embodiment, for a given hard-decision subsequent bit, in the step S1102, soft information of the corresponding information bit is set to be a product of r_1 and r_2, where r_1 is determined by the first node according to the first radio signal, and r_2 is determined according to a decision value of at least the given hard-decision subsequent bit.

As an embodiment, the second signaling is used to indicate the r_2.

As an embodiment, the soft information of each information bit is a probability, and the probability that each bit in the at least one bit subset after the hard decision is a "hard decision value" is set to r1 and the probability that each bit is a "1-hard decision value" is set to 1-r1 in step S1102.

As an embodiment, r1 is 1.

As an embodiment, the second signaling is used to indicate the r1.

As an embodiment, the reception quality of the modulation symbols including the hard decision bits in the first wireless signal received by the first node is used to determine the r1.

As an embodiment, the soft information of each information bit is a log likelihood ratio, and the soft information of each bit in the at least one bit subset after initializing the hard decision in step S1102 is: r2 (if "hard decision value" is 1), or-r 2 (if "hard decision value" is 0).

As an embodiment, the second signaling is used to indicate the r2.

As an embodiment, r2 is different for bits after different hard decisions.

As one embodiment, the soft information of each information bit includes soft information in a case where the I-th variable node (i=0, 1,2,., I-1) provides external information by other check nodes than the J-th check node (j=0, 1,2,., J-1); i and J are the number of variable nodes and the number of check nodes (i.e., the number of rows of the check matrix), respectively.

As one embodiment, the soft information satisfied by each check equation includes probability or log likelihood ratio satisfied by the j-th check equation in the case where the i-th variable node is 1 (or 0) and the current soft information of other variable nodes.

Example 11

Embodiment 11 illustrates a block diagram of a processing apparatus for use in a first node according to one embodiment of the present application; as shown in fig. 11. In fig. 11, a processing device 1600 in a first node includes a first receiver 1601 and a first transmitter 1602.

The first receiver 1601 receives a first wireless signal carrying a first bit sequence comprising a plurality of bit subsets; the first transmitter 1602 transmits first signaling, the first signaling being used to indicate at least one of the plurality of subsets of bits; the first receiver 1601 receives a second wireless signal, and the first signaling is used to determine a set of bits carried by the second wireless signal;

in embodiment 11, each bit in the bit set carried by the second wireless signal corresponds to one bit in the first bit sequence; for any one bit of the plurality of bit subsets in which a leading bit exists, the position of at least one bit subset of the plurality of bit subsets to which the leading bit belongs in the first bit sequence is located before the any one bit, and the leading bit is one bit of any one bit subset of the plurality of bit subsets in which the position in the first bit sequence is located before the any one bit and is different from the any one bit; any one bit subset of the plurality of bit subsets belongs to a set formed by all bits in the first bit sequence, wherein the set is used for influencing one check equation, the product of a row vector and a first column vector of the one check equation is zero, the row vector of the one check equation is one row vector of a channel coding check matrix for generating the first bit sequence, any element of the channel coding check matrix for generating the first bit sequence is 0 or 1, and any bit in the first bit sequence belongs to the first column vector.

As one embodiment, the first receiver performs channel decoding in conjunction with the first wireless signal and the second wireless signal.

As an embodiment, the first receiver receives second signaling indicating, from the at least one of the plurality of bit subsets, a corresponding bit of the set of bits carried by the second wireless signal in the first bit sequence, or the second signaling indicating a first degree of reliability; the reliability of any bit in the bit set carried by the second wireless signal is not lower than the first reliability.

As an embodiment, the bits in the first bit sequence are mapped to available REs in turn according to a rule of a first RE group index and a second RE group index in a RE group, where the RE group includes at least one RE.

As an embodiment, the check matrix used for generating the channel coding of the first bit sequence is H in section 5.3.2 of 3gpp ts38.212, i.e. by combining matrix H _BG Each element of (a) is replaced by a Z _c ×Z _c The first column vector is obtained from the matrix of TS38.212, section 5.3.2The first bit sequence is d in section 5.3 of TS38.212 ₀ ,d ₁ ,d ₂ ,...,d _N-1 And sequentially performing at least bit selection and bit interleaving.

As one embodiment, the bit selection is performed according to section 5.4.2.1 of TS38.212, after which the bit sequence e is obtained ₀ ,e ₁ ,e ₂ ,...,e _E-1 。

As one embodiment, Q1 is 46, and the Q1 row vectors respectively correspond to H _BG Q1 row vectors in (1), each row vector in the Q1 row vector group being defined by H _BG Each element of the corresponding row vector is replaced by a Z _c ×Z _c Obtained by a matrix of (a).

As an embodiment, in the bit interleaving, the bit sequence e ₀ ,e ₁ ,e ₂ ,...,e _E-1 No interleaving occurs within the blocks of bits corresponding to the same row vector group, only interleaving occurs between blocks of bits corresponding to different row vector groups.

As a sub-embodiment of the above embodiment, according to Table 5.3.2-2 in TS38.212, in the bit interleaving, bit blocks corresponding to element 1 in a row vector including the least element 1 are sequentially arranged at the forefront, and then bit blocks corresponding to element 1 in a reference row vector, which is one row vector having the least number of elements 1 that are not arranged in a row vector that is not arranged, are sequentially arranged; if a plurality of unordered row vectors have the same number of unordered elements 1, the row vector with the smallest row vector index is selected as the reference row vector.

As an embodiment, according to Table 5.3.2-2 in TS38.212, the output result of the bit interleaving is: bit sequence e ₀ ,e ₁ ,e ₂ ,...,e _E-1 The bit blocks in (a) are arranged in sequence according to the following indexes:

[0 1 26 6 8 49 17 62 10 67 7 41 14 47 4 29 2 32 18 45 1548 56 58 25 51 13 37 11 34 20 28 31 12 44 19 40 21 50 55 16 3639 65 3 22 27 38 46 53 57 61 24 30 52 54 64 5 9 23 33 35 4243 59 60 63 66]。

as an embodiment, the first node 1600 is a user equipment.

As one example, the first transmitter 1602 includes at least one of the antenna 452, the transmitter/receiver 454, the multi-antenna transmitter processor 457, the transmit processor 468, the controller/processor 459, the memory 460, and the data source 467 of fig. 4 of the present application.

As one example, the first transmitter 1602 includes an antenna 452, a transmitter/receiver 454, a multi-antenna transmitter processor 457, a transmit processor 468, a controller/processor 459, a memory 460, and a data source 467 of fig. 4 of the present application.

As one example, the first receiver 1601 includes at least the first five of the antenna 452, the receiver 454, the multi-antenna receive processor 458, the receive processor 456, the controller/processor 459, the memory 460, and the data source 467 of fig. 4 of the present application.

As an example, the first receiver 1601 includes at least the first four of the antenna 452, the receiver 454, the multi-antenna receive processor 458, the receive processor 456, the controller/processor 459, the memory 460, and the data source 467 of fig. 4 of the present application.

As an example, the first receiver 1601 includes at least the first three of the antenna 452, the receiver 454, the multi-antenna receive processor 458, the receive processor 456, the controller/processor 459, the memory 460, and the data source 467 of fig. 4 of the present application.

Example 12

Embodiment 12 illustrates a block diagram of a processing apparatus for use in a second node according to one embodiment of the present application; as shown in fig. 12. In fig. 12, the processing means 1700 in the second node comprises a second transmitter 1701 and a second receiver 1702.

The second receiver 1702 receives first signaling that is used to indicate at least one subset of bits of a plurality of subsets of bits, the plurality of subsets of bits belonging to the first bit sequence, the first bit sequence carried by a first wireless signal; the second transmitter 1701 transmits a second wireless signal, and the first signaling is used to determine a set of bits carried by the second wireless signal;

in embodiment 12, each bit in the set of bits carried by the second wireless signal corresponds to a bit in the first bit sequence; for any one bit of the plurality of bit subsets in which a leading bit exists, the position of at least one bit subset of the plurality of bit subsets to which the leading bit belongs in the first bit sequence is located before the any one bit, and the leading bit is one bit of any one bit subset of the plurality of bit subsets in which the position in the first bit sequence is located before the any one bit and is different from the any one bit; any one bit subset of the plurality of bit subsets belongs to a set formed by all bits in the first bit sequence, wherein the set is used for influencing one check equation, the product of a row vector and a first column vector of the one check equation is zero, the row vector of the one check equation is one row vector of a channel coding check matrix for generating the first bit sequence, any element of the channel coding check matrix for generating the first bit sequence is 0 or 1, and any bit in the first bit sequence belongs to the first column vector.

As an embodiment, the second transmitter 1701 transmits the first wireless signal.

As one embodiment, the second receiver 1702 receives the first wireless signal.

As an embodiment, the second transmitter transmits second signaling indicating, from the at least one of the plurality of bit subsets, a corresponding bit of the set of bits carried by the second wireless signal in the first bit sequence, or the second signaling indicating a first degree of reliability; the reliability of any bit in the bit set carried by the second wireless signal is not lower than the first reliability.

As an embodiment, the second node 1700 is a user equipment.

As an embodiment, the second node 1700 is a base station device.

As an example, the second transmitter 1701 includes the antenna 420, the transmitter 418, the transmit processor 416, and the controller/processor 475.

As an example, the second transmitter 1701 includes the antenna 420, the transmitter 418, the multi-antenna transmit processor 471, the transmit processor 416, and the controller/processor 475.

As an example, the second receiver 1702 includes the antenna 420, the receiver 418, the multi-antenna receive processor 472, the receive processor 470, and the controller/processor 475.

The second receiver 1702, as one embodiment, includes the controller/processor 475.

Those of ordinary skill in the art will appreciate that all or a portion of the steps of the above-described methods may be implemented by a program that instructs associated hardware, and the program may be stored on a computer readable storage medium, such as a read-only memory, a hard disk or an optical disk. Alternatively, all or part of the steps of the above embodiments may be implemented using one or more integrated circuits. Accordingly, each module unit in the above embodiment may be implemented in a hardware form or may be implemented in a software functional module form, and the application is not limited to any specific combination of software and hardware. User equipment, terminals and UEs in the present application include, but are not limited to, unmanned aerial vehicles, communication modules on unmanned aerial vehicles, remote control airplanes, aircraft, mini-planes, mobile phones, tablet computers, notebooks, vehicle-mounted communication devices, wireless sensors, network cards, internet of things terminals, RFID terminals, NB-IOT terminals, MTC (Machine Type Communication ) terminals, eMTC (enhanced MTC) terminals, data cards, network cards, vehicle-mounted communication devices, low cost mobile phones, low cost tablet computers, and other wireless communication devices. The base station or system device in the present application includes, but is not limited to, a macro cell base station, a micro cell base station, a home base station, a relay base station, a gNB (NR node B) NR node B, a TRP (Transmitter Receiver Point, transmitting and receiving node), and other wireless communication devices.

The foregoing description is only of the preferred embodiments of the present application and is not intended to limit the scope of the present application. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present application are intended to be included within the scope of the present application.

Claims

1. A first node for wireless communication, comprising:

2. The first node of claim 1, comprising:

the first receiver performs channel decoding in conjunction with the first wireless signal and the second wireless signal.

3. The first node according to claim 1 or 2, comprising:

the first receiver receiving second signaling indicating, from the at least one of the plurality of subsets of bits, a corresponding bit of the set of bits carried by the second wireless signal in the first bit sequence or the second signaling indicating a first degree of reliability; the reliability of any bit in the bit set carried by the second wireless signal is not lower than the first reliability.

4. A first node according to claim 1 or 2, characterized in that the bits in the first bit sequence are mapped sequentially into available REs according to a rule of a first, RE group index second within a RE group, the RE group comprising at least one RE.

5. A first node according to claim 3, characterized in that the bits in the first bit sequence are mapped sequentially into available REs according to a rule of a first, RE group index second within a RE group, the RE group comprising at least one RE.

6. The first node of claim 1 or 2, wherein the first signaling indicates a first set of REs, any one of the at least one of the plurality of subsets of bits being mapped to at least one RE of the first set of REs.

7. The first node of claim 3, wherein the first signaling indicates a first set of REs, any one of the at least one of the plurality of subsets of bits being mapped to at least one RE of the first set of REs.

8. The first node of claim 4, wherein the first signaling indicates a first set of REs, any one of the at least one of the plurality of subsets of bits being mapped to at least one RE of the first set of REs.

9. The first node of claim 5, wherein the first signaling indicates a first set of REs, and wherein any one of the at least one of the plurality of subsets of bits is mapped to at least one RE of the first set of REs.

10. The first node according to claim 1 or 2, wherein the check matrix for generating the channel coding of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

11. A first node according to claim 3, characterized in that the check matrix for generating the channel coding of the first bit sequence comprises Q1 sets of row vectors, Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

12. The first node of claim 4, wherein the check matrix for generating the channel code of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

13. The first node of claim 5, wherein the check matrix for generating the channel code of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

14. The first node of claim 6, wherein the check matrix for generating the channel code of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

15. The first node of claim 7, wherein the check matrix for generating the channel code of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

16. The first node of claim 8, wherein the check matrix for generating the channel code of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

17. The first node of claim 9, wherein the check matrix for generating the channel code of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

18. A second node for wireless communication, comprising:

a second receiver receiving first signaling, the first signaling being used to indicate at least one subset of bits of a plurality of subsets of bits, the plurality of subsets of bits belonging to a first bit sequence, the first bit sequence being carried by a first wireless signal;

19. The second node of claim 18, comprising:

the second transmitter transmits the first wireless signal, or

The second receiver receives the first wireless signal.

20. The second node according to claim 18 or 19, comprising:

the second transmitter transmits a second signaling;

wherein the second signaling indicates, from the at least one of the plurality of subsets of bits, a corresponding bit of the set of bits carried by the second wireless signal in the first bit sequence or the second signaling indicates a first degree of reliability; the reliability of any bit in the bit set carried by the second wireless signal is not lower than the first reliability.

21. The second node according to claim 18 or 19, characterized in that the bits in the first bit sequence are mapped sequentially into available REs according to a rule of a first, RE group index second within a RE group, the RE group comprising at least one RE.

22. The second node of claim 20, wherein the bits in the first bit sequence are mapped sequentially into available REs according to a rule of a first one of the RE groups and a second one of the RE group indexes, the RE group including at least one RE.

23. The second node of claim 18 or 19, wherein the first signaling indicates a first set of REs, any one of the at least one of the plurality of subsets of bits being mapped to at least one RE of the first set of REs.

24. The second node of claim 20, wherein the first signaling indicates a first set of REs, and wherein any one of the at least one of the plurality of subsets of bits is mapped to at least one RE of the first set of REs.

25. The second node of claim 21, wherein the first signaling indicates a first set of REs, and wherein any one of the at least one of the plurality of subsets of bits is mapped to at least one RE of the first set of REs.

26. The second node of claim 22, wherein the first signaling indicates a first set of REs, and wherein any one of the at least one of the plurality of subsets of bits is mapped to at least one RE of the first set of REs.

27. The second node according to claim 18 or 19, wherein the check matrix for generating the channel coding of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

28. The second node of claim 20, wherein the check matrix for generating the channel code of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

29. The second node of claim 21, wherein the check matrix for generating the channel code of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

30. The second node of claim 22, wherein the check matrix for generating the channel code of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

31. The second node of claim 23, wherein the check matrix for generating the channel code of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

32. The second node of claim 24, wherein the check matrix for generating the channel code of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

33. The second node of claim 25, wherein the check matrix for generating the channel code of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

34. The second node of claim 26, wherein the check matrix for generating the channel code of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

35. A method in a first node for wireless communication, comprising:

36. The method in the first node of claim 35, comprising:

37. A method in a first node according to claim 35 or 36, comprising:

receiving a second signaling;

38. The method according to claim 35 or 36, wherein the bits in the first bit sequence are mapped sequentially into available REs according to a rule of a first, RE group index second within a RE (Resource Element) group, the RE group comprising at least one RE.

39. The method of claim 37, wherein the bits in the first bit sequence are mapped sequentially into available REs according to a rule of a first, RE group index (RE) second within a RE (Resource Element) group, the RE group including at least one RE.

40. The method in the first node of claim 35 or 36, wherein the first signaling indicates a first set of REs, any one of the at least one of the plurality of subsets of bits being mapped to at least one RE of the first set of REs.

41. The method of claim 37, wherein the first signaling indicates a first set of REs, and wherein any one of the at least one of the plurality of subsets of bits is mapped to at least one RE of the first set of REs.

42. The method of claim 38, wherein the first signaling indicates a first set of REs, and wherein any one of the at least one of the plurality of subsets of bits is mapped to at least one RE of the first set of REs.

43. The method of claim 39, wherein the first signaling indicates a first set of REs, and wherein any one of the at least one of the plurality of subsets of bits is mapped to at least one RE of the first set of REs.

44. The method in the first node according to claim 35 or 36, wherein the check matrix for generating the channel coding of the first bit sequence comprises Q1 sets of row vectors, Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

45. The method in the first node of claim 37, wherein the check matrix used to generate the channel coding of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

46. The method in the first node of claim 38, wherein the check matrix used to generate the channel coding of the first bit sequence comprises Q1 sets of row vectors, the Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

47. The method of claim 39, wherein the check matrix for generating the channel code of the first bit sequence comprises a set of Q1 row vectors, wherein Q1 is a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

48. The method of claim 40, wherein the check matrix for generating the channel code of the first bit sequence comprises a set of Q1 row vectors, wherein Q1 is a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

49. The method of claim 41, wherein the check matrix for generating the channel code of the first bit sequence comprises a set of Q1 row vectors, wherein Q1 is a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

50. The method of claim 42, wherein the check matrix for generating the channel code for the first bit sequence comprises a set of Q1 row vectors, wherein Q1 is a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

51. The method of claim 43, wherein said check matrix for generating channel codes for said first bit sequence comprises a set of Q1 row vectors, said Q1 being a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

52. A method in a second node for wireless communication, comprising:

receiving first signaling, the first signaling being used to indicate at least one subset of bits of a plurality of subsets of bits, the plurality of subsets of bits belonging to a first bit sequence, the first bit sequence being carried by a first wireless signal;

53. The method in the second node of claim 52, comprising:

54. The method of claim 52 or 53, wherein bits in the first bit sequence are mapped sequentially into available REs according to a rule of a first one of the RE groups and a second one of the RE group indexes, the RE group including at least one RE.

55. The method of claim 52 or 53, wherein the check matrix used to generate the channel code for the first bit sequence comprises a set of Q1 row vectors, wherein Q1 is a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.

56. The method of claim 54, wherein the check matrix for generating the channel code for the first bit sequence comprises a set of Q1 row vectors, wherein Q1 is a positive integer greater than 1; each of the Q1 row vector groups includes Q2 row vectors, the Q2 being a positive integer greater than 1; for any two row vectors belonging to the same row vector group, one row vector can be obtained by circularly shifting the other row vector to the right by not more than Q2-1 times or circularly shifting the other row vector to the left by not more than Q2-1 times; the positions of at least Q2 bit subsets in the plurality of bit subsets in the first bit sequence are all located before any bit, the Q2 bit subsets affect Q2 check equations respectively, row vectors of the Q2 check equations form one row vector group in the Q1 row vector groups, and the Q2 bit subsets include a bit subset to which the leading bit belongs.