Blind detection method, device, terminal and storage medium

Abstract

The embodiments of the present disclosure provide a blind detection method, an apparatus, a terminal, and a storage medium. [Solution] Using the system frame number (SFN) information, the physical broadcast channel (PBCH) information received by the synchronization broadcast block (SSB) in the target beam direction in at least one synchronization signal period within one transmission time interval is unmasked to obtain at least one set of unmasking sequences. A merge sequence is determined using the at least one set of unmasking sequences. The decoded result of the merge sequence is checked. If the check is successful, the master information block (MIB) is extracted from the decoded result using the SFN information to complete blind detection of the PBCH information. The difference between the PBCH information received by the same SSB in different synchronization signal periods within one transmission time interval is removed by unmasking, achieving soft merging and improving the signal-to-noise ratio of the information. Furthermore, by merging the PBCH information received by the SSB in the target beam direction in different synchronization signal periods within one transmission time interval, the number of merges and the number of blind detection combinations are reduced, improving the efficiency of blind detection.

Description

[Technical field]

[0001] This disclosure claims priority to a Chinese patent application bearing application number 202010865334.0, filed with the China Intellectual Property Office on August 25, 2020, and entitled "Blind detection method, apparatus, terminal and storage medium," the entire contents of which are incorporated herein by reference.

[0002] FIELD OF THE DISCLOSURE Embodiments of the present disclosure relate to, but are not limited to, wireless communication networks, and in particular to blind detection methods, apparatus, terminals, and storage media. [Background technology]

[0003] In order to operate correctly in a cell, a terminal (User Equipment, UE) must first detect a Physical Broadcast Channel (PBCH) before accessing the cell to obtain the Master Information Block (MIB) of the cell, and then know how the cell is located. In a New Radio (NR) system, the PBCH payload is mapped to a Synchronization Signal / PBCH Block (SSB) by interleaving, scrambling, checking, etc., and then transmitted. The UE can obtain information such as MIB and SSB index by performing blind detection on the PBCH information, and further complete radio frame timing, half frame timing, slot timing, etc.

[0004] In the blind detection process, when different SSB sets and the related information of each SSB in each SSB set are soft-merged, the System Frame Number (SFN) information of different periods is also different, so it cannot be merged efficiently. The soft information obtained by direct merging has a low signal-to-noise ratio, and the number of combinations that need blind detection is too large, the calculation is complex, and the efficiency of blind detection is low. Summary of the Invention [Problem to be solved by the invention]

[0005] The embodiments of the present disclosure provide a blind detection method, an apparatus, a terminal, and a storage medium for improving the signal-to-noise ratio of information merging and the efficiency of blind detection. [Means for solving the problem]

[0006] In one embodiment of the present disclosure, the SFN information is used to unmask physical broadcast channel (PBCH) information received in at least one synchronization signal period within one transmission time interval (TTI) via an SSB, and at least one set of unmasking sequences is obtained. Get determining a merging sequence according to the at least one set of unmasking sequences; checking the decoded result of the merge sequence; and if the checking is successful, Extracting a master information block (MIB) from the decoding result according to SFN information to complete blind detection of PBCH information. the step of checking the decoded result of the merge sequence includes the steps of: decoding a polarity code of the merge sequence to obtain a decoded result; performing a CRC check on the decoded result; and if the CRC check is passed, performing a second check on the decoded result, where the second check is successful if the decoded result satisfies the conditions that bits corresponding to a specific bit in the decoded result are all 0 and the bits of the decoded result are not all 0. A blind detection method is provided.

[0007] In one embodiment of the present disclosure, the SFN information is used to unmask the PBCH information received in at least one synchronization signal period within one transmission time interval via the SSB on the target beam direction, and to obtain at least one set of unmasking sequences. Get a merge module configured to determine a merge sequence according to the at least one set of unmasking sequences; a check module configured to check a decoded result of the merge sequence; and an extraction module configured to extract an MIB from the decoded result according to the SFN information if the check is successful, to complete blind detection for PBCH information. the check module decodes a polarity code of the merge sequence to obtain a decoded result, and performs a CRC check on the decoded result. If the CRC check is passed, a second check is performed on the decoded result. If the decoded result satisfies the following conditions: bits corresponding to a specific bit in the decoded result are all 0, and the bits of the decoded result are not all 0, the second check is successful. A blind detection device is provided.

[0008] One embodiment of the present disclosure further provides a terminal including one or more processors and a storage means for storing one or more programs, the one or more programs being executed by the one or more processors to cause the one or more processors to realize the above-mentioned blind detection method.

[0009] An embodiment of the present disclosure further provides a computer-readable storage medium having stored thereon a computer program that, when executed by a processor, implements the above blind detection method. Effect of the Invention

[0010] The embodiments of the present disclosure provide a blind detection method, an apparatus, a terminal and a storage medium. The method unmasks the PBCH information received by the SSB in the target beam direction in at least one synchronization signal period in one transmission time interval according to the system frame number information, obtains at least one set of unmasking sequences, determines a merge sequence according to the at least one set of unmasking sequences, checks the decoded result of the merge sequence, and if the check is successful, extracts an MIB from the decoded result according to the system frame number information to complete the blind detection of the PBCH information. The difference of the PBCH information received by the same SSB in different synchronization signal periods in one transmission time interval is removed by unmasking, and soft merging is realized to improve the signal-to-noise ratio of the information. And the PBCH information received by the SSB in the target beam direction in multiple synchronization signal periods in one transmission time interval is merged, thereby reducing the number of merges and the number of combinations of blind detection, and improving the efficiency of blind detection. [Brief description of the drawings]

[0011] [Figure 1] 1 is a flowchart of a blind detection method according to one embodiment. [Diagram 2] FIG. 1 is a conceptual diagram of specific bit and SSB mapping according to one embodiment. [Diagram 3] FIG. 2 is a conceptual diagram illustrating a method for generating a mask sequence based on SFN information according to one embodiment. [Figure 4] 4 is a flowchart of a blind detection method according to another embodiment. [Diagram 5] FIG. 2 is a conceptual diagram of an implementation of a blind detection method according to one embodiment. [Figure 6] FIG. 1 is a structural conceptual diagram of a blind detection device according to one embodiment. [Figure 7] FIG. 2 is a structural conceptual diagram of the hardware configuration of a terminal according to one embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0012] Hereinafter, the present disclosure will be described with reference to the drawings and embodiments. It should be understood that the specific embodiments described herein are merely for the purpose of describing the present disclosure and do not limit the present disclosure. It should be noted that the embodiments and features of the embodiments in the present disclosure can be arbitrarily combined with each other unless they are inconsistent. It should also be noted that, for ease of explanation, the drawings show only a part of the configuration related to the present disclosure, rather than all of the configurations.

[0013] In the NR system, each SSB includes a main synchronization signal, a secondary synchronization signal, a PBCH, and a demodulation reference signal (DMRS) corresponding to the PBCH, and corresponds to one beam direction. In each beam direction, the base station transmits multiple SSBs in a synchronization signal period in a beam polling manner, and the multiple SSBs in the synchronization signal period are located in a half radio frame to form an SSB set, and the beam direction of each SSB in an SSB set covers the entire cell. By detecting the main synchronization signal and the secondary synchronization signal, the UE can determine the physical cell indicator and the SSB code boundary directed to the UE beam. Based on this, blind detection is performed for the PBCH information (i.e., for the PBCH). The UE can obtain the MIB, SFN information, half-frame indication, and SSB index by detecting the PBCH to complete the radio frame timing and the half-frame timing. In addition, the UE can determine the time slot and code in which the current synchronization signal exists according to the SSB index and the pattern of the SSB set used by the current band to complete the slot timing.

