Communication method and communication apparatus

Abstract

A communication method and a communication apparatus are disclosed. In this method, a transmitter sends multiple timing versions of a first signal, including adjacent timing versions of the first signal and second timing versions of the first signal. The union of the data mapped by the two first signals on their respective corresponding first time-frequency resources includes all bits of a codeword sequence of length N. The first time-frequency resource is the resource corresponding to a first bandwidth among the time-frequency resources used to transmit the corresponding first signal. The first bandwidth is less than the bandwidth of the first signal. The first signal is a signal obtained by mapping a first codeword sequence of length E onto the time-frequency resources used to transmit the first signal, where E is the number of bits that the time-frequency resources used to transmit the first signal can carry. The first codeword sequence is obtained by rate matching a codeword sequence of length N, where N is the length of the parent code. This method can improve the decoding performance of narrowband scenarios and bandwidth-constrained devices.

Description

Technical Field

[0001] This application relates to the field of communications, and more specifically, to a communication method and a communication device. Background Technology

[0002] In communication systems, there are some terminals with limited receiving bandwidth that can only receive data within a narrow bandwidth. The loss of data outside the narrow bandwidth may lead to a loss of data decoding performance.

[0003] For example, to support some devices receiving physical broadcast channel (PBCH) data at 3 MHz and narrower bandwidths, according to the 3rd Generation Partnership Project (3GPP) Release(R) 18 requirement to retain the primary synchronization signals (PSS) and secondary synchronization signals (SSS) in the synchronization signaling block / physical broadcast channel (SSB / PBCH), in one possible implementation, a receiver with a receiving bandwidth of 12 physical resource blocks (PRBs) may not receive the PBCH data carried on the top four and bottom four PRBs of the SSB / PBCH block. This method results in a significant loss of PBCH performance. Summary of the Invention

[0004] Embodiments of this application provide a communication method and a communication device that can improve the decoding performance of narrowband scenarios and bandwidth-limited devices, thereby improving communication quality.

[0005] In a first aspect, a communication method is provided, which can be executed by a first communication device, which is a transmitting device. Unless otherwise specified, the term "transmitting device" in this application can refer to a transmitting device (e.g., a network device, a terminal device), a component in the transmitting device (e.g., a processor, a chip, or a chip system), or a logic module or software that can implement all or part of the functions of the transmitting device.

[0006] The method includes: acquiring a first codeword sequence of length E, wherein the first codeword sequence is obtained by rate matching of a codeword sequence of length N, where N is the length of the mother code, the codeword sequence of length N is obtained by polar code encoding based on information bits, E is the number of bits that the time-frequency resources used to transmit the first signal can carry, and the first signal is a signal obtained by mapping the first codeword sequence onto the time-frequency resources used to transmit the first signal; within L repetition periods of the first signal, sequentially transmitting L timing versions of the first signal, wherein the L timing versions include adjacent first timing versions and second timing versions, L is an integer greater than or equal to 2, the data mapped on the first time-frequency resources corresponding to the first signal of the first timing version is the first part of the corresponding first codeword sequence, the data mapped on the first time-frequency resources corresponding to the first signal of the second timing version is the second part of the corresponding first codeword sequence, the first time-frequency resources are the resources in the time-frequency resources used to transmit the first signal that correspond to the first bandwidth, the first bandwidth is less than the bandwidth of the first signal, the first part and the second part are different, and the union of the first part and the second part includes all bits of the codeword sequence of length N.

[0007] The above technical solution maps different portions of a coded bit sequence of length N to time-frequency resources (i.e., first time-frequency resources) within a first bandwidth (hereinafter referred to as in-band) corresponding to two adjacent time-series versions of the first signal. This allows the receiver to receive all bits of the codeword sequence of length N in two adjacent time-series versions when receiving the first signal with a bandwidth greater than or equal to the first bandwidth. In contrast, mapping the same portion of the codeword sequence of length N to the first time-frequency resources corresponding to the first signal in different time-series versions always results in the narrowband receiver only receiving a specific portion, leading to decoding performance loss. This solution improves the decoding performance in narrowband scenarios and for devices with limited bandwidth.

[0008] In some implementations of the first aspect, the number of bits that the first time-frequency resource can carry is X, where X is less than E. The first part includes the N0th bit to the mod(N0+X-1, N)th bit in a codeword sequence of length N, and the second part includes the mod(N0+i*N / 4, N)th bit to the mod(N0+i*N / 4+X-1, N)th bit in a codeword sequence of length N, where i is 1, 2, or 3.

[0009] The above technical solution provides a specific implementation method for mapping different parts of a codeword sequence of length N onto the first time-frequency resource corresponding to the first bandwidth of two adjacent timing versions of the first signal.

[0010] In some implementations of the first aspect, N0 is equal to 1, or N / 4, or N / 2, or 3*N / 4.

[0011] In some implementations of the first aspect, the first part is obtained from a codeword sequence of length N in a first order, and the second part is obtained from a codeword sequence of length N in a second order, wherein the first order and the second order are the same or different, and the first order is either sequential or reverse.

[0012] In the above technical solution, if the first order and the second order are sequential, the index of the starting point of the data mapped by the first signal of the first timing version within the first time-frequency resource corresponding to the first bandwidth differs from the index of the starting point of the data mapped by the first signal of the second timing version within the first time-frequency resource corresponding to the first bandwidth by an integer multiple of N / 4; if the first order and the second order are reversed, the index of the ending point of the data mapped by the first signal of the first timing version within the first time-frequency resource corresponding to the first bandwidth differs from the index of the ending point of the data mapped by the first signal of the second timing version within the first time-frequency resource corresponding to the first bandwidth by an integer multiple of N / 4. If the first sequence is sequential and the second sequence is reversed, the index of the start point of the data mapped by the first signal of the first time-series version within the first time-frequency resource corresponding to the first bandwidth differs from the index of the end point of the data mapped by the first signal of the second time-series version within the first time-frequency resource corresponding to the first bandwidth by an integer multiple of N / 4. If the first sequence is reversed and the second sequence is sequential, the index of the end point of the data mapped by the first signal of the first time-series version within the first time-frequency resource corresponding to the first bandwidth differs from the index of the start point of the data mapped by the first signal of the second time-series version within the first time-frequency resource corresponding to the first bandwidth by an integer multiple of N / 4. Furthermore, since the data mapped in-band by the two time-series versions has the above characteristics, there is also a correspondence between their decoding results. Therefore, the receiving end does not need to decode multiple times; only one decoding and two CRC checks are required to determine whether the current time-series version is the first or second time-series version, thereby reducing the complexity of blind detection at the terminal.

[0013] In some implementations of the first aspect, the number of bits that the first time-frequency resource can carry is E / 2, and both the first part and the second part include E / 2 bits.

[0014] In some implementations of the first aspect, the data mapped onto the second time-frequency resource in the time-frequency resources required to transmit the first signal of the first timing version is the second part, and the data mapped onto the second time-frequency resource in the time-frequency resources required to transmit the first signal of the second timing version is the first part. The second time-frequency resource is the remaining resource in the time-frequency resources required to transmit the first signal excluding the first time-frequency resource.

[0015] The above technical solution describes the characteristics of the out-of-band time-frequency resource mapping data for the first and second timing versions. Specifically, the data mapped by the first signal of the two timing versions in-band and out-of-band are exactly opposite. That is, the data mapped by the first timing version on in-band time-frequency resources is equal to the data mapped by the second timing version on out-of-band time-frequency resources, and the data mapped by the second timing version on in-band time-frequency resources is equal to the data mapped by the first timing version on out-of-band time-frequency resources.

[0016] In some implementations of the first aspect, the L timing versions also include a third timing version adjacent to the second timing version, wherein the data mapped on the first time-frequency resource in the time-frequency resource required to transmit the first signal of the third timing version is the reverse-order data of the first part.

[0017] In the above technical solution, the receiving end can receive the first signal of the second timing version and the first signal of the third timing version based on the first bandwidth, and can also receive the complete first signal (i.e., receive all bits of the codeword sequence of length N), thereby improving the decoding performance.

[0018] In some implementations of the first aspect, the L timing versions also include a fourth timing version adjacent to the third timing version, wherein the data mapped on the first time-frequency resource in the time-frequency resource required to transmit the first signal of the fourth timing version is the reverse-order data of the second part.

[0019] In the above technical solution, the receiving end can receive the first signal of the third and fourth timing versions based on the first bandwidth, and can also receive the complete first signal, thereby improving decoding performance. Furthermore, based on the above solution, narrowband devices with different bandwidth capabilities can receive the complete first signal (i.e., receive all bits in a codeword sequence of length N) by receiving different numbers of first signals. For example, if the receiving end receives the first signal with the first bandwidth, it only needs to receive the data of the first time-frequency resources corresponding to the first bandwidth on any two timing versions to receive the complete first signal; if the receiving end receives the first signal with the first bandwidth, it only needs to receive the data of the first time-frequency resources corresponding to the first bandwidth on any four adjacent timing versions to receive the complete first signal.

[0020] In some implementations of the first aspect, the number of bits that the first time-frequency resource can carry is X, where X is less than E. The first part includes the first X bits of a codeword sequence of length N, and the second part includes the last X bits of a codeword sequence of length N. The first part is obtained from the codeword sequence of length N in a first order, and the second part is obtained from the codeword sequence of length N in a second order. The first order and the second order are different, and the first order is either sequential or reverse.

[0021] In the above technical solution, the first part consists of all the remaining bits after puncturing the last (NX) bits of a codeword sequence of length N, and the second part consists of all the remaining bits after puncturing the first (NX) bits of a codeword sequence of length N. It can be seen that although the puncturing patterns of the first and second parts are different, they satisfy the characteristics of continuous and symmetrical puncturing positions. Furthermore, based on the above characteristics, there is a corresponding relationship between the decoding results of the two timing versions. Therefore, the receiving end does not need to decode multiple times; only one decoding and two CRC checks are required to distinguish whether the current timing version is the first or the second timing version, thereby reducing the complexity of blind detection at the terminal.

[0022] In some implementations of the first aspect, X = E / 2, the data mapped on the second time-frequency resource corresponding to the first signal of the first timing version is the second part, the data mapped on the second time-frequency resource corresponding to the first signal of the second timing version is the first part, and the second time-frequency resource is the remaining resource in the time-frequency resource required to transmit the first signal excluding the first time-frequency resource.

[0023] In some implementations of the first aspect, the first codeword sequence corresponding to the first timing version and the second timing version is obtained by repeating a codeword sequence of length N, and the second part is the remaining part of the first codeword sequence excluding the first part. Both the first part and the second part include E / 2 bits.

[0024] In the above technical solution, the first part can be seen as all the bits remaining after puncturing the second part of the codeword sequence of length N, and the second part is all the bits remaining after puncturing the first part of the codeword sequence of length N. That is, the puncture positions corresponding to the data mapped by the first signals of the two timing versions on the in-band time-frequency resources are exactly complementary. It can be understood that the puncture position here refers to the puncture position of the mapped data compared to the puncture position corresponding to the codeword sequence of length N.

[0025] In some implementations of the first aspect, the first signal of the first timing version is a signal obtained by mapping the first codeword sequence to the time-frequency resources used to transmit the corresponding first signal in a first mapping manner, and the first signal of the second timing version is a signal obtained by mapping the second codeword sequence to the time-frequency resources used to transmit the corresponding first signal in a first mapping manner, wherein the second codeword sequence is obtained by bit interleaving the first codeword sequence.

[0026] In the above technical solution, by interleaving the first codeword sequence to obtain the second codeword sequence, and mapping the second codeword sequence using the same mapping method as the first codeword sequence, the first part of the first codeword sequence can be mapped to the second time-frequency resource corresponding to the first signal in the second timing version, and the second part of the first codeword sequence can be mapped to the first time-frequency resource corresponding to the first signal in the second timing version. Therefore, when the receiving end receives the first signal using the first bandwidth, it can receive all bits of the codeword sequence of length N in both the first and second timing versions, thereby improving decoding performance.

[0027] Secondly, a communication method is provided, which can be executed by a second communication device, which is a receiving device. Unless otherwise specified, the term "receiving device" in this application can refer to the receiving device itself (e.g., network device, terminal device), a component in the receiving device (e.g., processor, chip, or chip system), or a logic module or software that can implement all or part of the functions of the receiving device.

[0028] The method includes: receiving a first signal based on a second bandwidth, wherein the first signal is the first signal of any one of L timing versions corresponding to L repetition periods of the first signal, where L is an integer greater than or equal to 2, wherein the L timing versions include adjacent first timing versions and second timing versions, the data mapped on the first time-frequency resource corresponding to the first signal of the first timing version is the first part of the corresponding first codeword sequence of length E, and the data mapped on the first time-frequency resource corresponding to the first signal of the second timing version is the second part of the corresponding first codeword sequence of length E, where E is the number of bits that the time-frequency resource used to transmit the first signal can carry, and the first signal is the first codeword. The signal is obtained by mapping the codeword sequence to the time-frequency resources used to transmit the first signal. The first codeword sequence is obtained by rate matching of a codeword sequence of length N, where N is the length of the mother code. The codeword sequence of length N is obtained by polar code encoding based on information bits. The first time-frequency resource is the resource corresponding to the first bandwidth in the time-frequency resources used to transmit the first signal. The first bandwidth is less than the bandwidth of the first signal. The first part and the second part are different. The union of the first part and the second part includes all bits in the codeword sequence of length N. The decoding result is obtained based on the data carried on the third time-frequency resource, which is the time-frequency resource corresponding to receiving the first signal with the second bandwidth.

[0029] It is understandable that a narrowband receiver can only receive a portion of the first signal data with a fixed bandwidth. Since the mapping method of the first signal is the same for each timing version in the current scheme, the portion of the first signal data received by the narrowband receiver in any timing version is identical. This results in the narrowband receiver only receiving a specific part, leading to a loss of decoding performance. The method proposed in this scheme allows a receiver with first bandwidth capability to receive all bits of a codeword sequence of length N in two adjacent timing versions, i.e., to receive the complete first signal, thereby improving the decoding performance in narrowband scenarios and for bandwidth-constrained devices.

