WO2022078316A1

WO2022078316A1 - Communication decoding method and apparatus, and storage medium, chip and related device

Info

Publication number: WO2022078316A1
Application number: PCT/CN2021/123219
Authority: WO
Inventors: 桂竟晶; 朱志辉; 陈恒毅
Original assignee: 紫光展锐(重庆)科技有限公司
Priority date: 2020-10-14
Filing date: 2021-10-12
Publication date: 2022-04-21
Also published as: CN112217609B; CN112217609A

Abstract

Disclosed are a communication decoding method and apparatus, and a storage medium, a chip and a related device. The method comprises: acquiring priori information corresponding to physical broadcast channel (PBCH) decoding; according to the prior information, determining decoding state information for executing PBCH decoding processing; and executing the PBCH decoding processing according to the decoding state information. By means of the present invention, the reliability of PBCH decoding can be effectively improved.

Description

Communication decoding method, device, storage medium, chip and related equipment

technical field

The present invention relates to the field of communication, and in particular, to a communication decoding method, device, storage medium, chip and related equipment.

Background technique

In communication systems such as LTE (Long Term Evolution), eMTC (Enhance Machine Type Communication), IoT (Internet of Things, Internet of Things), etc., the terminal processes the synchronization signal to obtain Timing (time), After the Frequency (frequency) and other information, it is necessary to continue to receive the PBCH (Physical Broadcast Channel, physical broadcast channel), and decode the PBCH to obtain the basic information of the cell for subsequent communication. At present, the Viterbi decoding algorithm is usually used to decode the PBCH, and the Viterbi decoding algorithm is a maximum likelihood decoding algorithm based on a convolutional lattice graph. A decoded codeword that is closest to the encoded codeword. How to improve the reliability of PBCH decoding using Viterbi algorithm has become a research hotspot.

SUMMARY OF THE INVENTION

Embodiments of the present application provide a communication decoding method, device, storage medium, chip and related equipment, which can effectively improve the reliability of PBCH decoding.

In order to solve the above technical problems, in the first aspect, an embodiment of the present application provides a communication decoding method, the method includes:

Obtain the prior information corresponding to the PBCH decoding of the physical broadcast channel;

determining, according to the prior information, decoding state information for performing PBCH decoding processing;

Based on the decoding status information, a PBCH decoding process is performed.

In a second aspect, an embodiment of the present application provides a communication decoding device, where the communication decoding device includes: a storage device and a processor,

the storage device for storing program codes;

The processor, when invoking the stored code, is configured to execute the communication decoding method according to the first aspect.

In a third aspect, an embodiment of the present application provides a communication decoding device, where the communication decoding device includes:

an acquisition module, used to acquire the prior information corresponding to the PBCH decoding of the physical broadcast channel;

a determining module, configured to determine decoding state information for performing PBCH decoding processing according to the prior information;

A decoding module, configured to perform PBCH decoding processing according to the decoding state information.

In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, where the computer-readable storage medium is used to store a computer program, and the computer program causes a computer to execute the communication decoding method described in the first aspect.

In a fifth aspect, an embodiment of the present application provides a chip, which is used to obtain a priori information corresponding to physical broadcast channel PBCH decoding;

Based on the decoding status information, a PBCH decoding process is performed.

In a sixth aspect, an embodiment of the present application provides a module device, the module device includes a chip module, wherein:

The chip module is used to obtain a priori information corresponding to physical broadcast channel PBCH decoding;

Based on the decoding status information, a PBCH decoding process is performed.

Implementing the embodiments of the present application has the following beneficial effects:

The terminal obtains and determines the partial decoding state information for performing the PBCH decoding process according to the prior information corresponding to the PBCH decoding, and then performs the PBCH decoding process according to the determined partial decoding state information, which can effectively improve the reliability of the PBCH decoding. sex.

Description of drawings

In order to illustrate the technical solutions in the embodiments of the present application more clearly, the following briefly introduces the accompanying drawings used in the description of the embodiments. Obviously, the accompanying drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, other drawings can also be obtained from these drawings without creative effort.

Fig. 1 is a kind of convolutional code trellis diagram provided by the embodiment of this application;

FIG. 2 is a scene diagram of a communication decoding method provided by an embodiment of the present application;

3 is a schematic flowchart of a communication decoding method provided by an embodiment of the present application;

4 is a schematic diagram of a state transition path provided by an embodiment of the present application;

FIG. 5 is a schematic diagram of another state transition path provided by an embodiment of the present application;

FIG. 6 is a schematic structural diagram of a communication decoding device provided by an embodiment of the present application;

7 is a schematic structural diagram of a communication decoding apparatus provided by an embodiment of the present application;

FIG. 8 is a schematic structural diagram of a module device according to an embodiment of the present application.

Detailed ways

The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present invention, but not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

It should be noted that, in the description and claims of the present application and in the above drawings, "first", "second", etc. are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. . It is to be understood that the data so used are interchangeable under appropriate circumstances such that the embodiments of the application described herein can be practiced in sequences other than those illustrated or described herein. Furthermore, the term "comprising" and any variations thereof are intended to cover non-exclusive inclusion, for example, a process, method, system, product or server comprising a series of steps or elements is not necessarily limited to those steps or elements expressly listed, Rather, other steps or units not expressly listed or inherent to the process, method, product or apparatus may be included.

In order to better understand the communication decoding method, device, device, and storage medium provided by the embodiments of this application, the technical terms involved in this application are explained as follows:

(1) Viterbi decoding algorithm

The basic idea of the Viterbi decoding algorithm is to compare the received sequence with all possible transmission sequences, and select a sequence with the smallest code distance as the transmission sequence.

Please refer to FIG. 1. FIG. 1 is a trellis diagram of a convolutional code provided by an embodiment of the application. Specifically, as shown in FIG. 1, the trellis diagram of a convolutional code is a state transition of a (2, 1, 4) encoder. In the figure, the solid line indicates that the input is 0, and the dotted line indicates that the input is 1. Starting from the fifth group of nodes, each node can be transferred from two states.

