Communication method and apparatus

Abstract

A communication method and apparatus, which relate to the technical field of communications, and enable an SSB / PBCH block to be applicable to a narrowband scenario, so as to improve decoding performance. The method comprises: a transmitting-end device obtaining the number of first resource units; on the basis of the number of first resource units, performing rate matching on a first encoded bit sequence, so as to obtain a first sequence; mapping the first sequence to the first resource units, so as to obtain a second sequence; and outputting the second sequence. The number of first resource units corresponds to a first bandwidth, and the first bandwidth is predefined, or the first bandwidth is associated with a bandwidth supported by a terminal device; and the first resource units are some of second resource units, and the second resource units are predefined.

Description

Communication methods and devices

[0001] This application claims priority to Chinese patent application filed on January 27, 2025, with application number 202510127467.0 and entitled "Communication Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communication technology, and in particular to communication methods and apparatus. Background Technology

[0003] In a communication system, terminal equipment can decode the information carried by the synchronization system block / physical broadcast channel block (SSB / PBCH block) to achieve cell access. The SSB / PBCH block can include the primary synchronous signal (PSS), the secondary synchronous signal (SSS), and the PBCH. The PBCH can occupy 20 physical resource blocks (PRBs).

[0004] When the bandwidth supported by the terminal device is small (e.g., less than or equal to 3MHz), even if the subcarrier spacing corresponding to the PBCH is the smallest, the bandwidth occupied by the PBCH is still greater than 3MHz (e.g., 3.6MHz). This results in incomplete information carried by the PBCH received by the terminal device, affecting the decoding performance of the information carried by the PBCH. Therefore, how to make the SSB / PBCH block suitable for narrowband scenarios to improve decoding performance has become an urgent problem to be solved. Summary of the Invention

[0005] This application provides a communication method and apparatus that enables SSB / PBCH blocks to be used in narrowband scenarios, thereby improving decoding performance.

[0006] Firstly, this application provides a communication method that can be executed by a transmitting device. Unless otherwise specified, "transmitting device" in this application can refer to the transmitting device itself, a component within the transmitting device (e.g., a processor, chip, chip system, or integrated circuit), or a logic module or software capable of implementing all or part of the functions of the transmitting device. The method includes: the transmitting device obtaining the number of first resource units; performing rate matching on a first coded bit sequence based on the number of first resource units to obtain a first sequence; mapping the first sequence to first resource units to obtain a second sequence; and outputting the second sequence. The number of first resource units corresponds to a first bandwidth, which is predefined, or the first bandwidth is associated with the bandwidth supported by the terminal device; the first resource units are a portion of the second resource units, and the second resource units are predefined.

[0007] Based on the first aspect, the transmitting device can perform rate matching on the first coded bit sequence according to the number of first resource units to obtain a first sequence, such that the number of bits in the first sequence is the same as the number of bits carried by the first resource unit. This allows the first sequence to be adapted to the first resource unit. Since the first resource unit is a part of the second resource unit, narrowband transmission can be achieved. At the same time, the integrity of information transmission can be guaranteed as much as possible, which can improve the reliability of communication. In addition, if the transmitting device punctures the second resource unit to transmit the bits on the first resource unit, it will result in a large number of bit repetitions in the actual transmission, and less useful information will be transmitted. However, in this application, the transmitting device can perform rate matching on the first coded bit sequence, which can result in more useful information being transmitted, improve the integrity of information transmission, improve decoding performance (such as reducing the bit error rate), and thus reduce performance loss.

[0008] One possible implementation is as follows: the transmitting device obtains the number of third resource units; based on the number of third resource units, it performs rate matching on the first coded bit sequence to obtain a third sequence; it maps the third sequence to third resource units to obtain a fourth sequence; and it outputs the fourth sequence. The third resource units are a subset of the resource units in the second resource units, and the number of third resource units differs from the number of first resource units.

[0009] Based on this possible implementation, the transmitting device can rate-match the first coded bit sequence according to the number of third resource units to obtain a third sequence. Since the third resource unit is a partial resource unit of the second resource unit, narrowband transmission can be achieved; at the same time, the integrity of information transmission can be guaranteed as much as possible, thus improving communication reliability. In addition, since the transmitting device can rate-match the same coded bit sequence, the coding complexity can be reduced, simplifying the implementation.

[0010] One possible implementation is that the transmitting device sends an SSB / PBCH block; wherein the SSB / PBCH block includes a first signal; the first signal corresponds to a second sequence; and the information bit sequence is the broadcast information carried by the PBCH.

[0011] Based on this possible implementation, the SSB / PBCH block can be made suitable for narrowband scenarios, ensuring the integrity of information transmission as much as possible and improving the reliability of communication.

[0012] One possible implementation is that the transmitting device performs polar coding on the sixth sequence of length K1 according to the first information bit position set to obtain a second coded bit sequence of length N1; and performs rate matching on the second coded bit sequence to obtain a first PSS sequence of length L; where N1 is 2 to the power of A, and A is determined according to the number of first resource units.

[0013] One possible implementation is that the transmitting device performs polar coding on the seventh sequence of length K2 according to the second information bit position set to obtain a third coded bit sequence of length N1; and performs rate matching on the third coded bit sequence to obtain a first SSS sequence of length L; where N1 is 2 to the power of A, and A is determined according to the number of first resource units.

[0014] Based on the two possible implementations mentioned above, the transmitting device can determine the first PSS sequence based on the first information bit position set and the first SSS sequence based on the second information bit position set. That is, a unified encoding method can be used to determine the first PSS sequence and the first SSS sequence, thereby enabling the transmission of the second signal (the first PSS sequence corresponds to the second signal) and the third signal (the first SSS sequence corresponds to the third signal), which simplifies the implementation.

[0015] Secondly, this application provides a communication method that can be executed by a receiving device. Unless otherwise specified, "receiving device" in this application can refer to the receiving device itself, a component within the receiving device (e.g., a processor, chip, chip system, or integrated circuit), or a logic module or software capable of implementing all or part of the functions of the receiving device. The method includes: the receiving device receiving information to be decoded; performing de-rate matching on the information to be decoded according to the number of first resource units to obtain a de-rate matching bit sequence; and decoding the de-rate matching bit sequence to obtain a decoding result. The number of first resource units corresponds to a first bandwidth, which is predefined, or the first bandwidth is associated with the bandwidth supported by the terminal device; the first resource unit is a portion of a second resource unit, and the second resource unit is predefined.

[0016] Based on the second aspect, the receiving device can receive the information to be decoded on a portion of the resource units of the second resource unit (i.e., the first resource unit) and decode the information to be decoded. This allows it to receive more useful information, improve decoding performance (such as reducing the bit error rate), and thus reduce performance loss.

[0017] One possible implementation is that the receiving device receives the information to be decoded; based on the number of third resource units, it performs rate matching on the information to be decoded to obtain a rate-matched bit sequence; and it decodes the rate-matched bit sequence to obtain the decoding result. The third resource unit is a subset of the second resource units, and the number of third resource units differs from the number of first resource units.

[0018] Based on this possible implementation, the receiving device can receive the information to be decoded on a portion of the resource units of the second resource unit (i.e., the third resource unit) and decode the information to be decoded. This can result in receiving more useful information, improving decoding performance (such as reducing the bit error rate), and thus reducing performance loss.

[0019] One possible implementation is that the receiving device receives the SSB / PBCH block and accesses the cell based on the SSB / PBCH block. The SSB / PBCH block includes a first signal; the first signal corresponds to a second sequence; and the information bit sequence is the broadcast information carried by the PBCH.

[0020] Based on this possible implementation, the SSB / PBCH block can be made suitable for narrowband scenarios, ensuring the integrity of information transmission as much as possible and improving the reliability of communication.

[0021] Combining the first and second aspects, one possible implementation is that the number of first resource units is X, the number of second resource units is Y, where X and Y are both positive integers, and the first resource unit is the (YX) / 2th to (Y+X) / 2-1th resource unit in the second resource unit; or, the first resource unit is the 0th to X-1th resource unit in the second resource unit; or, the first resource unit is the YXth to Y-1th resource unit in the second resource unit.

[0022] Based on this possible implementation, several feasible schemes for determining the first resource unit are provided. The first resource unit can be determined according to the actual communication scenario, which can better meet the communication needs and thus improve the reliability of communication. At the same time, it can improve the flexibility and diversity of determining the first resource unit.

[0023] Combining the first and second aspects, one possible implementation is that the length of the first coded bit sequence is N, and the length of the first sequence is E, where N and E are both positive integers. When E is less than or equal to N, the first sequence includes the 0th bit to the (E-1)th bit of the first coded bit sequence; or, when E is less than or equal to N, the first sequence includes the (N-1)th bit to the NEth bit of the first coded bit sequence; or, when E is greater than N, the first sequence includes the 0th bit to the (N-1)th bit of the first coded bit sequence, and the 0th bit to the (EN-1)th bit; or, when E is greater than N, the first sequence includes the (N-1)th bit to the 0th bit of the first coded bit sequence, and the (N-1)th bit to the 2*NEth bit.

[0024] Based on this possible implementation, the transmitting device can determine E bits as the first sequence, starting from the first bit of the first coded bit sequence; or, it can determine E bits as the first sequence, starting from the last bit of the first coded bit sequence. The first sequence can be determined according to the actual communication scenario, better meeting communication requirements and thus improving communication reliability; it also increases the flexibility and versatility in determining the first sequence.

[0025] In conjunction with the first and second aspects, one possible implementation is that the SSB / PBCH block further includes a second signal and a third signal; wherein the second signal corresponds to a first PSS sequence of length L; the third signal corresponds to a first SSS sequence of length L; both the first PSS sequence and the first SSS sequence are associated with a base sequence; L is the difference between 2 raised to the power of A and 1, A is determined according to the number of first resource units, and A is a positive integer.

[0026] The second signal can be understood as PSS, and the third signal can be understood as SSS.

[0027] Based on this possible implementation, the length of the first SSS sequence or the first PSS sequence can be determined according to the number of first resource units, and a protection interval can be reserved for the first SSS sequence or the first PSS sequence, which can improve the reliability of communication.

[0028] Combining the first and second aspects, one possible implementation is that the first PSS sequence includes L bits from the second PSS sequence; wherein the second PSS sequence is the first base sequence, or the second PSS sequence is obtained by cyclically shifting the first base sequence; the length of the first base sequence is 127, and the first base sequence is determined according to the initial sequence.

[0029] Based on this possible implementation, the first PSS sequence can be part or all of the bits of the second PSS sequence. By determining the second PSS sequence (e.g., determining the second PSS sequence only once), the corresponding first PSS sequence can be determined based on the second PSS sequence in different bandwidth scenarios, which can simplify the implementation and reduce the complexity of the implementation.

[0030] Combining the first and second aspects, one possible implementation is that the first PSS sequence is the second base sequence; or, the first PSS sequence is obtained by cyclically shifting the second base sequence; wherein, the length of the second base sequence is L, and the second base sequence is determined according to the initial sequence.

[0031] Based on this possible implementation, L can be determined according to the number of first resource units, and the first PSS sequence can be determined according to the second base sequence of length L, so that the determined first PSS sequence can better adapt to different bandwidths, and at the same time, the first PSS sequence can obtain better cross-correlation (such as cross-correlation of 0), thereby improving the reliability of communication.

[0032] Combining the first and second aspects, one possible implementation is that the number of cyclic shift steps corresponding to the second base sequence is the first value; or, the number of cyclic shift steps corresponding to the second base sequence is 2 * the first value; where the first value is the result of rounding down the first ratio, and the first ratio is the ratio of L to 3.

[0033] Based on this possible implementation, different first PSS sequences can be determined based on the second base sequence by different numbers of cyclic shifts, such that the first PSS sequence indicates multiple PCIs.

[0034] Combining the first and second aspects, one possible implementation is that the first SSS sequence includes L bits from the second SSS sequence; wherein the second SSS sequence is determined based on the cyclically shifted third base sequence and the cyclically shifted fourth base sequence, the length of the third base sequence and the length of the fourth base sequence are both 127, and the number of cyclic shift steps corresponding to the third base sequence is different from the number of cyclic shift steps corresponding to the fourth base sequence; the third base sequence and the first base sequence satisfy a first recursive formula, and the fourth base sequence and the first base sequence satisfy a second recursive formula, the first recursive formula and the second recursive formula are different, the length of the first base sequence is 127, and the first base sequence is determined based on the initial sequence.

[0035] Based on this possible implementation, the first SSS sequence can be part or all of the bits of the second SSS sequence. By determining the second SSS sequence (e.g., determining the second SSS sequence only once), the corresponding first SSS sequence can be determined based on the second SSS sequence in different bandwidth scenarios, which can simplify the implementation and reduce the complexity of the implementation.

[0036] Combining the first and second aspects, one possible implementation is that the first SSS sequence is determined based on the fifth base sequence after superposition and the sixth base sequence after cyclic shift; the length of the fifth base sequence and the length of the sixth base sequence are both L; the number of cyclic shift steps corresponding to the fifth base sequence is different from the number of cyclic shift steps corresponding to the sixth base sequence; the fifth base sequence and the second base sequence satisfy the first recursive formula, and the sixth base sequence and the second base sequence satisfy the second recursive formula. The first recursive formula and the second recursive formula are different. The length of the second base sequence is L, and the second base sequence is determined based on the initial sequence.

[0037] Based on this possible implementation, L can be determined according to the number of first resource units, and the first SSS sequence can be determined according to the second base sequence of length L, so that the determined first SSS sequence can better adapt to different bandwidths, and at the same time, the first SSS sequence can obtain better cross-correlation (such as cross-correlation of 0), thereby improving the reliability of communication.

[0038] Combining the first and second aspects, one possible implementation is that the SSB / PBCH block further includes a second signal and a third signal; wherein the second signal corresponds to a first PSS sequence of length L; the third signal corresponds to a first SSS sequence of length L; L is the difference between 2 raised to the power of A and 1, A is determined according to the number of first resource units, and A is a positive integer; the first PSS sequence is determined according to a first information bit position set of length K1, and the first SSS sequence is determined according to a second information bit position set of length K2; the fourth value is the minimum value of an integer power of 2 that is greater than or equal to the first threshold, the fourth value is 2 raised to the power of (K1+K2), K1 and K2 are both positive integers, and the intersection of the first information bit position set and the second information bit position set is an empty set.

[0039] Based on this possible implementation, the transmitting device can determine the first PSS sequence based on the first information bit position set and the first SSS sequence based on the second information bit position set. That is, a unified encoding method can be used to determine the first PSS sequence and the first SSS sequence, thereby enabling the transmission of the second signal (the first PSS sequence corresponds to the second signal) and the third signal (the first SSS sequence corresponds to the third signal), which simplifies the implementation.

[0040] Furthermore, by determining the values ​​of K1 and K2, the first PSS sequence and the first SSS sequence can indicate multiple PCIs (e.g., the number of PCIs can be greater than or equal to 1008), better meeting the requirements for indicating PCIs. Moreover, by determining the values ​​of K1 and K2, different sets of first and second information bit positions can be determined, allowing the first PSS sequence and the first SSS sequence to indicate more PCIs. This also increases the flexibility and diversity in determining the first PSS sequence and the second SSS sequence, making the SSB / PBCH format more unified.

[0041] Combining the first and second aspects, one possible implementation is that the cross-correlation of the second coded bit sequence is less than or equal to the second threshold.

[0042] Based on this possible implementation, the cross-correlation of the second encoded bit sequence can be reduced, thereby improving the reliability of communication.

[0043] Combining the first and second aspects, one possible implementation is that the cross-correlation of the third coded bit sequence is less than or equal to the third threshold.

[0044] Based on this possible implementation, the cross-correlation of the third encoded bit sequence can be reduced, thereby improving the reliability of communication.

[0045] Combining the first and second aspects, one possible implementation is that K1 is less than or equal to K2.

[0046] Based on this possible implementation, the cross-correlation of the first PSS sequence can be minimized to zero, thereby improving communication reliability. Furthermore, the complexity of detecting the first PSS by the receiving device can be reduced; that is, the smaller K1 is, the simpler it is for the receiving device to detect the first PSS.

[0047] Combining the first and second aspects, one possible implementation is that there are two sets of first information bit positions, the number of first resource units corresponding to the two sets of first information bit positions is different, and the difference of the i-th element in the two sets of first information bit positions is a second value; wherein, the second value is predefined, or the second value is an integer power of 2, or the second value is determined according to the number of first resource units corresponding to the two sets of first information bit positions; i = 0, 1, ..., K1-1.

[0048] Based on this possible implementation, by utilizing the nested nature of polar code construction, it is only necessary to determine the set of first information bit positions for one code length. The set of first information bit positions for a longer code length can be obtained from the set of first information bit positions for the aforementioned code length. There is no need to reconstruct the information bit positions again, which can reduce the complexity of encoding or decoding and simplify the implementation.

[0049] Combining the first and second aspects, one possible implementation is that K1 is 4.

[0050] Based on this possible implementation, the cross-correlation of the first PSS sequence can be made as close to 0 as possible, which can improve the reliability of communication.

[0051] Combining the first and second aspects, one possible implementation is that the first information bit position set is [24 28 30 31]; or, the first information bit position set is [56 60 62 63]; or, the first information bit position set is [120 124 126 127].

[0052] Based on this possible implementation, the set of first information bit positions can be determined under different bandwidth scenarios, so that the set of first information bit positions can better meet communication requirements, thereby improving communication performance.

[0053] Combining the first and second aspects, one possible implementation is that there are two sets of second information bit positions, the number of first resource units corresponding to the two sets of second information bit positions is different, and the difference of the j-th element in the two sets of second information bit positions is a third value; wherein, the third value is predefined, or the third value is an integer power of 2, or the third value is determined according to the number of first resource units corresponding to the two sets of second information bit positions; j = 0, 1, ..., K2-1.

[0054] Based on this possible implementation, by utilizing the nested nature of polar code construction, it is only necessary to determine the set of second information bit positions for one code length. The set of second information bit positions for longer code lengths can be obtained from the set of second information bit positions for the aforementioned code lengths. There is no need to reconstruct the information bit positions again, which can reduce the complexity of encoding or decoding and simplify the implementation.

[0055] Combining the first and second aspects, one possible implementation is K2 = 6.

[0056] Combining the first and second aspects, one possible implementation is that the second information bit position set is [4 6 7 8 10 16]; or, the second information bit position set is [36 38 39 40 42 48]; or, the second information bit position set is [100 102 103 104 106 112].

[0057] Based on this possible implementation, the set of second information bit positions can be determined under different bandwidth scenarios, so that the set of second information bit positions can better meet communication requirements, thereby improving communication performance.

[0058] Thirdly, embodiments of this application provide a communication device that can be applied to the transmitting end device described in the first aspect to realize the functions performed by the transmitting end device. The communication device can be the transmitting end device itself, or it can be a chip, chip system, or system-on-a-chip of the transmitting end device, etc. The communication device can execute the functions performed by the transmitting end device through hardware, or it can execute corresponding software through hardware. The hardware or software includes one or more modules corresponding to the above functions. For example, a transceiver module and a processing module. The transceiver module can independently complete the following transceiver operations, or it can cooperate with the processing module to complete the following transceiver operations; correspondingly, the processing module can independently complete the following processing operations, or it can cooperate with the transceiver module to complete the following processing operations, without limitation.

[0059] For example, the processing module is used to obtain the number of first resource units; the number of first resource units corresponds to a first bandwidth, the first bandwidth is predefined, or the first bandwidth is associated with the bandwidth supported by the terminal device; the first resource unit is a part of the second resource unit, and the second resource unit is predefined; the processing module is further used to perform rate matching on the first coded bit sequence according to the number of first resource units to obtain a first sequence; the processing module is further used to map the first sequence to the first resource units to obtain a second sequence; the transceiver module is used to output the second sequence.

[0060] Optionally, the transceiver module and processing module of the communication device in the third aspect may also perform the corresponding functions in the first aspect or any possible design of the first aspect, as detailed in the method examples, and the beneficial effects that can be achieved can also be found in the foregoing related content.

[0061] Fourthly, embodiments of this application provide a communication device that can be applied to the receiving device described in the second aspect to realize the functions performed by the receiving device. The communication device can be the receiving device itself, or it can be a chip, chip system, or system-on-a-chip of the receiving device. The communication device can execute the functions performed by the receiving device through hardware or through corresponding software. The hardware or software includes one or more modules corresponding to the functions described above. For example, a transceiver module and a processing module. The transceiver module can independently complete the following transceiver operations or cooperate with the processing module to complete the following transceiver operations; correspondingly, the processing module can independently complete the following processing operations or cooperate with the transceiver module to complete the following processing operations, without limitation.

[0062] For example, the transceiver module is used for receiving information to be decoded by the receiving device; the number of first resource units corresponds to the first bandwidth, which is predefined, or the first bandwidth is associated with the bandwidth supported by the terminal device; the first resource unit is a part of the second resource unit, which is predefined; the processing module is used to perform de-rate matching on the information to be decoded according to the number of first resource units to obtain a de-rate matching bit sequence; the processing module is also used to decode the de-rate matching bit sequence to obtain a decoding result.

[0063] Optionally, the transceiver module and processing module of the communication device in the fourth aspect may also perform the corresponding functions in the second aspect or any possible design of the second aspect, as detailed in the method examples, and the beneficial effects that can be achieved can also be found in the foregoing related content.

[0064] Fifthly, embodiments of this application provide a communication device, which includes one or more processors; the one or more processors are configured to run computer programs or instructions, such that when the one or more processors execute the computer instructions or instructions, the communication method described in the first aspect is executed, or the communication method described in any of the second aspects is executed.