[0030] In some implementations of the second aspect, the number of bits that the first time-frequency resource can carry is X, where X is less than E. The first part includes the N0th bit to the mod(N0+X-1, N)th bit in a codeword sequence of length N, and the second part includes the mod(N0+i*N / 4, N)th bit to the mod(N0+i*N / 4+X-1, N)th bit in a codeword sequence of length N, where i is 1, 2, or 3.

[0031] In some implementations of the second aspect, N0 is equal to 1, or N / 4, or N / 2, or 3*N / 4.

[0032] In some implementations of the second aspect, the first part is obtained from a codeword sequence of length N in a first order, and the second part is obtained from a codeword sequence of length N in a second order. The first order may be the same as or different from the second order, and the first order may be sequential or reversed.

[0033] In some implementations of the second aspect, the number of bits that the first time-frequency resource can carry is E / 2, and both the first part and the second part include E / 2 bits.

[0034] In some implementations of the second aspect, the data mapped onto the second time-frequency resource in the time-frequency resources required to transmit the first signal of the first timing version is the second part, and the data mapped onto the second time-frequency resource in the time-frequency resources required to transmit the first signal of the second timing version is the first part. The second time-frequency resource is the remaining resource in the time-frequency resources required to transmit the first signal excluding the first time-frequency resource.

[0035] In some implementations of the second aspect, the L timing versions also include a third timing version adjacent to the second timing version, wherein the data mapped on the first time-frequency resource in the time-frequency resource required to transmit the first signal of the third timing version is the reverse-order data of the first part.

[0036] In some implementations of the second aspect, the second bandwidth is equal to the first bandwidth, and the decoding result is the message vector u′. The method further includes: performing a cyclic redundancy check (CRC) on the message vector u′; if the check passes, the received first signal is the first signal of the first timing version; if the check fails, the signal is based on the message vector u′*T. -1 Perform CRC check, or if the check passes, the received first signal is the first signal of the second timing version, wherein the first encoded bit sequence corresponding to the first signal of the first timing version is a codeword sequence of length N, and the second encoded bit sequence corresponding to the first signal of the second timing version is the sequence corresponding to the first encoded bit sequence cyclically shifted i*N / 4 bits to the right. The cyclic shift matrix corresponding to the transformation of the first encoded bit sequence to the second encoded bit sequence is P, T=G×P×G, where G is the polar code encoding matrix.

[0037] In the above technical solution, since the indices of the data mapped in the two timing versions differ by an integer multiple of N / 4, there is a correspondence between their decoding results. Therefore, the receiving end does not need to decode multiple times; it only needs to decode once and perform two CRC checks to determine whether the current timing version is the first or the second timing version. Furthermore, the complexity of CRC checking is far lower than that of decoding, thus this method can significantly reduce the detection complexity at the receiving end.

[0038] In some implementations of the second aspect, the number of bits that the first time-frequency resource can carry is X, where X is less than E. The first part includes the first X bits of a codeword sequence of length N, and the second part includes the last X bits of a codeword sequence of length N. The first part is obtained from the codeword sequence of length N in a first order, and the second part is obtained from the codeword sequence of length N in a second order. The first order and the second order are different, and the first order is either sequential or reverse.

[0039] In some implementations of the second aspect, X = E / 2, the data mapped on the second time-frequency resource in the time-frequency resources required to transmit the first signal of the first timing version is the second part, the data mapped on the second time-frequency resource in the time-frequency resources required to transmit the first signal of the second timing version is the first part, and the second time-frequency resource is the remaining resource in the time-frequency resources required to transmit the first signal excluding the first time-frequency resource.

[0040] In some implementations of the second aspect, the second bandwidth is equal to the first bandwidth, and the decoding result is the message vector u′. The method further includes: performing a cyclic redundancy check (CRC) on the message vector u′; if the check passes, the received first signal is the first signal of the first timing version; if the check fails, the signal is based on the message vector u′*T. -1Perform a CRC check, or, if the check passes, the received first signal is the first signal of the second timing version. The first coded bit sequence corresponding to the first signal of the first timing version is a codeword sequence of length N, and the second coded bit sequence corresponding to the first signal of the second timing version is the reverse sequence of the first coded bit sequence. The cyclic shift matrix corresponding to the transformation from the first coded bit sequence to the second coded bit sequence is P. 逆序 T = G × P 逆序 ×G, where G is the polar code encoding matrix.

[0041] In the above technical solution, since the puncture positions of the two timing versions within the corresponding time-frequency resources of the first bandwidth are continuous and symmetrical, there is also a correspondence between their decoding results. Therefore, the receiver does not need to decode multiple times; it only needs to decode once and perform two CRC checks to determine whether the current timing version is the first or the second timing version. In addition, the complexity of CRC check is much lower than that of decoding, so this method can significantly reduce the detection complexity at the receiver.

[0042] In some implementations of the second aspect, the first codeword sequence is obtained by repeating a codeword sequence of length N, and the second part is the remaining part of the first codeword sequence excluding the first part. Both the first part and the second part include E / 2 bits.

[0043] In some implementations of the second aspect, the first signal of the first timing version is a signal obtained by mapping the first codeword sequence to the time-frequency resources used to transmit the corresponding first signal in a first mapping manner, and the first signal of the second timing version is a signal obtained by mapping the second codeword sequence to the time-frequency resources used to transmit the corresponding first signal in a first mapping manner, wherein the second codeword sequence is obtained by bit interleaving the first codeword sequence.

[0044] In some implementations of the first or second aspect, the codeword sequence of length N is obtained by interleaving sub-blocks based on the mother code sequence of length N, or the codeword sequence of length N is the mother code sequence of length N.

[0045] In some implementations of the first or second aspect, the first signal is a signal carried by the physical broadcast channel PBCH, and the information bits are broadcast information carried on the PBCH.

[0046] In some implementations of the first or second aspect, transmitting the first signal includes: transmitting a synchronization signal / physical broadcast channel (SSB / PBCH) block, wherein the SSB / PBCH block includes the first signal.

[0047] In some implementations of the first or second aspect, the bandwidth of the SSB / PBCH block corresponds to 20 Physical Resource Blocks (PRBs), and the first bandwidth corresponds to the remaining 12 PRBs in the SSB / PBCH block excluding the top 4 PRBs and the bottom 4 PRBs. The bottom 4 PRBs are four consecutive PRBs, including the first PRB corresponding to the bandwidth of the SSB / PBCH block, and the top 4 PRBs are four consecutive PRBs, including the last PRB corresponding to the bandwidth of the SSB / PBCH block.

[0048] Thirdly, a communication apparatus is provided for performing the method provided by any of the above aspects or their implementations. Specifically, the apparatus may include units and / or modules for performing the method provided by any of the above aspects or their implementations, such as processing units and / or transceiver units.

[0049] In one implementation, the device is either a transmitting device or a receiving device. When the device is a transmitting device or a receiving device, the transceiver unit can be a transceiver, or an input / output interface, or a communication interface; the processing unit can be at least one processor. Optionally, the transceiver is a transceiver circuit. Optionally, the input / output interface is an input / output circuit.

[0050] In another implementation, the device is a chip, chip system, or circuit used in a transmitting or receiving device. When the device is a chip, chip system, or circuit used in a transmitting or receiving device, the transceiver unit can be an input / output interface, interface circuit, output circuit, input circuit, pin, or related circuit on the chip, chip system, or circuit; the processing unit can be at least one processor, processing circuit, or logic circuit.

[0051] Fourthly, a communication device is provided, comprising: a memory for storing a program; and at least one processor for executing the computer program or instructions stored in the memory to perform the method provided in any of the foregoing aspects or their implementations.

[0052] In one implementation, the device is either a transmitting device or a receiving device.

[0053] In another implementation, the device is a chip, chip system, or circuit used in a transmitting or receiving device.

[0054] Fifthly, a communication device is provided, comprising: at least one processor and a communication interface, wherein the at least one processor is configured to obtain a computer program or instructions stored in a memory via the communication interface to execute the method provided in any of the foregoing aspects or their implementations. The communication interface may be implemented in hardware or software.

[0055] In one implementation, the device also includes the memory. Alternatively, the memory and processor are integrated together.

[0056] Sixthly, a processor is provided for executing the methods provided in the above aspects.

[0057] Unless otherwise specified, or if it does not contradict its actual function or internal logic in the relevant description, the transmission and acquisition / reception operations involved in the processor can be understood as processor output and reception, input and other operations, or as transmission and reception operations performed by radio frequency circuits and antennas. This application does not limit them in this regard.

[0058] In a seventh aspect, a computer-readable storage medium is provided that stores program code for execution by a device, the program code including methods for performing any of the foregoing aspects or their implementations.

[0059] Eighthly, a computer program product containing instructions is provided, which, when run on a computer, causes the computer to perform the method provided in any of the foregoing aspects or their implementations.

[0060] Ninthly, a chip is provided, comprising a processor and a communication interface. The processor reads instructions stored in a memory through the communication interface and executes the methods provided in any of the above aspects or their implementations. The communication interface can be implemented in hardware or software.

[0061] Optionally, as one implementation, the chip also includes a memory storing computer programs or instructions. The processor executes the computer programs or instructions stored in the memory. When the computer programs or instructions are executed, the processor performs the methods provided by any of the above aspects or their implementations. Optionally, the memory and processor are integrated together.

[0062] When the method provided in this application is executed by a chip, this application does not limit the specific number of chips implementing the method. For example, it can be executed by one chip, or by two or more chips. Furthermore, when the number of chips implementing the method is two or more, the chip manufacturers are not limited; they can be from the same manufacturer or different manufacturers.

[0063] In a tenth aspect, a communication system is provided, comprising at least one of the transmitting end device or receiving end device described above. Attached Figure Description

[0064] Figure 1 This is a schematic diagram of the network architecture applicable to embodiments of this application.

[0065] Figure 2 This is a schematic diagram of the information transmission process.

[0066] Figure 3 This is a schematic diagram of the time-frequency structure of the SSB / PBCH block.

[0067] Figure 4 This is a schematic diagram of the structure of a PRB corresponding to a PBCH block.

[0068] Figure 5 This is a schematic flowchart of a communication method 500 provided in this application.

[0069] Figure 6 This is a schematic diagram of a codeword sequence of length N, where the first and Nth bits are connected end-to-end in a clockwise direction to form a loop.

[0070] Figures 7 to 12 This is a schematic diagram of PBCH data mapped on the corresponding first time-frequency resources in the first timing version and the second timing version of the first signal in Method 1 of this application.

[0071] Figure 13 This is a schematic diagram showing the PBCH data mapped on the first time-frequency resource corresponding to the in-band and the second time-frequency resource corresponding to the out-of-band for the four timing versions of SSB / PBCH blocks based on Method 1.

[0072] Figure 14 This is a schematic diagram of PBCH data mapped on the corresponding first time-frequency resources in the first timing version and the second timing version of the first signal in the second embodiment of this application.

[0073] Figure 15 This is a schematic diagram showing the PBCH data mapped on the first time-frequency resource corresponding to the four timing versions of SSB / PBCH blocks based on Method 2, and on the second time-frequency resource corresponding to the in-band and out-of-band versions.

[0074] Figure 16 This is a schematic diagram of PBCH data mapped on the corresponding first time-frequency resource in the first timing version and the second timing version of the first signal in the third embodiment of this application.

[0075] Figure 17 This is a schematic diagram showing the relationship between the frame containing the PBCH signal and the second-to-last and third-to-last bits in the SFN.

[0076] Figure 18 and Figure 19 This is a schematic block diagram of a communication device provided in an embodiment of this application. Detailed Implementation

[0077] To facilitate understanding of the embodiments of this application, the following points will be explained before introducing the embodiments of this application.

[0078] The terms "for indicating" or "instruction" can include both direct and indirect indication, or they can be explicit and / or implicit. The various numerical designations such as "first," "second," etc., are merely for descriptive convenience and are not intended to limit the scope of the embodiments of this application, such as distinguishing different messages or different information. The term "protocol" can refer to standard protocols in the field of communications, such as the Long Term Evolution (LTE) protocol, the New Radio (NR) protocol, and related protocols applied to future communication systems; this application does not limit this. Words such as "exemplary," "for example," "exemplarily," and "as (another) example" are used to indicate that something is an example, illustration, or description. Any embodiment or design described as "exemplary" in this application should not be construed as being more preferred or advantageous than other embodiments or designs. The terms "comprising," "including," "having," and variations thereof all mean "including but not limited to," unless otherwise specifically emphasized. "At least one" means one or more, and "more than one" means two or more. "At most one" means one or zero. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can mean: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, and c can mean: a, or, b, or, c, or, a and b, or, a and c, or, b and c, or, a, b, and c. Here, a, b, and c can be single or multiple. Descriptions involving network element A sending messages, information, or data to network element B, and network element B receiving messages, information, or data from network element A, aim to specify which network element the message, information, or data is to be sent to, without specifying whether they are sent directly or indirectly through other network elements. Descriptions such as “when…”, “under…”, “if”, and “if” all indicate that the device will take corresponding actions under certain objective circumstances. They are not time-limited, nor do they require the device to make a judgment action when implementing the action, nor do they imply any other limitations.

[0079] Furthermore, the network architecture and business scenarios described in the embodiments of this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0080] The following describes a communication system to which embodiments of this application can be applied.