As can be seen from Figure 1, the process of convolutional code encoding is a transition process of the encoder state along the time axis. The Viterbi decoding rule is to search for the most probable state jump path on the convolutional code trellis graph. Let the code sequence output by the (n, k, m) encoder be T and the register length is L. After DMC (Discrete Memoryless) Channel, discrete memoryless channel), the sequence input to the Viterbi decoder after transmission is R=T+E, where E is the error sequence of the channel. According to the received sequence R, the decoder finds the path taken by the received sequence on the encoder grid diagram as shown in Figure 1 according to the maximum likelihood criterion. This process is the calculation process of the Viterbi decoder and the search for the maximum likelihood function. , or the process of finding the maximum metric path, that is, the implementation process of the Viterbi decoding algorithm.

Specifically, when finding the maximum metric path, the metric value of the survival path of all states must be read at time t, and then the metric value of the jump path is calculated according to the input at time t+1, and the metric value of the survival path at time t and t+ The jump value at time 1 is added to obtain the metric value of the survival path from time t+1 to state S, so that each state has a survival path. According to these survival paths and the state of the final encoder, it is possible to The state transition path of the encoder is obtained, that is, the decoding result obtained by decoding with the Viterbi decoding algorithm.

It should be noted that the grid diagram used in the decoding of the Viterbi decoding algorithm in this application is not limited to the grid diagram shown in FIG. The trellis diagram of (branch)-2, the trellis diagram of Radix-4, etc.; the Viterbi decoding algorithm in this application may be the Viterbi decoding algorithm supporting a single communication standard, or the Viterbi decoding supporting multiple communication standards Algorithm; In this application, the metric value of the jump path can be the Hamming distance or the Euclidean distance between the grid states before and after the jump, and other codeword distances can also be used as the metric value of the jump path, which is not limited here. .

(2) Fields corresponding to PBCH (Physical Broadcast Channel, Physical Broadcast Channel)

The field corresponding to the PBCH can store one or more of the following information:

BW (Band Width, system bandwidth), occupies 3 bits (bits), the valid value of the BW bit is 0 to 5;

The configuration information of PHICH (Physical Hybrid ARQ Indicator Channel, Physical Hybrid Automatic Retransmission Indicator Channel) occupies 3 bits, and each bit of the PHICH configuration information can take a value of 0 or 1;

SFN (System Frame Number, system frame number), occupying 10 bits, each bit in the upper 8 bits of SFN can be 0 or 1;

The scheduling information (field) of SIB1-BR (System Information Block-Bandwidth Reduction, bandwidth-limited system information block 1) occupies 5 bits, and the valid bit value of SIB1-BR is 1 to 18;

SI (System Information, system message) does not change the indication information, occupying 1 bit, if the cell where the terminal is located supports R15 (Release 15, the technical standard of protocol version 15), the 1 bit of the SI unchanged indication information is 1, otherwise, it takes value is 0;

Reserve (reserved) field, occupying 4 bits.

In this embodiment of the present application, when the cell sends SIB1-BR, the field corresponding to PBCH will store the scheduling information of SIB1-BR; if the system bandwidth is less than or equal to 15 PRB (Physical Resource Block, physical resource block), then SIB1 The valid value of the bit corresponding to -BR is ∈ {1, 4, 7, 10, 13, 16}, otherwise, the valid value of 5 bits of SIB1-BR is 1 to 18.

Please refer to FIG. 2 . FIG. 2 is a scene diagram of a communication decoding method provided by an embodiment of the present application. Specifically, as shown in FIG. 2 , in this scenario, the first terminal 201 is a sending end device, and the second terminal 202 is a The receiving end device, the encoder of the first terminal 201 encodes the information sequence u of the information source and outputs an encoded codeword v, and the encoded codeword v is modulated and transmitted through a channel, such as PBCH (Physical Broadcast Channel, physical broadcast channel) to the receiver. The second terminal 202, the second terminal 202 demodulates the received codeword sequence to obtain the received information r, and then inputs the received information r to the decoder of the second terminal 202 for decoding, so that the decoder outputs the decoded Code sequence u_dec.

The decoding sequence u_dec output by the decoder is an estimated value of the information sequence u. The decoder generates a sequence u_dec from the received sequence r according to a certain decoding rule, such as the decoding rule of the Viterbi decoding algorithm. Since the information sequence u has a corresponding relationship with the encoded codeword v, it is equivalent to the decoder generating an estimate v' of the codeword v. When v'=v, u_dec=u; when v' is not equal to v, an error occurs in decoding.

It should be noted that, according to an actual application scenario, the second terminal 202 may be used as a transmitting end device, and the first terminal 201 may be used as a receiving end device, and the foregoing encoding and decoding processes may be performed. The first terminal 201 and the second terminal 202 include but are not limited to an access terminal, a subscriber unit, a subscriber station, a mobile station, a mobile station (Mobile Station, MS), a remote station, a remote terminal, a mobile device, a user terminal, and a terminal device (Terminal Equipment), wireless communication equipment, user agent or user device. The first terminal 201 and the second terminal 202 may also be a cellular phone, a cordless phone, a Session Initiation Protocol (Session Initiation Protocol, SIP) phone, a Wireless Local Loop (Wireless Local Loop, WLL for short) station, a Personal Digital Assistant (Personal Digital Assistant) Assistant, PDA for short), handheld devices with wireless communication capabilities, computing devices or other processing devices connected to wireless modems, in-vehicle devices, wearable devices, other terminal devices in 4G networks, and future 5G networks. The terminal equipment in the evolved public land mobile communication network (Public Land Mobile Network, PLMN for short) has wireless communication functions.

Please refer to FIG. 3. FIG. 3 is a schematic flowchart of a communication decoding method provided by an embodiment of the application. This specification provides the method operation steps as described in the embodiment or the flowchart, but based on conventional or non-creative work, it can be Include more or fewer steps. The sequence of steps enumerated in the embodiments is only one of the execution sequences of many steps, and does not represent the only execution sequence. When an actual terminal or storage medium product is executed, the methods shown in the embodiments or the accompanying drawings may be executed sequentially or in parallel. Specifically, as shown in FIG. 3 , the method can be applied to a terminal, and the method includes:

S301: Acquire prior information corresponding to physical broadcast channel PBCH decoding;

S302: Determine decoding state information for performing PBCH decoding processing according to the prior information;

S303: Execute PBCH decoding processing according to the decoding state information.

In the embodiment of the present application, the terminal obtains and determines the partial decoding state information for performing the PBCH decoding process according to the prior information corresponding to the PBCH decoding, and then performs the PBCH decoding process according to the determined partial decoding state information, which can effectively Improve the reliability of PBCH decoding.

Correspondingly, an embodiment of the present application further provides a communication decoding method, the method can be applied to a terminal, and the method includes:

S401: Acquire prior information corresponding to the decoding of the physical broadcast channel PBCH.

In this embodiment of the present application, the prior information includes value information of at least one bit in the field corresponding to the PBCH, for example: the prior information is the bit value of the system bandwidth, and/or the field corresponding to the PBCH is continuous Combination constraint information of multiple bits, for example, the prior information is the combination constraint information that the system bandwidth is high and 2 bits cannot be 1 at the same time.

The prior information may further include other information used to obtain value information of at least one bit in the field corresponding to the PBCH and/or combination constraint information of multiple consecutive bits in the field corresponding to the PBCH.

In the embodiment of the present application, the field corresponding to the PBCH stores any one or multiple pieces of the following information:

System bandwidth information, configuration information of physical hybrid automatic repeat indication channel PHICH, system frame number SFN information, scheduling information of bandwidth-limited system information block 1 SIB1-BR, system message SI unchanged indication information, reserved Reserve domain information.

Wherein, the value information of at least one bit in the field corresponding to the PBCH refers to the value information of at least one bit corresponding to the information stored in the field corresponding to the PBCH, for example: in the field corresponding to the PBCH The value information of at least one bit may be the value information of bits corresponding to the system bandwidth information stored in the field corresponding to the PBCH.

In the embodiment of the present application, the prior information is obtained according to the communication scene information of the terminal, and the terminal may determine the prior information corresponding to PBCH decoding according to the communication scene information where the terminal is located.

The communication scenario information includes, but is not limited to, the communication scenario information in which the terminal performs network search processing, the information on the cell in which the terminal has successfully camped, and the communication scenario in which the terminal performs the PBCH reading process for the same-frequency neighboring cell. information.

It should be noted that in addition to the three types of information, the communication scene information also includes other types of communication scene information; the communication scene information can be used to obtain a priori information corresponding to PBCH decoding, which can be used for Obtain the value information of at least one bit in the field corresponding to the PBCH and/or the combination constraint information of multiple consecutive bits in the field corresponding to the PBCH.

In the embodiment of the present application, if the communication scene information of the terminal includes the communication scene information of the terminal performing the network search process, the obtaining a priori information corresponding to the PBCH decoding of the physical broadcast channel includes:

Acquire prior information corresponding to PBCH decoding according to the communication scenario information in which the terminal performs network search processing;

The prior information includes value information of bits corresponding to the system bandwidth information in the field corresponding to the PBCH.

Specifically, in the process of performing a network search process to camp on the data network, for example, in the process of searching for an RPLMN (Registered Public Land Mobile Network, registered public land mobile network), the terminal will determine the range of the system bandwidth used by the PBCH, that is, The system bandwidth information of the PBCH is acquired, and then the value information of the bits of the system bandwidth information in the field corresponding to the PBCH can be acquired.

In this embodiment of the present application, if the communication scenario information of the terminal includes information of a cell where the terminal has successfully camped on, the obtaining prior information corresponding to the PBCH decoding of the physical broadcast channel includes:

According to the cell information on which the terminal has successfully camped, the prior information corresponding to the PBCH decoding is acquired.

Specifically, after the terminal successfully camps on the serving cell, it may be powered off or sleep; in this case, the terminal will quickly re-camp to the serving cell that has previously There will be a timing deviation between the serving cell and the serving cell where it resides before. Specifically, if a timing deviation of more than 40 ms occurs, the SFN of the terminal needs to be updated. Therefore, after the terminal re-camps to the cell where it has successfully camped before, it can obtain the value information of bits in the fields corresponding to other PBCHs except SFN according to the information of the cell that has successfully camped on, and then the system bandwidth can be obtained. Information, PHICH configuration information, SIB1-BR scheduling information, SI unchanged indication information, Reserve field information and other bit value information.

In the embodiment of the present application, if the communication scene information of the terminal includes the communication scene information of the terminal performing the PBCH reading processing of the same-frequency adjacent cell, the obtaining a priori information corresponding to the PBCH decoding of the physical broadcast channel, include:

Acquire prior information corresponding to PBCH decoding according to the communication scenario information that the terminal performs the PBCH reading process on the same-frequency adjacent cell;

Specifically, the same-frequency neighboring cell uses the same frequency band as the serving cell where the terminal is currently located, that is, the PBCH system bandwidth information of the serving cell where the terminal is currently located is the same as the PBCH system bandwidth information of the same-frequency neighboring cell, which can be directly The system bandwidth information of the current serving cell is obtained, and the value information of the bit value of the system bandwidth information corresponding to the PBCH decoding of the same-frequency neighboring cell is obtained.

S402: Determine, according to the prior information, decoding state information for performing PBCH decoding processing.

In the embodiment of the present application, the PBCH decoding is performed by using the Viterbi decoding method;

The decoding status information includes any one or more of the following information:

Trellis diagram structure information of Viterbi decoding, trellis state information corresponding to the prior information, and state transition information corresponding to the prior information.