[0065] In one possible design, the communication device further includes one or more memories coupled to one or more processors, the memories used to store the aforementioned computer programs or instructions. In one possible implementation, the memories are located outside the communication device. In another possible implementation, the memories are located inside the communication device. In embodiments of this application, the processor and memory may also be integrated into a single device, i.e., the processor and memory may be integrated together. In one possible implementation, the communication device further includes a transceiver for receiving and / or transmitting information.

[0066] In one possible design, the communication device further includes one or more communication interfaces coupled to one or more processors, and the communication interfaces are used to communicate with other modules outside the communication device.

[0067] In a sixth aspect, embodiments of this application provide a communication device, which includes an interface circuit and a logic circuit; the interface circuit is used to input and / or output information; the logic circuit is used to execute the communication method as described in any aspect of the first aspect, to process and / or generate information based on the information, or to execute the communication method as described in any aspect of the second aspect, to process and / or generate information based on the information.

[0068] In a seventh aspect, embodiments of this application provide a computer-readable storage medium storing computer instructions or programs that, when executed on a computer, cause the communication method described in either the first or second aspect to be performed.

[0069] Eighthly, embodiments of this application provide a computer program product containing computer instructions that, when run on a computer, causes the communication method described in either the first or second aspect to be executed.

[0070] Ninthly, embodiments of this application provide a computer program that, when run on a computer, causes the communication method described in either the first or second aspect to be executed.

[0071] In a tenth aspect, embodiments of this application provide a chip, including: a processor coupled to a memory, the memory being used to store programs or instructions, which, when executed by the processor, cause the communication method described in the first aspect to be executed, or either the second aspect.

[0072] The technical effects of any of the design methods in aspects three through ten are similar to those in aspects one and two above, and will not be elaborated upon further.

[0073] Eleventhly, embodiments of this application provide a communication system that may include communication means for performing the communication as described in the first aspect or any possible design of the first aspect, and communication means for performing the communication as described in the second aspect or any possible design of the second aspect. Attached Figure Description

[0074] Figure 1 is a schematic diagram of the time-frequency structure of an SSB / PBCH provided in an embodiment of this application;

[0075] Figure 2 is a schematic diagram of the structure of a PRB of a PBCH provided in an embodiment of this application;

[0076] Figure 3 is a schematic diagram of data carried by a PBCH according to an embodiment of this application;

[0077] Figure 4 is a schematic diagram of a simulation result provided in an embodiment of this application;

[0078] Figure 5 is a schematic diagram of a communication system provided in an embodiment of this application;

[0079] Figure 6 is a schematic diagram of encoding and decoding performed by a transmitting end device and a receiving end device according to an embodiment of this application;

[0080] Figure 7 is a schematic diagram of a channel coding process provided in an embodiment of this application;

[0081] Figure 8 is a schematic diagram of the structure of a communication device provided in an embodiment of this application;

[0082] Figure 9 is a flowchart illustrating a communication method provided in an embodiment of this application;

[0083] Figure 10 is a schematic diagram of a first encoded bit sequence with punctured bits provided in an embodiment of this application;

[0084] Figure 11 is a flowchart illustrating another communication method provided in an embodiment of this application;

[0085] Figure 12 is a schematic diagram of a rate matching method provided in an embodiment of this application;

[0086] Figure 13 is a schematic diagram of another simulation result provided by an embodiment of this application;

[0087] Figure 14 is a schematic diagram of a shift register provided in an embodiment of this application;

[0088] Figures 15-17 are schematic diagrams of another time-frequency structure of SSB / PBCH provided in the embodiments of this application;

[0089] Figure 18 is a schematic diagram of the structure of a transmitting device provided in an embodiment of this application;

[0090] Figure 19 is a schematic diagram of the structure of a receiving device provided in an embodiment of this application;

[0091] Figure 20 is a schematic diagram of another communication device provided in an embodiment of this application;

[0092] Figure 21 is a schematic diagram of the structure of another communication device provided in an embodiment of this application. Detailed Implementation

[0093] To facilitate understanding of this application, the channel coding process for the current New Radio (NR) PBCH is described below. This process mainly includes the following steps.

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

[0095] The transmitting device can generate a 32-bit PBCH payload, 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 code. 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.

[0096] 2) Net load scrambling

[0097] The transmitting device can scramble the payload generated in step 1), 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 payload will not be scrambled. All other payload bits need to be scrambled. 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. The original payload bit sequence can be recovered by generating a mask based on the decoded payload bits.

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

[0099] The transmitting device can perform TB-CRC encoding on the scrambled sequence in 2), where the TB-CRC length is 24. It can be understood that the scrambled sequence in 2) is concatenated with a 24-bit CRC, thus resulting in a CRC codeword of length 56.

[0100] 4) Channel coding

[0101] Before encoding, the transmitting device can perform distributed cyclic redundancy check (DCRC) interleaving on the 56-bit CRC codeword in step 3). Since a 24-bit CRC is concatenated after PBCH payload interleaving, the length of the DCRC interleaver is 56. Further, the 56-bit sequence after DCRC interleaving is polar encoded to output a mother code sequence of length 512, where 512 is the length of the polar code mother code.

[0102] 5) Rate matching

[0103] The transmitting device can perform 32-bit sub-block interleaving on the mother code sequence output in 4). Based on the sub-block interleaving, 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).

[0104] 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 the PBCH in the current synchronization signaling block / physical broadcast channel (SSB / PBCH) block, which will be explained in detail below and will not be elaborated here.

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

[0106] The transmitting device can modulate the 864-bit codeword sequence from step 5) 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 QPSK symbol d(i). For example, d(i) can satisfy the following formula:

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

[0108] The transmitting device can map the 432 symbols in 6) sequentially to the 432 REs corresponding to PBCH in the SSB / PBCH block in the order of frequency domain first and time domain second.

[0109] Figure 1 is a schematic diagram of the time-frequency structure of the SSB / PBCH block. As shown in Figure 1, 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. Among them, PSS occupies one OFDM symbol, SSS occupies one OFDM symbol, and PBCH occupies 3 OFDM symbols, one of which is shared with SSS.

[0110] 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 is 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 device cannot determine the relative position of the SSB within a burst based on the PSS and SSS. Thus, the network device needs to explicitly notify the terminal device of this information. This information, along with other essential information for accessing the cell, is mainly carried on the 56-bit payload of the PBCH, where 56 = 32 (PBCH payload) + 24 (CRC). Only by deciphering the payload in the PBCH can the remaining system information block (SIB) broadcast by the network device 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.

[0111] Figure 2 shows a schematic diagram of a PRB carrying the PBCH. One PRB corresponds to 12 REs, which are divided into three equal parts, each containing four REs. One RE in each part (25%) carries the physical broadcast channel-demodulation reference signal (PBCH-DMRS), and the remaining three REs (75%) each carry one symbol (also called PBCH data) after PBCH coding and modulation. The location of the PBCH-DMRS is not fixed and needs to be determined based on the PCI obtained from the joint detection of PSS and SSS. Its offset in each RE is equal to the PCI modulo 4, and the offset can be 0, 1, 2, or 3. Figure 2 shows a schematic diagram with an offset of 1. The purpose of associating the location of the PBCH-DMRS with the PCI is to avoid interference from a cell using the same location of the PBCH-DMRS as a neighboring cell on the same frequency.

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

[0113] Based on the above description of the SSB / PBCH block, the RE corresponding to the SSB / PBCH block can be exemplarily represented as shown in Table 1. In Table 1, the first OFDM symbol can be represented as symbol 1, the second OFDM symbol can be represented as symbol 2, the third OFDM symbol can be represented as symbol 3, and the fourth OFDM symbol can be represented as symbol 4.

[0114] Table 1. RE corresponding to SSB / PBCH blocks

[0115] Optionally, the transmitting device can, based on Table 1, map the 432 symbols (or PBCH data) corresponding to the 864-bit bit sequence after rate matching in the channel coding process of the above NR PBCH 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. As shown in Table 2, taking the offset value of PBCH-DMRS as 0 as an example, a cell with the same symbol length represents an RE. The value in an RE corresponding to symbol 1 and symbol 3 represents the subcarrier number of the current RE. Among them, the REs with subcarrier numbers 56 to 182 in symbol 1 and symbol 3 are the RE positions occupied by the 127-length PSS sequence and SSS sequence, respectively. The cells with "0" in symbol 2, symbol 3, and symbol 4 represent the REs occupied by PBCH-DMRS, and the values ​​in the cells with non-zero values ​​represent the index values ​​of the encoded bits in the rate-matched polar codeword sequence in the parent code sequence. For example, if the rate-matched polar codeword sequence 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. In Table 2, the starting bit of the rate-matched polar codeword sequence is the first bit, and the index value of this bit can be "1"; similarly, the index value of the second bit can be 2, ..., and the index value of the 512th bit can be 512.

[0116] Table 2

[0117] The 3rd Generation Partnership Project (3GPP) Release 18 protocol requires that NR (Radio Frequency Registry) support applications in narrowband spectrum below 5MHz. Examples of narrowband spectrum applications include smart grids, public safety and defense facilities, and the Future Railway Mobile Communication System (FRMCS) in Europe. In these scenarios, dedicated frequency division duplex (FDD) bandwidth resources in the low-frequency band are extremely limited. Even if the transmitting device uses the narrowest bandwidth parameter set, such as a 15kHz subcarrier space (SCS) in a frequency range less than 3GHz, the bandwidth corresponding to the PBCH can only be 3.6MHz, exceeding 3MHz. This causes some bandwidth-constrained receiving devices to be unable to completely receive the data carried by the PBCH, reducing decoding performance.

[0118] To support narrowband scenarios below 3MHz, and in accordance with the requirement in R18 to retain the PSS and SSS unchanged, a feasible approach is for a receiver with a receiving bandwidth of 12 PRBs to not receive the top and bottom four PRBs in the SSB / PBCH block. Specifically, it will not receive data on the REs corresponding to subcarrier numbers 0 to 47 and 192 to 239 in the cells corresponding to symbols 2 and 4 in Table 2. In other words, a receiver with a receiving 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) highlighted in bold in Table 2. Specifically, as shown in Figure 3, the time-frequency structure of the SSB / PBCH block can be shown in Figure 3(a) (i.e., Figure 1), and the time-frequency structure received by the receiver with a receiving bandwidth of 12 PRBs can be shown in Figure 3(b). Figure 3(b) represents the portion within the dashed box shown in Figure 3(a). In other words, narrowband spectrum application scenarios can be supported by punching holes in the top and bottom four PRBs of the time-frequency structure shown in Figure 3(a).

[0119] In Figure 3(b), the bits carried by the PBCH can be represented as shown in the cells corresponding to symbols 2 and 4 in the bold box in Table 2. The PBCH data in the cells corresponding to symbols 2 and 4 in the bold box of Table 2 has a large number of duplicates. For example, the values ​​in the row corresponding to the value 186 in symbol 2 (i.e., 327 and 328) are the same as those in the row corresponding to the value 191 in symbol 4 (i.e., 327 and 328). The PBCH data in the multiple rows following these two rows in symbols 2 and 4 are also the same. That is, the number of codeword bits received by a terminal device with a receiving bandwidth of 12 PRBs can be 432, but there is a large number of duplicates among these 432 bits, resulting in the receiving terminal device with a receiving bandwidth of 12 PRBs actually receiving approximately 228 codeword bits, thus causing a significant loss in the existing PBCH performance. Similarly, if receiving devices with other PRB (such as 8PRB, 6PRB, or 4PRB) receive SSB / PBCH in the above manner, it will also result in a significant loss of existing PBCH performance.

[0120] For example, as shown in Figure 4, the horizontal axis represents the signal-to-noise ratio (SNR), and the vertical axis represents the block error rate (BLER). Curve 1 represents the PBCH data corresponding to 20 PRBs in the SSB / PBCH block received by the receiving device. Curve 2 represents the PBCH data corresponding to 12 PRBs in the SSB / PBCH block received by the receiving device (i.e., not receiving the top and bottom 4 PRBs in the SSB / PBCH block). Curve 3 represents the PBCH data corresponding to 6 PRBs in the SSB / PBCH block received by the receiving device (i.e., not receiving the top and bottom 7 PRBs in the SSB / PBCH block). It can be seen that, with the same SNR, the BLER corresponding to Curve 2 is much greater than the BLER corresponding to Curve 1 (i.e., the decoding performance of PBCH is significantly reduced). Similarly, the BLER corresponding to Curve 3 is much greater than the BLER corresponding to Curve 1 (i.e., the decoding performance of PBCH is significantly reduced).

[0121] Therefore, how to make SSB / PBCH blocks suitable for narrowband scenarios to improve decoding performance has become an urgent problem to be solved.

[0122] This application provides a communication method, comprising: a transmitting device obtaining a number of first resource units; performing rate matching on a first coded bit sequence according to the number of first resource units to obtain a first sequence; mapping the first sequence to first resource units to obtain a second sequence; and outputting the second sequence. Wherein, the number of first resource units corresponds to a first bandwidth, which is predefined, or the first bandwidth is associated with the bandwidth supported by the terminal device; the first resource units are a subset of the second resource units, and the second resource units are predefined.

[0123] In this embodiment, the transmitting device can perform rate matching on the first coded bit sequence according to the number of first resource units to obtain a first sequence, such that the number of bits in the first sequence is the same as the number of bits carried by the first resource unit. This allows the first sequence to be adapted to the first resource unit. Since the first resource unit is a part of the second resource unit, narrowband transmission can be achieved. At the same time, the integrity of information transmission can be guaranteed as much as possible, which can improve the reliability of communication. In addition, if the transmitting device punches holes in the second resource unit to transmit bits from the first resource unit, it will result in a large number of bit repetitions in the actual transmission, and less useful information will be transmitted. However, in this application, the transmitting device can perform rate matching on the first coded bit sequence, which can result in more useful information being transmitted, improve the integrity of information transmission, improve decoding performance (such as reducing the bit error rate), and thus reduce performance loss.

[0124] The embodiments of this application will now be described in detail with reference to the accompanying drawings.

[0125] The communication method provided in this application can be used in any communication system, such as a 3GPP communication system, for example, a long term evolution (LTE) system, a fifth generation (5G) mobile communication system, a hybrid LTE and 5G network system, a vehicle-to-everything (V2X) system, a device-to-device (D2D) communication system, a machine-to-machine (M2M) communication system, an Internet of Things (IoT) system, a narrow band Internet of Things (NB-IoT) system, an ultra-reliable and low-latency communication (URLLC) system, an enhanced machine-type communication (eMTC) system, and various types of future communication systems. It can also be a non-terrestrial network (NTN) system (such as a satellite communication system), a non-3GPP communication system, etc., without limitation.

[0126] The communication system provided in the embodiments of this application will be described below using Figure 5 as an example.

[0127] Figure 5 is a schematic diagram of a communication system provided in an embodiment of this application. As shown in Figure 5, the communication system may include at least one terminal device and at least one network device.

[0128] In Figure 5, the terminal device can be located within the beam / cell coverage area of ​​the network device, and the network device can provide communication services to the terminal device. For example, the network device can use channel coding to encode downlink data and then transmit it to the terminal device via air interface after constellation modulation (i.e., the network device is the transmitting device, and the terminal device is the receiving device); the terminal device can also use channel coding to encode uplink data and then transmit it to the network device via air interface after constellation modulation (i.e., the terminal device is the transmitting device, and the network device is the receiving device). It is understood that when network devices communicate with each other, or when terminal devices communicate with each other, communication can also be based on channel coding; that is, the transmitting and receiving devices can both be network devices or both be terminal devices, without restriction.

[0129] The terminal device in Figure 5 can be a device with wireless transceiver capabilities or a chip or chip system that can be installed on the device. It allows users to access the network and is used to provide voice and / or data connectivity to users. The terminal device can also be called user equipment (UE), subscriber unit, terminal, mobile station (MS), or mobile terminal (MT), etc.

[0130] For example, the terminal device can be a mobile phone, a tablet computer, or a computer with wireless transceiver capabilities. Terminal equipment can also be user stations, mobile stations, remote stations, remote terminal equipment, mobile terminal equipment, user terminal equipment, wireless communication equipment, user agents, user devices, cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), handheld devices with wireless communication capabilities, computing devices, processing devices connected to wireless modems, in-vehicle equipment, wearable devices, terminal equipment in the Internet of Things (IoT), home appliances, virtual reality (VR) terminals, augmented reality (AR) terminals, wireless terminals in industrial control, wireless terminals in autonomous driving, wireless terminals in telemedicine, wireless terminals in smart grids, wireless terminals in smart cities, wireless terminals in smart homes, vehicles with vehicle-to-vehicle (V2V) communication capabilities, intelligent connected vehicles, and UAV-to-UAV communication. Unmanned aerial vehicles (UAVs) with U2U communication capabilities, terminal devices in future networks, or terminal devices in future evolved public land mobile networks (PLMNs) are not subject to restrictions.

[0131] In Figure 5, the network device can be any device deployed in the access network capable of wireless communication with terminal devices. It can also be a chip or chip system that can be configured in the aforementioned device, a logical node or logical module, or a function implemented in software. It is primarily responsible for functions such as air interface-side wireless physical control, resource scheduling, wireless resource management, quality of service management, data compression and encryption, wireless access control, and mobility management. Specifically, the network device can be a device supporting wired access or a device supporting wireless access. Alternatively, in this embodiment, the apparatus for implementing the functions of the network device can be the network device itself; it can also be an apparatus capable of supporting the network device in implementing these functions, such as a chip system, hardware circuit, software module, or a hardware circuit plus a software module. This apparatus can be installed in the network device or used in conjunction with the network device. In this embodiment, only the apparatus for implementing the functions of the network device is described as a network device, and this does not constitute a limitation on the solution of this embodiment.

[0132] For example, a network device can consist of one or more access network (AN) / radio access network (RAN) nodes. AN / RAN nodes can be various types of base stations, such as: satellite base stations, evolved Node Bs (gNBs), transmission reception points (TRPs), evolved Node Bs (eNBs), radio network controllers (RNCs), Node Bs (NBs), base station controllers (BSCs), base transceiver stations (BTSs), home base stations (e.g., home evolved Node Bs, or home Node Bs (HNBs), macro base stations, micro base stations, pico base stations, small cells, relay stations, balloon stations, drone stations, wireless backhaul nodes, base band units (BBUs), or wireless fidelity (Wi-Fi) access points (APs), etc. It is understood that network devices can be terrestrial devices or non-terrestrial devices (such as satellites, drones, high-altitude communication equipment, etc.). Furthermore, in communication systems employing different wireless access technologies, the names of network devices with base station functions may differ, and this application does not impose any restrictions on this.

[0133] In another example, the network equipment may include a BBU and a remote radio unit (RRU). The BBU and RRU can be located in different places; for example, the RRU can be moved remotely to a high-traffic area, while the BBU is located in the central equipment room. The BBU and RRU can also be located in the same equipment room. The BBU and RRU can also be different components under the same rack.

[0134] In another example, the network device can be a device that includes centralized unit (CU) nodes, distributed unit (DU) nodes, or both CU and DU nodes. For instance, the network device can be logically divided into CUs and DUs, with some protocol layer functions centrally controlled by the CU, and the remaining partial or complete protocol layer functions distributed in the DU, which is centrally controlled by the CU. The CU and DU can be separate entities or included in the same network element, such as a BBU. Furthermore, the centralized unit (CU) can be further divided into a control plane (CU-CP) and a user plane (CU-UP).

[0135] In another example, the network device may also be a device that includes a radio unit (RU), or a device that includes a CU, a DU, and a RU. The RU may be included in a radio frequency device or radio frequency unit, such as an RRU, an active antenna unit (AAU), or a remote radio head (RRH).

[0136] It is understood that CU (or CU-CP and CU-UP), DU, or RU may have different names in different systems, 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.

[0137] Network devices and / or terminal devices can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can also be deployed in the air on airplanes, balloons, and satellites. This application does not limit the scenario in which the network devices and terminal devices are located. Furthermore, terminal devices and network devices can be hardware devices, or software functions running on dedicated hardware or general-purpose hardware, such as virtualization functions instantiated on a platform (e.g., a cloud platform), or entities that include dedicated or general-purpose hardware devices and software functions. This application does not limit the specific form of the terminal devices and network devices.

[0138] Based on the above description of the terminal device and network device, optionally, the communication method provided in the embodiments of this application can be implemented by the aforementioned terminal device or network device, or by components of the terminal device or network device, such as by application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or software (such as program code in memory) deployed in the terminal device or network device, without limitation.

[0139] Optionally, in this embodiment, the transmitting device (or source) and the receiving device (or sink) can encode and decode using the process shown in Figure 6 below. The transmitting device can be any terminal device or network device in the communication system shown in Figure 5, and the receiving device can also be any terminal device or network device in the communication system shown in Figure 5.

[0140] In this process, the transmitting device performs source coding on its generated bits to obtain a source bit stream. Then, it performs channel coding on the source bit stream, modulates it, and transmits the modulated symbols to the receiving device through a noisy channel. When the receiving device receives the modulated symbols through the noisy channel, it demodulates them, performs channel decoding to recover the source bit stream, and then performs source decoding to obtain the decoded result.

[0141] Optionally, the transmitting device can implement channel coding based on the process shown in Figure 7. The transmitting device can process the transmit block (TB) received from the Media Access Control (MAC) layer at the physical (PHY) layer (i.e., the TB contains a bit sequence of length A). Right now Then, perform cyclic redundancy check (CRC) encoding (i.e., use the TB-CRC module in Figure 7 to perform CRC encoding on TB) to obtain a bit sequence of length B. Right now Among them, bit sequence It is a bit sequence The result is obtained by concatenating with a bit CRC of length L' (i.e., B = A + L'), where, for example, L' can be 16 or 24.