[0081] The embodiments of this application can be applied to various communication systems, including but not limited to: 5th generation (5G) systems, LTE systems, Long Term Evolution-Advanced (LTE-A) systems, LTE Frequency Division Duplex (FDD) systems, LTE Time Division Duplex (TDD) systems, and future communication systems. Furthermore, they can be applied to device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, machine-to-machine (M2M) communication, machine-type communication (MTC), Internet of Things (IoT) communication systems, narrowband Internet of Things (NB-IoT) systems, or other communication systems. Moreover, they can be extended to similar wireless communication systems, such as Wireless-Fidelity (WiFi) and 3GPP-related communication systems, without limitation.

[0082] The communication system applicable to embodiments of this application may include one or more transmitting devices and one or more receiving devices. Optionally, one of the transmitting device and the receiving device may be a terminal device, and the other may be a network device. Optionally, both the transmitting device and the receiving device may be terminal devices. Optionally, both the transmitting device and the receiving device may be network devices.

[0083] Figure 1 This is a schematic diagram of the network architecture applicable to embodiments of this application. Figure 1 This is a schematic diagram illustrating one possible, non-limiting system. For example... Figure 1As shown, the network architecture includes a radio access network (RAN) 100. RAN 100 includes at least one network device (such as...). Figure 1 101a and 101b (collectively referred to as 110) and at least one terminal (such as Figure 1 102a-102j, collectively referred to as 102, are also included in this system architecture. Other RAN nodes may also be included, such as wireless relay devices and / or wireless backhaul devices. Figure 1 (Not shown in the image). Terminal 102 is connected to network device 101 wirelessly. For example, network device 101 is connected to the core network (not shown in the image) wirelessly or via wired connection. Figure 1 (Not shown in the diagram) Connection. The core network equipment in the core network and the network equipment 101 in RAN 100 can be different physical devices, or they can be the same physical device that integrates core network logical functions and radio access network logical functions.

[0084] RAN 100 can be a cellular system related to the 3rd Generation Partnership Project (3GPP), such as 4G, 5G mobile communication systems, or future communication systems. RAN 100 can also be an open RAN (O-RAN or ORAN), a cloud radio access network (CRAN), or a WiFi system. RAN 100 can also be a communication system that integrates two or more of the above systems.

[0085] The apparatus provided in this application embodiment can be applied to network device 101 or to terminal 102. It is understood that... Figure 1 This application only illustrates one possible communication system architecture that can be applied to an embodiment of the present application. In other possible scenarios, the communication system architecture may also include other devices.

[0086] Network device 101 is a node in a radio access network (RAN), also known as an access network device or an RAN node (or device). Network device 101 is used to help terminals achieve wireless access. Figure 1 The network devices 101 in the illustrated network architecture can be nodes of the same type or different types. In some scenarios, the roles of network devices 101 and terminals 102 are relative, for example, Figure 1Network element 102i can be a helicopter or a drone, and it can be configured as a mobile base station. For terminals 102j that access RAN 100 through network element 102i, network element 102i is a base station; however, for base station 101a, network element 102i is a terminal. Network device 101 and terminal 102 are sometimes referred to as communication devices, for example... Figure 1 Network elements 101a and 101b can be understood as communication devices with base station functions, while network elements 102a-102j can be understood as communication devices with terminal functions.

[0087] In one possible scenario, network equipment can be a base station, an evolved NodeB (eNodeB), a transmitting and receiving point (TRP), a transmitting point (TP), a next-generation NodeB (gNB), a base station in a future mobile communication system, a satellite, or an access point (AP) in a WiFi system, an integrated access and backhaul (IAB) node, or network equipment in a mobile switching center non-terrestrial network (NTN) communication system, meaning it can be deployed on high-altitude platforms or satellites. Network equipment can also be a macro base station (such as...). Figure 1 110a), micro base stations or indoor stations (such as Figure 1 The network device can be a relay node or donor node (as described in section 110b), or a wireless controller in a cloud radio access network (CRAN) scenario. It can also function as a base station in device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, drone communication, or machine-to-machine (M2M) communication. Optionally, the network device can also be a server, wearable device, vehicle, or in-vehicle equipment. For example, in vehicle-to-everything (V2X) technology, the access network device can be a roadside unit (RSU).

[0088] In another possible scenario, multiple network devices collaborate to assist terminals in achieving wireless access, with each network device performing a portion of the base station's functions. For example, network devices can be central units (CUs), distributed units (DUs), CU-control plane (CPs), CU-user plane (UPs), or radio units (RUs), etc. CUs and DUs can be set up separately or included in the same network element, such as a baseband unit (BBU). RUs can be included in radio equipment or radio units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs). It is understood that network devices can be CU nodes, DU nodes, or devices comprising both CU and DU nodes. Furthermore, CUs can be classified as network devices in the access network (RAN) or the core network (CN), without limitation.

[0089] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an open-radio access network (O-RAN) system, CU can also be called O-CU (open CU), DU can also be called O-DU, CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software modules and hardware modules.

[0090] In this embodiment, the form of the network device is not limited. The device used to implement the function of the network device can be the network device itself, or it can be a device that supports the network device in implementing the function, such as a chip system. The device can be installed in the network device or used in conjunction with the network device.

[0091] Terminal equipment 102, also known as user equipment (UE), mobile station (MS), mobile terminal (MT), etc., is a device used to provide voice or data connectivity to users, and can also be an Internet of Things (IoT) device. For example, terminal equipment includes handheld devices with wireless connectivity, vehicle-mounted devices, etc. Currently, terminal devices can include: mobile phones, tablets, laptops, PDAs, mobile internet devices (MIDs), wearable devices (such as smartwatches, smart bracelets, pedometers, smart glasses, etc.), in-vehicle equipment (such as cars, bicycles, electric vehicles, airplanes, ships, trains, high-speed trains, etc.), satellite terminals, virtual reality (VR) devices, augmented reality (AR) devices, point-of-sale (POS) machines, customer-premises equipment (CPE), light user equipment (UE), reduced capability user equipment (REDCAP UE), wireless terminals in industrial control, smart home devices (such as refrigerators, televisions, air conditioners, electricity meters, etc.), intelligent robots, robotic arms, workshop equipment, wireless terminals in autonomous driving, wireless terminals in telemedicine, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, or wireless terminals in smart homes, and flying equipment (such as intelligent robots, hot air balloons, drones, airplanes), etc. Terminal devices can also be vehicle devices, such as vehicle devices, vehicle modules, vehicle chips, on-board units (OBUs) or telematics boxes (T-BOXs). Terminal devices can also be other devices with terminal functions. For example, a terminal device can also be a device that performs terminal functions in D2D communication.

[0092] The embodiments of this application do not limit the form of the terminal device. The device used to implement the functions of the terminal device can be the terminal device itself, or it can be a device that supports the terminal device in implementing the functions, such as a chip system. The device can be installed in the terminal device or used in conjunction with the terminal device. In the embodiments of this application, the chip system can be composed of chips, or it can include chips and other discrete devices. All or part of the functions of the terminal device in this application can also be implemented by software functions running on hardware, or by virtualization functions instantiated on a platform (such as a cloud platform).

[0093] Furthermore, the embodiments of this application can be applied to various application scenarios, such as high-throughput scenarios, high-reliability scenarios, low-latency scenarios, high-reliability low-latency scenarios, or low-power scenarios. Among them, high-throughput scenarios can be, for example, enhanced mobile broadband (eMBB) scenarios, high-reliability low-latency scenarios can be, for example, URLLC (ultrareliable low-latency communication) scenarios, and low-power scenarios can be, for example, M2M scenarios, MTC scenarios, or IoT scenarios.

[0094] Figure 2 This is a diagram illustrating the information transmission process. For example... Figure 2 As shown, information is sent from the source, undergoes source coding, channel coding, modulation, air interface transmission, demodulation, channel decoding, and source recovery before reaching the destination, completing the transmission of information from the source to the destination. Among these processes, Figure 2 The upper-layer processing (including source coding, channel coding, and modulation) is performed at the transmitting end device, while the lower-layer processing (including demodulation, channel decoding, and source recovery) is performed at the receiving end device. The embodiments of this application mainly relate to... Figure 2 The diagram shows source coding, channel coding, channel decoding, and source recovery.

[0095] To facilitate understanding of this application, the current NR PBCH channel coding process is described below. This process mainly includes the following steps.

[0096] 1) Physical Broadcast Channel Payload Generation (PBCH)

[0097] A 32-bit PBCH payload is generated, including 24 bits of master information block (MIB) bits and 8 bits of timing-related bits added at the physical layer. The 32 bits of the PBCH payload have different uses and different reliability requirements for the polar codes. After the payload is generated, it needs to be interleaved. Two layers of interleaving are performed on these 32 bits to obtain the interleaved payload bit sequence. The purpose of payload interleaving is to interleave the four timing-related key bits in the 32-bit payload to the first four positions for decoding the header.

[0098] 2) Net load scrambling

[0099] The payload generated in step 1) is scrambled, but the synchronization signaling block index (SSBI), half-frame indicator bit, and the second-to-last and third-to-last least significant bits (LSBs) of the system frame number in the 32-bit static payload are not scrambled. All other payload bits are scrambled, and the scrambling sequence is related to the second-to-last and third-to-last LSBs of the system frame number and the physical cell identity (PCI). The advantage of this approach is that it can potentially reduce decoding complexity. That is, if the current PBCH can be successfully decoded without soft-merging with other timing versions of the PBCH, only one decoding operation is needed, and the original payload bit sequence can be recovered by generating a mask based on the decoded payload bits.

[0100] 3) TB-CRC cascading (Transport block CRC attachment)

[0101] The scrambled sequence in 2) is then encoded using TB-CRC, with a length of L = 24. It can be understood that the scrambled sequence in 2) is concatenated with a 24-bit CRC, resulting in a CRC codeword of length 56.

[0102] 4) Channel coding

[0103] Before encoding, the 56-bit CRC codeword in step 3) is interleaved using distributed cyclic redundancy check (DCRC). It can be understood that since a 24-bit CRC is concatenated after PBCH payload interleaving, the DCRC interleaver length is 56. Then, the 56-bit DCRC interleaved sequence is polar encoded, outputting a mother code sequence of length 512, where 512 is the mother code length of the Polar code.

[0104] 5) Rate matching

[0105] The output mother code sequence in step 4) is divided into 32 sub-blocks and the sub-blocks are interleaved. Based on the interleaved sub-blocks, the interleaved bit sequence is y0~y511. Then, the first 352 bits of y0~y511 are concatenated (i.e., y0~y351 is concatenated) to obtain a codeword sequence of length 864 (i.e., the codeword sequence after rate matching).

[0106] It is understandable that the length of the codeword sequence after rate matching, 864, is determined based on the number of resource elements (REs) carrying PBCH in the current SSB / PBCH block, which will be explained in detail below and will not be elaborated here.

[0107] 6) Quadrature phase shift keying (QPSK) modulation

[0108] The 864-bit codeword sequence in step 5) is modulated into 432 QPSK symbols according to the following rules. Specifically, two adjacent bits b(2i) and b(2i+1) in the 864-bit codeword sequence are mapped to a single QPSK symbol.

[0109] 7) Resource mapping (mapping to physical resources)

[0110] The 432 symbols in 6) are mapped sequentially to the 432RE corresponding to PBCH in the SSB / PBCH block in the order of frequency domain first and time domain second.

[0111] Figure 3 This is a schematic diagram of the time-frequency structure of the SSB / PBCH block. For example... Figure 3 As shown, the SSB / PBCH block consists of three parts: PSS, SSS, and PBCH. The SSB / PBCH block occupies a total of 4 orthogonal frequency division multiplexing (OFDM) symbols in the time domain and 240 subcarriers (corresponding to 20 PRBs) in the frequency domain. Specifically, the PSS occupies one OFDM symbol, the SSS occupies one OFDM symbol, and the PBCH occupies three OFDM symbols, with one OFDM symbol shared with the SSS.

[0112] In this system, the middle 127 REs of the first and third OFDM symbols carry the PSS and SSS, respectively. One RE occupies one OFDM symbol in the time domain and one subcarrier in the frequency domain. It can be understood that the PSS and SSS are only responsible for accessing the cell; all PSS and SSS within a cell are identical. Therefore, the terminal cannot determine the relative position of the SSB within a burst based on the PSS and SSS. Thus, the network needs to explicitly notify the terminal of this information. This information, along with other information required for accessing the cell, is mainly carried on the 56-bit payload of the PBCH, where 56 = 32 (PBCH payload) + 24 (CRC). Only by decrypting the payload in the PBCH can the remaining system information block (SIB) broadcast by the network be obtained. The PBCH is distributed across 20 PRB resources in the second to fourth OFDM symbols. The subcarrier indices corresponding to the PBCH on the second and fourth OFDM symbols are 0 to 239, and the subcarrier indices corresponding to the PBCH on the third symbol are 0 to 47 and 192 to 239.

[0113] Figure 4 This is a schematic diagram of a PRB carrying the PBCH. One PRB corresponds to 12 REs, which are divided into three equal parts. Each part contains four REs. One RE (25%) in each part is used to store the Physical Broadcast Channel-Demodulation Reference Signal (PBCH-DMRS), and the remaining three REs (75%) each store one symbol encoded and modulated by the PBCH (also called PBCH data). The position of the PBCH-DMRS is not fixed and needs to be determined based on the PCI obtained from the joint detection of the PSS and SSS. Its offset in each RE is equal to the Physical Cell Number modulo 4, and the offset can be 0, 1, 2, or 3. Figure 4 The diagram shows an offset of 1.

[0114] As shown above, based on the number of PRBs carrying PBCH data and the proportion of DMRS overhead in the SSB / PBCH block, the number of REs carrying PBCH data and the rate-matched length E can be obtained. Figure 3From the structure, we can see that the number of REs carrying PBCH data is 432, where 432 = 48 (total number of PRBs carrying PBCH = 20 + 4 + 4 + 20) * 12 (number of REs in one PRB) * 0.75 (PBCH percentage after removing DMRS overhead). Therefore, one RE carries one symbol sequence, and the number of bits contained in the QPSK modulation corresponding to the symbol sequence is 2 (which can also be understood as one symbol sequence including two PBCH data). The length E after rate matching is 864, where 864 = 48 (total number of PRBs carrying PBCH = 20 + 4 + 4 + 20) * 12 (number of REs in one PRB) * 0.75 (PBCH percentage after removing DMRS overhead) * 2 (number of bits contained in QPSK modulation).

