Method and user equipment for wireless communication

Abstract

A method for wireless communication includes: at a base station in a wireless communication system, performing first scrambling on a subset of PBCH information bits with a first scrambling code to generate first scrambled PBCH data; performing channel coding processing via polar coding to encode PBCH data containing the first scrambled PBCH data to generate coded PBCH data, the coded PBCH data being carried in a SSB associated with an SBI and transmitted from a cell, the cell having a cell identity; and performing second scrambling on the coded PBCH data with a second scrambling code to generate second scrambled PBCH data, the second scrambling code being determined based on the cell identity and the SBI, the SBI being indicated by a DMRS associated with the SSB, the second scrambling being performed after the first scrambling on the subset of PBCH information bits and the channel coding processing. Through the present application, wireless communication can be better performed.

Description

[0001] This case is a divisional application of the patent application filed on September 11, 2018, with application number "201880027956.7", international application number "PCT / CN2018 / 105055", and invention title "PBCH Data Processing Method and User Equipment". Technical Field

[0002] This invention relates to wireless communication, specifically to data processing of the Physical Broadcast Channel (PBCH) in a wireless communication network. Background Technology

[0003] This section is intended to provide background or context for the embodiments of the invention set forth in the claims. The description herein is not an admission that it is prior art simply because it is included in this section.

[0004] This background section is provided to generally present the context of the invention. The work of the currently named inventors, the work to the extent described in this background section, and aspects described herein that did not constitute prior art at the time of application are neither expressly nor impliedly acknowledged as prior art to the invention.

[0005] Fifth-generation (5G) wireless communication networks employ beamforming technology to concentrate transmissions in specific directions and extend their range. For example, beam sweeping can be performed to cover the service area of ​​the wireless communication system. Information carried on the PBCH can be repeatedly broadcast in different directions during beam sweeping. Mobile devices can decode the PBCH to obtain system information or frame timing information. Summary of the Invention

[0006] A method for wireless communication includes: at a base station in a wireless communication system, performing a first scrambling on a subset of physical broadcast channel information bits using a first scrambling code to generate first scrambled physical broadcast channel data; performing channel coding processing via polar coding to encode the physical broadcast channel data containing the first scrambled physical broadcast channel data to generate encoded physical broadcast channel data, the encoded physical broadcast channel data being carried in a synchronization block associated with a synchronization block index and transmitted from a cell, wherein the cell has a cell identifier; and performing a second scrambling on the encoded physical broadcast channel data using a second scrambling code to generate second scrambled physical broadcast channel data, wherein the second scrambling code is determined based on the cell identifier and the synchronization block index, the synchronization block index being indicated by a demodulation reference signal associated with the synchronization block, wherein the second scrambling is performed after the first scrambling of the subset of physical broadcast channel information bits and the channel coding processing.

[0007] A method for wireless communication includes: at a user equipment in a wireless communication network, receiving a first synchronization signal block from a cell, wherein the first synchronization signal block carries a first physical broadcast channel, the first synchronization signal block being associated with a first synchronization signal block index, the cell having a cell identifier; determining a least significant set of bits of the first synchronization signal block index based on a demodulation reference signal in the first synchronization signal block, wherein the demodulation reference signal indicates the least significant set of bits; determining a first scrambling code based on the cell identifier and the least significant set of bits of the first synchronization signal block index determined according to the demodulation reference signal in the first synchronization signal block; performing demodulation on the first physical broadcast channel to generate first demodulated physical broadcast channel data; and utilizing the cell identifier and root... Based on the first scrambling code determined by the least significant bit set of the first synchronization signal block index determined by the demodulation reference signal, the first demodulated physical broadcast channel data is subjected to first descrambling to generate first descrambled physical broadcast channel data; channel decoding is performed to decode the first descrambled physical broadcast channel data to generate descrambled physical broadcast channel information bits and cyclic redundancy check bits; and when the cyclic redundancy check based on the cyclic redundancy check bits is successful, the descrambled physical broadcast channel information bits are subjected to second descrambling using a second scrambling code to recover the physical broadcast channel information bits, wherein the first descrambling of the first demodulated physical broadcast channel data is performed before the second descrambling of the descrambled physical broadcast channel information bits and the channel decoding.

[0008] A user equipment for wireless communication includes processing circuitry configured to: receive, in a wireless communication network, a first synchronization signal block from a cell, wherein the first synchronization signal block carries a first physical broadcast channel, the first synchronization signal block being associated with a first synchronization signal block index, and the cell having a cell identifier; determine the least significant bit set of the first synchronization signal block index based on a demodulation reference signal in the first synchronization signal block, wherein the demodulation reference signal indicates the least significant bit set; determine a first scrambling code based on the cell identifier and the least significant bit set of the first synchronization signal block index determined according to the demodulation reference signal in the first synchronization signal block; perform demodulation on the first physical broadcast channel by the processing circuitry to generate first demodulated physical broadcast channel data; and utilize a base... The system performs a first descrambling on the first demodulated physical broadcast channel data using the cell identifier and the first scrambling code determined by the least significant bit set of the first synchronization signal block index based on the demodulation reference signal to generate first descrambled physical broadcast channel data; performs channel decoding processing to decode the first descrambled physical broadcast channel data to generate descrambled physical broadcast channel information bits and cyclic redundancy check bits; and when the cyclic redundancy check based on the cyclic redundancy check bits is successful, performs a second descrambling on the descrambled physical broadcast channel information bits using a second scrambling code to recover the physical broadcast channel information bits, wherein the first descrambling of the first demodulated physical broadcast channel data is performed before the second descrambling of the descrambled physical broadcast channel information bits and the channel decoding processing.

[0009] By utilizing this invention, wireless communication can be improved. Attached Figure Description

[0010] Various exemplary embodiments of the present invention will now be described with reference to the accompanying drawings, in which similar numbers refer to similar elements, wherein:

[0011] Figure 1 An exemplary wireless communication system according to an embodiment of the present invention is shown.

[0012] Figure 2A The first PBCH decoding is shown as an example, in which no scrambling operation is performed.

[0013] Figure 2B An exemplary second PBCH decoding is shown, in which an scrambling operation is employed.

[0014] Figure 3 An exemplary Synchronization Signal Block (SSB) transmission configuration according to an embodiment of the present invention is shown.

[0015] Figure 4 An exemplary SSB is shown according to an example of the present invention.

[0016] Figure 5 An exemplary PBCH payload according to an embodiment of the present invention is shown.