In this embodiment of the present application, the trellis diagram structure information of Viterbi decoding includes the number of states and/or the number of branch paths of state transitions, for example: the trellis diagram structure information of Viterbi decoding includes a volume with a trellis diagram of 4 states The information of the product code trellis diagram, that is, the number of states is 4. Another example: the trellis diagram structure information of Viterbi decoding includes the information that the trellis diagram is a Radix-2 trellis diagram, that is, the number of branch paths of state transition is 2 ; Among them, the Radix-2 trellis diagram is used for decoding, and only 1 bit of decoding can be performed in each clock cycle.

In this embodiment of the present application, the grid state information corresponding to the prior information refers to the value of the grid state; wherein, because the PBCH uses a 6-bit state, the value of the grid state ranges from 0 to 63.

In this embodiment of the present application, the state transition information corresponding to the prior information includes: a state transition path corresponding to the prior information and/or branch metric information corresponding to a state transition path corresponding to the prior information; The state transition path corresponding to the prior information refers to the state transition path corresponding to the grid state information corresponding to the prior information; the branch metric information of the state transition path includes cumulative branch metric information and/or branches of a single state transition path measurement information.

In the embodiment of the present application, if the prior information is the value range of N consecutive bits in the field corresponding to the PBCH, and the value range of the consecutive N bits is less than 2N, and N is a positive integer, then determine The trellis diagram structure information of Viterbi decoding includes information that the trellis diagram for performing Viterbi decoding on the consecutive N bits is a trellis diagram of Radix-2.

In this embodiment of the present application, if the prior information includes value information of at least one bit in a field corresponding to the PBCH, then determining the decoding state information for performing PBCH decoding according to the prior information, including :

determining, according to the value information of the at least one bit, grid state information corresponding to the value information of the at least one bit;

According to the mesh state information corresponding to the value information of the at least one bit, the branch metric information of the state transition path corresponding to the value information of the at least one bit is determined.

Please refer to FIG. 4 . FIG. 4 is a schematic diagram of a state transition path provided by an embodiment of the present application. Specifically, as shown in FIG. 4 , the prior information includes information that a value of a bit in a field corresponding to the PBCH is 0. Using the received soft information and the transition polynomial of the convolutional code encoder to calculate the Hamming distance between each state, the branch metric of each state is obtained, including the branch metric of state 000000 and the branch metric of state 100000 on the right side of Figure 4.

In this embodiment of the present application, if the prior information includes the combination constraint information of multiple consecutive bits in the field corresponding to the PBCH, then determining the decoding state information for performing PBCH decoding according to the prior information, including :

Determine the trellis diagram structure information of the Viterbi decoding according to the combination constraint information of the consecutive multiple bits;

According to the combination constraint information of the consecutive multiple bits and the trellis diagram structure information, the branch metric information of the state transition paths corresponding to the multiple bits is determined.

Specifically, the trellis diagram of Viterbi decoding may be determined to be the trellis diagram of Radix-2M according to the combination constraint information of consecutive M bits.

Please refer to FIG. 5. FIG. 5 is a schematic diagram of another state transition path provided by an embodiment of the application. Specifically, as shown in FIG. 5, the received soft information is used to calculate the received information and the transition polynomial of the convolutional code encoder is used to calculate the transition between each state. The Hamming distance between each state is obtained, that is, the branch metric of each state is obtained, including the branch metric of state 000000, the branch metric of state 100000, the branch metric of state 010000, and the branch metric of state 110000. The branch metric from the left state 000000 in Figure 5 to the intermediate state 000000 in Figure 5 is calculated as M1_1, the branch metric from the left state 000000 in Figure 5 to the intermediate state 100000 in Figure 5 is M1_2, and the intermediate state in Figure 5 from 000000 to the right side of Figure 5 The branch metric of the state 000000 is M2_1, the branch metric of the middle state 000000 in Figure 5 to the state 100000 on the right side of Figure 5 is M2_2, the branch metric of the middle state 100000 in Figure 5 to the state 010000 on the right side of Figure 5 is M2_3, the middle state in Figure 5 is 100000 to The branch metric for state 110000 on the right side of Figure 5 is M2_4. Among them, M1_1, M1_2, M2_1, M2_2, M2_3, and M2_4 are all positive numbers.

In Figure 5, the prior information includes the combination constraint information in which the upper 2 bits of the system bandwidth information corresponding to the PBCH cannot be 1 at the same time. Without being constrained by the combination constraint information, the upper 2 bits of the system bandwidth information may have 4 values. , namely 00, 01, 10, and 11, it can be determined that the trellis diagram structure information of Viterbi decoding is the information that the trellis diagram is the Radix-4 trellis diagram; Among the four branch paths of the lattice state, the branch metric information of the state transition path corresponding to two consecutive bits of 00, 01, and 10 is determined, and the branch metric information of the state transition path corresponding to two consecutive bits of 1 can be further excluded. Among them, the number of branch paths for state transition in the Radix-4 trellis diagram is 4, that is, 2-bit decoding can be performed in each clock cycle.

It should be noted that the solid line in FIG. 4 and FIG. 5 indicates that the output is 0, and the dotted line indicates that the output is 1; the received soft information may be the received information r involved in the description of FIG. 2 .

In this embodiment of the present application, if the prior information includes system bandwidth information corresponding to PBCH, such as size information of the system bandwidth, the bit corresponding to the scheduling information of the SIB1-BR may be determined according to the system bandwidth information corresponding to PBCH. The value information of , that is, the value information of the bit corresponding to the scheduling information of the SIB1-BR is determined according to the system bandwidth information.

For example: if the system bandwidth (size information) is less than or equal to 15PRB, the bits corresponding to the scheduling information of SIB1-BR can only be 1, 4, 7, 10, 13, and 16; otherwise, the scheduling of SIB1-BR The value range of bits corresponding to the information is 1 to 18.

If the prior information includes the value information of bits corresponding to the scheduling information of SIB1-BR in the field corresponding to the PBCH, then determining the decoding state information for performing PBCH decoding according to the prior information, including:

Determine the grid state information corresponding to the bit value information according to the bit value information corresponding to the scheduling information of the SIB1-BR;