[0115] Table 1 shows the mapping of the 432 symbols (or PBCH data) corresponding to the rate-matched 864-bit sequence in the above NR PBCH channel coding process to the 432 REs used to carry PBCH data in the SSB / PBCH block, in the order of frequency domain first and time domain second. In Table 1, taking a PBCH-DMRS position offset of 0 as an example, a cell with the same symbol length represents an RE. The values ​​in the unfilled cells in symbols 1 and 3 represent the subcarrier number of the current RE. Specifically, the REs with subcarrier numbers 56 to 182 in symbols 1 and 3 occupy the RE positions of the 127-length PSS and SSS sequences, respectively. The light gray and dark gray filled cells in symbols 2, 3, and 4 represent the REs occupied by PBCH data and PBCH-DMRS, respectively. It can be understood that the values ​​in the light gray filled cells represent the index values ​​of the encoded bits in the rate-matched Polar codeword sequence within the parent code sequence. For example, if the Polar codeword sequence after rate matching includes coded bit A, and the index value of coded bit A in the output mother code sequence is B, then the value corresponding to coded bit A in Table 1 is B.

[0116] Table 1

[0117]

[0118]

[0119]

[0120]

[0121]

[0122]

[0123]

[0124]

[0125] The 3GPP Release 18 protocol requires that the NR (Radio Frequency Registry) support narrowband spectrum applications below 5MHz. For example, to support narrowband scenarios below 3MHz, according to the requirement in Release 18 to retain the PSS (Plain Old Segment) and SSS (Simplified Segment), a receiver with a bandwidth of 12 PRBs does not receive the top and bottom four PRBs in the SSB / PBCH block. Specifically, it does not receive data on the REs corresponding to subcarrier numbers 1 to 47 and 192 to 239 in the cells corresponding to symbols 2 and 4 in Table 1. In other words, a receiver with a bandwidth of 12 PRBs can receive the PBCH data corresponding to the remaining 12 PRBs in the SSB / PBCH block (excluding the top and bottom four PRBs) in the bold box of Table 1. However, it can be seen that there is a large amount of duplicate PBCH data in the cells corresponding to symbols 2 and 4 in the bold box of Table 1. Specifically, the values ​​in the row corresponding to value 186 in symbol 2 and the row corresponding to value 191 in symbol 4 are the same. Furthermore, the PBCH data in the multiple rows following these two rows in symbols 2 and 4 are also identical. It is understandable that the receiving device cannot receive the PBCH data outside the bold box, and the PBCH data carried on symbols 2 and 4 within the bold box is mostly the same (i.e., for a transmitted sequence #1, the sequences carried on symbols 2 and 4 within the bold box are sequences that severely puncture sequence #1 (the number of punctured bits is large) and the puncture positions are basically the same). Therefore, the existing method will cause a significant loss in the decoding performance of the receiving device for PBCH. In a simple example, for a Polar code of length 8 {c1,c2,c3,c4,c5,c6,c7,c8}, narrowband devices or devices within the narrowband can only receive 6 bits of time-frequency resources. Using the current mapping method, the data mapped on these 6 bits within the band is {c1,c2,c3,c2,c3,c4}. From the receiver's perspective, this is equivalent to receiving two heavily punctured Polar codes: the first codeword is {c1,c2,c3}, and the second codeword is {c2,c3,c4}. These two codewords have a large number of overlapping bits (i.e., {c2,c3}). Both the first and second codewords have punctured 5 bits. Specifically, the first codeword is equivalent to puncturing away {c4,c5,c6,c7,c8}, and the second codeword is equivalent to puncturing away {c1,c5,c6,c7,c8}, resulting in a significant performance loss.

[0126] In view of this, this application provides a communication method that can effectively solve the above-mentioned technical problems. The embodiments of the method proposed in this application are described below.

[0127] Figure 5 This is a schematic flowchart of a communication method 500 provided in this application. The method includes the following steps.

[0128] It is understood that method 500 can be executed by a transmitting device and a receiving device. Unless otherwise specified, a device (transmitting device, receiving device) can refer to an equipment, a component in the transmitting device (e.g., a processor, chip, or chip system), or a logic module or software that can implement all or part of the device's functions.

[0129] S510, the transmitting device acquires the first codeword sequence of length E.

[0130] The first codeword sequence is obtained by rate matching of a codeword sequence of length N, where N is the length of the mother code. The codeword sequence of length N is obtained by polar code encoding based on information bits. E is the number of bits that the time-frequency resources used to transmit the first signal can carry. The first signal is the signal obtained by mapping the first codeword sequence onto the time-frequency resources used to transmit the first signal.

[0131] For example, if the first signal is a signal carried on the PBCH, then the information bits are the broadcast information carried on the PBCH, such as the PBCH payload, or the PBCH payload and CRC. This application does not limit the number of PBCH payloads. Here, "first signal" can also be understood as "signal transmitted on the PBCH".

[0132] For example, sending the first signal can be sending an SSB / PBCH block, which includes PBCH. Here, E represents the number of bits that the time-frequency resources used to send the first signal can carry; it can also be understood as the number of PBCH data bits that the REs used to carry PBCH data in the SSB / PBCH block can carry.

[0133] For example, the first signal is as follows Figure 3 The signal carried on the PBCH in the SSB / PBCH block shown is 864 bits E, if each PRB contains 12 subcarriers and the modulation method is QPSK modulation. This means that the time and frequency resources used to transmit the first signal can carry 864 bits. Here, 864 = 48(4+4+20+20)*12 (the number of REs corresponding to one PRB)*0.75 (the proportion of PBCH after removing DMRS overhead)*2 (the number of bits contained in QPSK modulation).

[0134] For example, the first signal is downlink control information (DCI) or DCI carried on the physical downlink control channel (PDCCH), such as a first-level DCI or a second-level DCI.

[0135] For example, in this application, a codeword sequence of length N is obtained by sub-block interleaving based on a mother code sequence of length N, or, the codeword sequence of length N is a mother code sequence of length N. That is to say, in this application, the mother code sequence can be sub-block interleaved to obtain a rate-matched codeword sequence based on the interleaved mother code sequence, or the mother code sequence can be obtained without sub-block interleaving, without any limitation. It can be understood that the mother code sequence refers to the codeword sequence directly output after polar code encoding without any other processing, and the length of the mother code sequence is a positive integer power of 2. For example, if the first signal is a signal carried on the PBCH, then its corresponding mother code sequence can be the mother code sequence of step 4) of the NR PBCH channel coding process described above.

[0136] It is understood that mapping codeword sequences to time-frequency resources in this application refers to modulating the codeword sequences and mapping the modulated symbol sequences to the corresponding time-frequency resources. This application does not restrict the modulation method. For example, the modulation method can be QPSK modulation. For single-carrier systems, the corresponding modulation order can be determined by looking up the modulation and coding scheme (MCS) table and using the scheduled MCS index; for multi-carrier systems, such as OFDM systems, there is no binary phase shift keying (BPSK) modulation. Further details will not be elaborated upon in subsequent sections.

[0137] S520, the transmitting device sequentially transmits L timing versions of the first signal within L repetition periods of the first signal, where L is an integer greater than or equal to 2. Correspondingly, the receiving device receives the first signal with a second bandwidth, and the received first signal is the first signal of any one of the L timing versions.

[0138] The L timing versions include adjacent first and second timing versions. The data mapped on the first time-frequency resource corresponding to the first signal of the first timing version is the first part of the first codeword sequence, and the data mapped on the first time-frequency resource corresponding to the first signal of the second timing version is the second part of the first codeword sequence. The first time-frequency resource corresponding to each timing version is the resource corresponding to the first bandwidth in the time-frequency resource used to transmit the first signal of the corresponding timing version. The first bandwidth is less than the bandwidth of the first signal. The first part and the second part are different but contain the same number of bits. The union of the first part and the second part includes all bits in a codeword sequence of length N. It can be seen that if the receiving end receives the first signal of the first timing version and the first signal of the second timing version with the first bandwidth, it can receive all bits in a codeword sequence of length N, thereby improving decoding performance.

[0139] It can be understood that the first signal sent in each of the L repetition cycles is the first signal of a timing version, that is, the L repetition cycles correspond to the first signal of the L timing versions.

[0140] It can also be understood that one timing version corresponds to one cycle. Therefore, the timing version can be used to indicate the information of the frame in which the corresponding first signal is located within the radio system frame. The name of the timing version in this application is not specifically limited. For example, if the first signal is a signal carried on the PBCH, then the timing version can also be called the static payload version.

[0141] It can also be understood that the first codeword sequences corresponding to the first signals of different timing versions are all obtained by rate matching based on codeword sequences of length N, but the first codeword sequences corresponding to the first signals of different timing versions are different. Therefore, obtaining the first codeword sequence in S510 includes: obtaining the first codeword sequence corresponding to the first signal of each of the L timing versions. However, there is no limitation on the time for obtaining the first codeword sequence corresponding to the first signal of each timing version.

[0142] It can also be understood that the time-frequency resources used to send the first signal of any of the L timing versions are different, but the size of the time-frequency resources used is the same.

[0143] It can also be understood that the number of bits that the first time-frequency resource can carry is equal to the number of bits included in the first part (second part). For example, if the number of bits that the first time-frequency resource can carry is X, then the first part (second part) includes X bits. Since the first bandwidth is less than the bandwidth of the first signal, X is less than E.

[0144] For example, the first bandwidth is the capacity bandwidth (or maximum capacity bandwidth) of at least one of the devices receiving the first signal, or the first bandwidth is the receiving bandwidth when at least one of the devices receiving the first signal is in power-saving mode.

[0145] The first and second parts are illustrated below with examples.

[0146] Method 1

[0147] If the first time-frequency resource can carry X bits, then both the first part and the second part include X bits. The first part includes the N0th bit to the mod(N0+X-1, N)th bit in a codeword sequence of length N, and the second part includes the mod(N0+i*N / 4, N)th bit to the mod(N0+i*N / 4+X-1, N)th bit in a codeword sequence of length N, where i is 1, 2, or 3, and the N0th bit is any bit in the codeword sequence of length N (i.e., N0 ranges from 1 to N). Here, mod(a, b) is the modulo operation, which is defined as: for any integers a and b, mod(a, b) represents the remainder after a is divided by b. For example, mod(7, 3) results in 1.

[0148] For ease of understanding, combined with Figure 6 The first and second parts will be explained. For example... Figure 6 As shown, the first bit and the Nth bit in a codeword sequence of length N are connected end to end in a clockwise direction to form a loop.

[0149] The first part includes proceeding clockwise in Figure 6 The first part reads X bits starting from the N0th bit. It can be understood that if (N0+X-1) is greater than N, then the first part includes the N0th bit to the Nth bit in the codeword sequence of length N, as well as the 1st bit to the mod(N0+X-1, N)th bit.

[0150] The second part includes proceeding clockwise in Figure 6 The first part reads X bits starting from the mod(N0+i*N / 4, N)th bit. Similarly, if (N0+i*N / 4+X-1) is greater than N, then the second part includes the N0th bit to the Nth bit in the codeword sequence of length N, as well as the 1st bit to the mod(N0+i*N / 4+X-1, N)th bit.

[0151] For example, N0 can be equal to 1, or N / 4, or N / 2, or 3*N / 4.

[0152] It is understood that the above only describes the range of X bits included in the first and second parts. The following examples illustrate the specific forms of the first and second parts.

[0153] Specific Form 1: The first part is in a clockwise direction... Figure 6The first part is a codeword sequence of length X read starting from the N0th bit. The second part is read in a clockwise direction. Figure 6 The codeword sequence of length X is read starting from the mod(N0+i*N / 4, N)th bit.

[0154] Specific Form Two: The first part is in a clockwise direction... Figure 6 The first part is a codeword sequence of length X read starting from the N0th bit. The second part is read in a counterclockwise direction. Figure 6 The codeword sequence of length X is read starting from the mod(N0+i*N / 4+X-1, N).

[0155] Specific Form Three: The first part is in a counter-clockwise direction... Figure 6 The first part is a codeword sequence of length X read starting from the mod(N0+X-1, N)th bit. The second part is a codeword sequence read clockwise. Figure 6 The codeword sequence of length X is read starting from the mod(N0+i*N / 4, N)th bit.

[0156] Specific Form Four: The first part is in a counter-clockwise direction... Figure 6 The first part is a codeword sequence of length X read starting from the mod(N0+X-1, N)th bit. The second part is read in a counterclockwise direction. Figure 6 The codeword sequence of length X is read starting from the mod(N0+i*N / 4+X-1, N).

[0157] It is understandable that after determining the data to be mapped on the first time-frequency resource, the transmitting end can map the corresponding part to the first time-frequency resource according to the predefined rule #1, starting from its starting point. For example, the predefined rule #1 is frequency domain first, then time domain. For example, in specific form one, the starting point of the first part is the N0th bit, that is, the first part is mapped to the first time-frequency resource starting from the N0th bit according to the rule of frequency domain first, then time domain.

[0158] The above only describes the data mapped to the first time-frequency resources of the first and second timing versions of the first signal. Below, based on X = E / 2, an example is given illustrating the data mapped to the corresponding second time-frequency resources of the first and second timing versions of the first signal. The second time-frequency resources are the remaining resources in the time-frequency resources required to transmit the first signal of the corresponding timing version, excluding the first time-frequency resources of that corresponding timing version. It can be understood that X = E / 2, meaning the number of bits that the first time-frequency resources corresponding to the first bandwidth can carry is E / 2, and both the first part and the second part include E / 2 bits. Furthermore, since the number of bits that the time-frequency resources required to transmit the first signal can carry is E, the number of bits that the second time-frequency resources corresponding to the first bandwidth can carry is also E / 2.