[0017] Figure 6 An exemplary process for PBCH processing according to an embodiment of the present invention is shown.

[0018] Figure 7 An example is shown of mapping polar-encoded PBCH data to SSBs in a set of SSB bursts according to an embodiment of the present invention.

[0019] Figure 8 This demonstrates how to generate a scrambling code for use. Figure 6 An example of the second scrambling operation described in the example.

[0020] Figure 9 An exemplary scrambling operation according to an embodiment of the present invention is shown.

[0021] Figure 10 An example of initializing a Gold sequence for generating a second scrambling code is shown according to an embodiment of the present invention.

[0022] Figure 11 The PBCH detection process according to an embodiment of the present invention is illustrated.

[0023] Figure 12 An exemplary process for PBCH detection based on soft-combination across SSBs in an SSB burst set, according to an embodiment of the present invention, is shown.

[0024] Figures 13A-13B The simulation results for PBCH processing with different scrambling configurations are shown.

[0025] Figure 14 An exemplary apparatus according to an embodiment of the present invention is shown. Detailed Implementation

[0026] Figure 1An exemplary wireless communication system 100 according to an embodiment of the present invention is illustrated. System 100 may include user equipment (UE) 110 and base station (BS) 120. System 100 may employ 5G wireless communication technology developed under the 3rd Generation Partnership Project (3GPP), or other wireless technologies developed by other organizations. System 100 may include technologies not included in... Figure 1 Other BS and UE shown in the figure.

[0027] In some examples, millimeter wave (mmW) bands and beamforming technology can be employed in system 100. Accordingly, UE 110 and BS 120 can perform beamforming transmission or reception. In beamforming transmission, the energy of the radio signal can be focused in a specific direction to cover the target service area. Therefore, antenna transmission gain can be improved compared to omnidirectional antenna transmission. Similarly, in beamforming reception, the energy of the radio signal received from a specific direction can be combined to obtain a higher antenna reception gain than omnidirectional antenna reception. The improved transmission or reception gain can compensate for path loss or penetration loss in mmW signal transmission.

[0028] BS 120 can be a BS that implements a 5G node (gNode B, gNB), where the gNB node is defined in the 5G New Radio (NR) air interface standard developed by 3GPP. BS 120 can be configured to control one or more antenna arrays to form directional transmit or receive beams to transmit or receive radio signals.

[0029] exist Figure 1In the example, BS 120 can control the antenna array to form transmit beams 121-126 to cover cell 128. Beams 121-126 can be generated in different directions. In different examples, beams 121-126 can be generated simultaneously or at different time intervals. In one example, BS 120 can be configured to perform beam sweep 127 to transmit downlink (DL) Layer 1 (L1) or Layer 2 (L2) control channel and / or data channel signals. During beam sweep 127, transmit beams 121-126 in different directions can be continuously formed in a time division multiplexing (TDM) manner to cover cell 128. During the time intervals between transmitting each beam 121-126, each transmit beam can be used to transmit a set of L1 / L2 control channel data and / or data channel data. Beam sweep 127 can be repeated at a specific period.

[0030] In another example, beams 121-126 can be generated in other ways besides performing beam scanning. For example, multiple beams pointing in different directions can be generated simultaneously. In other examples, a beam can be repeatedly generated in one direction. Each beam can have a different beamwidth than beams 121-126. The maximum number of beams generated from a single BS can vary depending on the configuration and BS capabilities, such as 4, 8, and 64.

[0031] In one example, beams 121-126 of cell 128 can be associated with SSB 129, where SSB can also be referred to as a Synchronization Signal (SS) / PBCH block. In an Orthogonal Frequency Division Multiplexing (OFDM) based system, each SSB 129 can correspond to a set of Resource Elements (REs) carried on several consecutive OFDM symbols. Each SSB 129 may include a PBCH. The PBCH can carry information bits of system information and frame timing information. In some examples, this set of information bits can be referred to as a Master Information Block (MIB). Each SSB 129 can be associated with an SSB Index (SBI). The SBI indicates the timing of each SSB and is therefore also called an SSB timing index. Figure 1 As shown, SSB 129 can be associated with indices from #0 to #5.

[0032] For example, BS 120 can periodically transmit SSB 129 sequences, which can also be called SSB burst sets 130. This can be achieved by executing... Figure 1 The example shows beam scanning 127 used to transmit SSB burst set 130. One of the beams 121-126 can be used to transmit each SSB 129 in SSB burst set 130. Each SBI can indicate the time or location of each SSB in SSB burst set 130. Furthermore, the MIB of the PBCH transmitted in SSB burst set 130 can remain unchanged, for example, at least for a certain number of consecutive SSBs. In another example, BS 120 may not employ multiple beams. For example, BS 120 may transmit without beamforming to cover cell 128. In the above configuration, SSB 129 can be transmitted continuously in the time domain, but each transmission can be performed in every direction within cell 128.

[0033] UE 110 can be a mobile phone, laptop computer, in-vehicle mobile communication device, or utility meter fixed in a specific location. Similarly, UE 110 can employ one or more antenna arrays to generate directional transmit or receive beams to transmit or receive wireless signals.

[0034] In one example, UE 110 can perform PBCH decoding based on soft combinations across SSBs within the same SSB burst set. For instance, during initial access processing, UE 110 decodes the PBCH to obtain MIB and frame timing information. If one-shot PBCH decoding fails, UE 110 can attempt a second PBCH decoding by combining soft bits corresponding to two consecutive PBCH receptions within SSB burst set 130 to increase the chance of successful PBCH decoding.

[0035] To facilitate soft combination of PBCH decoding across SSBs within the SSB burst set at UE 110, BS 120 can be configured to perform a scrambling operation after channel coding processing. During the scrambling operation, for each PBCH transmission of SSB 129, BS 120 can scramble the same encoded PBCH data block 141 using different scrambling codes 142. Therefore, different scrambled PBCH data blocks 143 can be generated for different PBCHs of SSB 129.

[0036] For example, for SSB burst set 130, BS 120 can receive the MIB and generate encoded PBCH data 141 during channel coding processing, for example, using polar code. Since the MIB does not change within SSB burst set 130, the polar-coded PBCH data 141 can be identical for each PBCH of SSB 129. Then, as... Figure 1 As shown, for each PBCH of SSB 129, UE 110 can perform a scrambling operation 140 on the polarized coded PBCH data 141 using scrambling code 142. For example, a modulo-2 addition (or XOR operation) can be performed using a pair of bits from the polarized coded data 141 and the scrambling code 142, respectively. The scrambling code 142 can be determined based on the SBI corresponding to each SSB 129 and the cell identifier (ID) of cell 128. Therefore, the scrambling code 142 can be different across SSB 129.