[0014] The TTI of the PBCH is 80 milliseconds (ms), and the synchronization signal period may be 5 ms, 10 ms, 20 ms, etc., and accordingly, one TTI may include 16, 8, or 4 synchronization signal periods.

[0015] In order to accommodate the high-frequency multi-beam feature of the NR system, one SSB set includes a maximum of Lmax SSBs, where Lmax is related to the magnitude of the carrier frequency. If the carrier frequency is less than 3 GHz, one SSB set includes Lmax=4 SSBs, if the carrier frequency is greater than 3 GHz and less than 6 GHz, one SSB set includes Lmax=8 SSBs, and if the carrier frequency is greater than 6 GHz, one SSB set includes Lmax=64 SSBs. Each SSB is composed of four Orthogonal frequency division multiplexing (OFDM) codes, and each SSB includes one PBCH. Therefore, one TTI may include an equal amount of PBCHs of 16*Lmax, 8*Lmax, or 4*Lmax.

[0016] In a Long Term Evolution (LTE) system, a single received PBCH can be demodulated directly. If the currently received PBCH is successfully demodulated, the PBCH demodulation is terminated; if the currently received PBCH is unsuccessful, the next reception is performed, and the merging of the next received PBCH and the currently received PBCH is attempted. The two received PBCHs may be classified into different TTIs, so they cannot be merged in this case. Therefore, it is necessary to try two kinds of blind detection combinations, i.e., to try one merge or no merge for the two received PBCHs.

[0017] For example, the currently received PBCH is PBCH1, and if the demodulation of PBCH1 fails, the reception of PBCH2 will continue. After receiving PBCH2, because PBCH1 and PBCH2 may belong to different TTIs, it is necessary to merge PBCH1 and PBCH2 or try to demodulate PBCH2 alone, so there are two kinds of blind detection combinations.

[0018] For a PBCH that has been received twice, if demodulation is still unsuccessful after attempting two types of blind detection combinations, continue to receive PBCH3 and attempt to demodulate PBCH3 alone or attempt to merge PBCH3 with at least one of PBCH1 and PBCH2, and the possible blind detection combinations include four: PBCH1 and PBCH3, PBCH2 and PBCH3, PBCH1 and PBCH2 and PBCH3, and PBCH3.

[0019] Similarly, for a PBCH that is received twice, if two types of blind detection combinations are attempted and demodulation is still not successful, continue to receive PBCH4 and attempt to demodulate PBCH4 alone or attempt to merge at least one of PBCH1, PBCH2, and PBCH3 with PBCH4, and the possible blind detection combinations include eight types.

[0020] Meanwhile, in the NR system, the SFN information is different in different periods, the PBCH cannot be effectively merged, the signal-to-noise ratio of the directly merged soft information is low, and the accurate demodulation of the PBCH cannot be guaranteed. In addition, one TTI may contain an equal amount of PBCH such as 16*Lmax, 8*Lmax or 4*Lmax, which requires too many combinations of blind detection, resulting in high computational complexity, low blind detection efficiency, and high PBCH demodulation complexity of the terminal.

[0021] In the initial access process, the UE assumes that the period of the synchronization signal is 20 ms, and unless otherwise specified, the embodiments of the present disclosure will describe the blind detection process of PBCH information using the case of 20 ms (i.e., one TTI includes four synchronization signal periods, or a PBCH equivalent to 4*Lmax) as an example.

[0022] In the embodiment of the present disclosure, a blind detection method is provided, which can remove the difference between the PBCH information received in different synchronization signal periods by SSBs through unmasking, and realize soft merging to improve the signal-to-noise ratio of information. And, by merging the PBCH information received by the SSBs on the target beam direction in multiple synchronization signal periods within one transmission time interval, the number of merging times and the number of combinations of blind detection can be reduced, and the efficiency of blind detection can be improved.

[0023] 1 is a flowchart of a blind detection method according to an embodiment. The method is applicable to a terminal. As shown in FIG. 1, the method according to the embodiment includes steps 110 to 140.

[0024] In step 110, the PBCH information received in at least one synchronization signal period within one transmission time interval via the SSB on the target beam direction is unmasked using the SFN information to obtain at least one set of unmasking sequences.

[0025] In step 120, a merging sequence is determined from the at least one set of unmasking sequences.

[0026] In this embodiment, within one TTI of the PBCH, the PBCH information received by the SSB in the target beam direction (i.e., the beam direction directed to the UE) in at least one synchronization signal period is unmasked based on the SFN information to eliminate the difference in the SFN information, that is, the different bits of each SFN information are matched to obtain a set of unmasking sequences for the SSB, so as to maintain the consistency of the PBCH information received by the SSB in different synchronization signal periods, and establish the basis for realizing soft merging.

[0027] In step 130, the decoded result of the merge sequence is examined.

[0028] In step 140, if the check is successful, extract the MIB from the decoded result according to the SFN information to complete blind detection for the PBCH information.

[0029] In this embodiment, the unmasking sequence of the SSB directed to the beam direction of the UE is soft-merged within one TTI, and then polar code (Polar) decoding and checking are performed on the merged sequence. If the checking is successful, it is determined that the PBCH detection is successful. The decoded result obtained by decoding the polar code on the merged sequence does not include the difference information of the SFN information in different synchronization signal periods of the SSB, so that accurate MIB information cannot be extracted, and the radio frame timing and half frame timing cannot be completed. In this embodiment, in the MIB information extraction process, the information on the SFN information removed during the unmasking process is taken into account, so that accurate and complete decoded results can be obtained, and accurate MIB messages can be extracted to complete the blind detection of PBCH information.

[0030] It should be noted that the merged sequence may be obtained by merging multiple sets of decoded unmasking sequences, or may be composed of one set of unmasking sequences. For example, the first set of unmasking sequences obtained within the first synchronization signal period of one TTI may be directly used as the merged sequence. In the initial synchronization process, the UE does not know which of the beam directions directed to the UE is the SSB, that is, it does not know the index of the SSB of the beam direction directed to the UE. Therefore, it is necessary to traverse the index of the SSB, and perform unmasking, decoding and checking for each SSB until the checking is successful, to determine the SSB.

[0031] In one embodiment, step 110 further includes:

[0032] In step 1110, J sets of mask sequences based on the SFN information are generated according to the TTI and the synchronization signal period, where J is a positive integer.

[0033] Step 1120: determine L candidate SSB indexes according to the low 3 bits of the SSB index, or determine L candidate SSB indexes according to the low 2 bits of the SSB index and the half-frame indication bit, where L is a positive integer, and each candidate SSB index corresponds to one PBCH demodulation reference signal DMRS sequence and one secondary scrambling sequence.

[0034] Step 1130, for each candidate SSB index, a set of Log-Likelihood Ratio (LLR) sequences is calculated.

[0035] Step 1140 unmasks the LLR sequence with a set of J mask sequences, respectively, to obtain a set of J unmasked sequences until the test is successful.

[0036] In this embodiment, the number of mask sequences is J, and J is equal to the number of synchronization signal periods included in the TTI, for example, when the synchronization signal period is 20 ms, J = 80 / 20 = 4. Each SSB candidate index corresponds to a set of LLR sequences, and the LLR sequences are obtained by performing channel estimation on the PBCH according to the DMRS sequence generated by the SSB candidate index, and performing equalization, demodulation, secondary descrambling and rate dematching on the channel estimation result, and the LLR sequences can be used for soft merging after being unmasked.

[0037] In this embodiment, if the number of candidate SSB indexes is denoted as L, the number of groups of the LLR sequence is also L.