[0159] Specifically, the data mapped onto the second time-frequency resource corresponding to the first signal of the first timing version is the second part, and the data mapped onto the second time-frequency resource corresponding to the first signal of the second timing version is the first part. That is, the data mapped within and outside the first bandwidth for two adjacent timing versions are exactly opposite. Specifically, the first signal of the first timing version is the signal obtained by mapping the first part to the corresponding first time-frequency resource and mapping the second part to the corresponding second time-frequency resource; the first signal of the second timing version is the signal obtained by mapping the second part to the corresponding first time-frequency resource and mapping the first part to the corresponding second time-frequency resource.

[0160] Similarly, after determining the data that needs to be mapped on the second time-frequency resource corresponding to the first and second time-series versions, the transmitting end can map the corresponding part of the data from its starting point to the corresponding second time-frequency resource according to the predefined rule #1.

[0161] Optionally, if the transmitting end sequentially transmits the first signal in the first timing version, the second timing version, and the third timing version, in order for the receiving end to receive the first signal in the second timing version and the first signal in the third timing version based on the first bandwidth, and also to receive the complete first signal, the data mapped on the corresponding first time-frequency resource of the first signal in the third timing version can be: the reverse order data of the data mapped on the corresponding first time-frequency resource of the first signal in the first timing version (i.e., the reverse order data of the first part).

[0162] Optionally, if the transmitting end transmits the first signal of the third timing version and then transmits the first signal of the fourth timing version, in order to enable the receiving end to receive the complete first signal after receiving the first signal of the third timing version and the first signal of the fourth timing version based on the first bandwidth, the data mapped on the first time-frequency resource corresponding to the first bandwidth of the first signal of the fourth timing version can be the reverse data of the data mapped on the first time-frequency resource corresponding to the first bandwidth of the first signal of the second timing version (i.e., the reverse data of the second part).

[0163] The following example, based on X = E / 2, illustrates the data mapped to the corresponding second time-frequency resource for the first signal in the third and fourth timing versions.

[0164] Specifically, the data mapped on the second time-frequency resource in the time-frequency resource required to transmit the first signal of the third timing version is the reverse-order data of the second part, and the data mapped on the second time-frequency resource in the time-frequency resource required to transmit the first signal of the fourth timing version is the reverse-order data of the first part.

[0165] The first signal is used below. Figure 3The signal carried on the PBCH in the SSB / PBCH block shown is illustrated as an example of the first signal in the first and second timing versions. The specific values ​​of the parameters in the example below are: N0 = 1, N = 512, E = 864. The first bandwidth corresponds to the 12 PRBs in the middle of the SSB / PBCH block. If each PRB contains 12 subcarriers and the modulation method is QPSK modulation, then the number of bits that the first time-frequency resource corresponding to the first bandwidth can carry is X = E / 2 = 432, where 432 = 24 * (12 + 12) * 12 (the number of REs corresponding to one PRB) * 0.75 (the proportion of PBCH after removing DMRS overhead) * 2 (the number of bits contained in QPSK modulation).

[0166] Example 1

[0167] If i = 1, based on the specific form above, then as follows: Figure 7 As shown, the PBCH data (i.e., the first part of the first codeword sequence) mapped on the corresponding first time-frequency resource by the first signal of the first timing version is arranged in a clockwise direction. Figure 7 The first signal of the second timing version is a 432-bit codeword sequence (i.e., bits 1 to 432) read starting from the first bit; the PBCH data (i.e., the second part of the first codeword sequence) mapped on the corresponding first time-frequency resource is read in a clockwise direction. Figure 7 The codeword sequence of length 432 is read starting from the 129th (1+N / 4)th bit (i.e., bits 129 to 512, and bits 1 to 48).

[0168] Alternatively, it can be understood that the first signal of the first timing version is obtained by mapping 432 bits to the corresponding first time-frequency resource in a clockwise direction, starting from the first bit of a codeword sequence with a length of 512 as the transmission starting point; the first signal of the second timing version is obtained by mapping 432 bits to the corresponding first time-frequency resource in a clockwise direction, starting from the 129th bit of a codeword sequence with a length of 512 as the transmission starting point.

[0169] As can be seen, in this example, the starting points of the first and second parts are 90° out of phase.

[0170] Example 2

[0171] If i = 2, based on the specific form above, then as follows: Figure 8 As shown, the PBCH data mapped to the first signal of the first timing version on the corresponding first time-frequency resource is arranged in a clockwise direction. Figure 8The first signal of the second timing version is a codeword sequence of length 432 read from the first bit (i.e., bits 1 to 432); the PBCH data mapped on the corresponding first time-frequency resource by the first signal of the second timing version is in a clockwise direction. Figure 8 The codeword sequence of length 432 is read starting from the 257th (1+N / 2)th bit (i.e., bits 257 to 512, and bits 1 to 176).

[0172] As can be seen, in this example, the starting points of the first and second parts are 180° out of phase.

[0173] Example 3

[0174] If i = 3, based on the specific form above, then as follows: Figure 9 As shown, the PBCH data mapped to the first signal of the first timing version on the corresponding first time-frequency resource is arranged in a clockwise direction. Figure 9 The first signal of the second timing version is a codeword sequence of length 432 read from the first bit (i.e., bits 1 to 432); the PBCH data mapped on the corresponding first time-frequency resource by the first signal of the second timing version is in a clockwise direction. Figure 9 The codeword sequence of length 432 is read starting from the 385th (1+3*N / 4)th bit (i.e., bits 385 to 512, and bits 1 to 304).

[0175] As can be seen, in this example, the starting points of the first and second parts are 270° out of phase.

[0176] Example 4

[0177] If i = 1, based on the above specific form two, then as follows Figure 10 As shown, the PBCH data mapped to the first signal of the first timing version on the corresponding first time-frequency resource is arranged in a clockwise direction. Figure 10 The first signal of the second timing version is a codeword sequence of length 432 read from the first bit (i.e., bits 1 to 432); the PBCH data mapped on the corresponding first time-frequency resource by the first signal of the second timing version is in a counterclockwise direction. Figure 10 The codeword sequence of length 432 is read starting from the 48th bit (i.e., bits 48 to 1, and bits 512 to 129).

[0178] As can be seen, in this example, the starting point of the first part and the ending point of the second part are 90° out of phase.

[0179] Example 5

[0180] If i = 2, based on the above specific form two, then as follows Figure 11 As shown, the PBCH data mapped to the first signal of the first timing version on the corresponding first time-frequency resource is arranged in a clockwise direction. Figure 11 The first signal of the second timing version is a codeword sequence of length 432 read from the first bit (i.e., bits 1 to 432); the PBCH data mapped on the corresponding first time-frequency resource by the first signal of the second timing version is in a counterclockwise direction. Figure 11 The codeword sequence of length 432 is read starting from the 176th bit (i.e., bits 176 to 1, and bits 512 to 257).

[0181] As can be seen, in this example, the starting point of the first part and the ending point of the second part are 180° out of phase.

[0182] Example 6

[0183] If i = 3, based on the above specific form two, then as follows Figure 12 As shown, the PBCH data mapped to the first signal of the first timing version on the corresponding first time-frequency resource is arranged in a clockwise direction. Figure 12 The first signal of the second timing version is a codeword sequence of length 432 read from the first bit (i.e., bits 1 to 432); the PBCH data mapped on the corresponding first time-frequency resource by the first signal of the second timing version is in a counterclockwise direction. Figure 12 The codeword sequence of length 432 is read starting from the 304th bit (i.e., bits 304 to 1, and bits 512 to 385).

[0184] As can be seen, in this example, the phase difference between the starting point of the first part and the ending point of the second part is 270°.

[0185] Furthermore, in Examples 1 to 6 above, the PBCH data mapped to the first signal of the first timing version on the second time-frequency resource is the same as the PBCH data mapped to the first signal of the second timing version on the first time-frequency resource. Taking Example 1 as an example, the PBCH data mapped to the first signal of the first timing version on the corresponding second time-frequency resource is the same as the PBCH data mapped to the first signal of the first timing version on the first time-frequency resource in a clockwise direction. Figure 7 The first signal of the second timing version is a codeword sequence of length 432, read starting from the 129th bit; the PBCH data mapped on the corresponding second time-frequency resource by the first signal of the second timing version is in a clockwise direction. Figure 7 The codeword sequence of length 432 is read starting from the first bit.

[0186] The descriptions of specific form four at different i are similar to those of Examples 1 to 3, and the descriptions of specific form three at different i are similar to those of Examples 4 to 6, so they will not be repeated here.

[0187] It can be seen that there are two transmission start points in this method. 432 bits are transmitted from each start point. In one timing version, the 432-bit codeword sequences corresponding to these two start points are mapped to time-frequency resources within and outside the first bandwidth, respectively. In the adjacent timing version, the PBCH data mapped in-band and out-of-band are exactly the opposite. That is, the 432-bit codeword sequences corresponding to these two start points are mapped to time-frequency resources outside and within the first bandwidth, respectively. Furthermore, the bit indices of the start and end points, or the start and end points, of the codeword sequences corresponding to the first time-frequency resources within the first bandwidth in both timing versions differ by an integer multiple of N / 4.

[0188] The following is combined Figure 13 Here is a specific example of one possible approach. In this example, the first signal is... Figure 3 The signal carried on the PBCH in the SSB / PBCH block shown has L=4. The first signal, which is repeatedly transmitted 4 times, corresponds to timing version #1, timing version #2, timing version #3, and timing version #4 respectively according to the transmission order. Assume that the time-frequency resources required to transmit the first signal correspond to 4 cells, and the number of bits that the 4 cells can carry is E=864. The first time-frequency resources corresponding to the first bandwidth correspond to the middle 2 cells, and the number of bits that the first time-frequency resources can carry is E / 2=432.

[0189] like Figure 13 As shown, the first timing version corresponds to two transmission starting points, namely the 1st bit and the 129th bit. Specifically, the PBCH data mapped to the first signal of the first timing version on the corresponding first time-frequency resource is a codeword sequence of length 432 read clockwise starting from the 1st bit (labeled as 2 and 3 in the corresponding two cells of the first time-frequency resource). The PBCH data mapped to the corresponding second time-frequency resource (i.e., the second part) is a codeword sequence of length 432 read clockwise starting from the 129th bit (labeled as 1 and 4 in the corresponding two cells of the second time-frequency resource).

[0190] The second timing version corresponds to two transmission starting points, namely the 1st bit and the 129th bit. Specifically, the PBCH data mapped to the first signal of the second timing version on the corresponding first time-frequency resource is a codeword sequence of length 432 read clockwise starting from the 129th bit (labeled as 1 and 4 in the corresponding two cells of the first time-frequency resource), and the PBCH data mapped to the corresponding second time-frequency resource is a codeword sequence of length 432 read clockwise starting from the 1st bit (labeled as 2 and 3 in the corresponding two cells of the first time-frequency resource);

[0191] The third timing version corresponds to two transmission starting points, namely the 432nd bit and the 48th bit. Specifically, the PBCH data mapped to the first signal of the third timing version on the corresponding first time-frequency resource is a codeword sequence of length 432 read counterclockwise starting from the 432nd bit (labeled as 3 and 2 in the corresponding two cells of the first time-frequency resource), and the PBCH data mapped to the corresponding second time-frequency resource is a codeword sequence of length 432 read counterclockwise starting from the 48th bit (labeled as 4 and 1 in the corresponding two cells of the second time-frequency resource).

[0192] The fourth timing version corresponds to two transmission starting points, namely the 432nd bit and the 48th bit. The PBCH data mapped to the first signal of the fourth timing version on the corresponding first time-frequency resource is a codeword sequence of length 432 read counterclockwise starting from the 48th bit (labeled as 4 and 1 in the two cells of the corresponding first time-frequency resource). The PBCH data mapped to the corresponding second time-frequency resource is also a codeword sequence of length 432 read counterclockwise starting from the 432nd bit (labeled as 3 and 2 in the two cells of the corresponding first time-frequency resource).

[0193] It can be seen that, based on Figure 13 As shown, the different timing versions of the first signal can ensure that devices with different receiving bandwidths can receive the complete first signal by receiving the corresponding number of timing versions of the first signal.

[0194] If the receiving end receives the first signal with the first bandwidth, it can receive the complete first signal by receiving the PBCH data of the first time-frequency resources corresponding to the first bandwidth on any two adjacent timing versions. For example, the PBCH data mapped on the first time-frequency resources corresponding to the first bandwidth for the first signals of the first and second timing versions is {2,3,1,4}, the PBCH data mapped on the first time-frequency resources corresponding to the first bandwidth for the first signals of the second and third timing versions is {1,4,3,2}, the PBCH data mapped on the first time-frequency resources corresponding to the first bandwidth for the first signals of the third and fourth timing versions is {3,2,4,1}, and the PBCH data mapped on the first time-frequency resources corresponding to the first bandwidth for the first signals of the fourth and first timing versions is {4,1,2,3}.

[0195] If the receiver receives the first signal with half the bandwidth of the first bandwidth, it can only receive PBCH data on one cell at a time. However, as long as it receives any four adjacent timing versions of the first signal, it can receive the complete first signal.

[0196] If the receiving end receives the first signal with the bandwidth corresponding to the first signal, then receiving any timing version of the first signal will allow it to receive the complete first signal.

[0197] Method 2

[0198] The first codeword sequence is obtained by repeating a codeword sequence of length N. For example, if N < E, the codeword sequence of length N includes y1 to yN. The first codeword sequence is obtained by concatenating the first (EN) bits of y1 to yN to obtain a codeword sequence of length E. The first part and the second part both include E / 2 bits. The second part is the remaining part of the first codeword sequence excluding the first part.