According to the mesh state information corresponding to the bit value information, the branch metric information of the state transition path corresponding to the bit value information is determined.

For example: if the system bandwidth (size information) is less than or equal to 15PRB, the bits corresponding to the scheduling information of SIB1-BR can only take values of 1, 4, 7, 10, 13, 16, then the 5-bit SIB1- The cumulative branch metric of the state transition path corresponding to the BR scheduling information, that is, the cumulative branch metric of the state transition path with the value ∈ {1, 4, 7, 10, 13, 16} of the 5-bit SIB1-BR scheduling information.

S403: Execute PBCH decoding processing according to the decoding state information.

In the embodiment of the present application, there are two ways to perform the PBCH decoding process according to the decoding state information.

The first way includes:

Step A: According to the decoding state information and/or the measurement method, exclude branch paths that do not match the prior information in the Viterbi-decoded trellis diagram;

The measurement methods include error measurement of Hamming distance, error measurement of Euclidean distance, measurement methods of taking the maximum path and taking the minimum path measurement, and other measurement methods can also be set according to actual decoding requirements.

The branch path that does not match the a priori information refers to a branch path in which the decoding result obtained through the branch path is different or contradictory to the decoding result corresponding to the a priori information. One of the bits is 0, but the bit corresponding to the prior information is 1, then it can be determined that the branch path does not match the prior information, and for example: the system bandwidth information obtained through the branch path The upper 2 bits of s are 1 at the same time, but the prior information is the combined constraint information that the upper 2 bits of the system bandwidth information cannot be 1 at the same time, then it can be determined that the branch path does not match the prior information.

In this embodiment of the present application, after obtaining the branch metric information of the state transition path corresponding to the prior information, a branch path or a branch path metric value that cannot obtain the branch metric information of the state transition path corresponding to the prior information can be marked, such as : Set the branch path metric value of the state transition path corresponding to the prior information cannot be obtained as the first fixed value SetValue1, and in the subsequent calculation of the path metric, set the path metric including SetValue1 to SetValue1.

For example, in Figure 5, the prior information includes combination constraint information in which the upper 2 bits of the system bandwidth information corresponding to PBCH cannot be 1 at the same time. In the case that the upper 2 bits of the system bandwidth information are not constrained by the combination constraint information, there may be 4 types of upper 2 bits of the system bandwidth information. Values, namely 00, 01, 10, 11, can determine that the grid map structure information of Viterbi decoding is the information that the grid map is the Radix-4 grid map; in Figure 5, if the measurement method is the error of the Hamming distance metric and the metric method of taking the minimum path metric, set the branch metric value of the state transition path corresponding to two consecutive bits of 1 as SetValue1, and in the subsequent calculation of the path metric, mark the path metric containing the marked SetValue1 or Set to SetValue1, which is the value of the maximum path metric. In Figure 5, the state transition path with two consecutive bits of 1 is the path from the left state 000000 to the middle state 100000, and then to the left grid mesh 110000, and the branch metric corresponding to the path is marked or set as SetValue1.

Another example: when the system bandwidth (the size information) is less than or equal to 15 PRB, the value of the 5-bit SIB1-BR scheduling information does not belong to the state corresponding to {1, 4, 7, 10, 13, 16} ( transfer) path excluded.

Step B: In the remaining branch paths, use the Viterbi decoding method to perform PBCH decoding.

Specifically, when calculating the path metric, the branch paths whose path metric is SetValue1 can be directly excluded, and the information carried by the PBCH is decoded in the remaining branch paths according to the Viterbi decoding method.

The second way includes:

Step a: according to the decoding state information and/or the metric method, mark the branch paths that match the prior information in the trellis diagram of Viterbi decoding;

The marking of the branch paths in the Viterbi-decoded trellis graph that matches the prior information includes: marking the branch path metric values that match the prior information in the Viterbi-decoded trellis graph as the first Two fixed values SetValue2.

It should be noted that the first fixed value SetValue1 and the second fixed value SetValue2 may be the same or different, and the two may be set manually or by default by the system.

The branch path that matches the a priori information refers to the branch path whose decoding result obtained through the branch path is the same or consistent with the decoding result corresponding to the a priori information. For example, a bit in the PBCH field is obtained through the branch path. The bit value is 0, and the bit value corresponding to the prior information is 0, then it can be determined that the branch path matches the prior information. Another example: the upper 2 bits of the system bandwidth information obtained through the branch path are 01 , the prior information is the combination constraint information that the upper 2 bits of the system bandwidth information cannot be 1 at the same time, then it can be determined that the branch path matches the prior information.

Step b: Perform PBCH decoding using Viterbi decoding, so that the surviving path includes the marked branch path.

For example: in Fig. 4, in order to make the value of the bit obtained by decoding to be 0, that is, the selected branch path is from the left state 000000 in Fig. 4 to the right state 000000 in Fig. 4, by setting the left The branch path metric from the state 000000 to the right state 000000 in Figure 4 is SetValue2, which ensures that the branch path is selected in the comparison step of Viterbi, so that the finally obtained survivor path includes the branch path.

Please refer to FIG. 6. FIG. 6 is a schematic structural diagram of a communication decoding device provided by an embodiment of the application. Specifically, as shown in FIG. 6, the communication decoding device includes: a storage device 601 and a processor 602; The communication decoding device may further include a data interface 603 and a user interface 604 . Various types of buses can also be used to establish connections between various hardwares.

Through the data interface 603, the communication decoding device can exchange data with other terminals, servers and other devices; the user interface 604 is used to realize human-computer interaction between the user and the communication decoding device; The user interface 604 may provide a touch display screen, physical keys, etc. to realize human-computer interaction between the user and the communication decoding device.

The storage device 601 may include a volatile memory (Volatile memory), such as a random access memory (Random-Access Memory, RAM); the storage device 601 may also include a non-volatile memory (Non-Volatile Memory), such as a flash memory. Flash memory (Flash Memory), solid-state drive (Solid-State Drive, SSD), etc.; the storage device 601 may also include a combination of the above-mentioned types of memory.