[0038] L can be determined from a specific bit in the SFN information. For example, the initialization of the PBCH DMRS sequence is related to the low 3 bits of the SSB index, or related to the low 2 bits of the SSB index and the half frame indication (a total of 3 bits, represented as 3 bits). Thus, by traversing the corresponding 3-bit values, the number of SSBs can be set to L=2. 3 It can be determined that L=8. For each SSB, channel estimation is performed on the PBCH by the corresponding DMRS sequence to obtain the signal at the subcarrier position, and the signal is equalized and demodulated to obtain L sets of initial sequences (length is 864). Then, for each set of initial sequences, secondary descrambling and rate matching are performed by using the corresponding secondary scrambling sequence to obtain the corresponding LLR sequence (length is 512). In this embodiment, the low 3 bits of the SSB index and the bit of the half frame indication can take values ​​of 0 or 1, so the number of candidate SSB indexes in each synchronization signal period is L=8.

[0039] The LLR sequences are unmasked with the J sets of mask sequences, respectively, to obtain L*J sets of unmasked sequences.

[0040] It should be noted that this embodiment does not limit the execution order of step 1110 and step 1130. Also, if the check is successful, and the first SSB index corresponds to the j-th set of masked sequences, the remaining SSB indexes can be decoded and extracted based on the SFN information without unmasking.

[0041] In the following embodiments, for simplicity, the SFN information (total of 10 bits) is expressed as (s9, ..., s0) from high to low, the 1 bit of the half frame indication is c0, and the 6 bits of the SSB index are expressed as (b5, ..., b0) from high to low.

[0042] Figure 2 is a conceptual diagram of specific bits and SSB mapping according to one embodiment. In an NR system, a cell transmits system information to all UEs in the cell through logical channels, and the logical channel Broadcast Control Channel (BCCH) is mapped to the transport channel Broadcast Channel (BCH) and Downlink Shared Channel (DL-SCH). As shown in Figure 2, the PBCH payload is composed of BCCH-BCH information (32 bits) and information-related PBCH parameters (8 bits), totaling 32 bits, among which the time-related PBCH parameters include low 4 bits (s3, s2, s1 and s0) of SFN information, 1 bit half-frame indication (c0), and high 3 bits (b5, b4 and b3) of SSB index. The 32-bit PBCH payload undergoes interleaving, primary scrambling, cyclic redundancy check (CRC) with 24 bits added, polarity code encoding (512 bits), rate matching (864 bits), second stage scrambling, and quadrature phase shift keying (QPSK) modulation (432 codes), and is then resource mapped (576 codes) to the SSB together with the corresponding DMRS (144 codes) for transmission. Among them, each SSB has different low 3 bits of the corresponding SFN information in different synchronization signal periods, or the low 2 bits of the corresponding SFN information are different from the half frame indication. By unmasking based on SFN information, it is possible to eliminate the difference between SFN information (or SFN information and half-frame indication) in the soft merging process, and after decoding and inspection are completed, in the MIB extraction process, the SFN information (or SFN information and half-frame indication) of SSBs in different synchronization signal periods aimed at the UE beam is retrieved again to extract the accurate MIB message.

[0043] In one embodiment, step 1110 includes: generating a bit sequence according to each of the low 3 bits of SFN information and the specific bit belonging to the half-frame indication bit; The method further includes performing primary scrambling, cyclic redundancy check code (CRC) appending, and polarity code encoding on each of the bit sequences to obtain a corresponding set of J mask sequences.

[0044] In this embodiment, the specific bits are used to generate J sets of mask sequences based on SFN information to unmask the LLR sequences of the L candidate SSB indexes. The specific bits are denoted as (k3, k2, k1, k0).

[0045] When the synchronization signal period is 5 ms, on different synchronization signal periods within one TTI, the SFN information among the MIB information in the same SSB has different low 3 bits and half-frame indication, and these 4 bits require special processing. These 4 bits are expressed as special bits (k3, k2, k1, k0) = (s2, s1, s0, c0).

[0046] When the synchronization signal period is 10 ms, on different synchronization signal periods within one TTI, the SFN information among the MIB information in the same SSB has different low 3 bits and half-frame indication, and the specific bits are expressed as (k3, k2, k1, k0) = (s2, s1, s0, 0), among which, the half-frame indication bits are the same, so the half-frame indication bits can be expressed as 0, indicating that there is no difference.

[0047] When the synchronization signal period is 20 ms, only the second and third least significant bits (LSBs) of the SFN information in the MIB information in the same SSB are different on different synchronization signal periods within one TTI, but the half-frame indication is the same. The specific bits are expressed as (k3, k2, k1, k0) = (s2, s1, 0, 0), and since the first bit of the LSB and the bit of the half-frame indication are the same, they can be expressed as 0, indicating that there is no difference.

[0048] When the synchronization signal period is 40 ms, only the third LSB of the SFN information in the MIB information in the same SSB differs on different synchronization signal periods within one TTI, and is expressed as (k3, k2, k1, k0) = (s2, 0, 0, 0). Of these, the first and second LSB bits and the half-frame indication bit are identical, so the first and second LSB bits and the half-frame indication bit can be expressed as 0, indicating that there is no difference.

[0049] When the synchronization signal period is 80 ms or 160 ms, soft merging cannot be performed and there is no need to generate a mask sequence.

[0050] FIG. 3 is a conceptual diagram showing a method for generating a mask sequence based on SFN information according to one embodiment. In this embodiment, the bit sequence that generates 32 bits by (k3, k2, k1, k0) is a0, a1, ... a31. As shown in FIG. 3, the bit sequence and the specific bit have the following mapping relationship. That is, a0=k0, a6=k3, a7=k1, a24=k2. The other bits of the bit sequence are set to 0. The bit sequence a0, a1, ... a31 is subjected to primary scrambling. A CRC is added to the bit sequence after the primary scrambling, and then a mask sequence is generated by performing polar encoding. For example, when the synchronization signal period is 20 ms, there are a total of four types of traverse (k3, k2, k1, k0), and J=4 sets of mask sequences can be generated. The length of the mask sequence is N=512. The mask sequence is

[0051]

number

[0052] where N=512, j=0:J-1.

[0053] In one embodiment, the blind detection method comprises: step 1112, generating one PBCH DMRS sequence according to each of the low 3 bits of the SSB index, or generating one PBCH DMRS sequence according to each of the low 2 bits of the SSB index and the half-frame indication bit, to obtain L PBCH DMRS sequences; and generating L secondary scrambling sequences according to respective values ​​of the low 3 bits of the SSB index or respective values ​​of the low 2 bits of the SSB index.

[0054] In this embodiment, each candidate SSB index corresponds to one PBCH DMRS sequence and one secondary scrambling sequence, and for the L candidate SSB indexes, the L PBCH DMRS sequences can be obtained by using the low three bits of the SSB index (total L=8 possible values) or the low two bits of the SSB index and the half-field indication bit (total L=8 possible values). Also, the low three bits of the SSB index (total L=8 possible values) or the low two bits of the SSB index (total 4 possible values) are used to generate L secondary scrambling sequences, which are used to calculate a set of LLR sequences for each SSB candidate index, respectively. In one embodiment, step 1120 includes: performing channel estimation and demodulation on PBCH subcarrier positions corresponding to SSBs in a target beam direction using PBCH DMRS sequences corresponding to each candidate SSB index to obtain initial sequences corresponding to each candidate SSB index; The method further includes performing secondary descrambling and rate dematching on the initial sequence using a secondary scrambling sequence corresponding to each candidate SSB index to obtain an LLR sequence corresponding to each candidate SSB index.