[0199] The first part consists of all the bits remaining after punching the second part of the codeword sequence of length N, and the second part consists of all the bits remaining after punching the first part of the codeword sequence of length N. It can be seen that the punching patterns of the first part and the second part are different, but the punching positions are exactly complementary.

[0200] The following examples illustrate the first signal of the first timing version and the second signal of the second timing version based on Method 2.

[0201] In this implementation, the first signal of the first timing version is obtained by mapping the first codeword sequence to the corresponding time-frequency resource for transmitting the first signal according to a predefined rule #1. For example, the predefined rule #1 is frequency domain first, then time domain. Specifically, for the first signal of the second timing version, the data mapped to the corresponding first time-frequency resource in the second timing version is the same as the data mapped to the corresponding second time-frequency resource in the first timing version, and vice versa. In other words, in this implementation, the first signal of the second version sequence can be considered as a signal obtained by swapping the mapped data within and outside the first bandwidth corresponding to the signal of the first version sequence. Therefore, a receiver with first bandwidth capability can receive data not received in the previous repetition period in the current repetition period, and by combining this data with the data received in the previous repetition period, a complete first signal can be obtained.

[0202] For ease of description, this application refers to the mapping method of the first codeword sequence corresponding to the first signal of the first timing version on the time-frequency resources of the first signal of the first timing version as the first mapping method (that is, the first signal of the first timing version is the signal obtained by mapping the first codeword sequence to the time-frequency resources used to transmit the corresponding first signal using the first mapping method). It should be noted that the predefined rule #1 refers to the rule that must be followed when data is mapped to the corresponding time-frequency resources, but the mapping method refers to which parts need to be mapped on which time-frequency resources.

[0203] The following examples illustrate two specific implementations of obtaining the first signal of the second timing version.

[0204] Implementation Method 1 (Changing the Mapping Method): The first signal of the second timing version is the signal obtained by mapping the first codeword sequence to the time-frequency resources required to send the corresponding first signal using the second mapping method. The first mapping method is different from the second mapping method, and the second mapping method is related to the first bandwidth.

[0205] Implementation method two (adding a bit interleaving process): The first codeword sequence is bit-interleaved to obtain an interleaved codeword sequence. The first signal of the second timing version is the signal obtained by mapping the interleaved codeword sequence to the time-frequency resources used to send the corresponding first signal according to the predefined rule #1. The bit interleaving method is related to the first bandwidth.

[0206] For example, the transmitting device can use an interleaver of length E to perform bit interleaving, wherein the interleaver is associated with a first bandwidth. An interleaver of length E can be understood as having an input bit sequence and an output bit sequence of length E.

[0207] For example, the first signal is the signal carried on the PBCH. Based on this second implementation method, a bit interleaving module can be added to the PBCH channel coding process to achieve the bit interleaving function mentioned above. Specifically, the PBCH channel coding process may include: broadcast information generation, payload scrambling, TB-CRC concatenation, channel coding, rate matching, bit interleaving, modulation, and resource mapping.

[0208] Combination Figure 14 For example, the first signal is... Figure 3 The signal carried on the PBCH in the SSB / PBCH block shown has a first bandwidth corresponding to the 12 PRBs in the middle. If each PRB contains 12 subcarriers and the modulation method is QPSK modulation, then the number of bits that can be carried on the first time-frequency resource corresponding to the first bandwidth and the second time-frequency resource corresponding to the outside of the first bandwidth is 432. Figure 14 It can be seen that the data mapped on the first signal of the first timing version and the second signal of the second timing version are exactly opposite on the corresponding in-band and out-of-band time-frequency resources.

[0209] The following is combined Figure 15 Here is a specific example of a possible approach two. In this example, the first signal is... Figure 3 The signals carried on the PBCH in the SSB / PBCH block shown are transmitted sequentially by the transmitter within L = 4 repetition periods: timing version #1, timing version #2, timing version #3, and timing version #4. One period corresponds to 20ms, and 10ms is the duration of one frame. For example... Figure 15 As shown, the first signal of timing version #1 and timing version #3 is based on... Figure 14 The first signal of the first timing version is obtained by the same mapping method as the first signal of the first timing version. The first signals of timing versions #2 and #4 are based on the same mapping method as the first signal of the first timing version. Figure 14 The signal is obtained by mapping the first signal of the second timing version in the same way.

[0210] Method 3

[0211] If the number of bits that the first time-frequency resource can carry is X, both the first part (the data mapped onto the first time-frequency resource corresponding to the first signal of the first time-series version) and the second part (the data mapped onto the first time-frequency resource corresponding to the first signal of the second time-series version) include X bits. The first part includes the first X bits of a codeword sequence of length N, and the second part includes the last X bits of a codeword sequence of length N. The first part is obtained from the codeword sequence of length N in a first order, and the second part is obtained from the codeword sequence of length N in a second order. The first order and the second order are different; the first order is... Figure 6 The clockwise or counterclockwise order is shown.

[0212] It is understood that the above only describes the range of X bits included in the first and second parts. The following examples illustrate the specific forms of the first and second parts.

[0213] In the first specific form, if the first order is clockwise, then the first part is arranged in clockwise order... Figure 6 The first part reads X bits starting from the first bit, and the second part is read in counter-clockwise order. Figure 6 X bits are read starting from the Nth bit.

[0214] In the second specific form, if the first order is counter-clockwise, then the first part is arranged in counter-clockwise order... Figure 6 The first part reads X bits starting from the Xth bit, and the second part reads the bits in clockwise order. Figure 6 X bits are read starting from the (1+NX)th bit.

[0215] It can be seen that the first part consists of all the remaining bits after punching the last (NX) bits of the codeword sequence of length N, and the second part consists of all the remaining bits after punching the first (NX) bits of the codeword sequence of length N. Therefore, the punching patterns corresponding to the first part and the second part are different, but they satisfy the characteristics of continuous and symmetrical punching positions.

[0216] It is understandable that after determining the data to be mapped on the first time-frequency resource, the transmitting end can map the corresponding part of the data to the first time-frequency resource from the starting point according to the predefined rule #1. For example, the predefined rule #1 is frequency domain first, then time domain.

[0217] The above only describes the data mapped to the first signal of the first timing version and the second timing version on the corresponding first time-frequency resource. The following, based on X=E / 2, illustrates the data mapped to the first signal of the first timing version and the second timing version on the corresponding second time-frequency resource. The second time-frequency resource is the remaining resource in the time-frequency resource required to transmit the first signal, excluding the first time-frequency resource.

[0218] In this system, the data mapped onto the second time-frequency resource corresponding to the first signal in the first timing version is the second part, and the data mapped onto the second time-frequency resource corresponding to the first signal in the second timing version is the first part. That is, the first signal in the first timing version is the signal obtained by mapping the first part to the corresponding first time-frequency resource and mapping the second part to the corresponding second time-frequency resource; the first signal in the second timing version is the signal obtained by mapping the second part to the corresponding first time-frequency resource and mapping the first part to the corresponding second time-frequency resource.

[0219] Similarly, after determining the data that needs to be mapped on the second time-frequency resource, the transmitting end can map the corresponding part of the data to the second time-frequency resource from the starting point according to the predefined rule #1.

[0220] The first signal is used below. Figure 3 The signal carried on the PBCH in the SSB / PBCH block shown is illustrated as an example of the first signal in both the first and second timing versions. The specific values ​​for the parameters in the example below are: N = 512, E = 864. The first bandwidth corresponds to the 12 PRBs in the middle of the SSB / PBCH block. If each PRB contains 12 subcarriers and the modulation scheme is QPSK modulation, then the number of bits that the first time-frequency resource corresponding to the first bandwidth can carry is X = E / 2 = 432.

[0221] Example 1

[0222] like Figure 16 As shown, the first signal of the first timing version is obtained by mapping 432 bits to the first time-frequency resource corresponding to the first bandwidth in a clockwise direction, starting from the first bit of the codeword sequence with a length of 512 as the transmission starting point, and by mapping 432 bits to the second time-frequency resource corresponding to the first bandwidth in a counterclockwise direction, starting from the 512th bit of the codeword sequence with a length of 512 as the transmission starting point.

[0223] The first signal of the second timing version is a signal obtained by mapping 432 bits from the 512th bit of a codeword sequence of length 512, starting from the 512th bit, to the first time-frequency resource corresponding to the first bandwidth in a counterclockwise direction, and by mapping 432 bits from the 1st bit of a codeword sequence of length 512, to the second time-frequency resource corresponding to the first bandwidth in a clockwise direction.

[0224] It can be seen that the codeword sequence mapped to the corresponding first time-frequency resource in the first timing version can be regarded as the 433rd to 512th bits of the codeword sequence with a length of 512 being punched. The codeword sequence mapped to the corresponding first time-frequency resource in the second timing version can be regarded as the 1st to 80th bits of the codeword sequence with a length of 512 being punched. The punching positions are continuous and symmetrical.

[0225] Example 2

[0226] The difference between Example 2 and Example 1 is that the in-band and out-of-band mapped data of the first signal in any timing version of Example 2 are the reverse order of the mapping order on the corresponding resources in Example 1. This will be described in detail below.

[0227] The first signal of the first timing version is a signal obtained by mapping 432 bits from the 432nd bit of a codeword sequence of length 512, starting from the 432nd bit, to the first time-frequency resource corresponding to the first bandwidth in a counterclockwise direction, and by mapping 432 bits from the 81st bit of a codeword sequence of length 512, to the second time-frequency resource corresponding to the first bandwidth in a clockwise direction.

[0228] The first signal of the second timing version is a signal obtained by mapping 432 bits in a clockwise direction to the first time-frequency resource corresponding to the first bandwidth, starting from the 81st bit of a codeword sequence of length 512, and mapping 432 bits in a counterclockwise direction to the second time-frequency resource corresponding to the first bandwidth, starting from the 432nd bit of a codeword sequence of length 512.

[0229] As can be seen, there are two transmission starting points in this embodiment. 432 bits are transmitted from each starting point. In one timing version, the 432-bit codeword sequences corresponding to these two transmission starting points are mapped to time-frequency resources within the first bandwidth and time-frequency resources outside the first bandwidth, respectively. In the adjacent timing version, the mapping method is exactly the opposite. That is, the 432-bit codeword sequences corresponding to these two transmission starting points are mapped to time-frequency resources outside the first bandwidth and time-frequency resources within the first bandwidth, respectively. Moreover, the puncturing positions of the two timing versions within the corresponding time-frequency resources of the first bandwidth are continuous and symmetrical.

[0230] Below is a specific example of one possible approach two. In this example, the first signal is... Figure 3 The signals carried on the PBCH in the SSB / PBCH block shown are transmitted sequentially by the transmitting end within L = 4 repetition periods: timing version #1, timing version #2, timing version #3, and timing version #4, with one period corresponding to 20ms. For example... Figure 15 As shown, the first signals of timing versions #1 and #3 are obtained based on the same mapping method as the first signal of the first timing version in Example 1, and the first signals of timing versions #2 and #4 are obtained based on the same mapping method as the first signal of the second timing version in Example 1. Therefore, a receiver with the first bandwidth capability can receive data that was not received in the previous repetition period within the current repetition period, and by combining this data with the data received in the previous repetition period, a complete first signal can be obtained.

[0231] like Figure 17As shown, the current repetition period of the PBCH signal is 20ms, with 10ms constituting one frame. The same PBCH data will be transmitted four times. The second-to-last and third-to-last bits of the SFN (the two bold bits) can be used to determine which frame of the radio system frame the currently received PBCH belongs to, such as... Figure 17 As shown, the two bold bits 00 indicate frame 0, 01 indicates frame 2, 10 indicates frame 4, and 11 indicates frame 6. As the repetition period lengthens in the future, the position of the bit used to indicate which frame the currently received PBCH signal is located in may change. For example, if the PBCH repetition period is 40ms, then... Figure 17 The PBCH is transmitted in frames 0, 4, 8, and 12 (not shown in the figure). It can be seen that the second-to-last and third-to-last bits of the SFN corresponding to frames 0 and 8 are both 00. At this time, it is impossible to determine which frame the PBCH signal is in. Therefore, the third-to-last and fourth-to-last bits of the SFN can be used to determine which frame the currently received first signal is in. It can be seen that 00 in the third-to-last and fourth-to-last bits indicates that it is in frame 0, 01 indicates that it is in frame 4, 10 indicates that it is in frame 8, and 11 indicates that it is in frame 12.

[0232] It can be seen that the first codeword sequences corresponding to the first signals of different timing versions in Methods 1 to 3 are all obtained by rate matching based on a codeword sequence of length N. Specifically, the first codeword sequence corresponding to any timing version in Method 2 is obtained by repeating a codeword sequence of length N (i.e., the rate matching method for Method 2 is repetition). However, the rate matching method for the first codeword sequences corresponding to different timing versions in Methods 1 and 3 is different from that in Method 2. Specifically, the rate matching method for each timing version in Methods 1 and 3 corresponds to two transmission starting points, and is not obtained by repeating a codeword sequence of length N.

[0233] S530, the receiving device obtains the decoding result based on the data carried on the third time-frequency resource, which is the time-frequency resource corresponding to receiving the first signal with the second bandwidth.

[0234] The following describes the decoding process at the receiving end for modes one to three as described in S520, with the second bandwidth equal to the first bandwidth.

[0235] Regarding method one

[0236] For example, N = 512. Following a clockwise direction, the first signal of the first timing version can be transmitted starting from the first bit on the corresponding first time-frequency resource; the first signal of the second timing version can be transmitted starting from the 129th bit on the corresponding first time-frequency resource (a difference of N / 4 from the first timing version); the first signal of the third timing version can be transmitted starting from the 257th bit on the corresponding first time-frequency resource (a difference of N / 2 from the first timing version); and the first signal of the fourth timing version can be transmitted starting from the 385th bit (a difference of 3*N / 4 from the first timing version). After receiving the first signal of a certain timing version, the receiving end only needs to decode once and perform a maximum of 4 CRC checks to determine the current timing version. The specific reasons are explained below with an example.