[0037] Because of the scrambling operation 140 based on scrambling code 142 (where scrambling code 142 can be different across SSB 129), the performance of soft-combined PBCH decoding across SSB at UE 110 can be improved. Figure 2A and Figure 2B An example illustrating the above improvements is shown. Specifically, Figure 2A This demonstrates an exemplary first PBCH decoding, in which scrambling operation 140 is not performed. Figure 2B An exemplary second PBCH decoding is shown, in which a scrambling operation is employed.

[0038] exist Figure 2AIn serving cell 128, the same block 230 or 240 of encoded PBCH data Y can be transmitted twice via two consecutive SSBs with SBI#b and #(b+1). Similarly, in neighboring cell 258, the same block 210 or 220 of encoded PBCH data X can be transmitted twice via two consecutive SSBs with SBI#a and #(a+1). When SSB transmissions are synchronized at serving cell 128 and neighboring cell 258, interference 216 caused by block 210 may have similar characteristics to interference 226 caused by block 220 due to the transmission of the same block 210 or 220. At UE 110, the soft bits 250 derived from the first reception of block 230 (e.g., in the form of Log Likelihood Ratio (LLR)) may suffer from interference similar to that of the soft bits 260 derived from the second reception of block 240. Therefore, the combination 271 of the two sets of soft bits 250 and 260 may experience coherent interference from both receivers, which can degrade the performance of PBCH decoding based on soft combination.

[0039] exist Figure 2B In this process, scrambling operations 214, 224, 234, and 244, similar to scrambling operation 140, can be added for each PBCH transmission. At the serving cell 128, scrambling codes 232 and 242 can be used for scrambling operations 234 and 244, respectively. At the neighboring cell 258, scrambling codes 212 and 222 can be used for scrambling operations 214 and 224, respectively. Scrambling codes 212, 222, 232, and 242 can be generated based on each cell ID and SBI. With appropriate configuration, scrambling codes 212, 222, 232, and 242 can have low correlation with each other. Due to the randomization of different scrambling codes 212 and 222, interferences 216 and 226 may exhibit different characteristics. Furthermore, scrambling operations 234 and 244 can further utilize different scrambling codes 232 and 242 to randomize the received interferences 216 and 226. Therefore, the coherence of the two parts of interference during two consecutive receptions of PBCH data 230 and 240 can be minimized or reduced. At UE 110, descrambling operations 254 and 264 can be performed on soft bits 250 and 260 respectively using scrambling codes 232 and 242. For example, when scrambling with "1", the sign or polarity of the LLR value of the soft bit may be inverted, while when scrambling with "0", it can be retained. Then, a soft combination 271 of the two sets of soft bits can be performed. Figure 2A Compared to the example, this can improve the performance of PBCH decoding.

[0040] Figure 3 An exemplary SSB transmission configuration according to an embodiment of the present invention is shown. A sequence of eight frames 303 is shown, which may correspond to a Broadcast Channel (BCH) Transmission Time Interval (TTI) 301. The BCH TTI may have a duration of 80 ms. A sequence of SSB burst sets 310 may be transmitted between frames 303 at a period 302 of 20 ms. In various examples, the transmission period of the SSB burst sets may be 5, 10, 20, 40, 80, and 160 ms, etc. Each SSB burst set 310 may be contained within a half-frame time window (5 ms). Depending on the configuration, the half-frame time window may be a first or a second half-frame.

[0041] Each SSB burst set 310 may include a sequence of SSBs 320, each of which may be associated with an SBI. The number and timing of SSBs within the SSB burst set 310 can vary depending on the subcarrier spacing (numerology) configuration. For example, in different configurations, the maximum number L of candidate SSB locations can be 4, 8, or 64. Correspondingly, the SBI can be represented using 2 bits, 3 bits, or 6 bits. Figure 3 An example of an SSB burst set configuration corresponding to a 15kHz subcarrier spacing and 8 SSB candidate locations is shown. Eight SSBs can be transmitted at the 8 candidate locations, with SBIs #0-#7.

[0042] Figure 4 An exemplary SSB 400 according to an example of the present invention is shown. The SSB 400 may include a Primary Synchronization Signal (PSS) 401, a Secondary Synchronization Signal (SSS) 402, and a PBCH 403 (represented by shaded areas labeled 401, 402, and 403, respectively). Figure 4 As shown, the aforementioned signal can be carried in REs on the time-frequency resource grid. Additionally, SSB 400 can carry a demodulation reference signal (DMRS) (not shown) in a subset of REs in the shaded region 403. In one example, the RE carrying the DMRS may not be used to carry the PBCH signal.

[0043] In one example, the SSB 400 can be distributed across 4 OFDM symbols in the time domain and occupy 20 resource block (RB) bandwidth in the frequency domain. For example... Figure 4 As shown, the four OFDM symbols can be numbered from 0 to 3, and the 20 RB bandwidth can contain 240 subcarriers, which can be numbered from 0 to 239. Specifically, PSS 401 can occupy the REs at symbol 0 and subcarriers 56-182, SSS 402 can occupy the REs at symbol 2 and subcarriers 56-182, and PBCH 403 can be located at symbols 1-3 and occupy 20 RBs at symbols 1 and 3 and 8 RBs (96 subcarriers) at symbol 2.

[0044] In one example, SSB 400 can be configured to carry SBI bits using DMRS and PBCH 403. For instance, for an SBI with up to 6 bits, the 3 least significant bits (LSB) of the SBI can be carried by DMRS, and the 3 most significant bits (MSB) of the SBI can be carried by PBCH 403. In one example, the physical (PHY) layer cell ID can be determined by decoding PSS 401 and SSS 402. The cell ID indicates the cell associated with SSB 400.

[0045] Figure 5 An exemplary PBCH payload 510 according to an embodiment of the present invention is shown. The PBCH payload 510 may include information bits 520 and Cyclic Redundancy Check (CRC) bits 530. Information bits 520 may include system information 521 and timing information 522. Timing information 522 may include a System Frame Number (SFN) 523, a half-frame indication bit 524, and an MSB bit 525 of the SBI. Furthermore, a first portion 526 of information bits 520 may be received from the transport layer, and a second portion 527 of information bits 520 may be generated at the PHY layer. For example, the transport layer and PHY layer may be the protocol stack layers of System 100 as defined in the 3GPP 5G standard.