[0055] In this embodiment, L=8 candidate SSB indexes are traversed, and for each candidate SSB index, the corresponding PBCH DMRS sequence is used to perform channel estimation and demodulation on the signal at the subcarrier position of the PBCH, to obtain L sets of initial sequences, and the corresponding secondary scrambling sequence is used to perform secondary descrambling and rate dematching to obtain a set of LLR sequences corresponding to each candidate SSB sequence. Wherein, the initialization of the PBCH DMRS sequence is related to the low 3 bits of the SSB index, or related to the low 2 bits of the SSB index and 1 bit of the half frame indication. The UE needs to generate L=8 PBCH DMRS sequences to perform channel estimation for the PBCH. The 8 channel estimation results are respectively equalized and demodulated to obtain L=8 sets of initial sequences, and further L=8 secondary scrambling sequences are further generated to perform secondary descrambling and rate dematching on each initial sequence. Thus, L LLR sequences are obtained, and the LLR sequences are the sequences that need to be unmasked. Wherein, the secondary scrambling sequence of the PBCH is related to the low 3 bits of the SSB index or related to the low 2 bits of the SSB index. Based on this, in step 1120 of this embodiment, the UE performs secondary descrambling on each set of initial sequences, and obtains L sets of LLR sequences after de-rate matching;

[0056]

number

[0057] It is written as follows.

[0058] In one embodiment, the blind detection method step 1130 includes: Using each set of mask sequences, each set of LLR sequences is Exclusive OR withThe method includes the step of performing a computation to obtain J sets of unmasked sequences.

[0059] In this embodiment, in order to merge LLR sequences of different synchronization signal periods within one TTI, it is necessary to invert the LLR sequences to eliminate the influence of the difference in SFN information, and the L sets of LLR sequences (i.e., the L sets of LLR sequences) are unmasked using J sets of mask sequences based on the generated SFN information. For the nth (n=1:J) synchronization signal period, the unmasking process is as follows:

[0060]

number

[0061] which gives us L*J sets of unmasking sequences.

[0062] In one embodiment, step 120 includes: The method further includes adding, within one TTI, J sets of unmasking sequences corresponding to each candidate SSB index within each synchronization signal period to the current LLR cache data.

[0063] In this embodiment, for the L*J sets of unmasking sequences, the current LLR cache data (LLR_Buffer l,j , l=0:L-1, j=0:J-1) within the same TTI, the L*J set of unmasking sequences is cumulatively merged with the current LLR cache data, and the merged L*J set of LLRs is stored as a new LLR_Buffer l,j It can be stored as:

[0064] In one embodiment, step 120 includes: If the nth synchronization signal period belongs to the next transmission time interval, the method further includes updating the current LLR cache data to J sets of unmasking sequences corresponding to each candidate SSB index in the synchronization signal period.

[0065] In this embodiment, for the L*J sets of unmasking sequences, the current LLR cache data (LLR_Buffer l,j , l=0:L-1, j=0:J-1), that is, the nth synchronization signal period satisfies (n-1+j)%J=0 (where "%" represents a patterning operation). In this case, the current LLR cache data is directly replaced with and stored as the L*J set of unmasking sequences, and can be used as the current LLR cache data of the next TTI for merging the unmasking sequences calculated in the next TTI.

[0066] In one embodiment, step 130 further includes the following steps.

[0067] Step 1310: Decode the polarity code of the merge sequence to obtain a decoding result.

[0068] Step 1320, perform a cyclic redundancy check (CRC) on the decoded result.

[0069] Step 1330: if the CRC check passes, a secondary check is performed on the decoded result.

[0070] In this embodiment, the result of merging L*J sets of unmasking sequences with the current LLR cache data is polar decoded, and a secondary check is performed on the decoded results to avoid erroneous checks and improve the reliability of blind detection.

[0071] Specifically, a CRC check and a secondary check are performed on the decoded result. For example, a CRC check is performed first. If the CRC check is successful, a secondary check is performed again. If the secondary check is also successful, it indicates that the PBCH blind detection is successful, and the MIB can be extracted. If any one of the checks is unsuccessful, it indicates that the PBCH blind detection is unsuccessful, and detection continues for the next synchronization signal period. The unmasking, soft merging, and decoding processes in the above embodiment are repeated until the two types of checks on the decoded result are successful. Among them, the secondary check is set by the exclusive operation of the unmasking process, and passes the check only if the bit sequence in the decoded result is consistent with the result of the exclusive operation of the unmasking process.

[0072] In one embodiment, the second check is successful if the decoded result satisfies the following conditions: bits in the decoded result corresponding to a specific bit are all 0, and the bits in the decoded result are not all 0.

[0073] In this embodiment, the secondary check is based on the principle that if certain bits (belonging to the SFN information low 3 bits and the half-frame indication) match the corresponding bits in the bit sequence used to generate the mask sequence, then these corresponding bits should be 0 in the decoded result because an exclusive operation is used in the unmasking process.

[0074] Specifically, 24 bits of the decoded result are CRC and are used for the CRC check. The sequence consisting of the remaining bits after the CRC check is removed is denoted as p0, p1, ..., p31. For example, if the synchronization signal period is 20 ms, then if (p6, p24) = (s2, s1) = (0, 0) is satisfied and all bits other than p6 and p24 are not 0 (i.e., all bits of the decoded result are not 0), then the secondary check is successful.

[0075] Similarly, if the synchronization signal period is 5 ms, the secondary check is successful if (p0, p6, p7, p24) = (c0, s2, s0, s1) = (0, 0, 0, 0) is satisfied and all bits other than p0, p6, p7, and p24 are not 0 (i.e., the bits of the decoded result are not all 0).

[0076] If the synchronization signal period is 10 ms, the secondary check is successful if (p6, p7, p24) = (s2, s0, s1) = (0, 0, 0) is satisfied and all bits other than p6, p7, and p24 are not 0 (i.e., the bits of the decoded result are not all 0).

[0077] When the synchronization signal period is 40 ms, if p6=s2=0 is satisfied and all bits other than p6 are not 0 (that is, all bits in the decoded result are not 0), the second check is successful.

[0078] When the synchronization signal period is 80 ms and 160 ms, the unmasking operation is not performed, so there is no need to perform a secondary check on the decoded result.

[0079] To take the test process as an example, in an NR system, the TTI is 80 ms, the synchronization signal period is 10 ms, a maximum of J=8 merges are required within one TTI, and one SSB set includes Lmax=4 SSBs. When the j=5th mask sequence is used for the SSB index l=2 in the n=6th synchronization signal period, the test is successful, and the sequence of bits excluding the CRC from the decoded result is p0, p1, ..., p31.

[0080] Since the sync signal period is 10 ms, only the LSB low 3 bits (s2, s1, s0) of the SFN information are different among the MIB information in the same SSB on different sync signal periods. The 3-bit SFN information index (s2, s1, s0) used to generate the 32-bit mask sequence has a total of 8 possible values, which are 000, 001, 010, 011, 100, 101, 110, 111, and are represented in order as d jThis is written as (j=0:7).

[0081] For the n=6 synchronization signal periods, the decoded result of the j=5th set of mask sequences is the mask sequence d (n-1+j)%J Corresponding to the situation of (s2,s1,s0)=010, the unmasking operation inverts and deletes these 3 bits, so the UE needs to judge whether the corresponding 3 bits in the decoded result are 0 or not, that is, the condition for the second check to be successful is that p0,p1,...,p31 are not all 0, and p6=0, p7=0, and p24=0, otherwise, the second check fails.

[0082] In one embodiment, step 140 includes: Step 1410, complementing the SFN information in the decoded result; Step 1420 further includes extracting the MIB from the completed decoded result.