The processor 602 may be a central processing unit (Central Processing Unit, CPU). The processor 602 may further include a hardware chip. The above-mentioned hardware chip can be an application-specific integrated circuit (Application-Specific Integrated Circuit, ASIC), a programmable logic device (Programmable Logic Device, PLD), and the like. The above-mentioned PLD can be a field programmable gate array (Field-Programmable Gate Array, FPGA), a general-purpose array logic (Generic Array Logic, GAL), and the like.

The storage device 601 is used to store program codes;

The processor 602, when invoking the stored code, is configured to acquire the prior information corresponding to the decoding of the physical broadcast channel PBCH;

Based on the decoding status information, a PBCH decoding process is performed.

In one embodiment, the prior information is obtained according to the communication scenario information of the terminal.

In one embodiment, the PBCH decoding is performed using Viterbi decoding;

In one embodiment, the prior information includes value information of at least one bit in a field corresponding to PBCH and/or combination constraint information of multiple consecutive bits in a field corresponding to PBCH.

In one embodiment, the field corresponding to the PBCH stores any one or more pieces of the following information:

In one embodiment, the state transition information corresponding to the prior information includes: branch metric information of the state transition path corresponding to the prior information.

In one embodiment, the prior information includes value information of at least one bit in a field corresponding to the PBCH;

The processor 602 is specifically configured to determine grid state information corresponding to the value information of the at least one bit according to the value information of the at least one bit;

In one embodiment, the prior information includes combination constraint information of multiple consecutive bits in a field corresponding to the PBCH;

The processor 602 is specifically configured to determine the trellis diagram structure information of the Viterbi decoding according to the combination constraint information of the consecutive multiple bits;

In one embodiment, the prior information includes value information of bits corresponding to the scheduling information of SIB1-BR in a field corresponding to the PBCH;

The processor 602 is specifically configured to determine grid state information corresponding to the bit value information according to the bit value information corresponding to the scheduling information of the SIB1-BR;

In one embodiment, the processor 602 is specifically configured to, according to the decoding state information and the metric, exclude branch paths that do not match the prior information in the Viterbi-decoded trellis diagram;

In the remaining branch paths, PBCH decoding is performed using Viterbi decoding.

In one embodiment, the processor 602 is specifically configured to, according to the decoding state information and the metric, mark branch paths that match the prior information in the Viterbi-decoded trellis graph;

PBCH decoding is performed using Viterbi decoding so that the surviving path contains the marked branch path.

In one embodiment, the communication scene information of the terminal includes communication scene information of the terminal performing network search processing;

The processor 602 is specifically configured to obtain a priori information corresponding to PBCH decoding according to the communication scenario information of the terminal performing network search processing;

In an embodiment, the communication scenario information of the terminal includes information of a cell where the terminal has successfully camped;

The processor 602 is specifically configured to acquire the prior information corresponding to the PBCH decoding according to the cell information on which the terminal has successfully camped.

In one embodiment, the communication scenario information of the terminal includes the communication scenario information that the terminal performs the PBCH reading process for the same-frequency adjacent cell;

The processor 602 is specifically configured to obtain a priori information corresponding to PBCH decoding according to the communication scenario information that the terminal performs the PBCH reading processing for the same-frequency adjacent cell;

In an embodiment, the prior information further includes system bandwidth information corresponding to the PBCH; the value information of the bits corresponding to the scheduling information of the SIB1-BR is determined according to the system bandwidth information.

Please refer to FIG. 7. FIG. 7 is a schematic structural diagram of a communication decoding apparatus provided by an embodiment of the present application. Specifically, as shown in FIG. 7, the communication decoding apparatus includes:

An obtaining module 701, configured to obtain a priori information corresponding to physical broadcast channel PBCH decoding;

A determination module 702, configured to determine decoding state information for performing PBCH decoding processing according to the prior information;

The decoding module 703 is configured to perform PBCH decoding processing according to the decoding state information.

In one embodiment, the PBCH decoding is performed using Viterbi decoding;

The determining module 702 is specifically configured to determine grid state information corresponding to the value information of the at least one bit according to the value information of the at least one bit;

The determining module 702 is specifically configured to determine the trellis diagram structure information of the Viterbi decoding according to the combination constraint information of the consecutive multiple bits;

The determining module 702 is specifically configured to determine grid state information corresponding to the bit value information according to the bit value information corresponding to the scheduling information of the SIB1-BR;

In one embodiment, the decoding module 703 is specifically configured to exclude branch paths that do not match the prior information in the trellis diagram of Viterbi decoding according to the decoding state information and the metric;

In one embodiment, the decoding module 703 is specifically configured to, according to the decoding state information and the metric, mark branch paths that match the prior information in the Viterbi-decoded trellis diagram;

The obtaining module 701 is specifically configured to obtain a priori information corresponding to PBCH decoding according to the communication scenario information of the terminal performing network search processing;

The obtaining module 701 is specifically configured to obtain the prior information corresponding to the PBCH decoding according to the information of the cell where the terminal has successfully camped on.

The obtaining module 701 is specifically configured to obtain a priori information corresponding to PBCH decoding according to the communication scenario information that the terminal performs the PBCH reading processing for the same-frequency adjacent cell;

Correspondingly, an embodiment of the present invention further provides a computer-readable storage medium, where the computer-readable storage medium is used to store a computer program, and the computer program enables a computer to execute any of steps S301 to S303 and steps S401 to S403 of the present application methods described in the examples. It can be understood that, the computer storage medium here may include both the built-in storage medium in the smart terminal, and certainly also the extended storage medium supported by the smart terminal. The computer storage medium provides storage space, and the storage space stores the operating system of the intelligent terminal. In addition, one or more instructions suitable for being loaded and executed by the processor are also stored in the storage space, and these instructions may be one or more computer programs (including program codes). It should be noted that the computer storage medium here may be a high-speed RAM memory, or a non-volatile memory (Non-Volatile Memory), such as at least one magnetic disk memory; optionally, at least one storage medium located far away from the aforementioned processor may also be used. computer storage media.