[0046] For each SSB transmission, the PBCH payload can be formulated at the PHY layer. Bit 526 received from the upper layer remains unchanged within the BCH TTI. For each SSB burst set contained within a half-frame, SFN bits S0-S3 and half-frame indicator bit C0 remain unchanged.

[0047] For eight consecutive SSBs within an SSB burst set, the MSB bits of the SBI remain unchanged. In one example, the possible number (L) of SSBs within the SSB burst set can be configured as 4, 8, or 64. When L = 64, the three MSB bits of each SBI can be included in the PBCH payload. Therefore, for at least one set of eight consecutive SSBs, the PBCH payload remains unchanged. Accordingly, the PBCH payload can be decoded at UE 110 based on a soft combination of the PBCHs of two consecutive SSBs belonging to the aforementioned set of eight consecutive SSBs.

[0048] For L=4 or 8, the three LSB bits of each SBI can be carried in the DMRS of each PBCH. The PBCH payload may not include the SBI bits. Accordingly, for L=4 or 8, the payload of each PBCH may not change within the SSB burst set, and soft combination across SSBs within the SSB burst set can be performed accordingly.

[0049] Figure 6 An exemplary process 600 for PBCH processing according to an embodiment of the present invention is shown. Process 600 can be executed at BS120 to generate an SSB carrying PBCH data. System 100 and PBCH payload 510 can be used to interpret process 600. In process 600, scrambling is performed on polarized coded PBCH data using scrambling codes, wherein the scrambling codes can be based on cell ID and SBI.

[0050] In S610, the first scrambling operation can be performed. For example, as... Figure 5 As illustrated in the example, information bits 520 can be generated. A subset 601 of information bits 520 can be scrambled using a first scrambling code 602. The subset 601 of information bits 520 may exclude the second and third LSBs (bits S1 and S2) of SFN 523, the half-frame timing indicator bit C0, and the three MSBs of the SBI of the PBCH payload 510. The first scrambling code 602 can be based on the cell ID of cell 128 and... Figure 5The second and third LSBs (bits S1 and S2) of SFN 523 are used to determine this. The scrambled bits generated by the first scrambling operation can be combined with the unscrambled bits of the PBCH payload 510 to form the first scrambled PBCH data 603. An interleaving operation can also be performed on the information bits before the first scrambling operation.

[0051] In S612, the first scrambled PBCH data 603 may be attached to CRC 604 to form a scrambled PBCH payload, wherein the scrambled PBCH payload may include scrambled information bits.

[0052] In S614, channel coding (e.g., channel coding using polar codes) and rate matching operations can be performed on the scrambled PBCH payload to generate polar-coded PBCH data 605. In one example, the channel coding and rate matching operations can be part of the channel coding process. The encoded PBCH data 605 can be the result of the channel coding process. In other examples, the rate matching operation may not be performed.

[0053] For example, the 3GPP standard TS38.212 describes the operations of payload generation, first scrambling, CRC attachment, channel coding, and rate matching.

[0054] In S616, a second scrambling operation can be performed on the polarization-coded PBCH data 605 using a second scrambling code 606. Typically, the second scrambling code 606 can be used to vary cross-SSB interference from neighboring cells, so that the soft combination used for decoding the PBCH can perform better. To achieve this, the second scrambling code can vary with the SSB. Different methods can be used to generate the second scrambling code in different examples. In one example, the second scrambling code 606 can be generated based on the cell ID and the three LSBs of each SBI. Using this method, at least eight different scrambling codes can be generated. As a result of the second scrambling operation, second scrambling PBCH data 607 can be generated.

[0055] In S618, a second scrambled PBCH data 607 can be transmitted to UE 110. For example, modulation and RE mapping can be performed to carry the PBCH data in each SSB.

[0056] Figure 7An example is shown of mapping polar-coded PBCH data 710 to SSBs 741-744 within an SSB burst set 740, according to an embodiment of the present invention. As shown, the SSB burst set 740 may be contained within a half-frame 750. The PBCH payload corresponding to the SSB burst set 740 may not be changed on the SSBs 741-744. The PBCH payload can be used to generate the polar-coded data 710.