[0083] In this embodiment, since the SFN information is removed in the unmasking process, the SFN information bits used in the mask sequence process are complemented and generated for the decoded result of successful PBCH detection. Based on this, accurate SFN information can be obtained, MIB can be accurately extracted, and the radio frame timing, half frame timing, slot timing, etc. can be completed, thereby completing the blind detection of PBCH information.

[0084] In one embodiment, step 1410 includes: The method further includes a step of assigning a value of a particular bit corresponding to the nth synchronization signal period and the jth set of mask sequences to a corresponding bit of the decoded result, where n is an index of the corresponding synchronization signal period that is successfully checked, and j is an index of the corresponding mask sequence that is successfully checked.

[0085] In this embodiment, for a successfully decoded result, the sequence consisting of bits excluding the CRC check is represented as p0, p1, ..., p31, and the specific bits used to generate the mask sequence can be determined by the synchronization signal period. For example, when the synchronization signal period is 20 ms, the specific bits for generating a 32-bit mask sequence are (s2, s1) of the SFN information, and a total of 2 2 = 4 possible values: 00, 01, 10, 11. The four generated mask sequences are j (j=0:3). When PBCH detection is successful, the corresponding nth synchronization signal period and the jth mask sequence are the same. In this case, the mask sequence d (n-1+j)%J When unmasking is performed using d (n-1+j)%J The (s2, s1) corresponding to p0, p1, . . . , p31 can be further complemented to the corresponding bits p6=s2, p24=s1 in the decoded result, that is, the MIB can be further extracted for p0, p1, . . . , p31.

[0086] Similarly, if the synchronization signal period is 10 ms, the specific bits are (s2, s1, s0), for a total of 2 3 = 8 possible values. The 8 generated mask sequences are sequentially j (j=0:7), and when PBCH detection is successful, the nth synchronization signal period corresponds to the jth mask sequence. In this case, the mask sequence d (n-1+j)%J When unmasking is performed using d (n-1+j)%J The (s2, s1, s0) corresponding to p6=s2, p7=s0, and p24=s1 in the decoded result are complemented, that is, the MIB can be further extracted for p0, p1, . . . , p31.

[0087] If the synchronization signal period is 5 ms, the specific bits are (s2, s1, s0, c0), for a total of 2 4 = 16. The 16 mask sequences are generated in order as d j (j=0:15). When PBCH detection is successful, the corresponding nth synchronization signal period and the jth mask sequence are the mask sequence d(n-1+j)%J When unmasking is performed using d (n-1+j)%J The corresponding (s2, s1, s0, c0) values ​​are complemented to the corresponding bits p0=c0, p6=s2, p7=s0, p24=s1 in the decoded result, that is, the MIB can be further extracted for p0, p1, ..., p31.

[0088] When the sync signal period is 40 ms, the specific bit is s2, and there are two possible values ​​in total. The two sets of mask sequences generated are d j (j=0:1), and when PBCH detection is successful, it corresponds to the nth synchronization signal period and the jth mask sequence. In this case, the mask sequence d (n-1+j)%J When unmasking is performed using d (n-1+j)%J The corresponding bit p6=s2 in the decoded result is complemented with the corresponding value of (s2, s1, s0, c0), that is, the MIB can be further extracted for p0, p1, . . . , p31.

[0089] When the synchronization signal period is 80 ms or 160 ms, no unmasking operation is performed, and there is no need to perform complementation, and the MIB can be extracted directly from the decoded result.

[0090] The complementation process will be explained with an example. In the NR system, the TTI is 80 ms and the synchronization signal period is 5 ms. A maximum of J=16 merges are required within one TTI. One SSB set contains 64 SSBs. In the n=10th synchronization signal period, when the j=13th mask sequence is used for SSB index l=6, the check is successful, and the sequence of bits excluding the CRC in the decoded result is p0, p1, ..., p31.

[0091] Since the sync signal period is 5 ms, the SFN information in the MIB information in the same SSB on different sync signal periods has different LSB low 3 bits (s2, s1, s0) and half frame indication (c0). The 3-bit SFN information index and half frame indication (s2, s1, s0, c0) used to generate the 32-bit mask sequence have a total of 16 possible values: 0000, 0001, 0010, 0011, 0100, 0101, 0110, 0111, 1000, 1001, 1010, 1011, 1100, 1101, 1110, 1111, and d j This is written as (j=0:15).

[0092] For the n=10 synchronization signal periods, the decoded result of the j=13th set of mask sequences is the mask sequence d (n-1+j)%J In order to invert and remove these 4 bits by the unmasking operation according to the situation of (s2,s1,s0,c0)=0110, the UE needs to complement these 4 bits corresponding to the decoded result. In other words, the values ​​p0=c0=0, p6=s2=0, p7=s0=1, p24=s1=1 are assigned to the bits corresponding to the specific bits in the decoded result, and then the MIB message is extracted for p0, p1, ..., p31 to which values ​​have been assigned.

[0093] Figure 4 is a flow chart of a blind detection method according to another embodiment. This embodiment describes an example of performing blind detection for all synchronization signal periods in one TTI. When the SSB on the target beam direction in each synchronization signal period in one TTI traverses each candidate SSB index, after traversing and unmasking each mask sequence under each candidate SSB index, if the PBCH detection is still not successful, continue to receive PBCH information and move to blind detection in the next TTI. As shown in Figure 4, the blind detection method includes the following steps:

[0094] Step 201, traverse the indexes of L=8 SSBs, demodulate the SSBs in the target beam direction, and obtain L sets of initial sequences.

[0095] In step 202, the L sets of initial sequences are subjected to secondary descrambling and rate dematching to obtain L sets of LLR sequences.

[0096] Step 203: Traverse the values ​​of specific bits according to the TTI and the synchronization signal period to generate J sets of mask sequences based on the SFN information.

[0097] Step 204: Unmask the L LLR sequences using the J masked sequences based on the SFN information, respectively, to obtain L*J unmasked sequences.

[0098] Step 205, determine whether the current synchronization signal period is in the same TTI as the current LLR cache data; if so, execute step 206; if not, execute step 212.

[0099] In one embodiment, step 205 specifically determines whether the current synchronization signal period n satisfies (n-1+j)%J=0; if not, execute step 206; if yes, execute step 212, and no merging is required.

[0100] Step 206: merge the L*J set of unmasked sequences with the current LLR cache data, and store the merged L*J set of unmasked sequences as new LLR cache data.

[0101] In step 207, decoding is performed on the LLR cache data (ie, the L*J sets of unmasked sequences after merging in step 206, or the L*J sets of unmasked sequences replaced in step 212).

[0102] Step 208: perform CRC check and secondary check on the decoded result.

[0103] Step 209, whether the CRC check and the secondary check were successful? If so, execute step 210; if not, execute step 213.

[0104] In step 210, the value of a particular bit corresponding to the successfully checked mask sequence is assigned to a bit corresponding to the decoded result, thereby completing the SFN information in the decoded result.

[0105] Step 211: extract the MIB from the decoding result supplemented with the SFN information, and complete the blind detection of the PBCH information.

[0106] Step 212: replace the current LLR cache data with the L*J set of unmasking sequences, and store the L*J set of unmasking sequences as new LLR cache data (corresponding to the next TTI).

[0107] Step 213: The PBCH information of the next synchronization signal period is continuously received, and steps 201 to 211 are repeatedly executed.

[0108] In step 208, a CRC check and a secondary check are performed on the decoded result. If both checks are successful, it indicates that the PBCH detection is successful. If any one check fails, blind detection is performed based on the next set of mask sequences (j=j+1, j≦J) or SSB indices (l=l+1, l≦L). If none of the PBCHs are successfully detected after traversing the L*J sets of decoded results, the process moves to the next synchronization signal period (n=n+1, n≦J) for blind detection. If the PBCH is still not successfully detected after moving to the 2*J synchronization signal periods, it indicates that the PBCH detection is unsuccessful.