[0142] Furthermore, the transmitting device can process bit sequences The bit sequence without CRC is segmented to obtain C code blocks (CBCs). bit sequence in The code is segmented to obtain C code blocks, and then each of the C code blocks is CRC encoded (i.e., the bit sequence is encoded using the CB segmentation and CB-CRC module illustrated in Figure 7). (Perform code block segmentation and CRC encoding) to obtain C CRC codeword bit streams of length K. There is a one-to-one correspondence between the C code blocks and the C CRC codeword bit streams (i.e., C CRC codeword bit streams of length K), where C ≥ 1 and C is an integer. If C is 1, CB can be called TB (or TB can be called CB).

[0143] Furthermore, the transmitting device can use a channel coding module to perform channel coding on the C CRC codeword bitstreams (i.e., using the channel coding module in Figure 7) to obtain C channel-coded codewords. Each of the C channel-coded codewords corresponds one-to-one with a C CRC codeword bitstream, meaning each of the C channel-coded codewords corresponds one-to-one with a C code block. In addition, channel coding methods include, but are not limited to, low-density parity-check (LDPC) coding, polar coding, and other error-correcting codes. Specifically, when the bit sequence is calculated according to the mother code length... When segmenting, the length of each channel-coded codeword in the C channel-coded codewords is the length of the mother code of the corresponding code block, that is, the C channel-coded codewords are...

[0144] Furthermore, the transmitting device can use a rate matching module to perform rate matching on each of the C channel-coded codewords to obtain C code blocks, each of length E. In this system, C code blocks, each of length E, correspond one-to-one with C channel-coded codewords. Rate matching can be achieved through at least one of the following methods: puncture, shortening, or repetition. For example, when E is less than N... m In the case where E is greater than N, the rate matching method can be punching or shortening; m In this case, the rate matching method can be repetitive. In one implementation, when E equals N... m When this occurs, it indicates that the channel-coded codeword has not undergone any of the rate matching operations of puncturing, shortening, or repeating.

[0145] Furthermore, the transmitting device can use a bit interleaving module to perform bit interleaving on C code blocks, each of length E, to obtain C interleaved code blocks. The C interleaved code blocks are then concatenated using the CB concatenation module to obtain a bit sequence of length G. Where G = E * C. Finally, the bit sequence is mapped using the modulation and resource element (RE) mapping module. The signal is modulated into quadrature amplitude modulation (QAM) symbols and then mapped onto time-frequency resources for transmission.

[0146] In specific implementation, as shown in Figure 5, each terminal device and network device can adopt the composition structure shown in Figure 8, or include the components shown in Figure 8. Figure 8 is a schematic diagram of the structure of a communication device 800 provided in an embodiment of this application. The communication device 800 can be a terminal device or a chip or system-on-a-chip in a terminal device; it can also be a network device or a chip or system-on-a-chip in a network device. As shown in Figure 8, the communication device 800 includes a processor 801, a transceiver 802, and a communication line 803.

[0147] Furthermore, the communication device 800 may also include a memory 804. The processor 801, memory 804, and transceiver 802 can be connected via a communication line 803.

[0148] The processor 801 can be a central processing unit (CPU), a general-purpose processor, a network processor (NP), a digital signal processor (DSP), a microprocessor, a microcontroller, a programmable logic device (PLD), or any combination thereof. The processor 801 can also be other devices with processing capabilities, such as circuits, devices, or software modules, without limitation.

[0149] Transceiver 802 is used to communicate with other devices or other communication networks. These other communication networks can be Ethernet, radio access network (RAN), wireless local area network (WLAN), etc. Transceiver 802 can be a module, circuit, transceiver, or any device capable of enabling communication.

[0150] Communication line 803 is used to transmit information between the components included in communication device 800.

[0151] The memory 804 is used to store instructions. These instructions can be computer programs.

[0152] The memory 804 can be a read-only memory (ROM) or other type of static storage device that can store static information and / or instructions; it can also be a random access memory (RAM) or other type of dynamic storage device that can store information and / or instructions; it can also be an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compressed optical discs, laser discs, optical discs, digital universal optical discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, etc., without limitation.

[0153] The memory 804 can exist independently of the processor 801 or be integrated with the processor 801. The memory 804 can be used to store instructions, program code, or some data. The memory 804 can be located inside or outside the communication device 800, without limitation. The processor 801 is used to execute the instructions stored in the memory 804 to implement the communication method provided in the following embodiments of this application.

[0154] In one example, processor 801 may include one or more CPUs, such as CPU0 and CPU1 in Figure 8.

[0155] As an optional implementation, the communication device 800 may include multiple processors, for example, in addition to the processor 801 in FIG8, it may also include a processor 807.

[0156] As an optional implementation, the communication device 800 also includes an output device 805 and an input device 806. For example, the input device 806 is a device such as a keyboard, mouse, microphone, or joystick, and the output device 805 is a device such as a display screen or speaker.

[0157] The communication device 800 can be a desktop computer, a portable computer, a web server, a mobile phone, a tablet computer, a wireless terminal, an embedded device, a chip system, or a device with a similar structure to that shown in Figure 8. Furthermore, the composition shown in Figure 8 does not constitute a limitation on the communication device. In addition to the components shown in Figure 8, the communication device may include more or fewer components than shown, or combine certain components, or have different component arrangements.

[0158] In this embodiment of the application, the chip system may be composed of chips or may include chips and other discrete devices.

[0159] Furthermore, the actions, terms, etc., involved in the various embodiments of this application can be referenced interchangeably without limitation. The message names or parameter names in the messages exchanged between the various devices in the embodiments of this application are merely examples, and other names may be used in specific implementations without limitation.

[0160] The communication method provided in the embodiments of this application will be described below with reference to the communication system shown in Figure 5 and Figure 9. The transmitting device can be any terminal device or network device in the communication system shown in Figure 5, and the receiving device can also be any terminal device or network device in the communication system shown in Figure 5. The transmitting or receiving device described in the following embodiments may include the components shown in Figure 8.

[0161] Figure 9 is a flowchart of a communication method provided in an embodiment of this application. As shown in Figure 9, the method may include:

[0162] Step 901: The sending device obtains the number of first resource units.

[0163] Optionally, the resource unit can be a time-frequency resource unit, such as a RE; or, the resource unit can be a frequency-domain resource unit, such as a PRB, RB, or subcarrier; or, the resource unit can be a time-domain resource unit, such as a symbol (e.g., an OFDM symbol).

[0164] The number of first resource units (denoted as X, where X is a positive integer) corresponds to the first bandwidth. A first resource unit can be understood as a resource unit within the first bandwidth (e.g., a first resource unit can be a PRB included in the first bandwidth). Similarly, the number of first resource units can be understood as the number of resource units within the first bandwidth.

[0165] For the first bandwidth, this application proposes the following possible examples:

[0166] In the first example, the first bandwidth can be predefined. For example, the first bandwidth can be 2.6MHz; or, the first bandwidth can include 4PRB; or, the first bandwidth can include 6PRB; or, the first bandwidth can include 8PRB; or, the first bandwidth can include 12PRB.

[0167] In the second example, the first bandwidth can be associated with the bandwidth supported by the terminal device.

[0168] For example, the first bandwidth can be the minimum receiving bandwidth supported by the terminal device. Taking a minimum receiving bandwidth supported by the terminal device as 2.6MHz as an example, the first bandwidth can be 2.6MHz.

[0169] For example, the first bandwidth can be the receiving bandwidth of the terminal device. Taking the receiving bandwidth of the terminal device as any of the following: 2.6MHz, 2.8MHz, 3MHz as an example, the first bandwidth can be 2.6MHz, or the first bandwidth can be 2.8MHz, or the first bandwidth can be 3MHz.

[0170] For example, the first bandwidth can be the minimum value of the receiving bandwidth of multiple terminal devices. Taking the receiving bandwidth of terminal device 0 as 2.6MHz and the receiving bandwidth of terminal device 1 as 3MHz as an example, the first bandwidth can be 2.6MHz.

[0171] For example, the first bandwidth can be the receiving bandwidth when at least one of the multiple terminal devices is in power-saving mode.

[0172] In this context, the first resource unit is a subset of the second resource unit, which is predefined. The number of second resource units can be denoted as Y, where Y is a positive integer.

[0173] In the first example, the first resource unit can be the (YX) / 2th to (Y+X) / 2-1th resource units in the second resource unit (or, as can be understood, the first resource unit can be the Xth resource unit in the middle of the second resource unit). For example, taking the resource unit as PRB, assuming the number of second resource units is 20 and the number of first resource units is 4, then the first resource unit can be the 8th to 11th PRB in the second resource unit. Or, taking the resource unit as RE, assuming the number of second resource units is 432 and the number of first resource units is 72, then the first resource unit can be the 180th to 251st RE in the second resource unit.

[0174] In the second example, the first resource unit can be the 0th to the (X-1th)th resource unit in the second resource unit (or, as can be understood, the first resource unit can be the first X resource units in the second resource unit). For example, taking the resource unit as PRB, assuming the number of second resource units is 20 and the number of first resource units is 4, then the first resource unit can be the 0th to the 3rd PRB in the second resource unit. Or, taking the resource unit as RE, assuming the number of second resource units is 432 and the number of first resource units is 72, then the first resource unit can be the 0th to the 71st RE in the second resource unit.

[0175] In the third example, the first resource unit can be the YXth to the (Y-1th)th resource unit in the second resource unit (or, as can be understood, the first resource unit can be the last X resource units in the second resource unit). Taking PRB as an example, assuming the number of second resource units is 20 and the number of first resource units is 4, then the first resource unit can be the 16th to the 19th PRB in the second resource unit. Alternatively, taking RE as an example, assuming the number of second resource units is 432 and the number of first resource units is 72, then the first resource unit can be the 360th to the 431st RE in the second resource unit.

[0176] Based on the above three examples, the sending device can determine the first resource unit in the second resource unit according to the actual communication scenario, which can better meet the communication needs and thus improve the reliability of communication; at the same time, it can improve the flexibility and diversity of determining the first resource unit.

[0177] In this application, unless otherwise specified, the serial numbers (or indexes, numbers) start from 0, which is only for convenience. For example, the starting resource unit of the first resource unit can be the 0th resource unit. It is understood that the serial numbers (or indexes, numbers) can also start from 1. In this case, the corresponding serial number (or index, number) is based on the serial number (or index, number) shown in this application plus 1. For example, if the numbering starts from 1, the 0th resource unit in this application can be the 1st resource unit.

[0178] Step 902: The transmitting device performs rate matching on the first coded bit sequence according to the number of first resource units to obtain the first sequence.

[0179] Specifically, the transmitting device can determine the number of bits corresponding to the first resource unit (e.g., the number of bits that the first resource unit can carry) based on the number of first resource units; then, it can perform rate matching on the first coded bit sequence based on the number of bits corresponding to the first resource unit (e.g., E, where E is a positive integer) to obtain the first sequence. The length of the first sequence can be the number of bits corresponding to the first resource unit (i.e., E).

[0180] In one example, taking a resource unit (PRB) as an example, E can be the product of the number of first resource units, the number of subcarriers in a PRB, the number of OFDM symbols, the modulation order, and a first difference, where the first difference is the difference between 1 and the proportion of PBCH-DMRS in the first resource unit. For example, assuming the number of OFDM symbols is 2, the modulation order is 2, and the proportion of PBCH-DMRS in the first resource unit is 1 / 4, if X is 4, E can be 144 (i.e., 4*12*2*2*(1-1 / 4)=144). Or, if X is 6, E can be 216 (i.e., 6*12*2*2*(1-1 / 4)=216). Or, if X is 8, E can be 288 (i.e., 8*12*2*2*(1-1 / 4)=288). Or, if X is 12, E can be 432 (i.e., 12*12*2*2*(1-1 / 4)=432).

[0181] In another example, taking the resource unit as RE, E can be the product of the number of first resource units, the modulation order, and the first difference. The first difference can be the difference between 1 and the proportion of PBCH-DMRS in the first resource unit. For example, taking a modulation order of 2 and the proportion of PBCH-DMRS in the first resource unit as 1 / 4, assuming X is 96, E can be 144 (i.e., 96*2*(1-1 / 4)=144). Or, assuming X is 6, E can be 216 (i.e., 144*2*(1-1 / 4)=216). Or, assuming X is 8, E can be 288 (i.e., 192*2*(1-1 / 4)=288). Or, assuming X is 12, E can be 432 (i.e., 288*2*(1-1 / 4)=432).

[0182] It is understood that, unless otherwise specified, this application uses PRB as an example to illustrate the following embodiments.

[0183] The length of the first encoded bit sequence can be denoted as N, where N is a positive integer. For example, N can be an integer power of 2, such as 512; or 1024; or 256.

[0184] Optionally, the transmitting device can encode the information bit sequence of length K to obtain a first encoded bit sequence. For example, the transmitting device can perform LDPC encoding on the information bit sequence to obtain the first encoded bit sequence; or, the transmitting device can perform polar encoding on the information bit sequence to obtain the first encoded bit sequence, without limitation.

[0185] Where K is a positive integer. For example, the information bit sequence may include information bits and cyclic redundancy check (CRC) bits, and K may be the sum of the number of information bits and the number of CRC bits in the information bit sequence. Alternatively, the information bit sequence may include only the information bits themselves without CRC bits, and K may be the number of information bits.

[0186] For example, the information bit sequence can be broadcast information carried on the PBCH, such as the PBCH payload, or the PBCH payload and CRC bits. In this case, the second resource unit can be a resource unit in the resources occupied by the PBCH, as described in Figure 1 for details, which will not be repeated here.

[0187] Optionally, the transmitting device may determine the rate matching method according to E and N. For example, if E > N, the determined rate matching method is repetition, that is, after the transmitting device sends the mother code with length N, it sends (E - N) bits again. If E < N, the transmitting device may determine whether to puncture from front to back or shorten from back to front according to the current code rate R = K / E. If R < 7 / 16, rate matching is performed in the way of puncturing from front to back, that is, puncturing (N - E) bits from front to back; otherwise, shortening (N - E) bits from back to front.

[0188] Optionally, the first sequence may be the bit sequence obtained by the transmitting device performing rate matching on the first coded bit sequence, or the first sequence may be the bit sequence obtained by the transmitting device performing rate matching and interleaving on the first coded bit sequence, without limitation.

[0189] Step 903: The transmitting device maps the first sequence to the first resource unit to obtain a second sequence.

[0190] Among them, the second sequence may be understood as the bit sequence obtained by mapping the first sequence to the first resource unit; or the second sequence may be understood as the modulated symbol sequence obtained by mapping the first sequence to the first resource unit (that is, obtained by modulating the first sequence), without limitation.

[0191] Step 904: The transmitting device outputs the second sequence; correspondingly, the receiving device receives the information to be decoded from the transmitting device.

[0192] It can be understood that when the modulated symbol sequence sent by the transmitting device to the receiving device is transmitted through the channel, it may be affected by interference such as noise, and the information to be demodulated received by the receiving device is the modulated symbol sequence affected by interference such as noise.

[0193] Optionally, the receiving device may demodulate the information to be demodulated to obtain the information to be decoded.

[0194] It can be understood that the receiving device may receive the information to be decoded on the first resource unit. The first resource unit may refer to the above description of the first resource unit and will not be elaborated here.

[0195] Step 905: The receiving device performs rate dematching on the information to be decoded according to the number of the first resource units to obtain a rate dematched bit sequence.

[0196] Step 906: The receiving device decodes the rate dematched bit sequence to obtain a decoding result.

[0197] Based on the communication method shown in Figure 9, the transmitting device can perform rate matching on the first coded bit sequence according to the number of first resource units to obtain a first sequence, so that the number of bits in the first sequence is the same as the number of bits carried by the first resource unit. This allows the first sequence to be adapted to the first resource unit. Since the first resource unit is a part of the second resource unit, narrowband transmission can be achieved. At the same time, the integrity of information transmission can be guaranteed as much as possible, and the reliability of communication can be improved.

[0198] Furthermore, if the transmitting device punctures the second resource unit to transmit bits from the first resource unit, it will result in a large amount of bit duplication during transmission, leading to less useful information being transmitted. In other words, the transmitting device can perform rate matching on the first coded bit sequence based on the number of second resource units, map the rate-matched coded bit sequence to the second resource units, and obtain the first resource unit by puncturing the second resource unit, directly transmitting the bits from the first resource unit. As shown in Figure 10, taking N as 512 and E (the number of bits corresponding to the first resource unit) as 216 as an example, the horizontal axis represents the index of the bit in the first coded bit sequence, and the vertical axis represents the indicator of whether the bit in the first coded bit sequence has been punctured (or can be understood as whether it has been transmitted). For example, an indicator that is not 0 indicates that the bit has been punctured (or can be understood as the bit not being transmitted), and an indicator that is 0 indicates that the bit has not been punctured (or can be understood as the bit being transmitted). For a bit, if the indicator of its corresponding vertical coordinate is 0, it can be said that the bit has not been punctured. If the indicator of its corresponding vertical coordinate is not only 0 (for example, the vertical coordinate of the 100th bit is [-1,1]), it can be said that the bit has been punctured. As can be seen from Figure 10, puncturing the second resource unit to transmit the bits in the first resource unit will cause most of the bits in the first coded bit sequence to not be transmitted, resulting in less useful information actually transmitted. In this application, the transmitting device can perform rate matching on the first coded bit sequence, which can make more useful information actually transmitted (such as transmitting bits 0 to 215 of the first coded bit sequence, or bits 296 to 511 of the first coded bit sequence, i.e., the actual transmitted bits are not repeated, and more useful information is transmitted), which can improve the integrity of information transmission, thereby improving decoding performance (such as reducing the bit error rate) and reducing performance loss.

[0199] Based on the communication method shown in Figure 9, optionally, the transmitting device can communicate with multiple receiving devices. Taking the existence of two receiving devices (such as the first receiving device and the second receiving device) as an example, it is assumed that the transmitting device can communicate with the first receiving device based on the first resource unit (refer to the steps shown in Figure 9 above), and the transmitting device can communicate with the second receiving device based on the third resource unit (refer to the steps shown in Figure 11). Regardless of whether the number of the first resource units and the number of the third resource units are the same or different, the transmitting device can perform rate matching based on the same coded bit sequence (i.e., the first coded bit sequence) to achieve communication with different receiving devices.

[0200] The third resource unit is a portion of the resource units in the second resource unit, and the number of the third resource units (which can be denoted as Z) is different from the number of the first resource units.

[0201] Optionally, the rule for determining the third resource unit from the second resource unit can be the same as the rule for determining the first resource unit from the second resource unit. Alternatively, the rule for determining the third resource unit from the second resource unit can be different from the rule for determining the first resource unit from the second resource unit.

[0202] In one example, the first resource unit can be the (YX) / 2nd to (Y+X) / 2-1st resource units in the second resource unit, and the third resource unit can be the (YZ) / 2nd to (Y+Z) / 2-1st resource units in the second resource unit. Wherein, if X is greater than Z, the third resource unit can be the (XZ) / 2nd to (X+Z) / 2-1st resource units in the first resource unit; similarly, if X is less than Z, the first resource unit can be the (ZX) / 2nd to (X+Z) / 2-1st resource units in the third resource unit.

[0203] Alternatively, the first resource unit can be the 0th to the (X-1)th resource unit in the second resource unit, and the third resource unit can be the 0th to the (Z-1)th resource unit in the second resource unit. Wherein, if X is greater than Z, the third resource unit can be the 0th to the (Z-1)th resource unit in the first resource unit; similarly, if X is less than Z, the first resource unit can be the 0th to the (X-1)th resource unit in the third resource unit.

[0204] Alternatively, the first resource unit can be the YXth to Y-1th resource units in the second resource unit, and the third resource unit can be the YZth to Y-1th resource units in the second resource unit. Wherein, if X is greater than Z, the third resource unit can be the XZth to X-1th resource units in the first resource unit; similarly, if X is less than Z, the first resource unit can be the ZXth to Z-1th resource units in the third resource unit.

[0205] Based on the above embodiments, nesting of the first resource unit and the third resource unit can be achieved. Similarly, nesting of the first resource unit, the third resource unit, and the second resource unit can be achieved. In actual transmission, the second resource unit can be directly punched to obtain the first resource unit (or the third resource unit), and the bits carried by the first resource unit (or the third resource unit) can be transmitted, which simplifies the implementation.

[0206] In addition, the method of determining the first resource unit (or the third resource unit) can be standardized, which can simplify the implementation and reduce the complexity of implementation.

[0207] In another example, the first resource unit can be the (YX) / 2nd to (Y+X) / 2-1st resource units in the second resource unit, and the third resource unit can be the 0th to Z-1st resource units in the second resource unit.

[0208] It is understood that the resource units in the first resource unit may be partially the same as the resource units in the third resource unit, or the resource units in the first resource unit may be completely different from the resource units in the third resource unit, and this application does not limit this.

[0209] The communication between the transmitting device and the second receiving device based on the third resource unit can be shown in Figure 11:

[0210] Step 1101: The transmitting device obtains the number of third resource units.

[0211] The third resource unit is a portion of the resource units in the second resource unit. The determination of the number of the third resource units can refer to the determination of the number of the first resource units in step 901, and will not be repeated here.

[0212] Step 1102: The transmitting device performs rate matching on the first coded bit sequence according to the number of third resource units to obtain the third sequence.

[0213] The first encoded bit sequence can be referred to in the description of the first encoded bit sequence in step 902 above, and will not be repeated here.

[0214] Understandably, the transmitting device can perform rate matching on the same coded bit sequence (i.e., the first coded bit sequence). In other words, the transmitting device can encode the information bit sequence once to obtain the first coded bit sequence. During communication with different receiving devices, it does not need to repeatedly encode the information bit sequence; it can directly perform rate matching on the first coded bit sequence based on the number of resource units (such as the first resource unit or the third resource unit) to achieve communication with different receiving devices.