[0057] A scrambling code sequence 721-724 can be generated. Scrambling codes 721-724 can be different from each other, and each scrambling code can be determined based on each SBI (such as #0, #1, #2, or #3) of SSB741-744 and each cell ID. This can be achieved using methods such as... Figure 7 The scrambling sequences 721-724 shown scramble the polar-coded data 710 to generate scrambled PBCH data sequences 731-734. The scrambled PBCH data 731-734 can then be processed to be carried in SSB sequences 741-744 respectively.

[0058] Figure 8 The generated scrambling codes 821-828 are shown for use as follows: Figure 6 Example 800 of the second scrambling operation S616 described in the example. Scrambling codes 821-828 can be used to scramble the polarized coded PBCH data of the SSB burst set 830. The SSB burst set 830 may include an SSB 831 sequence, wherein the SSB 831 sequence may have an SBI from 000 to 111 (binary). Therefore, each scrambling code 821-828 may correspond to one of the SBIs from 000 to 111. The number of scrambling codes 821-828 may be equal to the number of SSBs 831, and may be 8. The number of bits in the polarized coded PBCH data may be represented as M. Therefore, each scrambling code 821-828 may have a length of M bits. It should be noted that... Figure 8 The eight parts shown are for illustrative purposes only. In other embodiments, four parts may be used.

[0059] exist Figure 8In the example, to obtain scrambling codes 821-828, a sequence generator 810 can be used to generate bit sequences 820. In one example, sequence 820 can be a pseudo-random sequence, such as the Gold sequence. Before generation, sequence generator 810 can be initialized using cell ID 801, which corresponds to the cell transmitting SSB 831. The length of sequence 820 can be determined based on the number of SSBs 831 and the number of bits M in the polar-coded PBCH data. As shown in the figure, after generating sequence 820, sequence 820 can then be divided into 8 parts, each corresponding to the SBI of SSB 831.

[0060] based on Figure 8 The following example illustrates a more general process for generating scrambling codes, which can be used for... Figure 6 The example describes the second scrambling operation in S616. First, the sequence generator is initialized using the cell ID. Then, a sequence of length (2^X)*M is generated, where X is the number of LSB bits in the SBI of the SSB sequence within the SSB burst set. The generated sequence is then divided into 2^X non-overlapping portions. Subsequently, X LSB bits of the SBI of the SSB are used to identify one of the non-overlapping portions (as a second scrambling code) to generate scrambled PBCH data, where the scrambled PBCH data corresponds to the SSB with that SBI.

[0061] For example, when the SSB burst set 830 is configured with 4 SSBs, X can take the value 2. When the SSB burst set 830 is configured with more than 4 SSBs, X can take the value 3. Corresponding to different SSB configurations, different numbers (4 or 8) of non-overlapping portions can be obtained by generating sequences 820 of different lengths.

[0062] In one example, the sequence generator 810 may be initialized at the beginning of the SSB burst set 830 (or, in other words, initialized when or before the second scrambling operation occurs on the first SSB in the SSB burst set 830). A bit sequence 820 may be generated and stored in memory. Subsequently, portions of the bit sequence 820 may be identified and used for each SSB 831 (the PBCH in each SSB 831). Alternatively, the bit sequence 820 may be generated portion by portion. Portions of the bit sequence 820 may be generated when processing of each SSB 831 (the PBCH in each SSB 831) begins.

[0063] In one example, at the start of PBCH processing for each SSB 831 (or, at or before each second scrambling operation is performed on each SSB 831), sequence generator 810 may be initialized and sequence 820 may be generated. A portion of sequence 820 may then be identified based on the SBI of the currently being processed SSB.

[0064] In one example, the pseudo-random sequence generated by sequence generator 810 can be defined by a Gold sequence of length 31 (length-31). For example, the pseudo-random sequence output by sequence generator 810 can be represented as c(n), where n is a bit index that starts from 0 and increments by 1 until the length of sequence 820 is reduced by 1 (e.g., in...). Figure 8 (The middle part is 8M-1). Sequence 820 can be defined as:

[0065] c(n)=(x1(n+N C )+x2(n+N C ))mod2

[0066] x1(n+31)=(x1(n+3)+x1(n))mod2

[0067] x2(n+31)=(x2(n+3)+x2(n+2)+x2(n+1)+x2(n))mod2

[0068] In the above expression, N C =1600, and the first m-sequence x1(n) can be initialized as x1(0) = 1, and for n = 1, 2, ..., 30, x1(n) = 0. The initial value of the second m-sequence x2(n) can be expressed as C init The value of can be different and can depend on the application of the output sequence. For example, in Figure 8 In the example, C init The value can be the community ID.

[0069] Figure 9 An exemplary scrambling operation 900 according to an embodiment of the present invention is shown. Scrambling operation 900 may correspond to... Figure 6 The second scrambling operation performed by S616 in the example. Figure 6 The polarized encoded PBCH data can be represented as a block of bits b(0),...,b(M) bit -1), where M bitThis represents the number of bits transmitted on each PBCH (the length of the PBCH payload). Bit blocks b(0),...,b(M) can be pre-modulated. bit -1) Scramble the bits to generate scrambled bit blocks. Right now Figure 6 The second scrambled PBCH data in the example is 607. Scrambling can be performed according to the following formula:

[0070]

[0071] Where c(i) is the bit sequence (scrambling sequence), such as a Gold sequence of length 31. The bit sequence (scrambling sequence) can be initialized using each cell ID, for example, at the beginning of each SSB burst set or at the beginning of each SSB (similar to...). Figure 8 The example describes the initialization timing. For an SSB burst set configured with 4 SSBs, v is the two LSBs of each SBI. For an SSB burst set configured with 8 or 64 SSBs, v is the three LSBs of each SBI.

[0072] Figure 10 Example 1000 of initialization for generating a Gold sequence for a second scrambling code is shown according to an embodiment of the present invention. The second scrambling code can be used to scramble polar-coded PBCH data carried in the SSB. As shown, the initial value c can be defined according to the following formula. init_1 :

[0073]

[0074] Where SBI represents the two or three LSBs of the SBI of the SSB. This represents the cell ID of the cell transmitting the PBCH. For PBCH processing of SSB sequences within the SSB burst set, Gold sequence initialization can be performed on each PBCH of the SSB sequence according to the above definition (initialization occurs at or before each second scrambling operation). Conversely, in Figure 8 and Figure 9 In the example, depending on the corresponding configuration, initialization can be performed at the beginning of each SSB burst set or at the beginning of each SSB.

[0075] Figure 11 A PBCH detection process 1100 according to an embodiment of the present invention is shown. Process 1100 may be... Figure 6 The PBCH process in the system is the reverse of process 600. Therefore, process 1100 can be interpreted by comparing it with process 600. Process 1100 can be executed at UE 110. System 100 can be used as an example to interpret process 1100.

[0076] In S1110, PBCH demodulation can be performed based on the received signal carrying SSB 1101. SSB 1101 can have an SBI of #N. SSB 1101 can include PSS, SSS, PBCH, and DMRS. For example, synchronization can be performed first based on PSS and SSS, and the cell ID can be obtained by decoding PSS and SSS. Subsequently, DMRS can be decoded, and the three LSBs of SBI#N can be obtained accordingly. Demodulation of PBCH can then be performed.

[0077] As a result of demodulation, the second scrambled PBCH data 1102 (corresponding to the second scrambled PBCH data 607) can be recovered. Figure 11 In one example, soft bits (e.g., in LLR form) can be calculated based on channel estimation results and the modulation scheme used. In another example, hard bits can be used instead of soft bits for PBCH detection.

[0078] In S1112, the first descrambling operation can be performed (corresponding to the second scrambling operation S616). For example, before the first descrambling operation, using the knowledge of the three LSBs and cell ID of SBI#N, it can be used with... Figure 6 The second scrambling code in 606 (or Figures 8-10 The second scrambling code 1103 is generated in the same manner as the example. Therefore, the second scrambling code 1103 can be the same as the second scrambling code 606. As a result of the first descrambling operation, the polar-coded PBCH data 1104 (corresponding to the polar-coded PBCH data 605) can be recovered. The polar-coded PBCH data 1104 can be a set of soft bits.

[0079] In S1114, polarization decoding can be performed using the polarized PBCH data 1104 as input. Therefore, first scrambled PBCH data 1105 (corresponding to first scrambled PBCH data 603) and CRC 1106 in hard bit form can be generated.