[0237] For example, N=8, let the coded bit sequence corresponding to the first signal of the first timing version be c=[c1,c2,c3,c4,c5,c6,c7,c8], and the coded bit sequence corresponding to the first signal of the adjacent second timing version be... Since the difference between c and is N / 4, Right now The following relationship exists between c and c:

[0238]

[0239] Where P is a matrix that performs a cyclic shift on the encoded bit sequence c, and matrix P is shown below:

[0240]

[0241] Assume that the row and column transformation P on the codeword side is equivalent to performing a linear transformation T over a binary field on the uncoded vector u, i.e.

[0242]

[0243] Where G is the Polar encoding matrix, In this example, N = 8, then For matrices Performing three Kronecker product operations yields the following 8x8 encoding matrix G of the Polar code with a code length of 8:

[0244]

[0245] Furthermore, the codeword c is equal to the message vector u multiplied by G, i.e., c = u × G. Substituting this into the above formula, we can obtain:

[0246]

[0247] Because the Polar coding matrix G is an N x N square matrix, its inverse is equal to itself.

[0248] T = G × P × G

[0249] That is, matrix T is shown below:

[0250]

[0251] Therefore, performing a cyclic shift of c by N / 4 before sending is equivalent to performing the aforementioned linear transformation T on u.

[0252] Therefore, when the receiving end receives the first signal of a timing version within the current time period, it only needs to decode once to obtain the message vector u′ corresponding to the current timing version (i.e., the decoding result), and then perform a maximum of four CRC checks to determine the current timing version. Specifically, let u be the message vector corresponding to timing version #1, and let u be the message vector corresponding to timing version #2. Message vector corresponding to timing version #3 Message vector corresponding to timing version #4 So, look at u′, Which one passed the CRC check? If u′ passed the CRC check, it means that the signal received in the current time period is the first signal of timing version #1; if... If the CRC check passes, it means that the signal received in the current time period is the first signal of timing version #2; if If the CRC check passes, it means that the signal received in the current time period is the first signal of timing version #3; if If the CRC check passes, it means that the signal received in the current time period is the first signal of timing version #4. Since the complexity of CRC check is much lower than that of decoding, this method can significantly reduce the detection complexity at the receiver.

[0253] It is understandable that the receiving end knows which frame the first signal of each of the L timing versions is located in within the wireless system frame. Therefore, if the timing version is determined, the current frame can be determined, thereby achieving synchronization.

[0254] In addition, if all four CRC checks fail, the decoding fails. The receiver will then soft-merge the first signal of the next cycle with the first signal of the next cycle and perform decoding again until successful decoding is achieved.

[0255] Regarding method two

[0256] In this method, the first signal of the first timing version is mapped to the first part of the first codeword sequence on the corresponding first time-frequency resource. In the second timing version, the first signal is mapped to the second part of the first codeword sequence on the corresponding first time-frequency resource. The first part is the remaining portion of the first codeword sequence excluding the second part. The puncturing patterns corresponding to the first and second parts are different, but their puncturing positions are complementary. Because the two timing versions correspond to different puncturing patterns, the receiver can decode twice, trying different puncturing patterns, to distinguish which timing version of the first signal is currently received.

[0257] For method three

[0258] Compared to method two, the punching patterns for the first and second parts are different, but they satisfy the characteristics of continuous and symmetrical punching positions. The receiving end can decode once and then perform two CRC checks on the decoded result to distinguish which timing version of the first signal is being received. This is because the information bits corresponding to the first and second parts are exactly the same, and there is a correspondence between the decoding results, so multiple decodings are unnecessary. An example will illustrate the specific reason below.

[0259] For example, N=8, let the coded bit sequence corresponding to the first signal of the first timing version be c=[c1,c2,c3,c4,c5,c6,c7,c8], and the coded bit sequence corresponding to the first signal of the adjacent second timing version be... Given a sequence of c, the sequence is reversed. Right now The following relationship exists between c and c:

[0260]

[0261] Among them, P 逆序 P is a matrix that reverses the coded bit sequence c. 逆序 As shown below:

[0262]

[0263] Assume that the row and column transformation P on the codeword side is equivalent to performing a linear transformation T over a binary field on the uncoded vector u, i.e.

[0264]

[0265] Where G is the Polar encoding matrix, In this example, N=8, then the encoding matrix G is as follows:

[0266]

[0267] Furthermore, the codeword c is equal to the message vector u multiplied by G, i.e., c = u × G. Substituting this into the above formula, we can obtain:

[0268] u×G×P 逆序 =u×T×G

[0269] G×P 逆序 =T×G

[0270] Because the Polar coding matrix G is an N x N square matrix, its inverse is equal to itself.

[0271] T = G × P 逆序 ×G

[0272] It can be observed that matrix T at this point is exactly the centrally symmetric matrix of matrix G. Specifically, matrix T is shown below:

[0273]

[0274] For example, L=2, the first signal of timing version #1 and the second signal of timing version #2 are sent sequentially. The first part of the first signal of timing version #1, mapped on the corresponding first time-frequency resource, is a codeword sequence read clockwise. The second part of the first signal of timing version #2, mapped on the corresponding first time-frequency resource, is a codeword sequence read counterclockwise. When the receiving end receives the first signal of a timing version within the current time period, it only needs to decode once to obtain the message vector u′ corresponding to the current timing version, and then perform at most two CRC checks to determine the current timing version. Specifically, let u be the message vector corresponding to timing version #1, and let u be the message vector corresponding to timing version #2. Then look at u′, Which one passed the CRC check? If u′ passed the CRC check, it means that the signal received in the current time period is the first signal of timing version #1; if... If the CRC check passes, it means that the signal received in the current time period is the first signal of timing version #2.

[0275] It is understandable that the receiving end knows which frame the first signal of each of the L timing versions is located in within the wireless system frame. Therefore, if the timing version is determined, the current frame can be determined, thereby achieving synchronization.

[0276] In addition, if the CRC check fails twice, the decoding fails. The receiver will soft-merge the first signal of the next cycle with the first signal of the next cycle and perform decoding again until successful decoding is achieved.

[0277] It can also be understood that the decoding result u′ in this application is a decoding output sequence of length N, which contains K message bits output by the decoder and (NK) freeze bits.

[0278] The index values ​​or sequence numbers in this application can start from 1 or 0, and this application does not specifically limit this. That is, the above index values ​​or sequence numbers starting from 0 can also be adapted to start from 1 (e.g., the index value of a subcarrier), or the above index values ​​or sequence numbers starting from 1 can also be adapted to start from 0 (e.g., the index value of a bit in a codeword sequence of length N). Those skilled in the art can understand the implementation method when the sequence number set starts from 1 based on the content disclosed in this application, and will not elaborate further.

[0279] It is also understood that the steps in the above figures are merely illustrative and are not intended to be strictly limited. Furthermore, the sequence numbers of the above processes do not imply a specific order of execution; the execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0280] It is also understood that some optional features in the various embodiments of this application may not depend on other features in some scenarios, or may be combined with other features in some scenarios, without limitation.

[0281] The above text combined Figures 1 to 17 The present application provides a detailed description of the method embodiments, which will be discussed below in conjunction with... Figure 18 and Figure 19 This describes an embodiment of the apparatus described in this application. It is understood that, in order to achieve the functions described in the above embodiments, Figure 18 and Figure 19 The apparatus includes hardware structures and / or software modules corresponding to perform various functions. Those skilled in the art will readily recognize that, based on the units and method steps described in conjunction with the embodiments disclosed in this application, this application can be implemented in hardware or a combination of hardware and computer software. It is understood that the technical features described in the above method embodiments are also applicable to the following apparatus embodiments.

[0282] Figure 18 and Figure 19 The diagram illustrates the possible structures of apparatuses provided for embodiments of this application. These apparatuses can be used to implement the functions of the transmitting or receiving apparatuses in the above method embodiments, and thus also achieve the beneficial effects of the above method embodiments.

[0283] Figure 18 This is a schematic block diagram of the communication device 1000 provided in an embodiment of this application. Figure 18As shown, the device 1000 may include a communication unit 1010 and a processing unit 1020. The communication unit 1010 can communicate with the outside world, and the processing unit 1020 is used for data processing. The communication unit 1010 may also be referred to as a communication interface or a transceiver unit.

[0284] In one possible design, the device 1000 can implement the steps or processes corresponding to those performed by the transmitting device in the above method embodiments, wherein the processing unit 1020 is used to perform processing-related operations of the transmitting device in the above method embodiments, and the communication unit 1010 is used to perform transmission-related operations of the transmitting device in the above method embodiments.

[0285] In another possible design, the device 1000 can implement the steps or processes corresponding to those executed by the receiving device in the above method embodiments, wherein the communication unit 1010 is used to perform reception-related operations of the receiving device in the above method embodiments, and the processing unit 1020 is used to perform processing-related operations of the receiving device in the above method embodiments.

[0286] It is understood that the device 1000 here is embodied in the form of a functional unit. The term "unit" here can refer to an application-specific integrated circuit (ASIC), electronic circuitry, a processor (e.g., a shared processor, a proprietary processor, or a group processor, etc.) and memory for executing one or more software or firmware programs, integrated logic circuitry, and / or other suitable components supporting the described functions. In an alternative example, those skilled in the art will understand that the device 1000 may specifically be the transmitting end device in the above embodiments, used to execute the various processes and / or steps corresponding to the transmitting end device in the above method embodiments; or, the device 1000 may specifically be the receiving end device in the above embodiments, used to execute the various processes and / or steps corresponding to the receiving end device in the above method embodiments. To avoid repetition, further details are omitted here.

[0287] The apparatus 1000 of each of the above-described schemes has the function of implementing the corresponding steps performed by the transmitting device in the above-described method, or the apparatus 1000 of each of the above-described schemes has the function of implementing the corresponding steps performed by the receiving device in the above-described method. The function can be implemented by hardware or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the above functions; for example, the communication unit can be replaced by a transceiver (e.g., the transmitting unit in the communication unit can be replaced by a transmitter, and the receiving unit in the communication unit can be replaced by a receiver), and other units, such as processing units, can be replaced by a processor, respectively executing the transmission and reception operations and related processing operations in each method embodiment.

[0288] Furthermore, the aforementioned communication unit can also be a transceiver circuit (e.g., it may include a receiving circuit and a transmitting circuit), and the processing unit can be a processing circuit. In embodiments of this application, Figure 18 The device mentioned can be the receiving or transmitting device in the foregoing embodiments, or it can be a chip or a chip system, such as a system on a chip (SoC). The communication unit can be an input / output circuit or a communication interface; the processing unit is a processor, microprocessor, or integrated circuit integrated on the chip. No limitations are imposed here.

[0289] Figure 19 This is a schematic block diagram of a communication device 1100 provided in an embodiment of this application. The device 1100 includes a processor 1110 and a transceiver 1120. The processor 1110 and the transceiver 1120 communicate with each other through an internal connection path. The processor 1110 is used to execute instructions to control the transceiver 1120 to transmit and / or receive signals.

[0290] Optionally, the device 1100 may further include a memory 1130, which communicates with the processor 1110 and the transceiver 1120 via an internal connection path. The memory 1130 stores instructions, and the processor 1110 can execute the instructions stored in the memory 1130. In one possible implementation, the device 1100 is used to implement the various processes and steps corresponding to the transmitting device in the above method embodiments. In another possible implementation, the device 1100 is used to implement the various processes and steps corresponding to the receiving device in the above method embodiments.

[0291] Optionally, the memory 1130 may be integrated into the processor 1110.

[0292] In one possible scenario, device 1100 includes at least one processor with integrated memory, and other memory besides the memory integrated on the processor.

[0293] It is understood that device 1100 can specifically be the transmitting device or receiving device in the above embodiments, or it can be a chip or chip system. Correspondingly, transceiver 1120 can be the transceiver circuit of the chip, which is not limited here. Specifically, device 1100 can be used to execute the various steps and / or processes corresponding to the transmitting device or receiving device in the above method embodiments.

[0294] Optionally, the memory 1130 may include read-only memory and random access memory, and provide instructions and data to the processor. The memory may include non-volatile random access memory. For example, the memory may also store device type information. The processor 1110 may be used to execute instructions stored in the memory, and when the processor 1110 executes instructions stored in the memory, the processor 1110 is used to perform the various steps and / or processes of the method embodiments corresponding to the transmitting or receiving devices described above.

[0295] In implementation, each step of the above method can be completed by integrated logic circuits in the processor's hardware or by instructions in software. The steps of the method disclosed in the embodiments of this application can be directly implemented by a hardware processor, or by a combination of hardware and software modules in the processor. The software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory, and the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above method. To avoid repetition, detailed descriptions are omitted here.

[0296] It should be noted that the processor in the embodiments of this application can be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above method embodiments can be completed by the integrated logic circuitry in the processor's hardware or by instructions in software form. The processor can be a general-purpose processor, digital signal processing (DSP), ASIC, field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. The processor in the embodiments of this application can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor can be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this application can be directly embodied as being executed by a hardware decoding processor, or executed by a combination of hardware and software modules in the decoding processor. The software modules can be located in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. This storage medium is located in memory; the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above methods.

[0297] It is understood that the memory in the embodiments of this application can be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. The non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. The volatile memory can be a cache or random access memory (RAM), which serves as an external cache. By way of example, but not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous linked dynamic random access memory (SLDRAM), and direct rambus RAM (DR RAM). It should be noted that the memory used in the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0298] Optionally, the memory (e.g., 1130) in this embodiment may be integrated into the processor (e.g., 1110).

[0299] In addition, this application also provides a computer-readable storage medium storing computer instructions, which, when executed on a computer, cause the operations and / or processes performed by the sending or receiving device in the various method embodiments of this application to be executed.