[0215] Step 1103: The transmitting device maps the third sequence to the third resource unit to obtain the fourth sequence.

[0216] The fourth sequence can be referred to in step 903 for the description of the second sequence, and will not be repeated here.

[0217] Step 1104: The transmitting device outputs the fourth sequence; correspondingly, the second receiving device receives the decoding information from the transmitting device.

[0218] Step 1105: The second receiving device performs de-rate matching on the information to be decoded according to the number of third resource units, and obtains the de-rate matching bit sequence.

[0219] Step 1106: The second receiving device decodes the rate-matched bit sequence to obtain the decoding result.

[0220] Based on the communication method shown in Figure 11, the transmitting device can perform rate matching on the first coded bit sequence according to the number of third resource units to obtain the third sequence. Since the third resource unit is a part of the second resource unit, narrowband transmission can be achieved; at the same time, the integrity of information transmission can be guaranteed as much as possible, thus improving the reliability of communication. In addition, since the transmitting device can perform rate matching on the same coded bit sequence, the coding complexity can be reduced, simplifying the implementation.

[0221] Based on the communication method shown in Figures 9 and 11, the transmitting device can communicate with the first receiving device and the second receiving device. Similarly, the transmitting device can communicate with the third receiving device, the fourth receiving device, and so on. Regardless of whether the number of resource units corresponding to the third receiving device, the fourth receiving device, and so on is the same or different, the transmitting device can perform rate matching on the first coded bit sequence to realize communication with the third receiving device, the fourth receiving device, and so on. The specific steps can be referred to the description of the second receiving device and the third resource unit in this application, and will not be repeated here.

[0222] Furthermore, the bit sequences corresponding to the rate-matched third receiving device, fourth receiving device, etc., can all refer to the description of the first or third sequence in this application, and will not be repeated here.

[0223] Optionally, the transmitting device can perform rate matching on the first coded bit sequence (the length of the first coded bit sequence can be denoted as N) to obtain a rate-matched bit sequence (such as the first sequence). The relationship between the first sequence (the length of the first sequence can be denoted as E) and the first coded bit sequence can be implemented in the following three possible ways:

[0224] In the first possible implementation, when E is less than or equal to N, the rate matching method can be shortening. For example, the first sequence may include bits 0 to E-1 of the first coded bit sequence.

[0225] In a second possible implementation, when E is less than or equal to N, rate matching can be achieved through puncturing. For example, the first sequence may include the (N-1)th to the NEth bits of the first coded bit sequence.

[0226] In the third possible implementation, when E is greater than N, the rate matching method can be repetition.

[0227] In one example, E bits can be determined as the first sequence, starting from the 0th bit of the first coded bit sequence. For example, the first sequence may include the 0th bit to the (N-1)th bit and the 0th bit to the (EN-1)th bit of the first coded bit sequence.

[0228] In another example, E bits can be determined as the first sequence, starting from the (N-1)th bit of the first coded bit sequence. For example, the first sequence may include the (N-1)th bit to the 0th bit and the (N-1)th bit to the 2*NEth bit of the first coded bit sequence.

[0229] Based on the three possible embodiments described above, the transmitting device can determine E bits as the first sequence starting from the start bit of the first coded bit sequence; or, it can determine E bits as the first sequence starting from the end bit of the first coded bit sequence. That is, the transmitting device can determine the first sequence according to the actual communication scenario, which can make the determined first sequence better meet the communication requirements, thereby improving the reliability of communication; at the same time, it can improve the flexibility and diversity of determining the first sequence.

[0230] Based on the above three possible implementations, this application provides a possible embodiment. Taking N as 512 as an example, as shown in Figure 12(a), the transmitting device can determine E bits as the first sequence, starting from the 0th bit of the first encoded bit sequence. When E is 144, the first sequence can be bits 0 to 143 of the first encoded bit sequence; when E is 216, the first sequence can be bits 0 to 215 of the first encoded bit sequence, that is, bits 144 to 215 of the first encoded bit sequence can be determined based on bits 0 to 143 of the first encoded bit sequence; when E is 288, the first sequence can be bits 0 to 287 of the first encoded bit sequence, that is, bits 215 to 287 of the first encoded bit sequence can be determined based on bits 0 to 215 of the first encoded bit sequence. In the case of E = 432, the first sequence can be the 0th to the 431st bits of the first encoded bit sequence, that is, the 288th to the 431st bits of the first encoded bit sequence can be determined based on the 0th to the 287th bits of the first encoded bit sequence; in the case of E = 864, the first sequence can be the 0th to the 511th bits and the 0th to the 351st bits of the first encoded bit sequence, that is, the 432nd to the 511th bits and the 0th to the 351st bits of the first encoded bit sequence can be determined based on the 0th to the 431st bits of the first encoded bit sequence.

[0231] Alternatively, as shown in Figure 12(b), the first sequence can be determined starting from the 511th bit of the first coded bit sequence, with E bits as the first sequence. When E is 144, the first sequence can be bits 511 to 368 of the first coded bit sequence; when E is 216, the first sequence can be bits 511 to 296 of the first coded bit sequence, that is, bits 367 to 296 of the first coded bit sequence can be determined based on bits 511 to 368; when E is 288, the first sequence can be bits 511 to 224 of the first coded bit sequence, that is, bits 295 to 296 of the first coded bit sequence can be determined based on bits 511 to 296. 224 bits; when E is 432, the first sequence can be the 511th to the 80th bits of the first coded bit sequence, that is, the 223rd to the 80th bits of the first coded bit sequence can be determined based on the 511th to the 224th bits of the first coded bit sequence; when E is 864, the first sequence can be the 511th to the 0th bits and the 511th to the 160th bits of the first coded bit sequence, that is, the 79th to the 0th bits and the 511th to the 160th bits of the first coded bit sequence can be determined based on the 511th to the 80th bits of the first coded bit sequence.

[0232] It is understandable that the relationship between the third sequence and the first encoded bit sequence can also be one of the three possible implementations mentioned above, which will not be elaborated here.

[0233] Optionally, if the length of the third sequence is greater than the length of the first sequence, the first sequence can be E bits of the third sequence; or, if the length of the third sequence is less than the length of the first sequence, the third sequence can be E' bits of the first sequence (E' being the length of the third sequence). In other words, the first or third sequence can be determined starting from the 0th bit of the first encoded bit sequence; or, the first or third sequence can be determined starting from the (N-1)th bit of the first encoded bit sequence.

[0234] For example, the first sequence can be bits 0 to E-1 of the first coded bit sequence, and the third sequence can be bits 0 to E'-1 of the first coded bit sequence; for example, if E' is greater than E, the first sequence can be bits 0 to E' of the third sequence. Alternatively, the first sequence can be bits E-1 to 0 of the first coded bit sequence, and the third sequence can be bits E-1 to 0 of the first coded bit sequence; for example, if E' is greater than E, the first sequence can be bits 0 to E' of the third sequence.

[0235] For example, taking a third sequence with a length of 432 and a first sequence with a length of 144, and assuming N is 512, the first sequence can include bits 0 to 143 of the first coded bit sequence, and the third sequence can include bits 0 to 431 of the first coded bit sequence; that is, the first sequence can be bits 0 to 143 of the third sequence. Alternatively, the first sequence can include bits 511 to 368 of the first coded bit sequence, and the third sequence can include bits 511 to 80 of the first coded bit sequence; that is, the first sequence can be bits 0 to 143 of the third sequence.

[0236] Based on the description of the first sequence (or the third sequence), the transmitting device can map the first sequence (or the third sequence) to the first resource unit (or the third resource unit). Optionally, the transmitting device can map the first sequence sequentially to the first resource unit (that is, map the 0th bit to the (E-1)th bit of the first sequence to the first resource unit in sequence), or the transmitting device can map the first sequence in reverse order to the first resource unit (that is, map the (E-1)th bit to the 0th bit of the first sequence to the first resource unit in sequence).

[0237] Similarly, the transmitting device can map the third sequence to the third resource unit. The transmitting device can map the third sequence sequentially to the third resource unit (that is, map the 0th bit to the E'-1th bit of the third sequence to the first resource unit in sequence) (E' can be the length of the third sequence). Alternatively, the transmitting device can map the third sequence to the third resource unit in reverse order (that is, map the E'-1th bit to the 0th bit of the third sequence to the third resource unit in sequence).

[0238] This application provides three possible designs, specifically describing the mapping relationship between the first sequence and the first resource unit. In the first possible design, the first resource unit is the (YX) / 2th to (Y+X) / 2-1th resource units in the second resource unit. In the second possible design, the first resource unit is the 0th to X-1th resource units in the second resource unit. In the third possible design, the first resource unit is the YXth to Y-1th resource units in the second resource unit. Taking the resource unit as a PRB (one PRB includes 12 subcarriers) and the second resource unit as the resource unit corresponding to the resources occupied by the PBCH (i.e., 20 PRBs) as an example, the mapping relationship between the first sequence and the subcarriers corresponding to X PRBs is specifically described.

[0239] The first possible design is described in detail below:

[0240] The first resource unit is the (YX) / 2nd to (Y+X) / 2-1st resource units in the second resource unit. The transmitting device can map the first sequence to the subcarriers corresponding to the (YX) / 2nd to (Y+X) / 2-1st PRBs of the 20 PRBs.

[0241] Specifically, the transmitting device can map the 0th bit to the (E-1)th bit of the first sequence to the first resource unit; or, if the first resource unit includes a third resource unit (the number of third resource units is Z, where Z is less than X), the transmitting device can map the third sequence to the third resource unit, and map the bits in the first sequence other than the third sequence to the resource units in the first resource unit other than the third resource unit.

[0242] For example, taking the first sequence as bits 0 to E-1 of the first coded bit sequence, and the third sequence as bits 0 to E'-1 of the first coded bit sequence, where E is greater than E', the third sequence can be bits 0 to E'-1 of the first sequence. Assuming the first resource unit may include the third resource unit, the transmitting device can map the third sequence (i.e., bits 0 to E'-1 of the first sequence) to the third resource unit (i.e., the subcarriers corresponding to the (YZ) / 2nd PRB of the second resource unit to the subcarriers corresponding to the (Y+Z) / 2-1st PRB), and map bits E to E'-1 of the first sequence to resource units other than the third resource unit in the first resource unit (i.e., the subcarriers corresponding to the (YX) / 2nd PRB of the second resource unit to the subcarriers corresponding to the (YZ) / 2-1st PRB, and the subcarriers corresponding to the (Y+Z) / 2nd PRB to the subcarriers corresponding to the (Y+X) / 2-1st PRB).

[0243] It is understandable that the first resource unit can be nested with the third resource unit. Taking the first resource unit including the third resource unit as an example, the third resource unit can be located in the middle of the first resource unit. That is, the bits carried by the third resource unit are the same as the bits carried by the resource unit in the middle part of the first resource unit. In actual transmission, the first resource unit can be directly punctured to obtain the third resource unit, and the bits carried by the third resource unit can be transmitted, which simplifies the implementation.

[0244] Similarly, the first resource unit and the third resource unit can be nested with the second resource unit. In actual transmission, the second resource unit can be directly punched to obtain the first resource unit (or the third resource unit), and the bits carried by the first resource unit (or the third resource unit) can be transmitted, which can simplify the implementation.

[0245] Based on the first possible design, this application provides five possible implementations, in which the number of first resource units varies.

[0246] In the first possible implementation, the number of first resource units can be 4, in which case the number of OFDM symbols can be 2, and the number of bits carried by the first resource unit can be 144 (i.e., the length of the first sequence can be 144). The transmitting device can map the 0th to the 143rd bits of the first sequence sequentially to the 96th to the 143rd subcarriers in the second resource unit (i.e., a total of 4*12=48 subcarriers); or, the transmitting device can map the 143rd to the 0th bits of the first sequence sequentially to the 96th to the 143rd subcarriers in the second resource unit.

[0247] In the second possible implementation, the number of first resource units can be 6, the number of OFDM symbols can be 2, and the number of bits carried by the first resource unit can be 216 (that is, the length of the first sequence can be 216).

[0248] In one example, the transmitting device can map the 0th to the 215th bits of the first sequence sequentially to the 84th to the 155th subcarriers in the second resource unit (i.e., a total of 6*12=72 subcarriers); or, the transmitting device can map the 215th to the 0th bits of the first sequence sequentially to the 84th to the 155th subcarriers in the second resource unit.

[0249] In another example, the transmitting device may map bits 0 through 143 of the first sequence sequentially to subcarriers 96 through 143 in the second resource unit, and bits 144 through 215 of the first sequence sequentially to subcarriers 84 through 96 and subcarriers 144 through 155 in the second resource unit; or, the transmitting device may map bits 143 through 0 of the first sequence sequentially to subcarriers 96 through 143 in the second resource unit, and bits 251 through 144 of the first sequence sequentially to subcarriers 84 through 96 and subcarriers 144 through 155 in the second resource unit.

[0250] In the third possible implementation, the number of first resource units can be 8, the number of OFDM symbols can be 2, and the number of bits carried by the first resource unit can be 288 (that is, the length of the first sequence can be 288).

[0251] In the first example, the transmitting device can map the 0th to the 287th bits of the first sequence sequentially to the 72nd to the 167th subcarriers in the second resource unit (i.e., a total of 8*12=96 subcarriers); or, the transmitting device can map the 287th to the 0th bits of the first sequence sequentially to the 72nd to the 167th subcarriers in the second resource unit.

[0252] In the second example, the transmitting device can sequentially map bits 0 to 143 of the first sequence to subcarriers 96 to 143 in the second resource unit; sequentially map bits 144 to 215 of the first sequence to subcarriers 84 to 96 and subcarriers 144 to 155 in the second resource unit; and sequentially map bits 216 to 287 of the first sequence to subcarriers 72 to 83 and subcarriers 156 to 167 in the second resource unit.

[0253] Alternatively, the transmitting device may map bits 143 to 0 of the first sequence sequentially to subcarriers 96 to 143 in the second resource unit; map bits 215 to 144 of the first sequence sequentially to subcarriers 84 to 96 and subcarriers 144 to 155 in the second resource unit; and map bits 287 to 216 of the first sequence sequentially to subcarriers 72 to 83 and subcarriers 156 to 167 in the second resource unit.

[0254] In the third example, the transmitting device can sequentially map bits 0 through 215 of the first sequence to subcarriers 84 through 155 in the second resource unit; and sequentially map bits 216 through 287 of the first sequence to subcarriers 72 through 83 and subcarriers 156 through 167 in the second resource unit. Alternatively, the transmitting device can sequentially map bits 215 through 0 of the first sequence to subcarriers 84 through 155 in the second resource unit; and sequentially map bits 287 through 216 of the first sequence to subcarriers 72 through 83 and subcarriers 156 through 167 in the second resource unit.

[0255] In the fourth possible implementation, the number of first resource units can be 12, the number of OFDM symbols can be 2, and the number of bits carried by the first resource unit can be 432 (that is, the length of the first sequence can be 432).

[0256] In the first example, the transmitting device can map the 0th to the 431st bits of the first sequence sequentially to the 48th to the 191st subcarriers in the second resource unit (i.e., a total of 12*12=144 subcarriers); or, the transmitting device can map the 431st to the 0th bits of the first sequence sequentially to the 48th to the 191st subcarriers in the second resource unit.

[0257] In the second example, the transmitting device can sequentially map bits 0 to 143 of the first sequence to subcarriers 96 to 143 in the second resource unit; sequentially map bits 144 to 215 of the first sequence to subcarriers 84 to 96 and subcarriers 144 to 155 in the second resource unit; sequentially map bits 216 to 287 of the first sequence to subcarriers 72 to 83 and subcarriers 156 to 167 in the second resource unit; and sequentially map bits 288 to 431 of the first sequence to subcarriers 48 to 71 and subcarriers 168 to 191 in the second resource unit.

[0258] Alternatively, the transmitting device may sequentially map bits 143 to 0 of the first sequence to subcarriers 96 to 143 in the second resource unit; sequentially map bits 215 to 144 of the first sequence to subcarriers 84 to 96 and subcarriers 144 to 155 in the second resource unit; sequentially map bits 287 to 216 of the first sequence to subcarriers 72 to 83 and subcarriers 156 to 167 in the second resource unit; and sequentially map bits 431 to 288 of the first sequence to subcarriers 48 to 71 and subcarriers 168 to 191 in the second resource unit.

[0259] In the third example, the transmitting device can sequentially map bits 0 to 215 of the first sequence to subcarriers 84 to 155 in the second resource unit; sequentially map bits 216 to 287 of the first sequence to subcarriers 72 to 83 and subcarriers 156 to 167 in the second resource unit; and sequentially map bits 288 to 431 of the first sequence to subcarriers 48 to 71 and subcarriers 168 to 191 in the second resource unit.

[0260] Alternatively, the transmitting device may map bits 215 through 0 of the first sequence sequentially to subcarriers 84 through 155 in the second resource unit; map bits 287 through 216 of the first sequence sequentially to subcarriers 72 through 83 and subcarriers 156 through 167 in the second resource unit; and map bits 431 through 288 of the first sequence sequentially to subcarriers 48 through 71 and subcarriers 168 through 191 in the second resource unit.

[0261] In the fourth example, the transmitting device may map bits 0 through 287 of the first sequence sequentially to subcarriers 72 through 167 in the second resource unit; and may map bits 288 through 431 of the first sequence sequentially to subcarriers 48 through 71 and subcarriers 168 through 191 in the second resource unit. Alternatively, the transmitting device may map bits 287 through 0 of the first sequence sequentially to subcarriers 72 through 167 in the second resource unit; and may map bits 431 through 288 of the first sequence sequentially to subcarriers 48 through 71 and subcarriers 168 through 191 in the second resource unit.

[0262] In the fifth possible implementation, the number of first resource units can be 20. In this case, the number of OFDM symbols corresponding to some resource units in the first resource unit can be 2, the number of OFDM symbols corresponding to other resource units in the first resource unit can be 3, and the number of bits carried by the first resource unit can be 864 (that is, the length of the first sequence can be 864).

[0263] In the first example, the transmitting device can sequentially map bits 0 through 431 of the first sequence to subcarriers 48 through 191 in the second resource unit; and sequentially map bits 432 through 863 of the first sequence to subcarriers 0 through 47 and subcarriers 192 through 239 in the second resource unit. Alternatively, the transmitting device can sequentially map bits 431 through 0 of the first sequence to subcarriers 48 through 191 in the second resource unit; and sequentially map bits 863 through 432 of the first sequence to subcarriers 0 through 47 and subcarriers 192 through 239 in the second resource unit.

[0264] In the second example, the transmitting device can sequentially map bits 0 through 143 of the first sequence to subcarriers 96 through 143 in the second resource unit; sequentially map bits 144 through 215 of the first sequence to subcarriers 84 through 96 and subcarriers 144 through 155 in the second resource unit; and sequentially map bits 216 through 287 of the first sequence to subcarrier 72 in the second resource unit. Up to the 83rd subcarrier, and the 156th to the 167th subcarriers in the second resource unit; the 288th to the 431st bits of the first sequence are sequentially mapped to the 48th to the 71st subcarriers in the second resource unit, and the 168th to the 191st subcarriers in the second resource unit; the 432nd to the 863rd bits of the first sequence are sequentially mapped to the 0th to the 47th subcarriers in the second resource unit, and the 192nd to the 239th subcarriers in the second resource unit.

[0265] Alternatively, the transmitting device may map bits 143 to 0 of the first sequence sequentially to subcarriers 96 to 143 in the second resource unit; map bits 215 to 144 of the first sequence sequentially to subcarriers 84 to 96 and subcarriers 144 to 155 in the second resource unit; and map bits 287 to 216 of the first sequence sequentially to subcarriers 72 to 143 in the second resource unit. 83 subcarriers, and subcarriers 156 to 167 in the second resource unit; bits 431 to 288 of the first sequence are sequentially mapped to subcarriers 48 to 71 in the second resource unit, and subcarriers 168 to 191 in the second resource unit; bits 863 to 432 of the first sequence are sequentially mapped to subcarriers 0 to 47 and subcarriers 192 to 239 in the second resource unit.

[0266] In the third example, the transmitting device can sequentially map bits 0 to 215 of the first sequence to subcarriers 84 to 155 in the second resource unit; sequentially map bits 216 to 287 of the first sequence to subcarriers 72 to 83 and subcarriers 156 to 167 in the second resource unit; sequentially map bits 288 to 431 of the first sequence to subcarriers 48 to 71 and subcarriers 168 to 191 in the second resource unit; and sequentially map bits 432 to 863 of the first sequence to subcarriers 0 to 47 and subcarriers 192 to 239 in the second resource unit.

[0267] Alternatively, the transmitting device may sequentially map bits 215 through 0 of the first sequence to subcarriers 84 through 155 in the second resource unit; sequentially map bits 287 through 216 of the first sequence to subcarriers 72 through 83 and subcarriers 156 through 167 in the second resource unit; sequentially map bits 431 through 288 of the first sequence to subcarriers 48 through 71 and subcarriers 168 through 191 in the second resource unit; and sequentially map bits 863 through 432 of the first sequence to subcarriers 0 through 47 and subcarriers 192 through 239 in the second resource unit.

[0268] In the fourth example, the transmitting device can sequentially map bits 0 to 287 of the first sequence to subcarriers 72 to 167 in the second resource unit; sequentially map bits 288 to 431 of the first sequence to subcarriers 48 to 71 and subcarriers 168 to 191 in the second resource unit; and sequentially map bits 432 to 863 of the first sequence to subcarriers 0 to 47 and subcarriers 192 to 239 in the second resource unit.