[0080] In S1116, a CRC check can be performed to verify whether the first scrambled PBCH data 1105 has been correctly decoded. If the CRC check fails, process 1100 can proceed to S1117, where PBCH detection can be performed based on soft combinations across SSBs. Otherwise, process 1100 can proceed to S1118.

[0081] In S1118, a second descrambling (corresponding to the first scrambling in S610) can be performed. Specifically, the scrambled PBCH information bits 1107 can be descrambled using the first scrambling code 1108 to generate descrambled PBCH information bits 1109a (corresponding to PBCH information bits 601), wherein the scrambled PBCH information bits 1107 can be a part of the first scrambled PBCH data 1105. The first scrambling code 1108 can be combined with... Figure 6 The first scrambling code 602 is the same as the first scrambling code 602, and can be generated in the same way as the first scrambling code 602.

[0082] For example, in addition to the scrambled PBCH information bits 1107, the first scrambled PBCH data 1105 may also include bit set 1109b: the 2nd / 3rd LSB, C0, and 3 MSBs of the SBI of the SFN (assuming that each SSB burst set has more than 4 SSBs). Bit set 1109b is not scrambled at S610, therefore it can be detected before the second descrambling. Using the knowledge of the 2nd / 3rd LSB of the SFN and the cell ID, the first scrambling code 1108 can be generated.

[0083] Finally, the descrambled PBCH information bits 1109a can be merged with bit set 1109b to form the recovered PBCH information bits 1109. Additionally, de-interleaving can be performed to adjust the order of the recovered PBCH information bits 1109; this step corresponds to... Figure 6 The example shows the interleaving operation performed.

[0084] Figure 12 An exemplary process 1200 is shown, based on soft combining across SSBs 1221-1224 within SSB burst set 1220 for PBCH detection. Process 1200 can be executed at UE 110, and system 100 can be used as an example to explain process 1200. As shown, SSB burst set 1220 can be contained within half-frame 1210. Accordingly, the same PBCH payload can be carried in the PBCH of each SSB 1221-1224.

[0085] UE 110 can first attempt to perform PBCH decoding to obtain system information and timing information via SSB 1222. For example, demodulation 1231 can be performed first to generate scrambled PBCH data 1243 in soft bit form, followed by descrambling operation 1241. Descrambling operation 1241 can be similar to... Figure 11The descrambling operation at S1112 in the example. Specifically, the descrambling code (or scrambling code) 1244 can be determined based on SBI#1 of SSB 1222. Therefore, the soft bits of the descrambled PBCH data 1251 can be obtained and stored in memory.

[0086] When a PBCH decoding fails, UE 110 can begin PBCH detection based on soft combining. Specifically, demodulation 1232 can be performed first to generate scrambled PBCH data 1245 in soft bit form, followed by descrambling operation 1242. Descrambling operation 1242 can be similar to... Figure 11 The descrambling operation at S1112 in the example. Specifically, the descrambling code (scrambling code) 1246 can be determined based on SBI#2 of SSB 1223. Therefore, the soft bits of the descrambled PBCH data 1252 can be obtained.

[0087] Then, UE 110 can perform soft combining 1260 on the two soft bit sets 1251 and 1252 (e.g., by adding the LLRs from the two sets bit by bit) to generate a combined soft bit set 1261. The combined soft bit set 1261 can then be fed to the polar encoder for polar decoding operation 1270. A CRC check can then be used to verify whether the PBCH detection was successful. If the CRC check fails, UE 110 can attempt to obtain a third soft bit set by processing the PBCH of SSB 1224, and combine the three soft bit sets across SSBs to decode the PBCH.

[0088] Figures 13A-13B Simulation results for PBCH processing with different scrambling configurations are shown. Specifically, block error rate (BLER) versus signal noise ratio (SNR) curves (1301-1303, 1311-1313, 1351-1353, and 1361-1363) are shown to compare the performance of PBCH processing and detection using different scrambling operations. As shown in the figure, the second scrambling operation based on cell ID and SBI described in this invention can improve the performance of cross-SSB PBCH detection within an SSB burst set.

[0089] Figures 13A-13B The simulation can be performed under Tapped Delay Line (TDL) mode C, 100ns spread delay, and ideal channel estimation (CE). Figure 13A The simulation assumes that two neighboring cells have zero power offset, while Figure 13B The simulation assumes that the two neighboring cells have a 3dB power offset (the serving cell has a lower transmission power). Figure 13A and Figure 13B The following six tests demonstrate the performance of PBCH processing and detection:

[0090] Test 1: A single detection using the first scrambling based on cell ID and SFN;

[0091] Test 2: A single detection using first scrambling based on cell ID and SFN and second scrambling based on cell ID;

[0092] Test 3: A single detection using first scrambling based on cell ID and SFN and second scrambling based on cell ID and SBI;

[0093] Test 4: Detection using two-shot (soft combination) detection based on the first scrambling of cell ID and SFN;

[0094] Test 5: Detection using two soft combinations of first scrambling based on cell ID and SFN and second scrambling based on cell ID;

[0095] Test 6: Two (soft combination) detections using a first scrambling based on cell ID and SFN and a second scrambling based on cell ID and SBI.

[0096] By Figures 13A-13B Comparing tests 1-3 and 4-6, soft-combination detection demonstrates higher performance than single-detection. In tests 4-6, which correspond to the soft-combination detection scenario, PBCH processing using a second scrambling based on both cell ID and SBI (test 6) shows better performance compared to using only the first scrambling or using only the second scrambling based on cell ID (tests 5 and 4).

[0097] In addition, Figure 13A In the case of PBCH processing (test 6) with a second scrambling based on both cell ID and SBI (with zero power offset between two neighboring cells), compared to PBCH processing using only cell ID based on the second scrambling (test 5), PBCH processing using the second scrambling based on cell ID and SBI shows an approximately 1.5 dB performance improvement. Conversely, when in... Figure 13B When a 3dB power offset exists, the PBCH processing using a second scrambling based on both cell ID and SBI (Test 6) shows an approximately 4dB performance improvement compared to PBCH processing using only cell ID-based second scrambling (Test 5). Accordingly, it can be seen that the second scrambling operation based on cell ID and SBI described in this invention can improve the performance of cross-SSB PBCH detection within an SSB burst set.