Correspondingly, the embodiment of the present application further provides a chip, the chip is used to obtain the prior information corresponding to the PBCH decoding of the physical broadcast channel;

Based on the decoding status information, a PBCH decoding process is performed.

In one embodiment, the PBCH decoding is performed using Viterbi decoding;

Viterbi decoding trellis diagram structure information, trellis state information corresponding to the prior information, and state transition information corresponding to the prior information.

The chip, in the aspect of determining the decoding state information for performing PBCH decoding according to the prior information, is specifically configured to determine the value of the at least one bit according to the value information of the at least one bit. The grid state information corresponding to the value information;

The chip, in the aspect of determining the decoding state information for performing PBCH decoding according to the prior information, is specifically configured to determine the Viterbi decoding based on the combination constraint information of the consecutive multiple bits. grid diagram structure information;

The chip, in the aspect of determining the decoding state information for performing PBCH decoding according to the prior information, is specifically configured to determine the bit value information corresponding to the scheduling information of the SIB1-BR. The grid state information corresponding to the bit value information;

In one embodiment, in the aspect of performing the PBCH decoding process according to the decoding state information, the chip is specifically configured to exclude Viterbi decoding according to the decoding state information and/or the metric method. The branch paths that do not match the prior information in the grid graph of ;

In one embodiment, in the aspect of performing the PBCH decoding process according to the decoding state information, the chip is specifically configured to mark the data of Viterbi decoding according to the decoding state information and/or the metric method. branch paths in the grid graph that match the prior information;

The chip, in the aspect of acquiring the prior information corresponding to the PBCH decoding of the physical broadcast channel, is specifically configured to acquire the prior information corresponding to the PBCH decoding according to the communication scenario information of the terminal performing the network search process;

In the aspect of acquiring the prior information corresponding to the PBCH decoding of the physical broadcast channel, the chip is specifically configured to acquire the prior information corresponding to the PBCH decoding according to the information of the cell where the terminal has successfully camped on.

The chip, in the aspect of acquiring the prior information corresponding to the PBCH decoding of the physical broadcast channel, is specifically configured to acquire the corresponding information of the PBCH decoding according to the communication scene information of the PBCH reading process performed by the terminal on the same-frequency adjacent cell. Prior Information;

It should be noted that the chip can execute the steps related to the network device in the method embodiment of FIG. 3 and steps S401 to S403. For details, please refer to the implementation manners provided by the above steps, which will not be repeated here.

In one embodiment, the chip includes at least one processor, at least one first memory, and at least one second memory; wherein, the at least one first memory and the at least one processor are interconnected through lines, and the first memory stores There are instructions; the at least one second memory and the at least one processor are interconnected through lines, and the second memory stores the data that needs to be stored in the foregoing method embodiments.

For each device or product applied to or integrated in the chip, each module contained therein may be implemented by hardware such as circuits, or at least some of the modules may be implemented by a software program that runs on the integrated circuit inside the chip. The processor and the remaining (if any) modules can be implemented in hardware such as circuits.

Please refer to FIG. 8 . FIG. 8 is a schematic structural diagram of a module device according to an embodiment of the application. The module device includes a chip module 801 , wherein:

The chip module 801 is used to obtain the prior information corresponding to the decoding of the physical broadcast channel PBCH;

Based on the decoding status information, a PBCH decoding process is performed.

In one embodiment, the PBCH decoding is performed using Viterbi decoding;

The chip module 801, in the aspect of determining the decoding state information for performing PBCH decoding according to the prior information, is specifically configured to determine the at least one bit according to the value information of the at least one bit The grid state information corresponding to the value information of the bit;

The chip module 801, in the aspect of determining the decoding state information for performing PBCH decoding according to the prior information, is specifically configured to determine the Viterbi according to the combination constraint information of the consecutive multiple bits. Decoded trellis structure information;

The chip module 801, in the aspect of determining the decoding state information for performing PBCH decoding according to the prior information, is specifically used for the value information of bits corresponding to the scheduling information of the SIB1-BR, determining the grid state information corresponding to the bit value information;

In one embodiment, the chip module 801, in the aspect of performing the PBCH decoding process according to the decoding state information, is specifically configured to exclude Witt according to the decoding state information and/or the metric method. than the branch paths in the decoded trellis graph that do not match the prior information;

In one embodiment, the chip module 801, in the aspect of performing the PBCH decoding process according to the decoding state information, is specifically configured to mark the Viterbi according to the decoding state information and/or the metric method. branch paths in the decoded trellis graph that match the prior information;

The chip module 801, in the aspect of obtaining the prior information corresponding to the PBCH decoding of the physical broadcast channel, is specifically configured to obtain the prior information corresponding to the PBCH decoding according to the communication scenario information of the terminal performing the network search processing;

The chip module 801, in the aspect of obtaining the prior information corresponding to the PBCH decoding of the physical broadcast channel, is specifically configured to obtain the prior information corresponding to the PBCH decoding according to the information of the cell where the terminal has successfully camped on .

The chip module 801, in the aspect of acquiring the prior information corresponding to the PBCH decoding of the physical broadcast channel, is specifically configured to acquire the PBCH decoding according to the communication scene information of the terminal performing the PBCH reading processing of the same-frequency adjacent cell. The prior information corresponding to the code;

In the embodiment of the present application, the module device may further include a communication interface (not shown in FIG. 8 ). The specific connection medium between the communication interface and the chip module 801 is not limited in the embodiment of the present application. In the embodiment of the present application, the communication interface and the chip module 801 are connected through a bus 802 in FIG. 8 . The bus is represented by a thick line in FIG. 8 . be limited. The bus 802 can be divided into an address bus, a data bus, a control bus, and the like. For ease of presentation, only one thick line is used in FIG. 8, but it does not mean that there is only one bus or one type of bus.

The above disclosures are only part of the embodiments of the present invention, and of course, the scope of the rights of the present invention cannot be limited by this. Those of ordinary skill in the art can understand all or part of the procedures for realizing the above embodiments, and make according to the claims of the present invention. The equivalent changes of the invention still belong to the scope covered by the invention.