[0269] Alternatively, the transmitting device may map bits 287 through 0 of the first sequence sequentially to subcarriers 72 through 167 in the second resource unit; map bits 431 through 288 of the first sequence sequentially to subcarriers 48 through 71 and subcarriers 168 through 191 in the second resource unit; and map bits 863 through 432 of the first sequence sequentially to subcarriers 0 through 47 and subcarriers 192 through 239 in the second resource unit.

[0270] In the second possible design, the first resource unit is the 0th to the (X-1)th resource units in the second resource unit, and the transmitting device can map the first sequence to the subcarriers corresponding to the 0th to the (X-1)th PRBs of the 20 PRBs.

[0271] Specifically, the transmitting device can map the 0th bit to the (E-1)th bit of the first sequence to the first resource unit; or, if the first resource unit includes a third resource unit (the number of third resource units is Z, where Z is less than X), the transmitting device can map the third sequence to the third resource unit, and map the bits in the first sequence other than the third sequence to the resource units in the first resource unit other than the third resource unit.

[0272] For example, taking the first sequence as bits 0 to E-1 of the first coded bit sequence, and the third sequence as bits 0 to E'-1 of the first coded bit sequence, where E is greater than E', the third sequence can be bits 0 to E'-1 of the first sequence. Assuming the first resource unit may include the third resource unit, the transmitting device can map the third sequence (i.e., bits 0 to E'-1 of the first sequence) to the third resource unit (i.e., the subcarriers corresponding to the 0th PRB to the (Z-1th PRB) of the second resource unit), and map bits E to E'-1 of the first sequence to resource units other than the third resource unit in the first resource unit (i.e., the subcarriers corresponding to the Zth PRB to the (X-1th PRB) of the second resource unit).

[0273] It is understandable that the first resource unit can be nested with the third resource unit. Taking the first resource unit including the third resource unit as an example, the third resource unit can be located at the beginning of the first resource unit. That is, the bits carried by the third resource unit are the same as the bits carried by the resource unit at the beginning of the first resource unit. In actual transmission, the first resource unit can be directly punctured to obtain the third resource unit, and the bits carried by the third resource unit can be transmitted, which simplifies the implementation.

[0274] Similarly, the first resource unit and the third resource unit can be nested with the second resource unit. In actual transmission, the second resource unit can be directly punched to obtain the first resource unit (or the third resource unit), and the bits carried by the first resource unit (or the third resource unit) can be transmitted, which can simplify the implementation.

[0275] Based on the second possible design, this application provides five possible implementations, in which the number of first resource units varies.

[0276] In the first possible implementation, the number of first resource units can be 4, in which case the number of OFDM symbols can be 2, and the number of bits carried by the first resource unit can be 144 (i.e., the length of the first sequence can be 144). The transmitting device can map the 0th to the 143rd bits of the first sequence sequentially to the 0th to the 47th subcarriers in the second resource unit (i.e., a total of 4*12=48 subcarriers); or, the transmitting device can map the 143rd to the 0th bits of the first sequence sequentially to the 0th to the 47th subcarriers in the second resource unit.

[0277] In the second possible implementation, the number of first resource units can be 6, the number of OFDM symbols can be 2, and the number of bits carried by the first resource unit can be 216 (that is, the length of the first sequence can be 216).

[0278] In one example, the transmitting device can map the 0th to the 215th bits of the first sequence sequentially to the 0th to the 71st subcarriers in the second resource unit (i.e., a total of 6*12=72 subcarriers); or, the transmitting device can map the 215th to the 0th bits of the first sequence sequentially to the 0th to the 71st subcarriers in the second resource unit.

[0279] In another example, the transmitting device can map bits 0 to 143 of the first sequence sequentially to subcarriers 0 to 47 in the second resource unit (i.e., a total of 4*12=48 subcarriers); and map bits 144 to 215 of the first sequence sequentially to subcarriers 48 to 71 in the second resource unit.

[0280] Alternatively, the transmitting device may map bits 143 to 0 of the first sequence sequentially to subcarriers 0 to 71 in the second resource unit; and map bits 215 to 144 of the first sequence sequentially to subcarriers 48 to 71 in the second resource unit.

[0281] In the third possible implementation, the number of first resource units can be 8, the number of OFDM symbols can be 2, and the number of bits carried by the first resource unit can be 2882 (that is, the length of the first sequence can be 288).

[0282] In the first example, the transmitting device can map the 0th to the 287th bits of the first sequence sequentially to the 0th to the 95th subcarriers in the second resource unit (i.e., a total of 8*12=96 subcarriers); or, the transmitting device can map the 287th to the 0th bits of the first sequence sequentially to the 0th to the 95th subcarriers in the second resource unit.

[0283] In the second example, the transmitting device can sequentially map bits 0 to 143 of the first sequence to subcarriers 0 to 47 in the second resource unit; sequentially map bits 144 to 215 of the first sequence to subcarriers 48 to 71 in the second resource unit; and sequentially map bits 216 to 287 of the first sequence to subcarriers 72 to 95 in the second resource unit.

[0284] Alternatively, the transmitting device may map bits 143 to 0 of the first sequence sequentially to subcarriers 0 to 71 in the second resource unit; map bits 215 to 144 of the first sequence sequentially to subcarriers 48 to 71 in the second resource unit; and map bits 287 to 216 of the first sequence sequentially to subcarriers 72 to 95 in the second resource unit.

[0285] In the third example, the transmitting device can sequentially map bits 0 through 215 of the first sequence to subcarriers 0 through 71 in the second resource unit; and sequentially map bits 216 through 287 of the first sequence to subcarriers 72 through 95 in the second resource unit. Alternatively, the transmitting device can sequentially map bits 215 through 0 of the first sequence to subcarriers 0 through 71 in the second resource unit; and sequentially map bits 287 through 216 of the first sequence to subcarriers 72 through 95 in the second resource unit.

[0286] In the fourth possible implementation, the number of first resource units can be 12, the number of OFDM symbols can be 2, and the number of bits carried by the first resource unit can be 432 (that is, the length of the first sequence can be 432).

[0287] In the first example, the transmitting device can map the 0th to the 431st bits of the first sequence sequentially to the 0th to the 143rd subcarriers in the second resource unit (i.e., a total of 12*12=144 subcarriers); or, the transmitting device can map the 431st to the 0th bits of the first sequence sequentially to the 0th to the 143rd subcarriers in the second resource unit.

[0288] In the second example, the transmitting device can sequentially map bits 0 to 143 of the first sequence to subcarriers 0 to 47 in the second resource unit; sequentially map bits 144 to 215 of the first sequence to subcarriers 48 to 71 in the second resource unit; sequentially map bits 216 to 287 of the first sequence to subcarriers 72 to 95 in the second resource unit; and sequentially map bits 288 to 431 of the first sequence to subcarriers 95 to 143 in the second resource unit.

[0289] Alternatively, the transmitting device may map bits 143 to 0 of the first sequence sequentially to subcarriers 0 to 71 in the second resource unit; bits 215 to 144 of the first sequence sequentially to subcarriers 48 to 71 in the second resource unit; bits 287 to 216 of the first sequence sequentially to subcarriers 72 to 95 in the second resource unit; and bits 431 to 288 of the first sequence sequentially to subcarriers 95 to 143 in the second resource unit.

[0290] In the third example, the transmitting device can sequentially map bits 0 to 215 of the first sequence to subcarriers 0 to 71 in the second resource unit; sequentially map bits 216 to 287 of the first sequence to subcarriers 72 to 95 in the second resource unit; and sequentially map bits 288 to 431 of the first sequence to subcarriers 95 to 143 in the second resource unit.

[0291] Alternatively, the transmitting device may map bits 215 through 0 of the first sequence sequentially to subcarriers 0 through 71 in the second resource unit; and bits 287 through 216 of the first sequence sequentially to subcarriers 72 through 95 in the second resource unit; or bits 431 through 288 of the first sequence sequentially to subcarriers 95 through 143 in the second resource unit.

[0292] In the fourth example, the transmitting device can sequentially map bits 0 through 287 of the first sequence to subcarriers 0 through 95 in the second resource unit; the transmitting device can sequentially map bits 288 through 431 of the first sequence to subcarriers 95 through 143 in the second resource unit. Alternatively, the transmitting device can sequentially map bits 287 through 0 of the first sequence to subcarriers 0 through 95 in the second resource unit; the transmitting device can sequentially map bits 431 through 288 of the first sequence to subcarriers 95 through 143 in the second resource unit.

[0293] In the fifth possible implementation, the number of first resource units can be 20. In this case, the number of OFDM symbols corresponding to some resource units in the first resource unit can be 2, the number of OFDM symbols corresponding to other resource units in the first resource unit can be 3, and the number of bits carried by the first resource unit can be 720 (that is, the length of the first sequence can be 720).

[0294] In the first example, the transmitting device can sequentially map bits 0 through 431 of the first sequence to subcarriers 0 through 143 in the second resource unit; and sequentially map bits 432 through 719 of the first sequence to subcarriers 144 through 239 in the second resource unit. Alternatively, the transmitting device can sequentially map bits 431 through 0 of the first sequence to subcarriers 0 through 143 in the second resource unit; and sequentially map bits 719 through 432 of the first sequence to subcarriers 144 through 239 in the second resource unit.

[0295] In the second example, the transmitting device can sequentially map bits 0 to 143 of the first sequence to subcarriers 0 to 47 in the second resource unit; sequentially map bits 144 to 215 of the first sequence to subcarriers 48 to 71 in the second resource unit; sequentially map bits 216 to 287 of the first sequence to subcarriers 72 to 95 in the second resource unit; the transmitting device can sequentially map bits 288 to 431 of the first sequence to subcarriers 95 to 143 in the second resource unit; and sequentially map bits 432 to 719 of the first sequence to subcarriers 144 to 239 in the second resource unit.

[0296] Alternatively, the transmitting device may map bits 143 to 0 of the first sequence sequentially to subcarriers 0 to 71 in the second resource unit; bits 215 to 144 of the first sequence sequentially to subcarriers 48 to 71 in the second resource unit; bits 287 to 216 of the first sequence sequentially to subcarriers 72 to 95 in the second resource unit; bits 431 to 288 of the first sequence sequentially to subcarriers 95 to 143 in the second resource unit; and bits 719 to 432 of the first sequence sequentially to subcarriers 144 to 239 in the second resource unit.

[0297] In the third example, the transmitting device can sequentially map bits 0 to 215 of the first sequence to subcarriers 0 to 71 in the second resource unit; sequentially map bits 216 to 287 of the first sequence to subcarriers 72 to 95 in the second resource unit; sequentially map bits 288 to 431 of the first sequence to subcarriers 95 to 143 in the second resource unit; and sequentially map bits 432 to 719 of the first sequence to subcarriers 144 to 239 in the second resource unit.

[0298] Alternatively, the transmitting device may sequentially map bits 215 through 0 of the first sequence to subcarriers 0 through 71 in the second resource unit; sequentially map bits 287 through 216 of the first sequence to subcarriers 72 through 95 in the second resource unit; sequentially map bits 431 through 288 of the first sequence to subcarriers 95 through 143 in the second resource unit; sequentially map bits 719 through 432 of the first sequence to subcarriers 144 through 239 in the second resource unit; and sequentially map bits 432 through 719 of the first sequence to subcarriers 144 through 239 in the second resource unit.

[0299] In the fourth example, the transmitting device can map the 0th to the 287th bits of the first sequence to the 0th to the 95th subcarriers in the second resource unit in sequence; the transmitting device can map the 288th to the 431st bits of the first sequence to the 95th to the 143rd subcarriers in the second resource unit in sequence.

[0300] Alternatively, the transmitting device may map bits 287 through 0 of the first sequence sequentially to subcarriers 0 through 95 in the second resource unit; the transmitting device may map bits 431 through 288 of the first sequence sequentially to subcarriers 95 through 143 in the second resource unit; and may map bits 719 through 432 of the first sequence sequentially to subcarriers 144 through 239 in the second resource unit.

[0301] In the third possible design, the first resource unit is the (Y-1)th to (YX)th resource units in the second resource unit. The transmitting device can map the first sequence to the subcarriers corresponding to the (Y-1)th to (YX)th PRBs of the 20 PRBs.

[0302] Specifically, the transmitting device can map the 0th bit to the (E-1)th bit of the first sequence to the first resource unit; or, if the first resource unit includes a third resource unit (the number of third resource units is Z, where Z is less than X), the transmitting device can map the third sequence to the third resource unit, and map the bits in the first sequence other than the third sequence to the resource units in the first resource unit other than the third resource unit.

[0303] For example, taking the first sequence as bits 0 to E-1 of the first coded bit sequence, and the third sequence as bits 0 to E'-1 of the first coded bit sequence, where E is greater than E', the third sequence can be bits 0 to E'-1 of the first sequence. Assuming the first resource unit may include the third resource unit, the transmitting device can map the third sequence (i.e., bits 0 to E'-1 of the first sequence) to the third resource unit (i.e., the subcarriers corresponding to the (Y-1)th PRB to the (YZ)th PRB of the second resource unit), and map bits E to E'-1 of the first sequence to resource units other than the third resource unit in the first resource unit (i.e., the subcarriers corresponding to the (YZ-1)th PRB to the (YX)th PRB of the second resource unit).

[0304] It is understandable that the first resource unit can be nested with the third resource unit. Taking the first resource unit including the third resource unit as an example, the third resource unit can be located at the end of the first resource unit. That is, the bits carried by the third resource unit are the same as the bits carried by the resource unit at the end of the first resource unit. In actual transmission, the first resource unit can be directly punctured to obtain the third resource unit, and the bits carried by the third resource unit can be transmitted, which simplifies the implementation.

[0305] Similarly, the first resource unit and the third resource unit can be nested with the second resource unit. In actual transmission, the second resource unit can be directly punched to obtain the first resource unit (or the third resource unit), and the bits carried by the first resource unit (or the third resource unit) can be transmitted, which can simplify the implementation.

[0306] Based on the third possible design, this application provides five possible implementations, in which the number of first resource units varies.

[0307] In the first possible implementation, the number of first resource units can be 4, the number of OFDM symbols can be 3, and the number of bits carried by the first resource unit can be 144 (i.e., the length of the first sequence can be 144). The transmitting device can map the 0th to the 144th bits of the first sequence sequentially to the 239th to the 192nd subcarriers in the second resource unit (i.e., a total of 4*12=48 subcarriers); or, the transmitting device can map the 144th to the 0th bits of the first sequence sequentially to the 239th to the 192nd subcarriers in the second resource unit.

[0308] In the second possible implementation, the number of first resource units can be 6, the number of OFDM symbols can be 2, and the number of bits carried by the first resource unit can be 216 (that is, the length of the first sequence can be 216).

[0309] In one example, the transmitting device can map the 0th to the 215th bits of the first sequence sequentially to the 239th to the 168th subcarriers in the second resource unit (i.e., a total of 6*12=72 subcarriers); or, the transmitting device can map the 215th to the 0th bits of the first sequence sequentially to the 239th to the 168th subcarriers in the second resource unit.

[0310] In another example, the transmitting device may map bits 0 through 143 of the first sequence sequentially to subcarriers 239 through 192 in the second resource unit; and bits 144 through 215 of the first sequence sequentially to subcarriers 191 through 168 in the second resource unit. Alternatively, the transmitting device may map bits 143 through 0 of the first sequence sequentially to subcarriers 239 through 192 in the second resource unit; and bits 215 through 143 of the first sequence sequentially to subcarriers 191 through 168 in the second resource unit.

[0311] In the third possible implementation, the number of first resource units can be 8, the number of OFDM symbols can be 2, and the number of bits carried by the first resource unit can be 2882 (that is, the length of the first sequence can be 288).

[0312] In the first example, the transmitting device can map the 0th to the 287th bits of the first sequence sequentially to the 239th to the 144th subcarriers in the second resource unit (i.e., a total of 8*12=96 subcarriers); or, the transmitting device can map the 287th to the 0th bits of the first sequence sequentially to the 239th to the 144th subcarriers in the second resource unit.

[0313] In the second example, the transmitting device can sequentially map bits 0 to 143 of the first sequence to subcarriers 239 to 192 in the second resource unit; sequentially map bits 144 to 215 of the first sequence to subcarriers 191 to 168 in the second resource unit; and sequentially map bits 216 to 287 of the first sequence to subcarriers 167 to 144 in the second resource unit.

[0314] Alternatively, the transmitting device may map bits 143 to 0 of the first sequence sequentially to subcarriers 239 to 192 in the second resource unit; map bits 215 to 144 of the first sequence sequentially to subcarriers 191 to 168 in the second resource unit; and map bits 287 to 216 of the first sequence sequentially to subcarriers 167 to 144 in the second resource unit.

[0315] In the third example, the transmitting device can sequentially map bits 0 to 215 of the first sequence to subcarriers 239 to 168 in the second resource unit; and sequentially map bits 216 to 287 of the first sequence to subcarriers 167 to 144 in the second resource unit.

[0316] Alternatively, the transmitting device may map bits 215 through 0 of the first sequence sequentially to subcarriers 239 through 168 in the second resource unit; and may map bits 287 through 216 of the first sequence sequentially to subcarriers 167 through 144 in the second resource unit.

[0317] In the fourth possible implementation, the number of first resource units can be 12, the number of OFDM symbols can be 2, and the number of bits carried by the first resource unit can be 432 (that is, the length of the first sequence can be 432).

[0318] In the first example, the transmitting device can map the 0th to the 431st bits of the first sequence sequentially to the 239th to the 96th subcarriers in the second resource unit (i.e., a total of 8*12=96 subcarriers); or, the transmitting device can map the 431st to the 0th bits of the first sequence sequentially to the 239th to the 96th subcarriers in the second resource unit.

[0319] In the second example, the transmitting device can sequentially map bits 0 to 143 of the first sequence to subcarriers 239 to 192 in the second resource unit; sequentially map bits 144 to 215 of the first sequence to subcarriers 191 to 168 in the second resource unit; sequentially map bits 216 to 287 of the first sequence to subcarriers 167 to 144 in the second resource unit; and sequentially map bits 288 to 431 of the first sequence to subcarriers 143 to 96 in the second resource unit.

[0320] Alternatively, the transmitting device may sequentially map bits 143 to 0 of the first sequence to subcarriers 239 to 192 in the second resource unit; sequentially map bits 215 to 144 of the first sequence to subcarriers 191 to 168 in the second resource unit; sequentially map bits 287 to 216 of the first sequence to subcarriers 167 to 144 in the second resource unit; and sequentially map bits 431 to 288 of the first sequence to subcarriers 143 to 96 in the second resource unit.

[0321] In the third example, the transmitting device can sequentially map bits 0 to 215 of the first sequence to subcarriers 239 to 168 in the second resource unit; sequentially map bits 216 to 287 of the first sequence to subcarriers 167 to 144 in the second resource unit; and sequentially map bits 288 to 431 of the first sequence to subcarriers 143 to 96 in the second resource unit.

[0322] Alternatively, the transmitting device may map bits 215 through 0 of the first sequence sequentially to subcarriers 239 through 168 in the second resource unit; bits 287 through 216 of the first sequence sequentially to subcarriers 167 through 144 in the second resource unit; and bits 431 through 288 of the first sequence sequentially to subcarriers 143 through 96 in the second resource unit.

[0323] In the fourth example, the transmitting device can sequentially map bits 0 through 287 of the first sequence to subcarriers 239 through 144 in the second resource unit; and sequentially map bits 288 through 431 of the first sequence to subcarriers 143 through 96 in the second resource unit. Alternatively, the transmitting device can sequentially map bits 287 through 0 of the first sequence to subcarriers 239 through 144 in the second resource unit; and sequentially map bits 431 through 288 of the first sequence to subcarriers 143 through 96 in the second resource unit.

[0324] In the fifth possible implementation, the number of first resource units can be 20. In this case, the number of OFDM symbols corresponding to some resource units in the first resource unit can be 2, and the number of bits carried by the first resource unit can be 720 (that is, the length of the first sequence can be 720).

[0325] In the first example, the transmitting device can sequentially map bits 0 through 431 of the first sequence to subcarriers 239 through 96 in the second resource unit; and sequentially map bits 432 through 719 of the first sequence to subcarriers 95 through 0 in the second resource unit. Alternatively, the transmitting device can sequentially map bits 431 through 0 of the first sequence to subcarriers 239 through 96 in the second resource unit; and sequentially map bits 719 through 432 of the first sequence to subcarriers 95 through 0 in the second resource unit.

[0326] In the second example, the transmitting device can sequentially map bits 0 to 143 of the first sequence to subcarriers 239 to 192 in the second resource unit; sequentially map bits 144 to 215 of the first sequence to subcarriers 191 to 168 in the second resource unit; sequentially map bits 216 to 287 of the first sequence to subcarriers 167 to 144 in the second resource unit; sequentially map bits 288 to 431 of the first sequence to subcarriers 143 to 96 in the second resource unit; and sequentially map bits 432 to 719 of the first sequence to subcarriers 95 to 0 in the second resource unit.

[0327] Alternatively, the transmitting device may sequentially map bits 143 to 0 of the first sequence to subcarriers 239 to 192 in the second resource unit; sequentially map bits 215 to 144 of the first sequence to subcarriers 191 to 168 in the second resource unit; sequentially map bits 287 to 216 of the first sequence to subcarriers 167 to 144 in the second resource unit; sequentially map bits 431 to 288 of the first sequence to subcarriers 143 to 96 in the second resource unit; and sequentially map bits 719 to 432 of the first sequence to subcarriers 95 to 0 in the second resource unit.

[0328] In the third example, the transmitting device can sequentially map bits 0 to 215 of the first sequence to subcarriers 239 to 168 in the second resource unit; sequentially map bits 216 to 287 of the first sequence to subcarriers 167 to 144 in the second resource unit; sequentially map bits 288 to 431 of the first sequence to subcarriers 143 to 96 in the second resource unit; and sequentially map bits 432 to 719 of the first sequence to subcarriers 95 to 0 in the second resource unit.