[0098] Figure 14 An exemplary apparatus 1400 according to an embodiment of the present invention is shown. Apparatus 1400 can be configured to perform various functions described in one or more embodiments or examples according to the present invention. Therefore, apparatus 1400 can provide means for implementing the techniques, processes, functions, components, and systems described in the present invention. For example, apparatus 1400 can be used to implement the functions of UE 110, BS 120 in various embodiments and examples described in the present invention. In some embodiments, apparatus 1400 may be a general purpose computer, while in other embodiments, apparatus 1400 may be a device including specially designed circuitry for implementing the various functions, components, or processes described in the present invention. Apparatus 1400 may include processing circuitry 1410, memory 1420, and radio frequency (RF) module 1430.

[0099] In various examples, the processing circuitry 1410 may include circuitry configured to perform the functions and processes described in this invention, which may be implemented in conjunction with or without software. In various examples, the processing circuitry may be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a programmable logic device (PLD), a field-programmable gate array (FPGA), digital enhancement circuitry, or equivalent devices or combinations thereof.

[0100] In some other examples, processing circuitry 1410 may be a central processing unit (CPU) for executing program instructions to perform the various functions and processes described in this invention. Accordingly, memory 1420 may be used to store program instructions. When program instructions are executed, processing circuitry 1410 can perform the aforementioned functions and processes. Memory 1420 may also store other programs or data, such as operating systems (OS) and application programs. Memory 1420 may include read-only memory (ROM), random access memory (RAM), flash memory, solid-state memory, hard disk drives, and optical disk drives, etc.

[0101] RF module 1430 receives processed data signals from processing circuitry 1410 and transmits these signals via antenna 1440, and vice versa. RF module 1430 may include a digital-to-analog converter (DAC), an analog-to-digital converter (ADC), a frequency up-converter, a frequency down-converter, filters, and amplifiers for receiving and transmitting operations. In some examples, RF module 1430 may include multi-antenna circuitry (such as an analog signal phase / amplitude control unit) for beamforming operations. Antenna 1440 may include one or more antenna arrays.

[0102] The device 1400 may optionally include other components, such as input and output devices and additional signal processing circuitry. Accordingly, the device 1400 may be capable of performing other additional functions, such as executing application programs and handling additional communication protocols.

[0103] While aspects of the invention have been described in conjunction with specific embodiments, these embodiments are presented by way of example and can be substituted, modified, and altered. Accordingly, the embodiments set forth in this invention are intended to be illustrative and not restrictive. Changes may be made without departing from the scope set forth in the claims.

Claims

1. A method for wireless communication, characterized in that, include: At the base station in the wireless communication system, a subset of physical broadcast channel information bits is scrambled using a first scrambling code to generate first scrambled physical broadcast channel data. The physical broadcast channel data containing the first scrambled physical broadcast channel data is encoded by performing channel coding processing via polar coding to generate encoded physical broadcast channel data, which is carried in a synchronization block associated with a synchronization block index and transmitted from a cell, wherein the cell has a cell identifier. as well as The encoded physical broadcast channel data is subjected to a second scrambling using a second scrambling code to generate second scrambled physical broadcast channel data, wherein the second scrambling code is determined based on the cell identifier and the synchronization signal block index, the synchronization signal block index being indicated by a demodulation reference signal associated with the synchronization signal block, wherein the second scrambling is performed after the first scrambling and the channel coding processing of the subset of the physical broadcast channel information bits.

2. The method for wireless communication as described in claim 1, characterized in that, Also includes: Receive the physical broadcast channel information bits corresponding to the synchronization signal block burst set, wherein the synchronization signal block burst set is contained in a half-frame with a system frame number, the synchronization signal block burst set contains the synchronization signal block with the synchronization signal block index, wherein the first scrambling code is determined based on the cell identifier and the system frame number; as well as Cyclic redundancy check bits are added to the first scrambled physical broadcast channel data to generate the physical broadcast channel data, wherein the physical broadcast channel data is used as input to the channel coding process to generate the encoded physical broadcast channel data.

3. The method for wireless communication as described in claim 1, characterized in that, The second scrambling code is determined based on the least significant set of bits of the cell identifier and the synchronization signal block index.

4. The method for wireless communication as described in claim 3, characterized in that, Also includes: Generate a product containing 2 X A sequence of M bits, where X is the number of least significant bits in the synchronization signal block index, and M is the number of bits in the encoded physical broadcast channel data, the sequence containing 2 X Each non-overlapping portion has M bits; and Use the X least significant bits of the synchronization signal block index to set the 2 X One of the non-overlapping parts is identified as the second scrambling code.

5. The method for wireless communication as described in claim 3, characterized in that, Also includes: The second scrambling is performed on the encoded physical broadcast channel data according to the following formula: Where b(0), ..., b(M) bit -1) is a block of bits in the encoded physical broadcast channel data, and has a length M. bit ; It is the scrambled bit block in the second scrambled physical broadcast channel data, and has a length M. bit ; c(i) is a scrambling sequence, which is initialized using the cell identifier; as well as v is the set of least significant bits of the synchronization signal block index.

6. The method for wireless communication as described in claim 1, characterized in that, The second scrambling code is a portion of a sequence initialized according to the following formula: c init = ((X LSBs of SBI) + 1)·2 10 +(Community ID) Where c init The initial value is represented by X, which is the number of least significant bits in the synchronization signal block index.

7. The method for wireless communication as described in claim 1, characterized in that, The second scrambling code is a portion of a Gold sequence, wherein the Gold sequence is initialized by the cell identifier.

8. The method for wireless communication as described in claim 1, characterized in that, The second scrambling code is part of a sequence that is initialized at the beginning of the synchronization block when or before the second scrambling occurs, or at the beginning of the synchronization block burst set when or before the second scrambling occurs for physical broadcast channel processing of the first synchronization block in the synchronization block burst set.

9. The method for wireless communication as described in claim 1, characterized in that, The channel coding process includes rate matching processing.