Claims

A communication decoding method, characterized in that the method comprises:

Obtain the prior information corresponding to the PBCH decoding of the physical broadcast channel;

determining, according to the prior information, decoding state information for performing PBCH decoding processing;

Based on the decoding status information, a PBCH decoding process is performed.
The method according to claim 1, wherein the prior information is obtained according to the communication scene information of the terminal.
The method of claim 1, wherein the PBCH decoding is performed using a Viterbi decoding method;

The decoding status information includes any one or more of the following information:

Trellis diagram structure information of Viterbi decoding, trellis state information corresponding to the prior information, and state transition information corresponding to the prior information.
The method according to claim 1, wherein the prior information includes value information of at least one bit in a field corresponding to PBCH and/or combination constraint information of multiple consecutive bits in a field corresponding to PBCH .
The method of claim 4, wherein the field corresponding to the PBCH stores any one or multiple pieces of information in the following information:

System bandwidth information, configuration information of physical hybrid automatic repeat indication channel PHICH, system frame number SFN information, scheduling information of bandwidth-limited system information block 1 SIB1-BR, system message SI unchanged indication information, reserved Reserve domain information.
The method of claim 3, wherein the state transition information corresponding to the prior information comprises: branch metric information of the state transition path corresponding to the prior information.
The method of claim 6, wherein the prior information includes value information of at least one bit in a field corresponding to the PBCH;

The determining, according to the prior information, the decoding state information for performing PBCH decoding, including:

determining, according to the value information of the at least one bit, grid state information corresponding to the value information of the at least one bit;

According to the mesh state information corresponding to the value information of the at least one bit, the branch metric information of the state transition path corresponding to the value information of the at least one bit is determined.
The method according to claim 6, wherein the prior information comprises combination constraint information of a plurality of consecutive bits in a field corresponding to the PBCH;

The determining, according to the prior information, the decoding state information for performing PBCH decoding, including:

Determine the trellis diagram structure information of the Viterbi decoding according to the combination constraint information of the consecutive multiple bits;

The branch metric information of the state transition paths corresponding to the plurality of bits is determined according to the combination constraint information of the plurality of consecutive bits and the structure information of the trellis.
The method of claim 6, wherein the prior information includes value information of bits corresponding to the scheduling information of SIB1-BR in a field corresponding to the PBCH;

The determining, according to the prior information, the decoding state information for performing PBCH decoding, including:

Determine the grid state information corresponding to the bit value information according to the bit value information corresponding to the scheduling information of the SIB1-BR;

According to the mesh state information corresponding to the bit value information, the branch metric information of the state transition path corresponding to the bit value information is determined.
The method according to any one of claims 3-9, wherein the performing PBCH decoding processing according to the decoding state information comprises:

According to the decoding state information and/or the metric method, the branch paths that do not match the prior information in the trellis diagram of Viterbi decoding are excluded;

In the remaining branch paths, PBCH decoding is performed using Viterbi decoding.
The method according to any one of claims 3-9, wherein the performing PBCH decoding processing according to the decoding state information comprises:

marking, according to the decoding state information and/or the metric, branch paths that match the prior information in the Viterbi-decoded trellis graph;

PBCH decoding is performed using Viterbi decoding so that the surviving path contains the marked branch path.
The method according to claim 2, wherein the communication scene information of the terminal includes communication scene information of the terminal performing network search processing;

The obtaining a priori information corresponding to the PBCH decoding of the physical broadcast channel includes:

Acquire prior information corresponding to PBCH decoding according to the communication scenario information in which the terminal performs network search processing;

The prior information includes value information of bits corresponding to the system bandwidth information in the field corresponding to the PBCH.
The method of claim 2, wherein the communication scenario information of the terminal includes information of a cell where the terminal has successfully camped;

The obtaining a priori information corresponding to the PBCH decoding of the physical broadcast channel includes:

According to the cell information on which the terminal has successfully camped, the prior information corresponding to the PBCH decoding is acquired.
The method according to claim 2, wherein the communication scene information of the terminal comprises communication scene information of the terminal performing the PBCH reading process of the same-frequency adjacent cell;

The obtaining a priori information corresponding to the PBCH decoding of the physical broadcast channel includes:

Acquire prior information corresponding to PBCH decoding according to the communication scenario information that the terminal performs the PBCH reading process on the same-frequency adjacent cell;

The prior information includes value information of bits corresponding to the system bandwidth information in the field corresponding to the PBCH.
The method according to claim 9, wherein the prior information further includes system bandwidth information corresponding to PBCH; and the value information of bits corresponding to the scheduling information of the SIB1-BR is based on the system bandwidth information definite.
A communication decoding device, characterized in that the communication decoding device comprises: a storage device and a processor,

the storage device for storing program codes;

The processor, when invoking the stored code, is configured to execute the communication decoding method according to any one of claims 1-15.
A communication decoding device, characterized in that the communication decoding device comprises:

an acquisition module, used to acquire the prior information corresponding to the PBCH decoding of the physical broadcast channel;

a determining module, configured to determine decoding state information for performing PBCH decoding processing according to the prior information;

A decoding module, configured to perform PBCH decoding processing according to the decoding state information.
A computer-readable storage medium, characterized in that the computer-readable storage medium is used for storing a computer program, and the computer program causes a computer to execute the communication decoding method according to any one of claims 1-15.
A chip, characterized in that, the chip is used to obtain a priori information corresponding to physical broadcast channel PBCH decoding;

determining, according to the prior information, decoding state information for performing PBCH decoding processing;

Based on the decoding status information, a PBCH decoding process is performed.
A module device, characterized in that the module device comprises a chip module, wherein:

The chip module is used to obtain a priori information corresponding to physical broadcast channel PBCH decoding;

determining, according to the prior information, decoding state information for performing PBCH decoding processing;

Based on the decoding status information, a PBCH decoding process is performed.