[0329] Alternatively, the transmitting device may sequentially map bits 215 through 0 of the first sequence to subcarriers 239 through 168 in the second resource unit; sequentially map bits 287 through 216 of the first sequence to subcarriers 167 through 144 in the second resource unit; sequentially map bits 431 through 288 of the first sequence to subcarriers 143 through 96 in the second resource unit; and sequentially map bits 719 through 432 of the first sequence to subcarriers 95 through 0 in the second resource unit.

[0330] In the fourth example, the transmitting device can sequentially map bits 0 to 287 of the first sequence to subcarriers 239 to 144 in the second resource unit; sequentially map bits 288 to 431 of the first sequence to subcarriers 143 to 96 in the second resource unit; and sequentially map bits 432 to 719 of the first sequence to subcarriers 95 to 0 in the second resource unit.

[0331] Alternatively, the transmitting device may map bits 287 through 0 of the first sequence sequentially to subcarriers 239 through 144 in the second resource unit; map bits 431 through 288 of the first sequence sequentially to subcarriers 143 through 96 in the second resource unit; and map bits 719 through 432 of the first sequence sequentially to subcarriers 95 through 0 in the second resource unit.

[0332] Based on the above description of the first sequence and the first resource unit, the first resource unit can be the resource unit included in the resources occupied by PBCH transmission in a narrowband scenario. Figure 13 presents a simulation performance comparison diagram of the decoding performance corresponding to different decoding methods for PBCH transmission under different numbers of first resource units. The horizontal axis is SNR, and the vertical axis is BLER; the lower the curve, the better the decoding performance. The first method is the communication method shown in Figure 9 (i.e., rate matching of the first coded bit sequence to obtain the first sequence and mapping it to the first resource unit). The second method is to puncture the second resource unit to obtain the first resource unit and transmit the bits carried by the first resource unit.

[0333] Taking PRB as an example, when the number of first resource units is 20, the curves corresponding to PBCH transmission based on the first and second methods can be shown as curve 11. The curves corresponding to different methods basically overlap in the figure, and the decoding performance is basically the same. When the number of first resource units is 12, the curve corresponding to PBCH transmission based on the first method is shown as curve 22, and the curve corresponding to PBCH transmission based on the second method is shown as curve 21. It can be seen that the decoding performance corresponding to curve 22 is better than that corresponding to curve 21 (there is a 2dB gain), that is, the decoding performance of the scheme in this application is better. When the number of first resource units is 6, the curve corresponding to PBCH transmission based on the first method is shown as curve 32, and the curve corresponding to PBCH transmission based on the second method is shown as curve 31. It can be seen that the decoding performance corresponding to curve 32 is better than that corresponding to curve 31, that is, the decoding performance of the scheme in this application is better. When the number of first resource units is 4, the curve corresponding to PBCH transmission based on the first method is shown as curve 42, and the curve corresponding to PBCH transmission based on the second method is shown as curve 31. It can be seen that the decoding performance corresponding to curve 42 is better than that corresponding to curve 31, that is, the decoding performance of the scheme in this application is better.

[0334] As can be seen from Figure 13, the PBCH transmission implemented in the narrowband scenario based on this application can reduce performance loss and improve decoding performance. In addition, when the number of first resource units is 20, the decoding performance can be the same as that of the second method. That is to say, even in the scenario with large bandwidth, the PBCH transmission using the scheme of this application still has better decoding performance and can reduce performance loss.

[0335] It is understandable that PBCH can be contained within SSB / PBCH blocks. Optionally, the sending device can send SSB / PBCH blocks; correspondingly, the receiving device can receive SSB / PBCH blocks.

[0336] The SSB / PBCH block may include a first signal, which may be a signal transmitted on the PBCH, i.e., the first signal may correspond to a second sequence.

[0337] The resources occupied by the SSB / PBCH block can be the first transmission resources, which may include 4 OFDM symbols and 20 PRBs. For details, please refer to the description of the SSB / PBCH block in Figure 1, which will not be repeated here.

[0338] The first transmission resource may include the second resource unit mentioned above.

[0339] Optionally, the SSB / PBCH may also include a second signal and a third signal.

[0340] The second signal can also be called the PSS. The second signal corresponds to the first PSS sequence.

[0341] Understandably, the first signal a terminal device searches for upon entering a communication system is the PSS (i.e., the second signal). At this stage, the terminal device is uncertain about the timing of the communication system and may have a significant deviation from the carrier frequency of the network device. If the terminal device successfully detects the PSS, it can synchronize with the PSS period and then use the carrier frequency sent by the network device as a reference frequency for generating its internal frequency, thereby eliminating frequency deviation.

[0342] The third signal can also be called the SSS. The third signal corresponds to the first SSS sequence.

[0343] It is understandable that terminal devices can determine the timing of SSS transmission by detecting PSS, and then determine the PCI of the currently accessed cell by detecting SSS.

[0344] The first PSS sequence and the first SSS sequence have the same length (denoted as L, where L is a positive integer). L can be determined based on the number of first resource units. For example, taking the number of resource units as PRBs, L can be the difference between 2 raised to the power of A and 1, and A can be determined based on the number of first resource units. For example, taking the resource units as PRBs, A can be log2(12*N). PRB The result of rounding down, N PRB The number of first resource units can be 12, which represents the number of subcarriers in a PRB.

[0345] In this application, unless otherwise specified, rounding can be understood as rounding down, rounding up, rounding to the nearest integer, or rounding to the nearest integer; no restriction is imposed. For example, L can satisfy the following formula: This indicates rounding down to the nearest integer.

[0346] It is understandable that the transmitting device can determine the length of the first SSS sequence or the first PSS sequence based on the number of first resource units, so that the length of the first SSS sequence or the first PSS sequence can be less than the number of subcarriers corresponding to the first resource unit. This allows for the reservation of a protection interval for the first SSS sequence or the first PSS sequence, thereby improving the reliability of communication.

[0347] This application provides two possible designs for determining the first PSS sequence and the first SSS sequence. In the first possible design, both the first PSS sequence and the first SSS sequence can be associated with a base sequence (such as an M sequence). In the second possible design, both the first PSS sequence and the first SSS sequence can be determined based on different sets of information bit positions.

[0348] The first possible design is described in detail below:

[0349] For determining the first PSS sequence, this application provides two possible implementations:

[0350] In the first possible implementation, the first PSS sequence may include L bits from the second PSS sequence.

[0351] The length of the second PSS sequence can be 127. For example, the first PSS sequence may include bits 0 to L-1 of the second PSS sequence; or, the first PSS sequence may include bits 127-L to 126 of the second PSS sequence; or, the first PSS sequence may include L bits in the middle of the second PSS sequence, such as bits 64-B-1 to 64+B of the second PSS sequence, where B is the integer result of L / 2 (e.g., ...). ).

[0352] Optionally, when the number of third resource units is greater than the number of first resource units, the first PSS sequence corresponding to the first resource unit may include some bits of the first PSS sequence corresponding to the third resource unit; or, when the number of first resource units is greater than the number of third resource units, the first PSS sequence corresponding to the third resource unit may include some bits of the first PSS sequence corresponding to the first resource unit. For example, taking the case where the number of third resource units is greater than the number of first resource units, the first PSS sequence corresponding to the first resource unit may include bits 0 to L-1 of the second PSS sequence, and the first PSS sequence corresponding to the third resource unit may include bits 0 to L1-1 of the second PSS sequence (where L1 is a positive integer greater than L). Therefore, the first PSS sequence corresponding to the first resource unit may include bits 0 to L-1 of the first PSS sequence corresponding to the third resource unit.

[0353] It is understandable that the first PSS sequence corresponding to the first resource unit can be nested with the first PSS sequence corresponding to the third resource unit, which can unify the format of the first PSS sequence and simplify the implementation.

[0354] The second PSS sequence is associated with the first base sequence. For example, the first base sequence {x} n} can be represented as: {x n}=x n (0), x n (1), ..., x n (126), x n (i) is {x n The 0th bit in}, i = 0, 1, ..., 126.

[0355] For example, the first base sequence can satisfy the following recursive formula: x n (i)=x n (i-7)⊕x n (i-3). Specifically, it can be determined based on the shift register shown in Figure 14, which is a shift register with a length of 7.

[0356] The initial sequence for determining the first base sequence can be [1 1 1 0 1 1 0], that is, {x n In the}, the value of the 0th bit can be 0, the value of the 1st bit can be 1, the value of the 2nd bit can be 1, the value of the 3rd bit can be 0, the value of the 4th bit can be 1, the value of the 5th bit can be 1, and the value of the 6th bit can be 1.

[0357] For example, with an initial sequence of [1 1 1 0 1 1 0], the first base sequence satisfies the following recursive formula: x n (i)=x n (i-7)⊕x n Taking (i-3) as an example, {x n The value of the 7th bit in} can be represented as, {x n The value of the 0th bit in} (i.e., 0) ⊕ {x n The value of the 4th bit in} (i.e., 1), that is, {x n The 7th bit in {x} can have a value of 1. Similarly, {x} n The value of the 8th bit in} can be represented as {x n The value of the first bit in} (i.e., 1) ⊕ {x n The value of the 5th bit in} (i.e., 1), that is, {x n The 7th bit in the sequence can have a value of 0, and so on, to obtain the first base sequence.

[0358] Based on the first base sequence determined above, the second PSS sequence can be the first base sequence, or the second PSS sequence can be obtained by cyclically shifting the first base sequence.

[0359] In one example, the second PSS sequence can be the first base sequence. For example, the second PSS sequence can be {x}. n}

[0360] In another example, the second PSS sequence can be obtained by cyclically shifting the first base sequence. For example, the second PSS sequence can be x. n ((i+43)mod 127); or, the second PSS sequence can be x n ((i+86)mod 127).

[0361] Based on the first possible implementation, the network device can determine three second PSS sequences based on the first base sequence. For a specific cell, it can determine which of the three second PSS sequences to use based on the PCI. When searching for a new cell, the terminal device must search all three second PSS sequences.

[0362] In addition, the first PSS sequence can be part or all of the bits of the second PSS sequence. The transmitting device can determine the corresponding first PSS sequence based on the second PSS sequence in different bandwidth scenarios by determining the second PSS sequence (e.g., determining the second PSS sequence only once), which can simplify the implementation and reduce the complexity of the implementation.

[0363] In the second possible implementation, the first PSS sequence can be the second base sequence (i.e., the number of cyclic shift steps corresponding to the first PSS sequence is 0); or, the first PSS sequence can be obtained by cyclically shifting the second base sequence.

[0364] For example, the number of cyclic shift steps corresponding to the second base sequence (or the parameter that can be described as the cyclic shift) can be a first value; or, the number of cyclic shift steps corresponding to the second base sequence is 2 * the first value. Here, the first value is the result of rounding down a first ratio, which is the ratio of L to 3. For example, with L = 31, the first value can be 11, or it can be 10.