[0109] In the blind detection method of the above embodiment, within one TTI, the SSBs directed to the UE beam demodulate the PBCH information received at different synchronization signal periods to obtain the LLR sequence, and then perform unmasking and merging to remove the difference in SFN information and improve the signal-to-noise ratio of the PBCH demodulation. Since it is only necessary to traverse the indexes of 8 SSBs and traverse a maximum of 16 combinations of SFN information for each SSB, a maximum of 128 blind detection combinations are performed, and there is no need to perform soft merging for different SSB sets and each SSB in each SSB set, so the number of blind detection combinations is reduced, the complexity of PBCH demodulation is reduced, and the efficiency of blind detection is improved. In addition, in addition to CRC checking the decoded result for the unmasking operation, a secondary check is also performed, and if both types of checks are successful, it is determined that the PBCH detection is successful, thereby reducing the probability of PBCH false detection and improving the reliability of blind detection.

[0110] Figure 5 is a conceptual diagram of the implementation of the blind detection method according to one embodiment. This embodiment describes a blind detection scenario in which each mask sequence is used for unmasking for each synchronization signal period and each candidate SSB index in one TTI. When unmasking is performed using the jth mask sequence in the nth synchronization signal period and the lth candidate SSB index, if the check is successful, the PBCH detection is successful; otherwise, it is necessary to traverse the above three parameters until the PBCH detection is successful or move to blind detection in the next TTI. As shown in Figure 5, the implementation process of the blind detection method is performed as follows:

[0111] First, extract the PBCH subcarrier received signal for the nth synchronization signal period, and traverse the SSB index (l=0:L-1) to the subcarrier position where the signal exists. L=8 PBCH DMRSs are generated to perform PBCH channel estimation, equalization and demodulation, and obtain L=8 initial sequences, the length of which is 864.

[0112] Then, traverse the SSB index (l=0:L-1). L=8 second-stage scrambling codes are generated for secondary scrambling and rate matching on the initial sequence to obtain L=8 LLR sequences, with a length of 512.

[0113] Furthermore, from the generated J sets of mask sequences (each having a length of 512), a (n-1+j)%J set of mask sequences is selected to perform unmasking on the LLR sequence to obtain at least one set of unmasked sequences, each having a length of 512.

[0114] Then, we perform merging on the unmasking sequence to obtain a merged sequence, which has length 512.

[0115] Then, Polar encoding is performed on the merge sequence to obtain the decoded result, which has a length of 56.

[0116] After that, the decoded result is subjected to CRC check and secondary check. If all checks pass, the PBCH detection is successful, and the SFN information can be complemented in the decoded result and the MIB can be extracted. If neither check passes, the unmasking, merging, decoding and checking operations are performed by traversing each set of mask sequences first until the PBCH detection is successful.

[0117] If the J sets of mask sequences are traversed and PBCH detection is still not successful, then L candidate SSB indices are traversed to generate corresponding LLR sequences by demodulation, secondary descrambling and rate dematching, and unmasking, merging, decoding and checking operations are performed on the LLR sequences using the J sets of mask sequences until PBCH detection is successful.

[0118] If the PBCH detection is still not successful after traversing the J sets of mask sequences and the L candidate SSB indexes, the next synchronization signal period is entered and the PBCH subcarrier received signal is extracted again. All the above operations are repeated until the PBCH detection is successful.

[0119] If 2*J synchronization signal periods have been traversed and PBCH detection is still unsuccessful, it is determined that PBCH detection for the current TTI has failed.

[0120] Hereinafter, a process of implementing the blind detection method will be described according to an embodiment.

[0121] In the NR system, the TTI is 80 ms, the synchronization signal period during initial cell access is 20 ms, and one SSB set includes eight SSBs (Lmax=8).

[0122] Before PBCH demodulation, the physical cell indicator and the code boundary of the SSB aimed at the UE beam can be determined by detecting the main synchronization signal and the secondary synchronization signal. The index of the SSB is that the UE does not know the SSB index during the initial synchronization process, and it is necessary to traverse the SSB index (l=0:7) starting from 0. A maximum of J=4 merges are required in one TTI. For the MIB information in the same SSB on different cycles, the SFN information only has different 2 bits and 3 bits of the LSB, which are denoted as (s2,s1). Since the PBCH TTI boundary is unknown, each merge needs to traverse a specific bit, that is, there are a total of four possible values ​​for all (s2,s1). First, initialize n=1, and the current LLR cache data

[0123]

number

[0124] Clear.

[0125] 1) Mask sequence generation: A 32-bit sequence a = a0, a1, ..., a31 is generated by (s2, s1), of which a6 = s2, a24 = s1, and all other bits are set to 0. After primary scrambling, 24-bit CRC addition, and polar coding are performed on sequence a, a mask sequence d = d0, d1, ..., d511 is generated. For (s2, s1), there are a total of four possible values ​​00, 01, 10, and 11, and four sets of mask sequences can be generated, in order of d. j This is written as (j=0:3).

[0126] 2) Set l=0.

[0127] 3) Generate a local PBCH DMRS sequence and a secondary scrambling sequence according to SSB index l, and perform channel estimation, equalization, and demodulation of the PBCH signal on the SSB that receives the nth synchronization signal period to obtain an initial sequence of length 864. Then, perform secondary descrambling and rate dematching on the initial sequence to obtain an LLR sequence of length 512, denoted as r=r0,r1,……,r511.

[0128] 4) Set j=0.

[0129] 5) Mask sequence d (n-1+j)%J , respectively, to unmask the LLR sequence obtained from the SSB index l, and obtain a new unmasked sequence r j and the unmasking process is

[0130]

number

[0131] It can be written as:

[0132] 6) Unmasking sequence j and the current LLR cache data for the calculated SSB index l (already in LLR_Bufferl,j Add it to the stored (in [specific storage]) to obtain new LLR cache data, i.e., the merge sequence. When n satisfies (n - 1 + j)%J = 0, skip this merge operation and the unmasking sequence r j is directly stored in the LLR_Buffer l,j .

[0133] 7) Perform Polar decoding on the merge sequence to obtain the decoding result.

[0134] 8) Perform CRC check and secondary check on the decoding result. If both checks are successful, it indicates that PBCH detection is successful. If the check fails, j = j + 1 (traverse the next mask sequence).

[0135] When j < J, repeat steps 5) to 8). When j = J, l = l + 1 (traverse the next SSB index).

[0136] When l < L, repeat steps 3) to 8). When l = L, n = n + 1 (shift to the next synchronization signal period).

[0137] When n < 2*J, repeat steps 2) to 8). When n = 2*J, it indicates that PBCH detection has failed for the current TTI.

[0138] The blind detection process of this embodiment has a maximum merge count of 4 times. After merging, the signal-to-noise ratio can be increased by 6 dB. It is necessary to perform a maximum of 32 combinations of blind detections, significantly reducing the complexity of PBCH demodulation.

[0139] The embodiments of the present disclosure further provide a blind detection device. FIG. 6 is a structural conceptual diagram of a blind detection device according to one embodiment. As shown in FIG. 6, the blind detection device includes an unmasking module 310, a merge module 320, an inspection module 330, and an extraction module 340.

[0140] The unmasking module 310 is configured to unmask the PBCH information received in at least one synchronization signal period within one transmission time interval via the SSB on the target beam direction according to the system frame number SFN information to obtain at least one set of unmasking sequences.

[0141] The merge module 320 is arranged to obtain a merged sequence by performing a soft merge on the unmasking sequence.