[0300] This application also provides a computer program product, which includes computer program code or instructions. When the computer program code or instructions are run on a computer, the operations and / or processes performed by the sending end device or the receiving end device in the various method embodiments of this application are executed.

[0301] Furthermore, this application also provides a chip including a processor. A memory for storing a computer program is provided independently of the chip, and the processor is used to execute the computer program stored in the memory, such that operations and / or processes performed by a transmitting or receiving device in any method embodiment are executed.

[0302] Furthermore, the chip may also include a communication interface. The communication interface may be an input / output interface or an interface circuit, etc. Furthermore, the chip may also include a memory.

[0303] In addition, this application also provides a communication system, including the transmitting end device and the receiving end device in the embodiments of this application.

[0304] It should also be noted that the memory described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0305] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application. Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here. In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods can be implemented in other ways. For example, the device embodiments described above are merely illustrative; for example, the division of units is merely a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the displayed or discussed mutual coupling or direct coupling or communication connection may be through some interfaces; the indirect coupling or communication connection of devices or units may be electrical, mechanical, or other forms. The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs. Furthermore, the functional units in the various embodiments of this application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0306] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, ROM, RAM, magnetic disks, or optical disks.

[0307] It is understood that the term "embodiment" used throughout the specification means that a specific feature, structure, or characteristic related to an embodiment is included in at least one embodiment of this application. Therefore, various embodiments throughout the specification do not necessarily refer to the same embodiment. Furthermore, these specific features, structures, or characteristics can be combined in any suitable manner in one or more embodiments.

[0308] It can also be understood that in this application, "when," "if," and "if" all refer to the network element making corresponding processing under certain objective circumstances, and are not time-limited, nor do they require the network element to make a judgment when it is implemented, nor do they mean that there are other limitations.

[0309] It can also be understood that in the various embodiments of this application, "B corresponding to A" means that B is associated with A, and B can be determined based on A. However, it can also be understood that determining B based on A does not mean that B is determined solely based on A; B can also be determined based on A and / or other information.

Claims

1. A communication method characterized by comprising: include: A first codeword sequence of length E is obtained, wherein the first codeword sequence is obtained by rate matching of a codeword sequence of length N, where N is the length of the mother code, the codeword sequence of length N is obtained by polar code encoding based on information bits, and E is the number of bits that the time-frequency resources used to transmit the first signal can carry. The first signal is a signal obtained by mapping the first codeword sequence onto the time-frequency resources used to transmit the first signal. Within L repetition periods of the first signal, L timing versions of the first signal are transmitted sequentially, wherein the L timing versions include adjacent first timing versions and second timing versions, and L is an integer greater than or equal to 2. The data mapped on the first time-frequency resource corresponding to the first signal in the first timing version is the first part of the corresponding first codeword sequence. The data mapped on the first time-frequency resource corresponding to the first signal in the second timing version is the second part of the corresponding first codeword sequence. The first time-frequency resource is the resource corresponding to the first bandwidth among the time-frequency resources used to transmit the first signal. The first bandwidth is less than the bandwidth of the first signal. The first part and the second part are different. The union of the first part and the second part includes all bits in the codeword sequence of length N.

2. The method of claim 1, wherein, The number of bits that the first time-frequency resource can carry is X, where X is less than E. The first part includes the N0th bit to the mod(N0+X-1,N)th bit in the codeword sequence of length N. The second part includes the mod(N0+i*N / 4, N)th bit to the mod(N0+i*N / 4+X-1, N)th bit in the codeword sequence of length N, where i is 1, 2 or 3.

3. The method according to claim 2, characterized in that, The N0 is equal to 1, or N / 4, or N / 2, or 3*N / 4.

4. The method according to claim 2 or 3, characterized in that, The first part is obtained from the codeword sequence of length N in a first order. The second part is obtained from the codeword sequence of length N in a second order. The first order may be the same as or different from the second order, and the first order may be sequential or reversed.

5. The method of claim 4, wherein, The first time-frequency resource can carry E / 2 bits, and both the first part and the second part include E / 2 bits.

6. The method according to claim 5, characterized in that, The data mapped on the second time-frequency resource corresponding to the first signal in the first timing version is the second part. The data mapped on the second time-frequency resource corresponding to the first signal in the second timing version is the first part. The second time-frequency resource is the remaining time-frequency resource other than the first time-frequency resource among the time-frequency resources required to transmit the first signal.

7. The method according to any one of claims 4 to 6, characterized in that, The L timing versions also include a third timing version adjacent to the second timing version, wherein, The data mapped on the first time-frequency resource corresponding to the first signal in the third timing version is the reverse order data of the first part.

8. The method of claim 1, wherein, The number of bits that the first time-frequency resource can carry is X, where X is less than E. The first part includes the first X bits of the codeword sequence of length N, and the second part includes the last X bits of the codeword sequence of length N, wherein... The first part is obtained from the codeword sequence of length N in a first order. The second part is obtained from the codeword sequence of length N in a second order. The first order is different from the second order, and the first order is either sequential or reverse.

9. The method of claim 8, wherein, The X = E / 2, The data mapped on the second time-frequency resource corresponding to the first signal in the first timing version is the second part. The data mapped on the second time-frequency resource corresponding to the first signal in the second timing version is the first part. The second time-frequency resource is the remaining time-frequency resource other than the first time-frequency resource among the time-frequency resources required to transmit the first signal.

10. The method of claim 1, wherein, The first codeword sequence is obtained by repeating the codeword sequence of length N, and the second part is the remaining part of the first codeword sequence excluding the first part. Both the first part and the second part include E / 2 bits.

11. The method according to claim 10, characterized in that, The first signal in the first timing version is a signal obtained by mapping the first codeword sequence to the time-frequency resources used to transmit the corresponding first signal using a first mapping method. The first signal of the second timing version is a signal obtained by mapping the second codeword sequence to the time-frequency resources used to transmit the corresponding first signal using the first mapping method, wherein the second codeword sequence is obtained by bit interleaving the first codeword sequence.

12. A communication method characterized by comprising: include: A first signal is received based on a second bandwidth. The first signal is any one of L timing versions of the first signal corresponding to L repetition periods of the first signal, where L is an integer greater than or equal to 2. The L timing versions include adjacent first and second timing versions. The data mapped on the first time-frequency resource corresponding to the first signal of the first timing version is the first part of a first codeword sequence of length E. The data mapped on the first time-frequency resource corresponding to the first signal of the second timing version is the second part of a first codeword sequence of length E. E represents the number of bits that the time-frequency resources used to transmit the first signal can carry. The first signal is a signal obtained by mapping the first codeword sequence to the time-frequency resources used to transmit the first signal. The first codeword sequence is obtained by rate matching of a codeword sequence of length N, where N is the length of the mother code. The codeword sequence of length N is obtained by polar code encoding based on information bits. The first time-frequency resource is the resource corresponding to the first bandwidth among the time-frequency resources used to transmit the first signal. The first bandwidth is less than the bandwidth of the first signal. The first part and the second part are different. The union of the first part and the second part includes all bits in the codeword sequence of length N. The decoding result is obtained based on the data carried on the third time-frequency resource, which is the time-frequency resource corresponding to receiving the first signal with the second bandwidth.

13. The method of claim 12, wherein, The number of bits that the first time-frequency resource can carry is X, where X is less than E. The first part includes the N0th bit to the mod(N0+X-1,N)th bit in the codeword sequence of length N. The second part includes the mod(N0+i*N / 4, N)th bit to the mod(N0+i*N / 4+X-1, N)th bit in the codeword sequence of length N, where i is 1, 2 or 3.

14. The method of claim 13, wherein, The N0 is equal to 1, or N / 4, or N / 2, or 3*N / 4.

15. The method according to claim 13 or 14, characterized in that, The first part is obtained from the codeword sequence of length N in a first order. The second part is obtained from the codeword sequence of length N in a second order. The first order may be the same as or different from the second order, and the first order may be sequential or reversed.

16. The method according to claim 15, characterized in that, The first time-frequency resource can carry E / 2 bits, and both the first part and the second part include E / 2 bits.

17. The method according to claim 16, characterized in that, The data mapped on the second time-frequency resource corresponding to the first signal in the first timing version is the second part. The data mapped on the second time-frequency resource corresponding to the first signal in the second timing version is the first part. The second time-frequency resource is the remaining time-frequency resource other than the first time-frequency resource among the time-frequency resources required to transmit the first signal.

18. The method of any one of claims 15-17, wherein, The L timing versions also include a third timing version adjacent to the second timing version, wherein, The data mapped on the first time-frequency resource corresponding to the first signal in the third timing version is the reverse order data of the first part.

19. The method according to any one of claims 13 to 18, characterized in that, The second bandwidth is equal to the first bandwidth, and the decoding result is the message vector u′. The method further includes: Perform a Cyclic Redundancy Check (CRC) on the message vector u′. If the test passes, the received first signal is the first signal of the first timing version, or... If the check fails, based on the message vector u' *T -1 performing a CRC check, and if the check passes, the received first signal is the first signal of the second timing version, Wherein, the first encoded bit sequence corresponding to the first signal of the first timing version is the codeword sequence of length N, the second encoded bit sequence corresponding to the first signal of the second timing version is the sequence corresponding to the first encoded bit sequence cyclically shifted to the right by i*N / 4 bits, the cyclic shift matrix corresponding to the transformation of the first encoded bit sequence to the second encoded bit sequence is P, and T = G×P×G, where G is the polar code encoding matrix.

20. The method of claim 12, wherein, The number of bits that the first time-frequency resource can carry is X, where X is less than E. The first part includes the first X bits of the codeword sequence of length N, and the second part includes the last X bits of the codeword sequence of length N, wherein... The first part is obtained from the codeword sequence of length N in a first order. The second part is obtained from the codeword sequence of length N in a second order. The first order is different from the second order, and the first order is either sequential or reverse.

21. The method of claim 20, wherein, The X = E / 2, The data mapped on the second time-frequency resource corresponding to the first signal in the first timing version is the second part. The data mapped on the second time-frequency resource corresponding to the first signal in the second timing version is the first part. The second time-frequency resource is the remaining time-frequency resource other than the first time-frequency resource among the time-frequency resources required to transmit the first signal.

22. The method of claim 20 or 21, wherein, The second bandwidth is equal to the first bandwidth, and the decoding result is the message vector u′. The method further includes: Perform a Cyclic Redundancy Check (CRC) on the message vector u′. If the test passes, the received first signal is the first signal of the first timing version, or... If the check fails, based on the message vector u' *T -1 performing a CRC check, and if the check passes, the received first signal is the first signal of the second timing version, The first encoding bit sequence corresponding to the first signal of the first time sequence version is the code word sequence with the length of N, the second encoding bit sequence corresponding to the first signal of the second time sequence version is the reverse sequence of the first encoding bit sequence, and the cyclic shift matrix corresponding to the transformation of the first encoding bit sequence to the second encoding bit sequence is P 逆序 , T = G x P 逆序 x G, and G is a polar code encoding matrix.

23. The method of claim 12, wherein, The first codeword sequence is obtained by repeating the codeword sequence of length N, and the second part is the remaining part of the first codeword sequence excluding the first part. Both the first part and the second part include E / 2 bits.

24. The method according to claim 23, characterized in that, The first signal in the first timing version is a signal obtained by mapping the first codeword sequence to the time-frequency resources used to transmit the corresponding first signal using a first mapping method. The first signal of the second timing version is a signal obtained by mapping the second codeword sequence to the time-frequency resources used to transmit the corresponding first signal using the first mapping method, wherein the second codeword sequence is obtained by bit interleaving the first codeword sequence.

25. The method of any one of claims 1 to 24, wherein, The codeword sequence of length N is obtained by interleaving sub-blocks based on the mother code sequence of length N, or the codeword sequence of length N is the mother code sequence of length N.

26. The method of any one of claims 1 to 25, wherein, The first signal is a signal carried by the Physical Broadcast Channel (PBCH), and the information bits are broadcast information carried on the PBCH.

27. The method of claim 26, wherein, Sending the first signal includes: sending a synchronization signal / physical broadcast channel (SSB / PBCH) block, wherein the SSB / PBCH block includes the first signal.

28. The method according to claim 27, characterized in that, The bandwidth of the SSB / PBCH block corresponds to 20 Physical Resource Blocks (PRBs). The first bandwidth corresponds to the remaining 12 PRBs in the SSB / PBCH block, excluding the top 4 PRBs and the bottom 4 PRBs. The bottom 4 PRBs are four consecutive PRBs, including the first PRB corresponding to the bandwidth of the SSB / PBCH block. The top 4 PRBs are four consecutive PRBs, including the last PRB corresponding to the bandwidth of the SSB / PBCH block.

29. A communications device, characterized by It includes modules or units for performing the method of any one of claims 1 to 11 or any one of claims 25 to 28, or it includes modules or units for performing the method of any one of claims 12 to 24 or any one of claims 25 to 28.

30. A communications device, characterized by The device includes at least one processor and an interface circuit, the interface circuit being configured to receive signals from other communication devices besides the communication device and transmit them to the processor or to send signals from the processor to other communication devices besides the communication device, the processor being configured to implement the method as described in any one of claims 1 to 11 or any one of claims 25 to 28, or to implement the method as described in any one of claims 12 to 28, through logic circuits and / or executing code instructions.

31. The communication device according to claim 30, characterized in that, The communication device is a chip or chip system.

32. A computer-readable storage medium, comprising: The storage medium stores a computer program or instructions that, when executed, cause the method as claimed in any one of claims 1 to 11 or any one of claims 25 to 28 to be implemented, or cause the method as claimed in any one of claims 12 to 28 to be implemented.

33. A computer program product, characterised in that, Includes a computer program that, when run, causes the method of any one of claims 1 to 11 or any one of claims 25 to 28 to be implemented, or causes the method of any one of claims 12 to 28 to be implemented.

Images