[0365] The length of the second basis sequence can be L. For example, the second basis sequence can be represented as: {x' n}=x' n (0), x' n (1), ..., x' n (L-1).

[0366] For example, the second base sequence can satisfy the following recursive formula: x' n (i)=x' n (i-7)⊕x' n (i-3). Specifically, it can be determined based on the shift register shown in Figure 14, which is a shift register with a length of 7.

[0367] The initial sequence for determining the second base sequence can be [1 1 1 0 1 1 0]. For details, please refer to the description of the initial sequence in the first possible implementation above, which will not be repeated here.

[0368] For example, taking the first value as the result of rounding up the first ratio, the first PSS sequence can be x' n (i); or, the first PSS sequence can be Alternatively, the first PSS sequence can be

[0369] Based on the second possible implementation, the network device can determine three first PSS sequences based on the second base sequence. For a specific cell, it can be determined which of the three first PSS sequences to use based on the PCI. When searching for a new cell, the terminal device must search all three first PSS sequences.

[0370] In addition, the transmitting device can determine L based on the number of first resource units and determine the first PSS sequence based on the second base sequence of length L, so that the determined first PSS sequence can better adapt to different bandwidths and obtain better cross-correlation (such as cross-correlation of 0), thereby improving the reliability of communication.

[0371] Based on the second possible implementation, this application proposes four possible embodiments. The number of first resource units varies in different embodiments. Taking a resource unit as a PRB as an example, a PRB includes 12 subcarriers.

[0372] In a first possible embodiment, taking the number of the first resource units as an example of 4, L can be the difference between 2 raised to the power of A and 1, and A can be log2(12*N). PRB The result of rounding down, i.e., L can be 31, the length of the second base sequence can be 31, and the second base sequence can be represented as: {x' n}=x' n (0), x' n (1), ..., x' n (31). Assume the first value is 11 (i.e. ), then the first PSS sequence can be {x' n Alternatively, the first PSS sequence can be x' n ((i+11)mod 127); or, the first PSS sequence can be x' n ((i+22)mod 127).

[0373] In a second possible embodiment, taking the number of the first resource units as 6 as an example, L can be the difference between 2 raised to the power of A and 1, and A can be log2(12*N). PRB The result of rounding down, i.e., L can be 63, can be represented as: {x' n}=x' n (0), x' n (1), ..., x' n (63). Assume the first value is 21 (i.e. Then, the first PSS sequence can be {x' n Alternatively, the first PSS sequence can be x' n ((i+21)mod 127); or, the first PSS sequence can be x' n ((i+42)mod 127).

[0374] In a third possible embodiment, taking the number of the first resource units as an example of 8, L can be the difference between 2 raised to the power of A and 1, and A can be log2(12*N). PRB The result of rounding down, i.e., L can be 63, can be represented as: {x' n}=x' n (0), x' n (1), ..., x' n (63). Assume the first value is 21 (i.e. Then, the first PSS sequence can be {x' n Alternatively, the first PSS sequence can be x' n ((i+21)mod 127); or, the first PSS sequence can be x' n ((i+42)mod 127).

[0375] In the fourth possible embodiment, taking the number of the first resource units as 12 as an example, L can be the difference between 2 raised to the power of A and 1, and A can be log2(12*N). PRB The result of rounding down, i.e., L can be 127, can be represented as: {x' n}=x' n (0), x' n (1), ..., x' n (127). Assume the first value is 43 (i.e. Then, the first PSS sequence can be {x' n Alternatively, the first PSS sequence can be x' n ((i+43)mod 127); or, the first PSS sequence can be x' n ((i+84)mod 127).

[0376] For determining the first SSS sequence, this application provides two possible implementations:

[0377] In the first possible implementation, the first SSS sequence may include L bits from the second SSS sequence.

[0378] The length of the second SSS sequence can be 127. For example, the first SSS sequence may include bits 0 to L-1 of the second SSS sequence; or, the first SSS sequence may include bits 127-L to 126 of the second SSS sequence; or, the first SSS sequence may include L bits in the middle of the second SSS sequence, such as bits 64-B to 64+B of the second SSS sequence, where B is the integer result of L / 2 (e.g., ...). ).

[0379] Optionally, when the number of third resource units is greater than the number of first resource units, the first SSS sequence corresponding to the first resource unit may include some bits of the first SSS sequence corresponding to the third resource unit; or, when the number of first resource units is greater than the number of third resource units, the first SSS sequence corresponding to the third resource unit may include some bits of the first SSS sequence corresponding to the first resource unit. For example, taking the case where the number of third resource units is greater than the number of first resource units, the first SSS sequence corresponding to the first resource unit may include bits 0 to L-1 of the second SSS sequence, and the first SSS sequence corresponding to the third resource unit may include bits 0 to L1-1 of the second SSS sequence (L1 is a positive integer greater than L). Therefore, the first SPSS sequence corresponding to the first resource unit may include bits 0 to L-1 of the first SSS sequence corresponding to the third resource unit.

[0380] It is understandable that the first SSS sequence corresponding to the first resource unit can be nested with the first SSS sequence corresponding to the third resource unit, which can unify the format of the first SSS sequence and simplify the implementation.

[0381] The second SSS sequence is associated with the first base sequence. The first base sequence can be referred to in the above description of the first base sequence, and will not be repeated here.

[0382] Specifically, the second SSS sequence can be determined based on the cyclically shifted third base sequence and the cyclically shifted fourth base sequence. The third base sequence satisfies the first recursive formula with the first base sequence, and the fourth base sequence satisfies the second recursive formula with the first base sequence. The first recursive formula and the second recursive formula are different.

[0383] For example, the third basis sequence and the first basis sequence can satisfy the following recursive formula: x n (i)=x n (i-7)⊕x n (i-3), the fourth basis sequence and the first basis sequence can satisfy the following recursive formula: y n (i)=y n (i-7)⊕y n (i-6), x n (i) and y n (i) can be determined based on Figure 14. x n (i) can be understood as the i-th bit of the third base sequence, y n (i) can be understood as the i-th bit of the fourth base sequence.

[0384] The lengths of the third and fourth base sequences are both 127. The number of cyclic shift steps corresponding to the third base sequence (which can be denoted as m1) is different from the number of cyclic shift steps corresponding to the fourth base sequence (which can be denoted as m2).

[0385] For example, the second SSS sequence can be the result of XORing the cyclically shifted third base sequence and the cyclically shifted fourth base sequence. For instance, the second SSS sequence can satisfy the following formula: x n (i+m1)⊕y n (i+m2).

[0386] Based on the first possible implementation, the first SSS sequence can be part or all of the bits of the second SSS sequence. The transmitting device can determine the corresponding first SSS sequence based on the second SSS sequence in different bandwidth scenarios by determining the second SSS sequence (e.g., determining the second SSS sequence only once). This simplifies the implementation and reduces its complexity.

[0387] In the second possible implementation, the first SSS sequence is determined based on the fifth base sequence after superposition and the sixth base sequence after cyclic shift.

[0388] Among them, the fifth basis sequence and the second basis sequence satisfy the first recursive formula, and the sixth basis sequence and the second basis sequence satisfy the second recursive formula. The first recursive formula and the second recursive formula are different. The second basis sequence can be referred to the above description of the second basis sequence, which will not be repeated here.

[0389] For example, the fifth base sequence and the second base sequence can satisfy the following recursive formula: x' n (i)=x' n (i-7)⊕x' n (i-3), the sixth base sequence and the second base sequence can satisfy the following recursive formula: y' n (i)=y' n (i-7)⊕y' n (i-6), x' n (i) and y' n (i) can be determined based on Figure 14. x' n (i) can be understood as the i-th bit of the fifth base sequence, y' n (i) can be understood as the i-th bit of the sixth base sequence.

[0390] The lengths of the fifth and sixth base sequences are both L; the number of cyclic shift steps corresponding to the fifth base sequence (which can be denoted as m3) is different from the number of cyclic shift steps corresponding to the sixth base sequence (which can be denoted as m4).

[0391] For example, the second SSS sequence can be the result of XORing the cyclically shifted fifth base sequence and the cyclically shifted sixth base sequence. For instance, the second SSS sequence can satisfy the following formula: x' n (i+m3)⊕y' n (i+m4).

[0392] Based on the second possible implementation, the transmitting device can determine L according to the number of first resource units, and determine the first SSS sequence according to the second base sequence of length L, so that the determined first SSS sequence can better adapt to different bandwidths, and at the same time, the first SSS sequence can obtain better cross-correlation (such as cross-correlation of 0), thereby improving the reliability of communication.

[0393] Based on the two possible implementations described above, the terminal device can determine the PCI of the cell by detecting the first SSS sequence. That is, when the number of PCIs is 1008, since the terminal device has already detected 3 first PSS sequences, it can determine the PCI by detecting the remaining 336 first SSS sequences. In other words, the terminal device can determine the PCI based on the first PSS sequence and the first SSS sequence. Therefore, cell access can be achieved based on the PCI.

[0394] Based on the first possible design, the transmitting device may determine the first PSS sequence and the first SSS sequence based on the first possible implementation; or, the transmitting device may determine the first PSS sequence and the first SSS sequence based on the first possible implementation; or, the transmitting device may determine the first PSS sequence and the first SSS sequence based on the second possible implementation; or, the transmitting device may determine the first PSS sequence and the first SSS sequence based on the second possible implementation, without limitation.

[0395] In the second possible design, the first PSS sequence can be determined based on the first information bit position set of length K1, and the first SSS sequence can be determined based on the second information bit position set of length K2.

[0396] The fourth value is the minimum of the integer powers of 2 that are greater than or equal to the first threshold. The fourth value is 2 raised to the power of (K1+K2), where K1 and K2 are both positive integers. For example, taking a first threshold of 1008 as an example, the integer powers of 2 that are greater than or equal to 1008 can be 1024, 2048, ..., where the minimum value among 1024, 2048, ... is 1024 (which is 2 raised to the power of 10). Therefore, (K1+K2) can be 10.

[0397] For example, if (K1+K2) is 10, K1 can be 4 and K2 can be 6; or K1 can be 2 and K2 can be 8; or K1 can be 5 and K2 can be 5; or K1 can be 3 and K2 can be 7.

[0398] The first threshold can be predefined, or it can be determined based on the actual communication scenario or communication situation without restriction.

[0399] The first set of information bit positions may include K1 positions in a reliability sequence of length N1. Similarly, the second set of information bit positions may include K2 positions in a reliability sequence of length N1. N1 is 2 to the power of A. The determination of A can be referred to the description of A above, and will not be repeated here.

[0400] The reliability sequence can be used to indicate the reliability of each bit position in the sequence. The higher the reliability value, the more reliable the position corresponding to that reliability.

[0401] Optionally, the reliability sequence can be predefined by the protocol. The sending device can select a reliability sequence of length N1 from one or more predefined reliability sequences.

[0402] The intersection of the first information bit position set and the second information bit position set can be an empty set. For example, with K1 being 4 and K2 being 6, and assuming N1 is 32, the first information bit position set can be [24 28 30 31], and the second information bit position set can be [4 6 7 8 10 16].

[0403] Optionally, K1 can be less than or equal to K2, aiming to minimize the cross-correlation of the first PSS sequence to zero, thereby improving communication reliability. Furthermore, it reduces the complexity of detecting the first PSS at the receiving end; that is, the smaller K1 is, the simpler it is for the receiving end to detect the first PSS. For example, K1 can be 4, and K2 can be 6.

[0404] The first PSS sequence is determined based on the first information bit position set of length K1. Specifically, the transmitting device can perform polar coding on the sixth sequence of length K1 based on the first information bit position set to obtain the second coded bit sequence of length N1. Furthermore, the transmitting device can perform rate matching on the second coded bit sequence to obtain the first PSS sequence of length L.

[0405] For example, with K1 being 4, the sixth sequence can be 0000, or the sixth sequence can be 0001, or the sixth sequence can be 0010.

[0406] For example, the first PSS sequence may include the 0th to L-1th bits of the second coded bit sequence; or, the first PSS sequence may include the N1-Lth to N1-1th bits of the second coded bit sequence.

[0407] Optionally, the cross-correlation of the second coded bit sequence is less than or equal to the second threshold; or it can be replaced by the second coded bit sequence having good orthogonality; or it can be replaced by the cross-correlation of the second coded bit sequence being 0.

[0408] The second threshold can be predefined, or it can be determined based on the actual communication scenario or situation. For example, the second threshold can be 0 (i.e., the cross-correlation of the second coded bit sequence is 0).

[0409] It is understandable that, since the size of the first information bit location set (or the number of locations included in the first information bit location set) is K1, at most 2 can be determined based on the first information bit location set. K1 The first PSS sequence, that is, at most 2, can determine 2 K1 PCI.

[0410] Optionally, there exist two sets of first information bit positions, and the number of first resource units corresponding to the two sets of first information bit positions is different. The difference between the i-th element in the two sets of first information bit positions is a second value; i = 0, 1, ..., K1-1. For example, taking the two sets of first information bit positions as first information bit position set 0 and first information bit position set 1, the difference between the 0th element in first information bit position set 0 and the 0th element in first information bit position set 1 is a second value, the difference between the 1st element in first information bit position set 0 and the 1st element in first information bit position set 1 is a second value, ..., the difference between the (K-1)th element in first information bit position set 0 and the (K-1)th element in first information bit position set 1 is a second value.

[0411] In the first example, the second value can be predefined. For example, the second value can be 32.

[0412] In the second example, the second value can be an integer power of 2, for example, the second value can be 16, 32 or 64.

[0413] In the third example, the second value can be determined based on the number of first resource units corresponding to the two first information bit position sets. For example, the second value can be the difference between N1 corresponding to the two first information bit position sets, and N1 can be determined based on the number of first resource units. Taking the resource unit as PRB as an example, assuming that the number of first resource units corresponding to the first information bit position set 0 can be 4, the number of first resource units corresponding to the first information bit position set 0 can be 6, N1 corresponding to the first information bit position set 0 can be 32, and N1 corresponding to the first information bit position set 1 can be 64, then the second value can be 32 (i.e., 64-32=32).

[0414] Based on the above description of the second value, this application provides a possible embodiment. Taking the second value as 32 as an example, assuming K1 is 4, the first information bit position set 0 can be [24 28 30 31], and the first information bit position set 1 can be [56 60 62 63].

[0415] Understandably, by utilizing the nested nature of polar codes, it is only necessary to determine the set of first information bit positions for a code length. The set of first information bit positions for a longer code length can be obtained from the set of first information bit positions for the code length mentioned above, without the need to reconstruct the information bit positions again. This can reduce the complexity of encoding or decoding and simplify the implementation.

[0416] The first SSS sequence is determined based on the second information bit position set of length K2. Specifically, the transmitting device can perform polar coding on the seventh sequence of length K2 based on the second information bit position set to obtain the third coded bit sequence of length N1. Furthermore, the transmitting device can perform rate matching on the third coded bit sequence to obtain the first SSS sequence of length L.

[0417] For example, with K1 being 6, the seventh sequence can be 000000, or the sixth sequence can be 000001, or the sixth sequence can be 000010.

[0418] For example, the first SSS sequence may include the 0th to the (L-1)th bits of the third coded bit sequence; or, the first SSS sequence may include the (N1-L)th to the (N1-1)th bits of the third coded bit sequence.

[0419] Optionally, the cross-correlation of the third coded bit sequence is less than or equal to the third threshold; or it can be replaced by the third coded bit sequence having good orthogonality; or it can be replaced by the cross-correlation of the third coded bit sequence being 0.

[0420] The third threshold can be predefined, or it can be determined based on the actual communication scenario or situation. For example, the third threshold can be 0 (i.e., the cross-correlation of the third coded bit sequence is 0).

[0421] It is understandable that, since the size of the second information bit location set (or the number of locations included in the second information bit location set) is K2, at most 2 bits can be determined based on the first information bit location set. K2 The first SSS sequence, that is, at most 2, can determine 2 K2 PCI.

[0422] Furthermore, by combining the first set of information bit positions and the second set of information bit positions, at most 2... K2+K1 Type PCI, if 2 K2+K1 A value greater than or equal to 1008 can meet the requirement of 1008 PCIs.

[0423] Optionally, there exist two sets of second information bit positions, with different numbers of first resource units corresponding to the two sets. The difference between the j-th element in the two sets is a third value; j = 0, 1, ..., K2-1. For example, taking the two sets of second information bit positions as second information bit position set 0 and second information bit position set 1, the difference between the 0th element in second information bit position set 0 and the 0th element in second information bit position set 1 is a third value, the difference between the 1st element in second information bit position set 0 and the 1st element in second information bit position set 1 is a third value, ..., the difference between the (K2-1)th element in second information bit position set 0 and the (K2-1)th element in second information bit position set 1 is a third value.

[0424] In the first example, the third value can be predefined. For example, the third value can be 32.

[0425] In the second example, the third value can be an integer power of 2, for example, the third value can be 16, 32 or 64.

[0426] In the third example, the third value can be determined based on the number of first resource units corresponding to the two second information bit position sets. For example, the third value can be the difference between N1 corresponding to the two second bit position sets, and N1 can be determined based on the number of first resource units. Taking the resource unit as PRB as an example, assuming that the number of first resource units corresponding to second information bit position set 0 can be 4, the number of first resource units corresponding to second information bit position set 0 can be 6, N1 corresponding to second information bit position set 0 can be 32, and N1 corresponding to second information bit position set 1 can be 64, then the third value can be 32 (i.e., 64-32=32).

[0427] Based on the above description of the third value, this application provides a possible embodiment. Taking the third value as 32 as an example, assuming K2 is 6, the second information bit position set 0 can be [4 6 7 8 10 16], and the second information bit position set 1 can be [100 102 103 104 106 112].

[0428] Understandably, by utilizing the nested nature of polar codes, it is only necessary to determine the set of second information bit positions for a single code length. The set of second information bit positions for longer code lengths can be obtained from the set of second information bit positions for the aforementioned code lengths, without the need to reconstruct the information bit positions again. This reduces the complexity of encoding or decoding and simplifies implementation.

[0429] Based on the second possible design, the transmitting device can determine the first PSS sequence based on the first information bit position set and the first SSS sequence based on the second information bit position set. That is, a unified encoding method can be used to determine the first PSS sequence and the first SSS sequence, thereby enabling the transmission of the second signal (the first PSS sequence corresponds to the second signal) and the third signal (the first SSS sequence corresponds to the third signal), which simplifies the implementation.

[0430] Furthermore, by determining the values ​​of K1 and K2, the first PSS sequence and the first SSS sequence can indicate multiple PCIs (e.g., the number of PCIs can be greater than or equal to 1008), better meeting the requirements for indicating PCIs. Moreover, by determining the values ​​of K1 and K2, different sets of first and second information bit positions can be determined, allowing the first PSS sequence and the first SSS sequence to indicate more PCIs. This also increases the flexibility and diversity in determining the first PSS sequence and the second SSS sequence, making the SSB / PBCH format more unified.

[0431] Based on the second possible design, this application provides two possible embodiments. The number of first resource units differs in the different embodiments. Taking a resource unit as a PRB, with one PRB including 12 subcarriers as an example:

[0432] In a first possible embodiment, taking a first resource unit quantity of 4 as an example, L can be the difference between 2 raised to the power of A and 1, and A can be log2(12*N). PRB The result of rounding down is that L can be 31, N1 can be 32, K1 can be 4, K2 can be 6, the first information bit position set can be [24 28 30 31], and the second information bit position set can be [4 6 7 8 10 16].

[0433] In a second possible embodiment, taking a first resource unit quantity of 6 as an example, L can be the difference between 2 raised to the power of A and 1, and A can be log2(12*N). PRB The result of rounding down is that L can be 63, N1 can be 64, K1 is 4, K2 is 6, the first information bit position set can be [56 60 62 63], and the second information bit position set can be [36 38 39 40 42 48].

[0434] In a third possible embodiment, taking the number of the first resource units as 8 as an example, L can be the difference between 2 raised to the power of A and 1, and A can be log2(12*N). PRB The result of rounding down is that L can be 63, N1 can be 64, K1 is 4, K2 is 6, the first information bit position set can be [56 60 62 63], and the second information bit position set can be [36 38 39 40 42 48].

[0435] In the fourth possible embodiment, taking the number of the first resource units as 12 as an example, L can be the difference between 2 raised to the power of A and 1, and A can be log2(12*N). PRB The result of rounding down is that L can be 127, N1 can be 128, K1 is 4, K2 is 6, the first set of information bit positions can be [120 124 126 127], and the second set of information bit positions can be [100 102 103 104 106 112].

[0436] Understandably, to support SSB / PBCH block reception in narrowband scenarios for some devices, for example, as shown in Figure 1, where the current SSB / PBCH block occupies 20 PRBs in the frequency domain, the PRBs can be reduced based on the current SSB / PBCH block bandwidth. That is, the reduced SSB / PBCH block occupies less than 20 PRBs in the frequency domain. For instance, the transmitting device can reduce the SSB / PBCH block bandwidth from 20 PRBs to X (e.g., 4, 6, 8, or 12) PRBs, and then map the first sequence, the first PSS sequence, and the first SSS sequence to the reduced bandwidth to achieve SSB / PBCH block transmission.

[0437] The determination of the first sequence, the first PSS sequence, and the first SSS sequence can be referred to the above description of the first sequence, the first PSS sequence, and the first SSS sequence, and will not be repeated here. This application proposes three possible implementations, in which the position of the deleted PRB differs.

[0438] In the first possible implementation, the transmitting device can start from the middle of the bandwidth of the SSB / PBCH block and expand upwards and downwards to determine X PRBs, and remove the other PRBs in the bandwidth of the SSB / PBCH block except for the X PRBs.

[0439] In the first example, as shown in Figure 15, the bandwidth of the SSB / PBCH block is reduced from 20 PRBs to 12 PRBs. A specific bandwidth reduction method could be to remove subcarriers 0-47 and 192-239 on the first to fourth OFDM symbols in Figure 1 (i.e., the transmitter does not transmit, and the receiver does not receive). The transmitting device can map the first sequence to subcarriers 48-191 on the second and fourth OFDM symbols, map the first PSS sequence to subcarriers 56-182 on the first OFDM symbol, and map the first SSS sequence to subcarriers 56-182 on the third OFDM symbol.

[0440] In the second example, as shown in Figure 15, the bandwidth of the SSB / PBCH block is reduced from 20 PRBs to 6 PRBs. A specific bandwidth reduction method could be to remove subcarriers 0-83 and 156-239 on the first to fourth OFDM symbols in Figure 1 (i.e., the transmitter does not transmit, and the receiver does not receive). The transmitting device can map the first sequence to subcarriers 84-155 on the second and fourth OFDM symbols, map the first PSS sequence to subcarriers 88-150 on the first OFDM symbol, and map the first SSS sequence to subcarriers 88-150 on the third OFDM symbol.

[0441] In the third example, as shown in Figure 15, the bandwidth of the SSB / PBCH block is reduced from 20 PRBs to 4 PRBs. A specific bandwidth reduction method could be to remove subcarriers 0-95 and 144-239 on the first to fourth OFDM symbols in Figure 1 (i.e., the transmitter does not transmit, and the receiver does not receive). The transmitting device can map the first sequence to subcarriers 95-143 on the second and fourth OFDM symbols, map the first PSS sequence to subcarriers 104-134 on the first OFDM symbol, and map the first SSS sequence to subcarriers 104-134 on the third OFDM symbol.

[0442] In the second possible implementation, the transmitting device can determine X PRBs upwards from the starting position of the SSB / PBCH block bandwidth, and remove the other PRBs in the SSB / PBCH block bandwidth except for the X PRBs. The time-frequency resource structure of the SSB / PBCH block can be as shown in Figure 16 for the time-frequency resource structure corresponding to 20 PRBs, and the starting position of the SSB can be located at the w1-th subcarrier (w1 is a positive integer, e.g., w1 can be 8).

[0443] In the first example, as shown in Figure 16, the bandwidth of the SSB / PBCH block is reduced from 20 PRBs to 12 PRBs. A specific bandwidth reduction method could be to remove subcarriers 144 to 239 on the first to fourth OFDM symbols (i.e., the transmitter does not transmit, and the receiver does not receive). The transmitting device can map the first sequence to subcarriers 0 to 143 on the second and fourth OFDM symbols, map the first PSS sequence to subcarriers 8 to 134 on the first OFDM symbol, and map the first SSS sequence to subcarriers 8 to 134 on the third OFDM symbol.

[0444] In the second example, as shown in Figure 16, the bandwidth of the SSB / PBCH block is reduced from 20 PRBs to 6 PRBs. A specific bandwidth reduction method could be to remove subcarriers 72 to 239 on the first to fourth OFDM symbols in Figure 1 (i.e., the transmitter does not transmit, and the receiver does not receive). The transmitting device can map the first sequence to subcarriers 0 to 71 on the second and fourth OFDM symbols, map the first PSS sequence to subcarriers 8 to 70 on the first OFDM symbol, and map the first SSS sequence to subcarriers 8 to 70 on the third OFDM symbol.

[0445] In the third example, as shown in Figure 16, the bandwidth of the SSB / PBCH block is reduced from 20 PRBs to 4 PRBs. A specific bandwidth reduction method could be to remove subcarriers 48 to 239 on the first to fourth OFDM symbols in Figure 1 (i.e., the transmitter does not transmit, and the receiver does not receive). The transmitting device can map the first sequence to subcarriers 0 to 47 on the second and fourth OFDM symbols, map the first PSS sequence to subcarriers 8 to 38 on the first OFDM symbol, and map the first SSS sequence to subcarriers 8 to 38 on the eighth OFDM symbol.

[0446] In the third possible implementation, the transmitting device can determine X PRBs downwards from the end position of the SSB / PBCH block bandwidth, and remove the other PRBs in the SSB / PBCH block bandwidth except for the X PRBs. The time-frequency resource structure of the SSB / PBCH block can be as shown in Figure 17 for the 20 PRBs, and the end position of the SSB can be located at the w2-th subcarrier (w2 is a positive integer, e.g., w2 can be 2^32).

[0447] In the first example, as shown in Figure 17, the bandwidth of the SSB / PBCH block is reduced from 20 PRBs to 12 PRBs. A specific bandwidth reduction method could be to remove subcarriers 0 to 95 on the first to fourth OFDM symbols in Figure 1 (i.e., the transmitter does not transmit, and the receiver does not receive). The transmitting device can map the first sequence to subcarriers 96 to 239 on the second to fourth OFDM symbols, the first PSS sequence to subcarriers 106 to 232 on the first OFDM symbol, and the first SSS sequence to subcarriers 106 to 232 on the third OFDM symbol.

[0448] In the second example, as shown in Figure 17, the bandwidth of the SSB / PBCH block is reduced from 20 PRBs to 6 PRBs. A specific bandwidth reduction method could be to remove subcarriers 0 to 167 on the first to fourth OFDM symbols in Figure 1 (i.e., the transmitter does not transmit, and the receiver does not receive). The transmitting device can map the first sequence to subcarriers 168 to 239 on the second to fourth OFDM symbols, the first PSS sequence to subcarriers 170 to 232 on the first OFDM symbol, and the first SSS sequence to subcarriers 170 to 232 on the third OFDM symbol.

[0449] In the third example, as shown in Figure 17, the bandwidth of the SSB / PBCH block is reduced from 20 PRBs to 4 PRBs. A specific bandwidth reduction method could be to remove subcarriers 0 to 191 on the first to fourth OFDM symbols in Figure 1 (i.e., the transmitter does not transmit, and the receiver does not receive). The transmitting device can map the first sequence to subcarriers 192 to 239 on the second to fourth OFDM symbols, the first PSS sequence to subcarriers 202 to 232 on the first OFDM symbol, and the first SSS sequence to subcarriers 202 to 232 on the third OFDM symbol.

[0450] Based on the description of the above communication method, taking a resource unit (PRB) as an example, this application provides three possible embodiments to realize the transmission of SSB / PBCH blocks. In the following three possible embodiments, the length of the first coded bit sequence can be 512, and the first resource unit can be the (YX) / 2nd to (Y+X) / 2-1th resource units of the second resource unit. In the first possible embodiment, the bandwidth of the SSB / PBCH block is 8 PRB; in the second possible embodiment, the bandwidth of the SSB / PBCH block is 12 PRB; and in the third possible embodiment, the bandwidth of the SSB / PBCH block is 20 PRB.

[0451] In a first possible embodiment, the bandwidth of the SSB / PBCH block can be 8 PRBs, so the number of first resource units can be 8, and the length of the first sequence can be 288. Assuming the first sequence can include bits 224 to 511 of the first coded bit sequence, the transmitting device can map the first sequence to subcarriers 72 to 167 on the second and fourth OFDM symbols in Figure 1. Additionally, the lengths of the first PSS sequence and the first SSS sequence can be 63. The transmitting device can map the first PSS sequence to subcarriers 88 to 150 on the first OFDM symbol in Figure 1, and the first SSS sequence to subcarriers 88 to 150 on the third OFDM symbol in Figure 1.

[0452] For example, the correspondence between the first sequence, the first PSS sequence, and the first SSS sequence and the subcarrier numbers can be shown in Table 3. In Table 3, taking the offset value of the PBCH-DMRS position as 0 as an example, a cell with the same symbol length represents an RE. The value in an RE corresponding to symbol 1 and symbol 3 represents the subcarrier number of the current RE. Among them, the REs with subcarrier numbers 88 to 152 in symbol 1 and symbol 3 are the RE positions occupied by the 63-length first PSS sequence and the first SSS sequence, respectively. The cell containing "0" in symbol 2 and symbol 4 represents the RE occupied by PBCH-DMRS, and the value in the cell containing non-zero values ​​represents the index value of the bit in the first coded bit sequence. In order to distinguish it from PBCH-DMRS, the index value of the starting bit in the first coded bit sequence is set to "1" in Table 3. That is, the index value of the 224th bit to the 511th bit in the first coded bit sequence can be "225-512".

[0453] Table 3

[0454] In a second possible embodiment, the bandwidth of the SSB / PBCH block can be 12 PRBs, so the number of first resource units can be 12, and the length of the first sequence can be 432. Assuming the first sequence can include the 80th to 511th bits of the first coded bit sequence, the transmitting device can map the first sequence to the 48th to 191st subcarriers on the 2nd and 4th OFDM symbols in Figure 1. Additionally, the lengths of the first PSS sequence and the first SSS sequence can be 127. The transmitting device can map the first PSS sequence to the 56th to 182nd subcarriers on the 1st OFDM symbol in Figure 1, and the first SSS sequence to the 56th to 182nd subcarriers on the 3rd OFDM symbol in Figure 1.

[0455] For example, the correspondence between the first sequence, the first PSS sequence, and the first SSS sequence and the subcarrier numbers can be shown in Table 4. In Table 4, taking the offset value of the PBCH-DMRS position as 0 as an example, a cell with the same symbol length represents an RE. The value in an RE corresponding to symbol 1 and symbol 3 represents the subcarrier number of the current RE. Among them, the REs with subcarrier numbers 56 to 182 in symbol 1 and symbol 3 are the RE positions occupied by the 127-length first PSS sequence and the first SSS sequence, respectively. The cell containing "0" in symbol 2 and symbol 4 represents the RE occupied by PBCH-DMRS, and the value in the cell containing non-zero values ​​represents the index value of the bit in the first coded bit sequence. In order to distinguish it from PBCH-DMRS, the index value of the starting bit in the first coded bit sequence is set to "1" in Table 4. That is, the index value of the 80th bit to the 511th bit in the first coded bit sequence can be "80-512".

[0456] Table 4

[0457] In Table 4, the bit index values ​​of the first coded bit sequences corresponding to subcarriers 88 to 150 on symbols 2 and 4 are the same as those of the first coded bit sequences corresponding to subcarriers 88 to 150 on symbols 2 and 4 in Table 3. That is, the SSB / PBCH block shown in Table 4 is based on the SSB / PBCH block shown in Table 3, with additional coded bits added to subcarriers 48 to 71 and subcarriers 168 to 191 on symbols 2 and 4.

[0458] In a third possible embodiment, the bandwidth of the SSB / PBCH block can be 20 PRBs, so the number of first resource units can be 20, and the length of the first sequence can be 864. Assuming the first sequence can include bits 0 to 511 and bits 0 to 351 of the first coded bit sequence, the transmitting device can map the first sequence to subcarriers 0 to 239 on the second and fourth OFDM symbols in Figure 1, and subcarriers 0 to 47 and subcarriers 192 to 239 on the third OFDM symbol. Additionally, the lengths of the first PSS sequence and the first SSS sequence can be 127. The transmitting device can map the first PSS sequence to subcarriers 56 to 182 on the first OFDM symbol in Figure 1, and the first SSS sequence to subcarriers 156 to 182 on the third OFDM symbol in Figure 1.

[0459] For example, the correspondence between the first sequence, the first PSS sequence, and the first SSS sequence and the subcarrier numbers can be shown in Table 5. In Table 5, taking the offset value of the PBCH-DMRS position as 0 as an example, a cell with the same symbol length represents an RE. The value in an RE corresponding to symbol 1 and symbol 3 represents the subcarrier number of the current RE. Among them, the REs with subcarrier numbers 56 to 182 in symbol 1 and symbol 3 are the RE positions occupied by the 127-length first PSS sequence and the first SSS sequence, respectively. The cell containing "0" in symbol 2 and symbol 4 represents the RE occupied by PBCH-DMRS, and the value in the cell containing non-zero values ​​represents the index value of the bit in the first coded bit sequence. In order to distinguish it from PBCH-DMRS, the index value of the starting bit in the first coded bit sequence is set to "1" in Table 5. That is, the index value of the 0th bit to the 511th bit in the first coded bit sequence can be "1-512".

[0460] Table 5

[0461] Specifically, the bit index values ​​of the first coded bit sequences corresponding to subcarriers 88 to 150 on symbols 2 and 4 in Table 5 are the same as those in Table 3. Similarly, the bit index values ​​of the first coded bit sequences corresponding to subcarriers 48 to 71 and 168 to 191 on symbols 2 and 4 in Table 5 are the same as those in Table 4. In other words, the SSB / PBCH block shown in Table 5 is based on the SSB / PBCH block shown in Table 4, with additional coded bits added to subcarriers 0 to 47 and subcarriers 192 to 239 on symbols 2 and 4.

[0462] The various embodiments of this application can be implemented independently or in combination, without limitation. Unless otherwise specified or in conflict of logic, the terminology and / or descriptions between the different embodiments provided in this application are consistent and can be referenced mutually. Technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships.

[0463] It is understood that in the embodiments of this application, the executing entity may perform some or all of the steps in the embodiments of this application. These steps or operations are merely examples, and the embodiments of this application may also perform other operations or variations thereof. Furthermore, the various steps may be executed in different orders as presented in the embodiments of this application, and it is not necessarily necessary to execute all the operations in the embodiments of this application.

[0464] The foregoing primarily describes the solutions provided in this application from the perspective of device-to-device interaction. It is understood that each device, in order to achieve the aforementioned functions, includes corresponding hardware structures and / or software modules for executing each function. Those skilled in the art will readily recognize that, based on the algorithmic steps of the examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware 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.

[0465] This application embodiment can divide each device into functional modules according to the above method example. For example, each function can be divided into a separate functional module, or two or more functions can be integrated into one processing module. The integrated module can be implemented in hardware or as a software functional module. The module division in this application embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods.

[0466] With each functional module divided according to its corresponding function, Figure 18 shows a transmitting device 180. The transmitting device 180 can perform the actions performed by the transmitting device in the method shown in Figure 9. All relevant content of each step involved in the above method embodiment can be referred to the functional description of the corresponding functional module. The technical effects that can be obtained can be referred to the above method embodiment, and will not be repeated here.

[0467] The transmitting device 180 may include a transceiver module 1801 and a processing module 1802. Exemplarily, the transmitting device 180 may be a communication device, or a chip or other combination device or component having the aforementioned transmitting device functions applied in a communication device. When the transmitting device 180 is a communication device, the transceiver module 1801 may be a transceiver, which may include an antenna and radio frequency circuits, etc.; the processing module 1802 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the transmitting device 180 is a combination device or component having the aforementioned transmitting device functions, the transceiver module 1801 may be a radio frequency unit; the processing module 1802 may be a processor (or processing circuit), such as a baseband processor. When the transmitting device 180 is a chip system, the transceiver module 1801 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 1802 may be a processor (or processing circuit) of the chip system, and may include one or more central processing units. It should be understood that the transceiver module 1801 in the embodiments of this application can be implemented by a transceiver or transceiver-related circuit components; the processing module 1802 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0468] For example, the transceiver module 1801 can be used to perform all the transceiver operations performed by the transmitting device in the embodiment shown in FIG9, and / or to support other processes of the technology described herein; the processing module 1802 can be used to perform all operations other than the transceiver operations performed by the transmitting device in the embodiment shown in FIG9, and / or to support other processes of the technology described herein.

[0469] Figure 19 shows a receiving device 190, which can perform the actions performed by the receiving device in the method shown in Figure 9. All relevant content of each step involved in the above method embodiment can be referred to the functional description of the corresponding functional module, and the technical effects that can be obtained can be referred to the above method embodiment, which will not be repeated here.

[0470] The receiving device 190 may include a transceiver module 1901 and a processing module 1902. Exemplarily, the receiving device 190 may be a communication device, or a chip or other combination device or component having the aforementioned receiving device functions applied in a communication device. When the receiving device 190 is a communication device, the transceiver module 1901 may be a transceiver, which may include an antenna and radio frequency circuits, etc.; the processing module 1902 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the receiving device 190 is a combination device or component having the aforementioned receiving device functions, the transceiver module 1901 may be a radio frequency unit; the processing module 1902 may be a processor (or processing circuit), such as a baseband processor. When the receiving device 190 is a chip system, the transceiver module 1901 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 1902 may be a processor (or processing circuit) of the chip system, and may include one or more central processing units. The transceiver module 1901 in this embodiment can be implemented by a transceiver or transceiver-related circuit components; the processing module 1902 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0471] For example, the transceiver module 1901 can be used to perform all the transceiver operations performed by the receiving device in the embodiment shown in FIG9, and / or to support other processes of the technology described herein; the processing module 1902 can be used to perform all operations other than the transceiver operations performed by the receiving device in the embodiment shown in FIG9, and / or to support other processes of the technology described herein.

[0472] As another possible implementation, the transceiver module 1801 in Figure 18 can be replaced by a transceiver that integrates the functions of the transceiver module 1801; the processing module 1802 can be replaced by a processor that integrates the functions of the processing module 1802. Furthermore, the transmitting end device 180 shown in Figure 18 may also include a memory. Alternatively, the transceiver module 1901 in Figure 19 can be replaced by a transceiver that integrates the functions of the transceiver module 1901; the processing module 1902 can be replaced by a processor that integrates the functions of the processing module 1902. Furthermore, the receiving end device 190 shown in Figure 19 may also include a memory.

[0473] Alternatively, when the processing module 1802 is replaced by a processor and the transceiver module 1801 is replaced by a transceiver, the transmitting end device 180 involved in the embodiments of this application can also be the communication device 200 shown in FIG20. Or, when the processing module 1902 is replaced by a processor and the transceiver module 1901 is replaced by a transceiver, the receiving end device 190 involved in the embodiments of this application can also be the communication device 200 shown in FIG20.

[0474] The processor can be logic circuit 2001, and the transceiver can be interface circuit 2002. Furthermore, the communication device 200 shown in Figure 20 may also include a memory 2003. The memory 2003 can exist independently of the processor or be integrated with it. The memory 2003 can be used to store instructions, program code, or data, for example, it can store one or more of the following: a base matrix, a list of expansion factors, a list of translation values, or a cyclic shift matrix, or other data used to implement the method shown in Figure 9. The memory 2003 can be located inside or outside the communication device 200, without limitation.

[0475] This application also provides a communication device, as shown in FIG21. This communication device can be applied to the method shown in any of the embodiments in FIG9. As shown in FIG21, the communication device includes a processing module and a transceiver module. The processing module may be one or more processors, and the transceiver module may be a transceiver or a communication interface. This communication device can be used to implement the sending or receiving device involved in any of the above method embodiments, or to implement the functions of the device involved in any of the above method embodiments. The device or device function may be a network component in a hardware device, a software function running on dedicated hardware, or a virtualization function instantiated on a platform (e.g., a cloud platform). Optionally, the communication device may further include a storage module for storing the program code and data of the communication device.

[0476] In one example, the communication device functions as a transmitting device or is a chip applied within a transmitting device, and executes the steps performed by the transmitting device in the above method embodiments. The transceiver module is used to specifically execute the transmitting and / or receiving actions performed by the transmitting device in any embodiment of FIG9, for example, supporting the transmitting device in performing other processes of the technology described herein. The processing module can be used to support the communication device in performing the processing actions in the above method embodiments, for example, supporting the transmitting device in performing other processes of the technology described herein.

[0477] To achieve the above functions, the chip of this application may include hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art will readily recognize that, based on the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware 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.

[0478] In one possible implementation, when the transmitting or receiving device is a chip, the transceiver module can be a communication interface, pins, or circuits. The communication interface can be used to input data to be processed to the processor and can output the processor's processing results. Specifically, the communication interface can be a general purpose input / output (GPIO) interface, which can connect to multiple peripheral devices (such as LCD displays, cameras, radio frequency (RF) modules, antennas, etc.). The communication interface is connected to the processor via a bus.

[0479] The processing module can be a processor, which can execute computer execution instructions stored in the storage module to cause the chip to perform the methods involved in any of the embodiments shown in FIG9. Further, the processor may include a controller, an arithmetic logic unit (ALU), and registers. For example, the controller is mainly responsible for instruction decoding and issuing control signals for the operations corresponding to the instructions. The ALU is mainly responsible for performing fixed-point or floating-point arithmetic operations, shift operations, and logical operations, and can also perform address operations and conversions. The registers are mainly responsible for storing register operands and intermediate operation results temporarily stored during instruction execution. In specific implementations, the processor's hardware architecture can be an ASIC architecture, a microprocessor without interlocked piped stages architecture (MIPS) architecture, an advanced reduced instruction set machine (RISC) machine (ARM) architecture, or a network processor (NP) architecture, etc. The processor can be single-core or multi-core. The storage module can be an internal storage module of the chip, such as registers or caches. The storage module can also be an external storage module, such as ROM or other types of static storage devices that can store static information and instructions, RAM, etc.

[0480] This application also provides a computer program product that, when executed by a computer, can implement the functions of any of the above method embodiments.

[0481] This application also provides a computer program that, when executed by a computer, can implement the functions of any of the above method embodiments.

[0482] This application also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be implemented by a computer program instructing related hardware. This program can be stored in the computer-readable storage medium, and when executed, it can include the processes of the above method embodiments. The computer-readable storage medium can be an internal storage unit of the terminal (including a data sending end and / or a data receiving end) of any of the foregoing embodiments, such as the terminal's hard disk or memory. The computer-readable storage medium can also be an external storage device of the terminal, such as a plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, etc., equipped on the terminal. Further, the computer-readable storage medium can include both the terminal's internal storage unit and external storage devices. The computer-readable storage medium is used to store the computer program and other programs and data required by the terminal. The computer-readable storage medium can also be used to temporarily store data that has been output or will be output.

[0483] The terms "first" and "second," etc., used in the specification, claims, and drawings of this application are used to distinguish different objects, not to describe a specific order. "First" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Therefore, a feature defined with "first" and "second" may explicitly or implicitly include one or more of that feature. In the description of this embodiment, unless otherwise stated, "a plurality of" means two or more.

[0484] Furthermore, the terms “comprising” and “having”, and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the steps or units listed, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to such process, method, product, or apparatus.

[0485] It is understood that in this application, "at least one (item)" refers to one or more. "More than one" refers to two or more. "At least two (items)" refers to two or three or more. "And / or" is used to describe the relationship between related objects, indicating that there can be three relationships. For example, "A and / or B" can mean: only A exists, only B exists, and both A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the related objects before and after are in an "or" relationship. "At least one (item) 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 (item) of a, b, or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple. Both "...when" and "if" indicate that a corresponding action will be taken under certain objective circumstances. They are not time limits, nor do they require a judgment action to be taken when the action is taken, nor do they imply any other limitations.

[0486] In the embodiments of this application, the terms "exemplary" or "for example" are used to indicate that something is an example, illustration, or description. Any embodiment or design that is described as "exemplary" or "for example" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or design. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a specific manner to facilitate understanding.

[0487] In this application, "sending information to...(terminal device)" can be understood as the destination of the information being the terminal device. This can include sending information directly or indirectly to the terminal device. "Receiving information from...(terminal device)" can be understood as the source of the information being the terminal device, and can include receiving information directly or indirectly from the terminal device. Information may undergo necessary processing between the source and destination, such as format changes, but the destination can understand the valid information from the source.

[0488] Through the above description of the embodiments, those skilled in the art can clearly understand that, for the sake of convenience and brevity, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

[0489] In the several embodiments provided in this application, the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative. For instance, the division of modules or units is only 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 device, or some features may be ignored or not executed. Furthermore, the displayed or discussed mutual couplings, direct couplings, or communication connections may be through some interfaces; indirect couplings or communication connections between devices or units may be electrical, mechanical, or other forms.

[0490] The units described as separate components may or may not be physically separate. A component shown as a unit can be one or more physical units; that is, it can be located in one place or distributed in multiple different locations. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0491] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0492] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solution of this application embodiment, or all or part of the technical solution, can be embodied in the form of a software product. This software product is stored in a storage medium and includes several instructions to cause a device (which may be a microcontroller, chip, etc.) or processor 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.

Claims

1. A communication method, characterized in that, include: The number of first resource units obtained; The number of the first resource units corresponds to the first bandwidth, which is predefined, or the first bandwidth is associated with the bandwidth supported by the terminal device; the first resource unit is a portion of the second resource units, which are predefined. Based on the number of the first resource units, rate matching is performed on the first coded bit sequence to obtain the first sequence; Map the first sequence to the first resource unit to obtain the second sequence; Output the second sequence.

2. The method according to claim 1, characterized in that, The method further includes: Obtain the quantity of the third resource unit; the third resource unit is a portion of the resource units in the second resource unit, and the quantity of the third resource unit is different from the quantity of the first resource unit; Based on the number of the third resource units, the first coded bit sequence is rate-matched to obtain the third sequence; The third sequence is mapped to the third resource unit to obtain the fourth sequence; Output the fourth sequence.

3. The method according to claim 1 or 2, characterized in that, The number of the first resource units is X, and the number of the second resource units is Y, where X and Y are both positive integers. The first resource unit is the (YX) / 2th to (Y+X) / 2-1th resource units in the second resource unit; or The first resource unit is the 0th to the (X-1)th resource units in the second resource unit; or The first resource unit is the YXth to Y-1th resource units in the second resource unit.

4. The method according to any one of claims 1-3, characterized in that, Rate matching is performed on the first coded bit sequence to obtain the first sequence, comprising: the length of the first coded bit sequence is N, and the length of the first sequence is E, wherein N and E are both positive integers. When E is less than or equal to N, the first sequence includes the 0th bit to the (E-1)th bit of the first coded bit sequence; or When E is less than or equal to N, the first sequence includes the (N-1)th to the NEth bits of the first coded bit sequence; or When E is greater than N, the first sequence includes the 0th to N-1th bits and the 0th to EN-1th bits of the first encoded bit sequence; or When E is greater than N, the first sequence includes the (N-1)th bit to the 0th bit of the first encoded bit sequence, and the (N-1)th bit to the 2*NEth bit.

5. The method according to any one of claims 1-4, characterized in that, Transmit a synchronization signal block / physical broadcast channel block (SSB / PBCH); wherein, the SSB / PBCH block includes a first signal; the first signal corresponds to the second sequence; the information bit sequence is the broadcast information carried by the PBCH.

6. The method according to claim 5, characterized in that, The SSB / PBCH block also includes a second signal and a third signal; Wherein, the second signal corresponds to a first primary synchronization signal PSS sequence of length L; the third signal corresponds to a first secondary synchronization signal SSS sequence of length L; Both the first PSS sequence and the first SSS sequence are associated with the base sequence; L is the difference between 2 raised to the power of A and 1, A is determined according to the number of the first resource units, and A is a positive integer.

7. The method according to claim 6, characterized in that, The first PSS sequence includes L bits from the second PSS sequence; Wherein, the second PSS sequence is the first base sequence, or the second PSS sequence is obtained by cyclically shifting the first base sequence; the length of the first base sequence is 127, and the first base sequence is determined according to the initial sequence.

8. The method according to claim 6, characterized in that, The first PSS sequence is the second base sequence; or The first PSS sequence is obtained by cyclically shifting the second base sequence; Wherein, the length of the second base sequence is L, and the second base sequence is determined according to the initial sequence.

9. The method according to claim 8, characterized in that, The number of cyclic shift steps corresponding to the second base sequence is the first value; or The number of cyclic shift steps corresponding to the second base sequence is 2 * the first value; Wherein, the first value is the result of rounding the first ratio, and the first ratio is the ratio of L to 3.

10. The method according to any one of claims 6-9, characterized in that, The first SSS sequence includes L bits from the second SSS sequence; The second SSS sequence is determined based on the cyclically shifted third base sequence and the cyclically shifted fourth base sequence. The length of the third base sequence and the length of the fourth base sequence are both 127. The number of cyclic shift steps corresponding to the third base sequence is different from the number of cyclic shift steps corresponding to the fourth base sequence. The third base sequence and the first base sequence satisfy the first recursive formula, and the fourth base sequence and the first base sequence satisfy the second recursive formula. The first recursive formula is different from the second recursive formula. The length of the first base sequence is 127, and the first base sequence is determined according to the initial sequence.

11. The method according to any one of claims 6-9, characterized in that, The first SSS sequence is determined based on the fifth base sequence after superposition and the sixth base sequence after cyclic shift; The length of the fifth base sequence and the length of the sixth base sequence are both L; the number of cyclic shift steps corresponding to the fifth base sequence is different from the number of cyclic shift steps corresponding to the sixth base sequence; The fifth base sequence and the second base sequence satisfy the first recursive formula, and the sixth base sequence and the second base sequence satisfy the second recursive formula. The first recursive formula and the second recursive formula are different. The length of the second base sequence is L, and the second base sequence is determined according to the initial sequence.

12. The method according to claim 5, characterized in that, The SSB / PBCH block also includes a second signal and a third signal; Wherein, the second signal corresponds to a first PSS sequence of length L; the third signal corresponds to a first SSS sequence of length L; L is the difference between 2 raised to the power of A and 1, where A is determined based on the number of the first resource units and is a positive integer. The first PSS sequence is determined based on a first information bit position set of length K1, and the first SSS sequence is determined based on a second information bit position set of length K2; the fourth value is the minimum value of an integer power of 2 that is greater than or equal to the first threshold, the fourth value is 2 raised to the power of (K1+K2), K1 and K2 are both positive integers, and the intersection of the first information bit position set and the second information bit position set is an empty set.

13. The method according to claim 12, characterized in that, The first PSS sequence is determined based on a first information bit position set of length K1, including: Based on the first set of information bit positions, the sixth sequence of length K1 is polar-coded to obtain the second coded bit sequence of length N1; Rate matching is performed on the second encoded bit sequence to obtain the first PSS sequence of length L; Wherein, N1 is 2 to the power of A, and A is determined according to the number of the first resource units.

14. The method according to claim 13, characterized in that, The cross-correlation of the second encoded bit sequence is less than or equal to the second threshold.

15. The method according to any one of claims 12-14, characterized in that, The first SSS sequence is determined based on a second information bit position set of length K1, including: Based on the second set of information bit positions, the seventh sequence of length K2 is polar-coded to obtain the third coded bit sequence of length N1; Rate matching is performed on the third encoded bit sequence to obtain the first SSS sequence of length L; Wherein, N1 is 2 to the power of A, and A is determined according to the number of the first resource units.

16. The method according to claim 15, characterized in that, The cross-correlation of the third encoded bit sequence is less than or equal to the third threshold.

17. The method according to any one of claims 12-16, characterized in that, There are two sets of first information bit positions, and the number of first resource units corresponding to the two sets of first information bit positions is different. The difference between the i-th element in the two first information bit location sets is a second value; wherein, the second value is predefined, or, the second value is an integer power of 2, or, the second value is determined according to the number of first resource units corresponding to the two first information bit location sets; i = 0, 1, ..., K1-1.

18. The method according to any one of claims 12-17, characterized in that, K1 is 4.

19. The method according to claim 18, characterized in that, The first set of information bit positions is [24 28 30 31]; or The first set of information bit positions is [56 60 62 63]; or The first set of information bit positions is [120 124 126 127].

20. The method according to any one of claims 12-19, characterized in that, There are two sets of second information bit positions, and the number of first resource units corresponding to the two sets of second information bit positions is different. The difference between the j-th element in the two sets of second information bit positions is a third value; wherein, the third value is predefined, or the third value is an integer power of 2, or the third value is determined according to the number of first resource units corresponding to the two sets of second information bit positions; j = 0, 1, ..., K2-1.

21. The method according to any one of claims 12-20, characterized in that, K2 is 6.

22. The method according to claim 21, characterized in that, The second set of information bit positions is [4 6 7 8 10 16]; or The second set of information bit positions is [36 38 39 40 42 48]; or The second set of information bit positions is [100 102 103 104 106 112].

23. A communication device, characterized in that, The communication device includes a unit or module for performing the communication method according to any one of claims 1-22.

24. A communication device, characterized in that, The communication device includes a processor; the processor is configured to run a computer program or instructions that cause the communication method as described in any one of claims 1-22 to be executed.

25. A communication device, characterized in that, The communication device includes an interface circuit and a logic circuit; the interface circuit is used to input and / or output information; the logic circuit is used to execute the communication method as described in any one of claims 1-22, processing and / or generating the information based on the information.

26. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions or programs that, when executed on a computer, cause the communication method as described in any one of claims 1-22 to be performed.

27. A computer program product, characterized in that, The computer program product includes computer instructions; when some or all of the computer instructions are run on a computer, the communication method as described in any one of claims 1-22 is executed.

Images