[0142] The checking module 330 is arranged to check the decoding result of the merged sequence.

[0143] The extraction module 340 is configured to extract the MIB from the decoding result according to the SFN information if the checking is successful, and complete blind detection for the PBCH information.

[0144] The blind detection device of the present embodiment realizes soft merging by removing the difference between PBCH information received in different synchronization signal periods through SSB by unmasking, and improves the signal-to-noise ratio of information merging. And, by soft merging the PBCH information received through SSB on the target beam direction in multiple synchronization signal periods within one transmission time section, the number of merges and the number of combinations of blind detection can be reduced, and the efficiency of blind detection can be improved.

[0145] In one embodiment, the unmasking module 310 further includes:

[0146] The mask sequence generating module generates J sets of mask sequences based on SFN information according to the transmission time interval and the synchronization signal period, where J is arranged to be a positive integer.

[0147] The candidate index determination module determines L candidate SSB indexes according to the low 3 bits of the SSB index, or determines L candidate SSB indexes according to the low 2 bits of the SSB index and the half-frame indication bit, where L is a positive integer, and each candidate SSB index is arranged to correspond to one PBCH demodulation reference signal DMRS sequence and one secondary scrambling sequence.

[0148] The LLR calculation module is arranged to calculate a set of LLR sequences for each of the candidate SSB indices.

[0149] An information unmasking module is arranged to unmask said LLR sequence with J sets of mask sequences respectively to obtain J sets of unmasked sequences until a successful test is achieved.

[0150] In one embodiment, the mask sequence generation module is further arranged as follows.

[0151] generating a bit sequence according to each of the low 3 bits of the SFN information and a specific bit belonging to the half-frame indication bit; Each of the bit sequences is subjected to primary scrambling, cyclic redundancy check code (CRC) appending, and polarity code encoding to obtain a corresponding set of J mask sequences.

[0152] In one embodiment, the blind detection apparatus further includes:

[0153] The DMRS sequence generation module is configured to generate one PBCH DMRS sequence according to each of the values ​​of the low 3 bits of the SSB index, or generate one PBCH DMRS sequence according to each of the values ​​of the low 2 bits of the SSB index and the half-frame indication bit, to obtain L PBCH DMRS sequences.

[0154] The secondary scrambling sequence generating module is configured to generate L secondary scrambling sequences according to respective values ​​of the low 3 bits of the SSB index or respective values ​​of the low 2 bits of the SSB index.

[0155] In one embodiment, the LLR calculation module is further arranged as follows:

[0156] Using the PBCH DMRS sequence corresponding to each candidate SSB index, perform channel estimation and demodulation on the PBCH subcarrier position corresponding to the SSB on the target beam direction to obtain an initial sequence corresponding to each candidate SSB index; The secondary scrambling sequence corresponding to each candidate SSB index is used to perform secondary descrambling and rate dematching on the initial sequence to obtain an LLR sequence corresponding to each candidate SSB index.

[0157] In one embodiment, the information unmasking module is further arranged as follows.

[0158] Using each set of mask sequences, we apply exclusive disjunction A calculation is performed to obtain J sets of unmasking sequences.

[0159] In one embodiment, the merge module 320 is further arranged as follows.

[0160] Within one transmission time interval, J sets of unmasking sequences corresponding to each candidate SSB index within each synchronization signal period are added to the current LLR cache data.

[0161] In one embodiment, the merge module 320 is further arranged as follows.

[0162] If the nth synchronization signal period belongs to the next transmission time interval, update the current LLR cache data to J sets of unmasking sequences corresponding to each candidate SSB index in the synchronization signal period.

[0163] In one embodiment, the inspection module 330 further includes:

[0164] The decoding module is configured to perform polarity code decoding on the merge sequence to obtain a decoding result.

[0165] A first check module is configured to perform a cyclic redundancy check code CRC check on the decoded result.

[0166] A second check module is configured to perform a secondary check on the decoded result if the CRC check passes.

[0167] In one embodiment, the secondary check is successful if the decoding result satisfies the following condition:

[0168] The bits of the decoded result corresponding to a specific bit are all 0, and the bits of the decoded result are not all 0.

[0169] In one embodiment, the extraction module 340 further includes:

[0170] The complementation module is configured to complement the SFN information in the decoding result.

[0171] The MIB extraction module is configured to extract the MIB from the completed decoded result.

[0172] In one embodiment, the complementation modules are further arranged as follows:

[0173] The method includes a step of assigning a value of a particular bit corresponding to the nth synchronization signal period and the jth set of mask sequences to a corresponding bit of the decoded result, where n is an index of the corresponding synchronization signal period that is successfully checked, and j is an index of the corresponding mask sequence that is successfully checked.

[0174] The blind detection device proposed in this embodiment belongs to the same inventive concept as the blind detection method applied to the second node provided in the above embodiment, and technical details not described in detail in this embodiment can refer to any of the above embodiments, and this embodiment has the same effect as executing the blind detection method applied to the second node.

[0175] The embodiment of the present disclosure further provides a terminal. The blind detection method applied to the above-mentioned terminal can be realized in a software and / or hardware manner and executed by a blind detection device integrated into the terminal. The terminal can be a mobile device capable of communicating with a network side, such as a mobile phone, a notebook computer, a tablet computer, etc.

[0176] FIG. 7 is a structural conceptual diagram of the hardware configuration of a terminal according to one embodiment. As shown in FIG. 7, the terminal according to this embodiment includes a processor 410 and a storage device 420. One or more processors may be provided in the terminal. FIG. 7 takes one processor 410 as an example, and the processor 410 and the storage device 420 in the device may be connected by a bus or in other manners, and FIG. 7 takes a bus connection as an example.

[0177] The one or more processors execute the one or more processors 410 to realize, by the one or more processors, the blind detection method applied to the terminal according to any of the above embodiments.

[0178] The storage device 420 in the terminal is used as a computer-readable storage medium to store one or more programs, which may be software programs, computer-executable programs and modules, such as program instructions / modules corresponding to the blind detection method applied to the terminal in the embodiment of the present invention (for example, the modules in the blind detection device shown in FIG. 6 include an unmasking block 310, a merging module 320, an inspection module 330 and an extraction module 340). The processor 410 executes the software programs, instructions and modules stored in the storage device 420 to execute various functional applications and data processing of the terminal, i.e., to realize the blind detection method in the above method embodiment.

[0179] The storage device 420 mainly includes a storage program area that can store an operating system and an application required for at least one function, and a storage data area, and the storage data area can store data generated according to the use of the device (e.g., the unmasking sequence in the above embodiment, the decoded result, etc.). In addition, the storage device 420 may include a high-speed random access memory, and may include a non-volatile memory such as at least one disk storage device, a flash memory device, or other non-volatile solid-state memory device. In some embodiments, the storage device 420 may further include a memory located remotely from the processor 410, and these remote memories may be connected to the terminal via a network. Examples of the above network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0180] Then, when one or more programs included in the terminal are executed by the one or more processors 410, the following operations are realized: unmask PBCH information received in at least one synchronization signal period within one transmission time interval via an SSB on a target beam direction according to SFN information to obtain at least one set of unmasking sequences, soft-merge the at least one set of unmasking sequences to determine a merged sequence, check the decoding result of the merged sequence, and if the check is successful, extract an MIB from the decoding result according to the SFN information to complete blind detection of the PBCH information.

[0181] The terminal according to this embodiment is based on the same inventive concept as the blind detection method or query method applied to the terminal according to the above embodiments, and technical details not described in detail in this embodiment may refer to any of the above embodiments, and this embodiment has the same effect as executing the blind detection method.