10. A method for wireless communication, characterized in that, include: At a user equipment in a wireless communication network, a first synchronization signal block is received from a cell, wherein the first synchronization signal block carries a first physical broadcast channel, the first synchronization signal block is associated with a first synchronization signal block index, and the cell has a cell identifier. The least significant bit set of the first synchronization block index is determined based on the demodulation reference signal in the first synchronization block, wherein the demodulation reference signal indicates the least significant bit set; The first scrambling code is determined based on the cell identifier and the least significant bit set of the first synchronization block index determined according to the demodulation reference signal in the first synchronization block; Demodulation is performed on the first physical broadcast channel to generate first demodulated physical broadcast channel data; Using the first scrambling code determined based on the cell identifier and the least significant bit set of the first synchronization signal block index determined according to the demodulation reference signal, the first demodulated physical broadcast channel data is descrambled to generate the first descrambled physical broadcast channel data. Perform channel decoding processing to decode the first descrambled physical broadcast channel data to generate descrambled physical broadcast channel information bits and cyclic redundancy check bits; as well as When the cyclic redundancy check based on the cyclic redundancy check bit is successful, the descrambled physical broadcast channel information bits are descrambled using a second scrambling code to recover the physical broadcast channel information bits, wherein the first descrambling of the first demodulated physical broadcast channel data is performed before the second descrambling of the descrambled physical broadcast channel information bits and the channel decoding process.

11. The method for wireless communication as described in claim 10, characterized in that, Also includes: When the cyclic redundancy check based on the cyclic redundancy check bits fails A second synchronization signal block is received from the cell, wherein the second synchronization signal block carries a second physical broadcast channel, the second synchronization signal block has a second synchronization signal block index, and the first synchronization signal block and the second synchronization signal block belong to the same set of synchronization signal block bursts; Demodulation is performed on the second physical broadcast channel to generate second demodulated physical broadcast channel data; The second demodulated physical broadcast channel data is descrambled using a third scrambling code to generate the second descrambled physical broadcast channel data, wherein the third scrambling code is determined based on the cell identifier and the second synchronization signal block index; as well as Channel decoding is performed based on a soft combination of the first descrambled physical broadcast channel data and the second descrambled physical broadcast channel data.

12. The method for wireless communication as described in claim 10, characterized in that, Also includes: Receive contains 2 X A sequence of M bits, where X is the number of least significant bits in the first synchronization signal block index, and M is the number of bits in the first demodulated physical broadcast channel data, the sequence containing 2 X Each non-overlapping portion has M bits; and Use the X least significant bits of the first synchronization signal block index to set the 2 X One of the non-overlapping portions is identified as the first scrambling code.

13. The method for wireless communication as described in claim 10, characterized in that, Also includes: The first descrambling is performed on the first demodulated physical broadcast channel data according to the following formula: Where b(0), ..., b(M) bit -1) is a bit block in the demodulated physical broadcast channel data, and has a length M. bit ; It is the descrambled bit block in the first descrambled physical broadcast channel data, and has a length M. bit ; c(i) is a scrambling sequence, which is initialized using the cell identifier; as well as v is the set of least significant bits of the first synchronization signal block index.

14. The method for wireless communication as described in claim 10, characterized in that, The scrambling code is part of a sequence initialized according to the following formula: c init = ((X LSBs of SBI) + 1)·2 10 +(Community ID) Where c init The initial value is represented by X, which is the number of least significant bits in the first synchronization signal block index.

15. The method for wireless communication as described in claim 10, characterized in that, The first scrambling code is a portion of a Gold sequence, wherein the Gold sequence is initialized by the cell identifier.

16. The method for wireless communication as described in claim 10, characterized in that, The scrambling code is part of a sequence that is initialized at the beginning of the first synchronization block when or before the first descrambling occurs, or at the beginning of the synchronization block burst set when or before the descrambling occurs for processing demodulated physical broadcast channel data of the synchronization block, wherein the synchronization block is located at the beginning of the synchronization block burst set.

17. A user equipment for wireless communication, characterized in that, Includes processing circuitry, the processing circuitry being configured to: In a wireless communication network, a first synchronization signal block is received from a cell, wherein the first synchronization signal block carries a first physical broadcast channel, the first synchronization signal block is associated with a first synchronization signal block index, and the cell has a cell identifier; The least significant bit set of the index of the first synchronization signal block is determined based on the demodulation reference signal in the first synchronization signal block, wherein the demodulation reference signal indicates the least significant bit set; The first scrambling code is determined based on the cell identifier and the least significant bit set of the first synchronization block index determined according to the demodulation reference signal in the first synchronization block; The processing circuit demodulates the first physical broadcast channel to generate first demodulated physical broadcast channel data; Using the first scrambling code determined based on the cell identifier and the least significant bit set of the first synchronization signal block index determined according to the demodulation reference signal, the first demodulated physical broadcast channel data is descrambled to generate the first descrambled physical broadcast channel data. Perform channel decoding processing to decode the first descrambled physical broadcast channel data to generate descrambled physical broadcast channel information bits and cyclic redundancy check bits; as well as When the cyclic redundancy check based on the cyclic redundancy check bit is successful, the descrambled physical broadcast channel information bits are descrambled using a second scrambling code to recover the physical broadcast channel information bits, wherein the first descrambling of the first demodulated physical broadcast channel data is performed before the second descrambling of the descrambled physical broadcast channel information bits and the channel decoding process.

18. The user equipment as claimed in claim 17, characterized in that, The processing circuit is further configured to: When the cyclic redundancy check based on the cyclic redundancy check bits fails A second synchronization signal block is received from the cell, wherein the second synchronization signal block carries a second physical broadcast channel, the second synchronization signal block has a second synchronization signal block index, and the first synchronization signal block and the second synchronization signal block belong to the same set of synchronization signal block bursts; Demodulation is performed on the second physical broadcast channel to generate second demodulated physical broadcast channel data; The second demodulated physical broadcast channel data is descrambled using a third scrambling code to generate the second descrambled physical broadcast channel data, wherein the third scrambling code is determined based on the cell identifier and the second synchronization signal block index; as well as Channel decoding is performed based on a soft combination of the first descrambled physical broadcast channel data and the second descrambled physical broadcast channel data.

19. The user equipment as claimed in claim 17, characterized in that, The processing circuit is further configured to: Receive contains 2 X A sequence of M bits, where X is the number of least significant bits in the first synchronization signal block index, and M is the number of bits in the first demodulated physical broadcast channel data, the sequence containing 2 X Each non-overlapping portion has M bits; and Use the X least significant bits of the first synchronization signal block index to set the 2 X One of the non-overlapping portions is identified as the first scrambling code.

20. A storage medium for storing program instructions, characterized in that, When the program instructions are executed by the processing circuit, the processing circuit performs the method for wireless communication as described in any one of claims 1-16.

21. A base station for wireless communication, characterized in that, include: A processing circuit, which, when executing program instructions stored in a storage medium, performs the method for wireless communication as described in any one of claims 1-9.

Images