[0182] An embodiment of the present disclosure further provides a readable storage medium including computer-executable instructions for implementing a blind detection method when executed by a computer processor, the method includes: unmasking PBCH information received in at least one synchronization signal period in one transmission time interval via an SSB on a target beam direction according to SFN information to obtain at least one set of unmasking sequences, performing soft merging on the unmasking sequences to obtain merged sequences, checking a decoded result of the merged sequences, and if the checking is successful, extracting an MIB from the decoded result according to the SFN information to complete blind detection on the PBCH information.

[0183] From the above description of the embodiments, those skilled in the art can understand that the present disclosure can be realized by software and general-purpose hardware, or can be realized by hardware. Based on this understanding, the technical solution of the present disclosure can be embodied in the form of a software product, which is stored in a computer-readable storage medium, such as a computer flexible disk, a read-only memory (ROM), a random access memory (RAM), a flash memory (FLASH), a hard disk or an optical disk, and includes a number of instructions for making a computer device (which may be a personal computer, a server, or a network device, etc.) execute the blind detection method described in any embodiment of the present disclosure.

[0184] The above are only exemplary embodiments of the present disclosure, and do not limit the protection scope of the present disclosure.

[0185] Any logic flow block diagram in the drawings of this disclosure may represent program steps, or may represent interconnected logic circuits, modules, and functions, or may represent a combination of program steps and logic circuits, modules, and functions. The computer program may be stored in a memory. The memory may be of any type suitable for the local technology environment and may be implemented using any suitable data storage technology, such as, but not limited to, read-only memory (ROM), random access memory (RAM), optical memory devices and systems (digital versatile disks DVD or CD disks), etc. The computer-readable medium may include a non-transitory storage medium. The data processor may be of any type suitable for the local technology environment, such as, but not limited to, general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs), application specific integrated circuits (ASICs), programmable logic devices (FPGAs), and processors based on multi-core processor architectures.

[0186] By way of illustrative and non-limiting examples, the detailed description of the exemplary embodiments of the present disclosure has been provided above. However, in view of the drawings and claims, various modifications and adjustments to the above embodiments will be obvious to those skilled in the art, but will not depart from the scope of the present invention. Therefore, the appropriate scope of the present invention is determined by the claims.

Claims

1. unmasking physical broadcast channel PBCH information received in at least one synchronization signal period within one transmission time interval via a synchronization broadcast block SSB on a target beam direction according to system frame number SFN information to obtain at least one set of unmasking sequences; determining a merging sequence according to the at least one set of unmasking sequences; checking a decoded result of the merge sequence; If the check is successful, extracting a master information block (MIB) from the decoding result according to the SFN information to complete blind detection of PBCH information; The step of checking the decoded result of the merge sequence further comprises: performing polarity code decoding on the merge sequence to obtain a decoding result; performing a CRC check on the decoded result; If the CRC check is passed, a secondary check is performed on the decoded result; If the decoded result satisfies the condition that bits corresponding to a specific bit in the decoded result are all 0 and the bits of the decoded result are not all 0, the second check is successful. Blind detection methods.

2. The step of unmasking PBCH information received in at least one synchronization signal period within one transmission time interval via an SSB on a target beam direction according to SFN information to obtain at least one set of unmasking sequences includes: generating J sets of mask sequences based on SFN information according to the transmission time interval and the synchronization signal period, where J is a positive integer; determining L candidate SSB indexes according to the low 3 bits of the SSB index, or determining L candidate SSB indexes according to the low 2 bits of the SSB index and the half-frame indication bit, where L is a positive integer, and each candidate SSB index corresponds to one PBCH demodulation reference signal DMRS sequence and one secondary scrambling sequence; calculating a set of log-likelihood ratio (LLR) sequences for each SSB candidate index; unmasking the LLR sequence with J sets of mask sequences respectively to obtain J sets of unmasked sequences until a test is successful; The blind detection method of claim 1 , comprising:

3. The step of generating J sets of mask sequences based on SFN information using the transmission time interval and the synchronization signal period includes: generating a bit sequence according to each of the low 3 bits of the SFN information and a specific bit belonging to the half-frame indication bit; performing primary scrambling, cyclic redundancy check code (CRC) appending, and polarity code encoding on each of the bit sequences to obtain a corresponding set of J mask sequences; The blind detection method of claim 2 , comprising:

4. generating one PBCH DMRS sequence according to each of the low three bits of the SSB index, or generating one PBCH DMRS sequence according to each of the low two bits of the SSB index and a half-frame indication bit, to obtain L PBCH DMRS sequences; generating L secondary scrambling sequences according to respective values ​​of the low three bits of the SSB index or respective values ​​of the low two bits of the SSB index; The blind detection method of claim 2 further comprising:

5. said step of calculating a set of log-likelihood ratio (LLR) sequences for each respective SSB candidate index comprises: Using the PBCH DMRS sequence corresponding to each candidate SSB index, perform channel estimation and demodulation on the PBCH subcarrier position location corresponding to the SSB on the target beam direction to obtain an initial sequence corresponding to each candidate SSB index; performing secondary descrambling and rate dematching on the initial sequence using a secondary scrambling sequence corresponding to each candidate SSB index to obtain an LLR sequence corresponding to each candidate SSB index; The blind detection method of claim 2 , comprising:

6. The step of unmasking the LLR sequence with J respective sets of mask sequences to obtain J respective sets of unmasked sequences comprises: performing an XOR operation on each set of LLR sequences with each set of mask sequences to obtain J sets of unmasking sequences. The blind detection method of claim 2 , comprising:

7. 3. The blind detection method of claim 2, wherein the step of determining a merging sequence by the at least one set of unmasking sequences includes a step of adding, within one transmission time interval, J sets of unmasking sequences corresponding to each candidate SSB index in each synchronization signal period to current LLR cache data.

8. The step of determining a merging sequence according to the at least one set of unmasking sequences further comprises: updating the current LLR cache data to J sets of unmasking sequences corresponding to each candidate SSB index in the synchronization signal period if the nth synchronization signal period belongs to the next transmission time interval; The blind detection method of claim 2 , comprising:

9. The step of extracting a MIB from the decoding result according to the SFN information includes: complementing the SFN information in the decoding result; extracting the MIB from the complemented decoded result; The blind detection method according to any one of claims 1 to 8, comprising:

10. The step of complementing the SFN information in the decoding result includes: and assigning a value of a particular bit corresponding to the nth synchronization signal period and the jth set of mask sequences to a corresponding bit of the decoded result, where n is an index of the corresponding synchronization signal period that is successfully checked, and j is an index of the corresponding mask sequence that is successfully checked. The blind detection method of claim 9.

11. an unmasking module configured to unmask PBCH information received in at least one synchronization signal period within one transmission time interval via an SSB on a target beam direction according to SFN information to obtain at least one set of unmasking sequences; a merge module configured to determine a merge sequence according to the at least one set of unmasking sequences; a checking module arranged to check a decoding result of the merge sequence; and an extraction module configured to extract an MIB from the decoding result according to the SFN information if the check is successful, to complete blind detection for PBCH information; The inspection module includes: Decoding a polarity code of the merge sequence to obtain a decoding result; performing a CRC check on the decoded result; If the CRC check is passed, a second check is performed on the decoded result; If the decoded result satisfies the condition that bits corresponding to a specific bit in the decoded result are all 0 and the bits of the decoded result are not all 0, the second check is successful. Blind detection device.

12. one or more processors; a storage means for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors implement the blind detection method according to any one of claims 1 to 10. Terminal.

13. A computer program is stored which, when executed by a processor, implements the blind detection method according to any one of claims 1 to 10. A non-volatile computer-readable storage medium.

Images