CN111614441A - Decoding method, device, equipment and storage medium - Google Patents

Decoding method, device, equipment and storage medium Download PDF

Info

Publication number
CN111614441A
CN111614441A CN202010443472.XA CN202010443472A CN111614441A CN 111614441 A CN111614441 A CN 111614441A CN 202010443472 A CN202010443472 A CN 202010443472A CN 111614441 A CN111614441 A CN 111614441A
Authority
CN
China
Prior art keywords
decoding
predicted
current
information
descrambling
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202010443472.XA
Other languages
Chinese (zh)
Other versions
CN111614441B (en
Inventor
刘君
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangdong Oppo Mobile Telecommunications Corp Ltd
Original Assignee
Guangdong Oppo Mobile Telecommunications Corp Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Guangdong Oppo Mobile Telecommunications Corp Ltd filed Critical Guangdong Oppo Mobile Telecommunications Corp Ltd
Priority to CN202010443472.XA priority Critical patent/CN111614441B/en
Publication of CN111614441A publication Critical patent/CN111614441A/en
Application granted granted Critical
Publication of CN111614441B publication Critical patent/CN111614441B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045Arrangements at the receiver end
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045Arrangements at the receiver end
    • H04L1/0047Decoding adapted to other signal detection operation

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The application provides a decoding method, a device, equipment and a storage medium; the method comprises the following steps: demodulating the received current synchronous signal block to obtain current soft bit information corresponding to the current synchronous signal block; sequencing N prediction scrambling codes corresponding to the N prediction bit values based on the current soft bit information to obtain the sequenced N prediction scrambling codes; n is the power of 2; obtaining ith descrambling information based on the ith prediction scrambling code in the sequenced N prediction scrambling codes; wherein i is a positive integer greater than or equal to 1 and less than or equal to N; and decoding the ith descrambling information to obtain an ith decoding result, and when the ith decoding result passes the verification, taking the ith decoding result as the decoding result of the current synchronous signal block to finish the decoding of the current synchronous signal block. By the method and the device, decoding power consumption can be saved, and decoding efficiency is improved.

Description

Decoding method, device, equipment and storage medium
Technical Field
The present application relates to mobile communication technologies, and in particular, to a decoding method, apparatus, device, and storage medium.
Background
Currently, when a terminal acquires a system message of a cell on a Broadcast Channel of a 5G NR (5th-Generation New Radio) cell, a PBCH packet needs to be received on a Physical Broadcast Channel (PBCH). Because the scrambling code used by the sending end in the PBCH packet is unknown to the terminal, under the condition of poor channel condition, the terminal generally needs to perform blind descrambling on the PBCH packet one by one according to all possibilities of the scrambling code, then perform the next decoding according to the blind descrambling result, and finally verify whether the decoding result is normal. Therefore, the terminal usually needs to descramble and decode many times to finally obtain the content of the system message, and the decoding causes large power consumption and low decoding efficiency.
Disclosure of Invention
The embodiment of the application provides a decoding method, a decoding device and a storage medium, which can save decoding power consumption and improve decoding efficiency.
The technical scheme of the embodiment of the application is realized as follows:
an embodiment of the present application provides a method, including:
demodulating the received current synchronous signal block to obtain current soft bit information corresponding to the current synchronous signal block;
sequencing N prediction scrambling codes corresponding to the N prediction bit values based on the current soft bit information to obtain the sequenced N prediction scrambling codes; the N is a power of 2;
obtaining ith descrambling information based on the ith prediction scrambling code in the sequenced N prediction scrambling codes; wherein i is a positive integer greater than or equal to 1 and less than or equal to N;
and decoding the ith descrambling information to obtain an ith decoding result, and when the ith decoding result passes verification, taking the ith decoding result as the decoding result of the current synchronous signal block to finish decoding the current synchronous signal block.
An embodiment of the present application provides a decoding apparatus, including:
the demodulation module is used for demodulating the received current synchronization signal block to obtain current soft bit information corresponding to the current synchronization signal block;
the sequencing module is used for sequencing the N types of prediction scrambling codes corresponding to the N types of prediction bit values based on the current soft bit information to obtain the sequenced N types of prediction scrambling codes; wherein N is the power of 2;
a descrambling and merging module, configured to obtain an ith descrambling information based on an ith predicted scrambling code of the N sequenced predicted scrambling codes; wherein i is a positive integer greater than or equal to 1 and less than or equal to N;
and the decoding module is used for decoding the ith descrambling information to obtain an ith decoding result, and when the ith decoding result passes the verification, the ith decoding result is used as the decoding result of the current synchronization signal block to finish the decoding of the current synchronization signal block.
An embodiment of the present application provides a decoding apparatus, including:
a memory for storing executable instructions;
and the processor is used for realizing the method provided by the embodiment of the application when executing the executable instructions stored in the memory.
The embodiment of the application provides a storage medium, which stores executable instructions and is used for causing a processor to execute the executable instructions so as to realize the method provided by the embodiment of the application.
The embodiment of the application has the following beneficial effects: by sequencing the N kinds of predicted scrambling codes, the terminal can select the correct scrambling code in advance to descramble and decode the synchronous signal block in the next step, and then obtains the decoding result which can pass the verification in advance and finishes the decoding, thereby reducing unnecessary descrambling and decoding attempts, saving decoding power consumption and improving decoding efficiency.
Drawings
Fig. 1 is a diagram comparing PB CH encoding processes of lte (long Term evolution) and 5G NR provided in the embodiment of the present application;
fig. 2 is a schematic diagram of a process for descrambling a PBCH packet according to an embodiment of the present application;
FIG. 3-1 is a schematic diagram of a transmission sequence of scrambled SSB packets provided by an embodiment of the present application;
fig. 3-2 is a first schematic diagram illustrating a rule for soft bit data combining according to an embodiment of the present application;
fig. 3-3 are schematic diagrams illustrating a rule of soft bit data combining according to an embodiment of the present application;
fig. 3-4 are schematic diagrams illustrating a rule of soft bit data combining according to an embodiment of the present application;
fig. 4 is an alternative structural diagram of a communication system architecture provided by an embodiment of the present application;
fig. 5 is an alternative structural diagram of a terminal provided in an embodiment of the present application;
fig. 6 is an alternative flow chart of a decoding method provided in the embodiment of the present application;
fig. 7 is an alternative flow chart of a decoding method provided in the embodiment of the present application;
fig. 8 is an alternative flow chart of a decoding method provided in the embodiment of the present application;
fig. 9 is an alternative flowchart of a decoding method provided in an embodiment of the present application;
fig. 10 is a graph illustrating a euclidean distance versus a decoding success rate according to an embodiment of the present disclosure;
fig. 11 is an alternative flowchart of a decoding method provided in an embodiment of the present application;
fig. 12 is an alternative flowchart of a decoding method provided in the embodiment of the present application;
fig. 13 is an alternative flowchart of a decoding method provided in the embodiment of the present application;
fig. 14 is an alternative flowchart of a decoding method provided in an embodiment of the present application.
Detailed Description
In order to make the objectives, technical solutions and advantages of the present application clearer, the present application will be described in further detail with reference to the attached drawings, the described embodiments should not be considered as limiting the present application, and all other embodiments obtained by a person of ordinary skill in the art without creative efforts shall fall within the protection scope of the present application.
In the following description, reference is made to "some embodiments" which describe a subset of all possible embodiments, but it is understood that "some embodiments" may be the same subset or different subsets of all possible embodiments, and may be combined with each other without conflict.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein is for the purpose of describing embodiments of the present application only and is not intended to be limiting of the application.
Before further detailed description of the embodiments of the present application, terms and expressions referred to in the embodiments of the present application will be described, and the terms and expressions referred to in the embodiments of the present application will be used for the following explanation.
1) Synchronization Signal Block (SSB): the Primary Synchronization Signal (PSS), the Secondary Synchronization Signal (SSS), and the physical broadcast channel are included.
2) The System Frame Number (SFN), a Frame Number allocated by the transmitting end for the System Frame, and each PBCH packet is carried by a different System Frame and transmitted on the PBCH channel.
3)5G NR: a global 5G standard for a completely new air interface design based on Orthogonal Frequency Division Multiplexing (OFDM).
4) Half radio frame index: (HRF, Half Radio Frame), field index within a Radio Frame,
5) decoding: the reverse process of coding, meanwhile, removes the noise mixed in the bit stream in the transmission process, and demodulates, descrambles and decodes the modulated signal to obtain the information.
6) SFN LSB: SFN Least Significant Bits in SFN system frame number, SFN LSB of 5G NR mm wave transmission system are usually lower 3 Bits of SFN, and SFN LSB of non-mm wave transmission system is lower 2 Bits of SFN.
7) Hybrid Automatic Repeat Request (harq) caching: the receiving end is used for reserving the received hybrid automatic repeat request data so as to carry out the cache of data combination in the following.
8) polar coding: a linear block coding method based on channel polarization theory.
9) SSB MSB: the upper 8 bits of the system frame number of the SSB.
Before accessing a cell, a terminal first needs to acquire a system message of the cell and obtain configuration information of the cell, so that the terminal can normally access the cell and normally work in the cell. The system message of the cell is sent in the form of an SSB message packet on a physical broadcast channel PBCH, and after the terminal receives the SSB on the PBCH, the terminal needs to decode and descramble the SSB to obtain the system message content of the cell.
In the 5G NR, a periodic transmission mechanism of LTE is used to improve the demodulation success rate, but a blind detection scheme different from that adopted in LTE is used for detection of the PBCH channel. In LTE, PBCH packets are transmitted on a physical broadcast channel, a transmission period of each PBCH packet is 40ms, a sender retransmits the PBCH packets every 10ms within the 40ms period, and before sending the PBCH packets, the sender uses different redundancy versions to identify the low 1,2 bits of SFN and scrambles and encodes the entire PBCH encoded content, as shown in the LTE PBCH encoding process in fig. 1, including: s1001, adding a CRC check code at the tail of original PBCH data; s1002, carrying out cross convolutional coding and rate matching on the PBCH data added with the CRC to obtain coded PBCH data; s1003, scrambling all coded PBCH data by using a scrambling code generated according to the low 2 bits of the SFN to obtain scrambled and coded PBCH data; s1104, signal-modulating and remapping the scrambled data, so as to obtain a scrambled and encoded PBCH packet with a total size of 1920 bits. Thus, even if the channel conditions are good, the terminal of the LTE system needs to perform 4 attempts to descramble the PBCH packet according to 4 possible values of SFN.
In the 5G NR, the transmission period of the SSB packet is usually 80ms, the SSB packet is retransmitted every 20ms in the transmission period, and in order to avoid blind detection when the channel condition is good, the sending end scrambles and encodes the SSB packet, and only scrambles part of the PBCH content, as shown in the 5G NR encoding process in fig. 1, the process includes: s1101, scrambling is not carried out on the high-order 3 bits of HRF and SSB in PBCH and the low- order 2 or 3 bits of SFN by using the scrambling code generated according to the low-order 2 bits of the SFN, and only the remaining PBCH content is scrambled to obtain the scrambled PBCH data. S1102, adding a CRC (cyclic redundancy check) code at the tail of the scrambled PBCH; s1103, performing cross convolutional coding and rate matching on the scrambled PBCH data added with the CRC to obtain scrambled and coded PBCH data; s1104, the PBCH data after scrambling and coding is subjected to signal modulation and remapping, and finally a PBCH packet after scrambling and coding is obtained. Therefore, under the condition of good channel condition, the terminal can directly decode the SSB packet to obtain the SFN LSB value, further calculate the corresponding scrambling code according to the SFN LSB value, and finally obtain the decoding result by using the calculated scrambling code; when the channel condition is not ideal, the terminal usually cannot receive the decoding correctly through one-time SSB decoding, so it needs to descramble the current SSB packet by assuming the scrambling code corresponding to different SFN LSB values, and combine the current descrambling result with the soft bits of the previous multiple SSB descrambling results to obtain the final decoding result.
Specifically, a descrambling mode of the PBCH packet by the terminal in the 5G NR may be as shown in fig. 2, where fig. 2 shows a process of obtaining the PBCH information after descrambling, that is, only the coded PBCH information, from the scrambled and coded PBCH packet obtained in fig. 1, by removing the coded Scrambling Code (ESC) added by the xor operation during the Scrambling. Fig. 2 also shows a generating process of the ESC, wherein a Scrambling Code (SC) is generated from the SFN LSB and the Cell ID of the current Cell, the terminal adds all 0 bits of the head and CRC check codes at the tail to the information combination of the SC and SFN LSB through S2001 and S2002, respectively, and then performs polar coding on the data combination obtained in S2002 through S2003 to generate a Scrambling Code 200 (ESC). Because polar coding has linear characteristics, the PBCH packet can be obtained by scrambling the high-order 3 bits of HRF and SSB and the part except the low 2 or 3 bits of SFN in PBCH content by using scrambling code ESC, then polar coding is carried out on the whole PBCH content, and then the scrambling result and the coding result are combined; the scrambling code SC can be used to scramble the high-order 3 bits of HRF and SSB and the part of SFN other than the low 2 or 3 bits, and then polar coding is performed on the entire PBCH content obtained after scrambling. Regardless of the encoding sequence, the descrambling SSB packet can be obtained by removing the scrambling code ESC from the SSB packet, and the descrambling SSB packet needs to be further decoded to obtain the decoding. Since the SFN LSB is unknown to the terminal when the terminal receives the SSB packet, the terminal needs to try different ESCs corresponding to multiple possibilities of the SFNLSB to descramble the SSB packet, and further decode a descrambling result.
Based on fig. 1 and fig. 2, if the terminal fails to decode the SSB packet received for the first time, the SSB soft bit data after the first ESC descrambling and the subsequently retransmitted SSB soft bit data may be combined, and a decoding attempt may be made on the combined result. As the system frame number SFN of the sending end is changed according to the preset sequence when retransmitting each SSB packet, it is determined that different ESC scrambling codes used by each retransmitted SSB packet also follow the preset sequence of the system frame number SFN LSB, for example, as shown in fig. 3-1, the sending end scrambles the SSB packet sent first in the transmission period by using the ESC corresponding to the SFN LSB (0,0), the SSB packet sent second by using the ESC corresponding to the SFN LSB (0,1), the SSB packet sent third by using the ESC corresponding to the SFNLSB (1,0), and the SSB packet sent fourth by using the ESC corresponding to the SFN LSB (1, 1). Therefore, the terminal also needs to combine the soft bit data of different SSB packets according to the preset sequence, as shown in fig. 3-2, 3-3, and 3-4, ESC (0,0) represents ESC with SFN LSB of (0,0), ESC (0,1) represents ESC with SFN LSB of (0,1), ESC (1,0) represents ESC with SFN LSB of (1,0), ESC (1,1) represents ESC with SFN LSB of (1,1), so that when the terminal performs soft bit combination on the descrambled soft bit data corresponding to SSB1 packet and SSB2 packet in fig. 3-1, three decoding rounds can be performed according to three combining manners: a first merging manner is shown in fig. 3-2, a terminal merges SSB1 soft bit data after descrambling by an ESC (0,0) and SSB2 soft bit data after descrambling by the ESC (0,1) to obtain a first merging result, and the terminal performs a first round of decoding on the first merging result to verify whether the first round of decoding result can pass a Cyclic Redundancy Check (CRC); if the first round decoding result cannot pass the CRC check, performing a second merging manner, as shown in fig. 3-3, the terminal merges the SSB1 soft bit data after the ESC (0,1) descrambled with the SSB2 soft bit data after the ESC (1,0) descrambled to obtain a second merging result, and the terminal performs a second round decoding on the second merging result to verify whether the second round decoding result can pass the CRC check; if the second round decoding result cannot pass the CRC check, performing a third merging mode, as shown in fig. 3-4, the terminal merges the SSB1 soft bit data after the ESC (1,0) descrambled with the SSB2 soft bit data after the ESC (1,1) descrambled to obtain a third merging result, and the terminal performs a third round of decoding on the third merging result to verify whether the third round of decoding result can pass the CRC check; if any one of the three decoding rounds passes the CRC check, obtaining a decoding result, terminating the decoding of the SSB packet in the current transmission period, if none of the three decoding rounds can pass the CRC check, storing the descrambling result of each predicted ESC of all the current SSB packets, continuously receiving the next SSB packet, and descrambling and decoding again in the same method.
Based on the above, the present PBCH decoding scheme needs to decode the result of multiple descrambling, so as to complete the decoding by contacting the correct descrambling result. When the cell is initially searched and reselected, a plurality of selected PBCH packets need to be decoded at the same time, and the decoding times and decoding time are multiplied.
The embodiment of the present application provides a decoding method, an apparatus, a device, and a storage medium, which can save decoding power consumption and improve decoding efficiency. Next, an exemplary application when the decoding apparatus is implemented as a terminal will be explained.
Referring to fig. 4, fig. 4 is an alternative architecture diagram of a communication system 100 provided in the embodiment of the present application, where the communication system may include: a terminal 400 and a network device 102.
The terminal 400 may include various handheld devices, vehicle-mounted devices, wearable devices, computing devices or other processing devices connected to a wireless modem with wireless communication capabilities, as well as various forms of user equipment, Mobile Stations (MSs), terminals (terminal devices), and so forth. For convenience of description, the above-mentioned devices are collectively referred to as a terminal. The network device 102 and the terminal 400 communicate with each other via some air interface technology, for example, a Uu interface.
The network device 102 may be an evolved NodeB (eNB), an Access Point (AP), or a relay station in a Long Term Evolution (LTE) system, or may be a base station (e.g., a gNB or a Transmission Point (TRP)) in a 5G system, and in a 5G NR-U system, a device having a base station function is referred to as a gnnodeb or a gNB. The description of "base station" may change as communication technology evolves. The Network device 102 may also be a wireless controller in a Cloud Radio Access Network (CRAN) scenario, a Mobile switching center, a relay station, an Access Point, a vehicle-mounted device, a wearable device, a hub, a switch, a bridge, a router, or a Network device in a future communication System, and may also be a Base station in an NTN System (such as a gNB or a Transmission Point (TRP), a Global System for Mobile communication (GSM) System or a Base station in a Code Division Multiple Access (CDMA) System (Base transceiver station, BTS), and may also be a Base station in a Wideband Code Division Multiple Access (Wideband Code Division Multiple Access, WCDMA) System (NodeB, NB), and the like, which is not limited in this application.
In addition, in this embodiment of the present application, the network device 102 provides a service for a cell, and the terminal 400 communicates with the network device 102 through a transmission resource (for example, a frequency domain resource or a spectrum resource) used by the cell, where the cell may be a cell corresponding to the network device 102 (for example, a base station), and the cell may belong to a macro base station or a base station corresponding to a small cell (small cell), where the small cell may include: urban cell (etro cell), Micro cell (Micro cell), Pico cell (Pico cell), Femto cell (Femto cell), these small cells have the characteristics that coverage is little, transmission power is low, are applicable to and provide high-speed data transmission service. In addition, the cell may also be a super cell (supercell).
In the embodiment of the present application, multiple cells may simultaneously operate at the same frequency on a carrier in an LTE system or an NR system, and under some special scenarios, the concepts of the carrier and the cell may also be considered to be equivalent. For example, in a Carrier Aggregation (CA) scenario, when a secondary carrier is configured for a UE, the carrier index of the secondary carrier and a Cell identity (Cell identity, Cell ID) of a secondary Cell operating on the secondary carrier are carried at the same time, and in this case, the concepts of the carrier and the Cell may be considered to be equivalent, for example, it is equivalent that the UE accesses one carrier and one Cell.
Common channels and signals in the NR system, such as Synchronization Signal (SS) and physical broadcast channel, need to cover the whole cell by means of multi-beam scanning for UE reception in the cell. The multi-beam transmission of the synchronization signals is realized by defining SS/PBCH burst sets (SS/PBCH burst sets), one SS/PBCH burst set comprises one or more SS/PBCH blocks (SS/PBCH blocks), and one SS/PBCH block is used for carrying the synchronization signals and the physical broadcast channels of one beam; therefore, one SS/PBCH burst set can contain synchronization signals of N beams corresponding to the SS/PBCH block in the cell, and the maximum number L of the SS/PBCH block is related to the frequency band of the system. For example, when the frequency band of the system does not exceed 3GHz, the maximum number L of SS/PBCH blocks takes the value of 4; when the frequency band of the system is within the range of 3GHz and 6GHz, the maximum number L of SS/PBCH blocks is 8; when the frequency band of the system is in the range of 6GHz and 52.6GHz, the maximum number L of SS/PBCH blocks is 64.
In the NR system, one synchronization signal block is used to carry a synchronization signal of one beam and a broadcast channel, and SSBs of all beams in a cell included in one synchronization signal set.
The SSB is a set of time-frequency resources (resource units) transmitted on the basic OFDM grid, and includes a primary synchronization signal, a secondary synchronization signal, and a physical broadcast channel.
Referring to fig. 5, fig. 5 is a schematic structural diagram of a terminal 400 provided in an embodiment of the present application, where the terminal 400 shown in fig. 5 includes: at least one processor 410, memory 450, at least one network interface 420, and a user interface 430. The various components in the terminal 400 are coupled together by a bus system 440. It is understood that the bus system 440 is used to enable communications among the components. The bus system 440 includes a power bus, a control bus, and a status signal bus in addition to a data bus. For clarity of illustration, however, the various buses are labeled as bus system 440 in fig. 5.
The Processor 410 may be an integrated circuit chip having Signal processing capabilities, such as a general purpose Processor, a Digital Signal Processor (DSP), or other programmable logic device, discrete gate or transistor logic device, discrete hardware components, or the like, wherein the general purpose Processor may be a microprocessor or any conventional Processor, or the like.
The user interface 430 includes one or more output devices 431, including one or more speakers and/or one or more visual displays, that enable the presentation of media content. The user interface 430 also includes one or more input devices 432, including user interface components that facilitate user input, such as a keyboard, mouse, microphone, touch screen display, camera, other input buttons and controls.
The memory 450 includes either volatile memory or nonvolatile memory, and may include both volatile and nonvolatile memory. The non-volatile Memory may be a Read Only Memory (ROM), and the volatile Memory may be a Random Access Memory (RAM). The memory 450 described in embodiments herein is intended to comprise any suitable type of memory. Memory 450 optionally includes one or more storage devices physically located remote from processor 410.
In some embodiments, memory 450 is capable of storing data, examples of which include programs, modules, and data structures, or a subset or superset thereof, to support various operations, as exemplified below.
An operating system 451, including system programs for handling various basic system services and performing hardware-related tasks, such as a framework layer, a core library layer, a driver layer, etc., for implementing various basic services and handling hardware-based tasks;
a communications module 452 for communicating to a base station or other computing device in mobile communications via one or more (wired or wireless) network interfaces 420, an exemplary network interface 420 comprising: radio frequency communication interface, bluetooth, wireless compatibility authentication (WiFi), Universal Serial Bus (USB), and the like;
a display module 453 for enabling presentation of information (e.g., user interfaces for operating peripherals and displaying content and information) via one or more output devices 431 (e.g., display screens, speakers, etc.) associated with user interface 430;
an input processing module 454 for detecting one or more user inputs or interactions from one of the one or more input devices 432 and translating the detected inputs or interactions.
In some embodiments, the apparatus provided in the embodiments of the present application may be implemented in software, and fig. 5 illustrates an apparatus 455 stored in the memory 450, which may be software in the form of programs and plug-ins, and includes the following software modules: a demodulation module 4551, a sorting module 4552, a descrambling and combining module 4553, and a decoding module 4554, functions of which will be described below.
In other embodiments, the decoding apparatus provided in the embodiments of the present Application may be implemented in hardware, and by way of example, the decoding apparatus provided in the embodiments of the present Application may be a processor in the form of a hardware decoding processor, which is programmed to execute the decoding method provided in the embodiments of the present Application, for example, the processor in the form of the hardware decoding processor may employ one or more Application Specific Integrated Circuits (ASICs), DSPs, Programmable Logic Devices (PLDs), Complex Programmable Logic Devices (CPLDs), Field Programmable Gate Arrays (FPGAs), or other electronic components.
In the following, the decoding method provided by the embodiment of the present application will be described in conjunction with exemplary applications and implementations of the terminal provided by the embodiment of the present application.
Referring to fig. 6, fig. 6 is an alternative flowchart of a decoding method provided in the embodiment of the present application, which will be described with reference to the steps shown in fig. 6.
S101, demodulating the received current synchronous signal block to obtain current soft bit information corresponding to the current synchronous signal block.
The decoding method provided by the embodiment of the application is suitable for a scene of receiving PBCH broadcast channel messages in a 5G NR cell, and can be applied to millimeter wave frequency bands and non-millimeter wave frequency bands.
In the embodiment of the application, when the terminal accesses the cell, the terminal monitors the PBCH of the target cell to be accessed, receives the current synchronization signal block transmitted on the PBCH, so as to decode the system broadcast message of the cell and obtain the configuration information of the target cell to be accessed.
In the embodiment of the present application, a current synchronization signal block received by a terminal from a channel is usually a modulation signal, so the terminal needs to demodulate the synchronization signal block first, and a demodulation algorithm may calculate current soft bit information of the current synchronization signal block by using a Log Likelihood Ratio (LLR) based on a maximum a posteriori probability criterion.
In the embodiment of the present application, the log-likelihood ratio is a natural log representation form of a probability ratio that a receiving end, that is, a terminal, correctly determines a bit symbol in a modulation signal to be 0 or correctly determines the bit symbol to be 1, that is, soft bit information obtained according to the log-likelihood ratio is based on a certain probability random process model, and a quantization guess is made for each bit included in the modulation signal, so as to obtain an estimated value of the log-likelihood ratio form of each bit.
In some embodiments, the current synchronization signal block may be an SSB block transmitted by the 5G NR cell on the PBCH channel, wherein the transmission period of the SSB block may be 80ms and the SSB block is retransmitted every 20ms, so that the terminal may retransmit SSB packets with consistent PBCH content 4 times in one transmission period. The soft bit information is LLR information obtained by the terminal after the terminal demodulates the SSB packet.
S102, sequencing N prediction scrambling codes corresponding to the N prediction bit values based on the current soft bit information to obtain the sequenced N prediction scrambling codes; where N is the power of 2.
In the embodiment of the present application, after the terminal demodulates the current synchronization signal block to obtain the current soft bit information, the terminal needs to further descramble and decode the current soft bit information to obtain the decoded content. The scrambling code used by the current synchronization signal block at the sending end is unknown to the terminal, but the scrambling code used by the sending end for each synchronization signal block is generated according to the value of the preset bit in the synchronization signal block, so the terminal can predict the value of the preset bit, for example, in a non-millimeter wave frequency band, the preset bit can be the SFN LSB bit contained in the PBCH message, that is, the low 2 bits of the SFN, and there can be 4 kinds of predicted bit values for the SFN LSB: (0,0), (0,1), (1,0) and (1, 1); the 4 predicted bit values may correspond to 4 predicted scrambling codes for generating the current synchronization signal block, which are: ESC (0,0), ESC (0,1), ESC (1,0) and ESC (1,1), the terminal station uses the 4 kinds of prediction scramble codes corresponding to the 4 kinds of prediction bit values as N kinds of prediction scramble codes corresponding to the N kinds of prediction bit values.
In the embodiment of the application, the decoding process is a process of continuously retransmitting and combining until the decoding CRC is correct, that is, the earlier the terminal descrambles the current soft bit information by using the correct predicted scrambling code, the earlier the terminal can decode the current soft bit information according to the correct descrambling information, and thus the decoding of the current synchronization signal block is finished by passing the decoding check more quickly. Therefore, in order to reduce system power consumption caused by multiple decoding and improve decoding efficiency, the terminal may sort the N kinds of predicted scrambling codes corresponding to the N kinds of predicted bit values according to the high or low probability of successful descrambling based on the current soft bit information, so as to obtain the N kinds of sorted predicted scrambling codes. Thus, the terminal can preferentially use the predicted scrambling code with high descrambling success probability to descramble the current soft bit information.
In the embodiment of the application, the current soft bit information and the actual bit information in the content of the PBCH message are in a mapping relation, so that the terminal can sort the N kinds of prediction scrambling codes in the sequence of the Euclidean distances from near to far based on the Euclidean distances between the current soft bit information and the prediction bit values corresponding to each kind of prediction scrambling codes to obtain the sorted N kinds of prediction scrambling codes; or, when the terminal can also sort the N kinds of predicted scrambling codes in the order of the likelihood from large to small based on the likelihood between the descrambling result of the current soft bit information and the soft bit information of the last synchronization signal block by each kind of predicted scrambling codes, so as to obtain the N kinds of sorted predicted scrambling codes.
In the embodiment of the application, when the current synchronization signal block is the first synchronization signal block, the terminal may sort the N kinds of prediction scrambling codes based on the above euclidean distance sorting manner to obtain the sorted N kinds of prediction scrambling codes; when the current synchronization signal block is not the first synchronization signal block, the terminal may sort the N kinds of predicted scrambling codes based on the euclidean distance, or based on the above likelihood sorting manner, to obtain the sorted N kinds of predicted scrambling codes. The selection is specifically performed according to actual conditions, and the embodiment of the application is not limited.
S103, obtaining ith descrambling information based on the ith prediction scrambling code in the sequenced N prediction scrambling codes; wherein i is a positive integer greater than or equal to 1 and less than or equal to N.
In the embodiment of the application, after the terminal obtains the N kinds of sequenced predicted scrambling codes, the ith descrambling information may be obtained based on the ith kind of predicted scrambling codes. Wherein i is a positive integer greater than or equal to 1 and less than or equal to N.
In the embodiment of the application, the terminal can directly descramble the current soft bit information by using the ith prediction scrambling code to obtain the ith descrambling information; or combining the current descrambling information obtained by descrambling the current soft bit information by using the ith prediction scrambling code with the descrambling information corresponding to the last synchronization signal block to obtain the ith descrambling information.
S104, decoding the ith descrambling information to obtain an ith decoding result, and when the ith decoding result passes the verification, taking the ith decoding result as the decoding result of the current synchronous signal block to finish the decoding of the current synchronous signal block.
In the embodiment of the application, after the terminal obtains the ith descrambling information, the decoding is carried out on the ith descrambling information, and the decoding result is used as the ith decoding result.
In the embodiment of the present application, the terminal performs CRC check on the ith decoding result, and when the ith decoding result passes the check, it indicates that the ith decoding result is correct decoding, and the terminal takes the ith decoding result as the decoding result of the current synchronization signal block, and finishes decoding the current synchronization signal block.
It can be understood that, in the embodiment of the present application, by sorting the N kinds of predicted scrambling codes, the terminal may select a correct scrambling code in advance to descramble and decode the synchronization signal block, and further obtain a decoding result that can pass the verification in advance and end the decoding, thereby reducing unnecessary descrambling and decoding attempts, saving decoding power consumption, and improving decoding efficiency.
In some embodiments, referring to fig. 7, fig. 7 is an optional flowchart of the method provided in the embodiments of the present application, and S102 shown in fig. 6 may be implemented by S1021 to S1023, which will be described with reference to the steps.
S1021, when the current synchronous signal block is a non-first synchronous signal block, acquiring a previous descrambling information set corresponding to a previous synchronous signal block; the last descrambling information set is obtained by decoding the soft bit information of the last synchronous signal block through N kinds of prediction scrambling codes.
In S1021, after obtaining the current soft bit information, the terminal checks whether the descrambled soft bit information of the previous sync signal block exists in the preset storage space, so as to determine whether the current sync signal block is the first sync signal block.
And when the current synchronous signal block is not the first synchronous signal block, the terminal acquires the descrambling information set corresponding to the last synchronous signal block as the last descrambling information set.
In the embodiment of the present application, the previous descrambling information set is a set formed by N previous descrambling information, where the previous synchronization signal is obtained by decoding N types of predicted scrambling codes.
In some embodiments, the predetermined storage space may be a harq cache.
S1022, based on the current soft bit information and the last descrambling information set, sorting the N kinds of predicted scrambling codes to obtain the sorted N kinds of predicted scrambling codes.
In S1022, after the terminal obtains the previous descrambling information set, the N types of predicted scrambling codes are ranked based on the current soft bit information and the previous descrambling information set, so as to obtain the ranked N types of predicted scrambling codes.
In some embodiments, referring to fig. 8, fig. 8 is an optional flowchart of the method provided in the embodiments of the present application, and S1022 shown in fig. 7 may be implemented by S301 to S304, which will be described with reference to each step.
S301, descrambling the current soft bit information by using the j type of prediction scrambling codes in the N types of prediction scrambling codes to obtain j type of current descrambling information corresponding to the j type of prediction scrambling codes; wherein j is a positive integer greater than or equal to 1 and less than or equal to N.
In the embodiment of the application, the terminal descrambles the current soft bit information by using each of the N kinds of predicted scrambling codes to obtain the current descrambling information corresponding to each kind of predicted scrambling codes. Specifically, the jth predicted scrambling code corresponds to the jth current descrambling information.
In some embodiments, 4 predicted scrambling codes are used for SFN LSBs with 2-bit predicted bit values: (0,0), (0,1), (1,0), and (1,1), when j is 1, the terminal may use the prediction scrambling code ESC (0,0) corresponding to SFN LSB (0,0) as the j-th prediction scrambling code, and descramble the current soft bit information using ESC (0,0), so as to obtain the j-th current descrambling information; when j is 2, the terminal takes a prediction scrambling code ESC (0,1) corresponding to SFN LSB (0,1) as a j-th prediction scrambling code, and uses ESC (0,1) to descramble the current soft bit information to obtain j-th current descrambling information; and so on.
S302, determining jth previous descrambling information corresponding to the jth predicted scrambling code in the jth previous descrambling information set according to the jth predicted scrambling code; the jth last descrambling information is the last descrambling information corresponding to the last scrambling code of the jth predicted scrambling code in the preset sending sequence; the jth predicted scrambling code corresponds to the jth last descrambling information.
In this embodiment, based on the soft bit combining rule shown in fig. 3, when the terminal performs soft bit combining, according to the preset sending sequence of the sending end and the jth predicted scrambling code, the previous scrambling code of the jth predicted scrambling code in the preset sending sequence is determined, and then the previous descrambling information corresponding to the previous scrambling code in the previous descrambling information set is soft bit combined with the jth current descrambling information. Therefore, in S302, the terminal may determine, according to the j-th predicted scrambling code of the N predicted scrambling codes, the j-th previous descrambling information corresponding to the j-th predicted scrambling code in the previous descrambling information set. And the jth previous descrambling information is the previous descrambling information corresponding to the previous scrambling code of the jth predicted scrambling code in the preset sending sequence.
S303, carrying out correlation calculation on the jth current descrambling information and the jth previous descrambling information to obtain the likelihood of the jth prediction scrambling code, thereby obtaining the likelihood of each prediction scrambling code in the N prediction scrambling codes.
In S303, the specific method for the terminal to calculate the correlation between the jth current descrambling information and the jth previous descrambling information to obtain the likelihood of the jth predicted scrambling code may be as shown in formula (1), as follows:
Figure BDA0002504776350000111
in the formula (1), LLRj,n,iIn the nth retransmission, the terminal receives the jth current descrambling information (generally 864 bits) obtained by descrambling the current soft bit value with the jth predictive coding scrambling code, wherein n is greater than or equal to 1. LLRj,n-1,iAnd the current descrambling information is the jth last descrambling information corresponding to the jth current descrambling information. Metric (j) is the calculated likelihood of the j-th predicted scrambling code. And the terminal multiplies each bit value in the jth current descrambling information by the corresponding bit value in the jth previous descrambling information one by one according to a formula (1), and the sum of all multiplication results is used as the likelihood of the jth predicted scrambling code.
After the terminal obtains the likelihood of the j-th prediction scrambling code, the likelihood of each prediction scrambling code in the N prediction scrambling codes can be obtained in the same way.
It can be seen that the likelihood of each kind of predicted scrambling codes represents the similarity between PBCH descrambling information of two transmissions corresponding to the predicted scrambling codes, and in an ideal case, when descrambling with a wrong predicted scrambling code, the mean value of metric (j) is 0; when descrambling with the correct predicted scrambling code, the mean value of metric (j) is 864, which is a significant difference compared to using the wrong ESC.
S304, sorting the N predicted scrambling codes according to the likelihood of each predicted scrambling code to obtain the N sorted predicted scrambling codes.
In the embodiment of the application, the likelihood of each type of predicted scrambling code represents the similarity between the PBCH descrambling information of two transmissions corresponding to the predicted scrambling code, and the higher the likelihood is, the higher the possibility that the corresponding predicted scrambling code can be descrambled correctly is. Therefore, after the terminal obtains the likelihood of each type of predicted scrambling code, the N types of predicted scrambling codes can be ranked according to the order of the likelihood of each type of predicted scrambling code from top to bottom, and the N types of ranked predicted scrambling codes are obtained.
It can be understood that, in the embodiment of the present application, the terminal may measure the descrambling success rate of each predicted scrambling code according to the likelihood between PBCH descrambling information transmitted twice before and after each predicted scrambling code, so that, after N kinds of predicted scrambling codes are sorted according to the order of likelihood from top to bottom, the terminal may descramble based on the predicted scrambling code with the highest likelihood, that is, the predicted scrambling code with the highest descrambling success rate, so as to reach the correct descrambling result more quickly, and improve the descrambling efficiency and the descrambling speed.
In this embodiment of the application, based on fig. 7, in S103, according to the ith predicted scrambling code of the N sequenced predicted scrambling codes, the obtained ith descrambling information may specifically be:
and S1031, combining the ith current descrambling information corresponding to the sorted ith prediction scrambling code with the ith previous descrambling information by soft bit data, and taking the data combination result as the ith descrambling information.
In the embodiment of the application, after the terminal obtains the N kinds of sequenced predicted scrambling codes, soft bit data merging can be performed on the ith current descrambling information corresponding to the i-th predicted scrambling code after sequencing and the ith previous descrambling information according to the sequence of the N kinds of predicted scrambling codes, and the data merging result is used as the ith descrambling information. For further decoding.
In step S1031, the ith current descrambling information and the ith previous descrambling information may be from the same beam, have the same SSB index, and are different only from the SFN LSB; the beams may also be from different beams, and SSB index and SFNLSB are different, and the embodiment of the present application is not limited.
It can be understood that, in the embodiment of the present application, when the current synchronization signal block is a non-first synchronization signal block, the terminal may evaluate the possibility of successfully descrambling each type of predicted scrambling code through the similarity between the current soft bit information and the previous descrambling information set, and thus rank the N types of predicted scrambling codes, and the terminal decodes the descrambling information by using the ranked N types of predicted scrambling codes, so that the terminal can more quickly contact with correct descrambling information, obtain a decoding result in advance, and end decoding of PBCH information, thereby saving decoding power consumption and improving decoding efficiency.
S1023, when the current synchronous signal block is the first synchronous signal block, sequencing the N kinds of prediction scrambling codes based on the Euclidean distance between the current soft bit information and the N kinds of prediction bit values to obtain the sequenced N kinds of prediction scrambling codes.
In S1023, since the current soft bit information includes the soft bit information actually corresponding to the SFB LSB, and the N predicted scrambling codes are generated from the N predicted bit values corresponding to the SFB LSB, the terminal may evaluate the correlation between the soft bit information actually corresponding to the SFB LSB and the N predicted scrambling codes according to the soft bit information actually corresponding to the SFB LSB in the current soft bit information, and order the predicted scrambling codes with higher correlation in the front.
In the embodiment of the application, the terminal may use a method of calculating the euclidean distance to order the N kinds of predicted scrambling codes based on the current soft bit information and the N kinds of predicted bit values, so as to obtain the N kinds of predicted scrambling codes after the ordering.
It can be seen that, based on the current soft bit information and the N predicted bit values, the method for sorting the N predicted scrambling codes may be applied to both the first synchronization signal block received by the terminal and the non-first synchronization signal block received by the terminal, in some embodiments, refer to fig. 9, fig. 9 is an optional flowchart of the method provided in the embodiment of the present application, and S102 shown in fig. 6 or "sorting the N predicted scrambling codes based on the euclidean distance between the current soft bit information and the N predicted bit values in S1023 shown in fig. 7" to obtain the sorted N predicted scrambling codes "may be implemented by S201 to S203, which will be described with reference to each step.
S201, obtaining current sub soft bit information corresponding to the N predicted bit values from the current soft bit information.
In S201, the terminal obtains soft bit information on bits corresponding to the N kinds of predicted bit values from the current soft bit information as current sub-soft bit information.
Illustratively, the bits corresponding to the N predicted bit values are SFN LSB bits, and the terminal obtains the soft bit information corresponding to the SFN LSB bits in the current soft bit information as the current soft bit information.
S202, carrying out the exclusive OR operation on the current sub soft bit information and each predicted bit value to obtain the Euclidean distance corresponding to each predicted bit value.
In S202, the terminal may perform an exclusive or operation on the current sub soft bit information and each predicted bit value according to formula (2), to obtain an euclidean distance corresponding to each predicted bit value, as follows:
Metric(j)=H(j)⊙H0 (2)
in formula (2), H (j) is the j-th predicted bit value, H (0) is the current sub-soft bit information, and metric (j) is the same bit value of the j-th predicted bit value as the corresponding bit in the current sub-soft bit information. As can be seen from equation (2), the more the predicted bit value is the same as the current sub soft bit information, the larger metric (j) is, the smaller the corresponding euclidean distance is.
In the embodiment of the present application, in the same manner, the terminal may obtain the euclidean distance corresponding to each predicted bit value according to formula (2).
In some embodiments, the graph of the euclidean distance versus the decoding success rate may be as shown in fig. 10, and as can be seen from fig. 10, in the case that the predicted bit value contains 2-bit data, the euclidean distance D between each predicted bit value and the current sub-soft bit information may have three values, which are respectively: d ═ 0, D ═ 1, and D ═ 2. As can be seen from the graph of fig. 10, when the SIGNAL-to-NOISE RATIO (SNR) is greater than-10 dB, that is, when the channel condition is not ideal, the decoding success rates corresponding to different euclidean distances D are significantly different, and the decoding success rate curve corresponding to the euclidean distance D equal to 0 goes up significantly compared to the decoding success rate curves corresponding to D equal to 1 and D equal to 2. That is, the smaller the euclidean distance between each predicted bit value and the current sub soft bit information is, the higher the success rate of descrambling by the terminal using the scrambling code corresponding to the predicted bit value and further completing CRC decoding is.
S203, sequencing the prediction scrambling codes corresponding to each prediction bit value according to the Euclidean distance of each prediction bit value to obtain N kinds of sequenced prediction scrambling codes.
It can be understood that, in the embodiment of the present application, since the scrambling code actually used by the current synchronization signal block is generated by a bit value on a preset bit, the terminal can obtain the confidence level of successful descrambling of each predicted scrambling code based on the euclidean distance between the predicted bit value corresponding to each predicted scrambling code and the current sub-soft bit information corresponding to the preset bit, and thus the terminal can descramble the current soft bit information by using the predicted scrambling code with high confidence level, and can contact the correct descrambling result more quickly, thereby improving the descrambling efficiency and the descrambling speed.
In some embodiments, referring to fig. 11, fig. 11 is an optional flowchart of the method provided in the embodiments of the present application, and after S104 shown in fig. 6, S108-S109 may be further included, as follows:
and S108, when the ith decoding result is not verified, storing the ith descrambling information in a preset storage space.
In S108, when the ith decoding result fails to pass the verification, it indicates that the descrambling result corresponding to the ith predicted scrambling code is incorrect, and the terminal may store the ith descrambling information in a preset storage space for combining with the descrambling information in the next synchronization signal block.
S109, continuing descrambling and decoding based on the sorted (i + 1) th prediction scrambling code until the (i +1+ M) th decoding result passes the verification, taking the (i +1+ M) th decoding result as the decoding result of the current synchronization signal block, and ending the decoding of the current synchronization signal block, wherein M is a positive integer which is more than or equal to zero and less than or equal to N-1-i.
In S109, when the ith decoding result fails to be verified, the terminal continues to perform descrambling and decoding for the next time among the N kinds of sequenced predicted scrambling codes according to the (i + 1) th predicted scrambling code, and verifies whether the (i + 1) th decoding result passes the verification, and the descrambling, decoding and verifying processes are consistent with those of S103 and S104, which is not described herein again.
In the embodiment of the application, the terminal iterates the descrambling, decoding and verifying processes according to the sequence of the sequenced N kinds of prediction scrambling codes until the (i +1+ M) th decoding result passes the verification, and takes the (i +1+ M) th decoding result as the decoding result of the current synchronization signal block to finish the decoding of the current synchronization signal block.
In the embodiment of the application, M is a positive integer which is greater than or equal to zero and less than or equal to N-1-i.
In some embodiments, referring to fig. 12, fig. 12 is an optional flowchart of the method provided in the embodiments of the present application, and based on fig. 11, after obtaining the i +1 th decoding result based on the i +1 th predicted scrambling code in S109, S110 may be further performed, as follows:
and S110, when i +1+ M is larger than N, receiving the next synchronous signal block, and performing the next decoding by taking the next synchronous signal block as the current synchronous signal block.
In S110, when i +1+ M is greater than N, it indicates that the terminal cannot obtain a correct decoding result according to any of the N kinds of ordered predicted scrambling codes, so that the terminal stops blind descrambling of the current signal block, starts receiving the next synchronization signal block in the same transmission period, regards the next synchronization signal block as the current synchronization signal block, and performs the next round of decoding.
In the embodiment of the present application, the process of the terminal performing the next decoding is the same as the method of S101-S109, and is not described herein again.
In this embodiment of the present application, if all the synchronization signal blocks in the same transmission period cannot obtain the decoding result passing the CRC check, the terminal fails to receive the system message in the transmission period, clears the preset storage space, and starts receiving the synchronization signal block in the next transmission period.
In some embodiments, referring to fig. 13, fig. 13 is an optional flowchart of the method provided in the embodiments of the present application, and based on fig. 6, after S101, S105-S107 may be further performed, as follows:
and S105, decoding the current soft bit information to obtain pre-decoding information.
In S105, under the condition of good channel condition, the decoding accuracy is usually higher, so the terminal may decode the current soft bit information first to obtain the pre-decoding information.
In the embodiment of the present application, the pre-decoding information may be PBCH information that is obtained by decoding the PBCH information after scrambling and encoding, and is decoded but not descrambled.
And S106, when the pre-decoding information passes verification, obtaining a scrambling code corresponding to the current synchronous signal block according to the pre-decoding information.
In S106, the terminal performs CRC check on the directly decoded pre-decoding information, and when the pre-decoding information passes the CRC check, it indicates that the pre-decoding information is correctly decoded, so that the terminal can obtain the corresponding PBCH unscrambled content in the pre-decoding information, where the PBCH unscrambled content includes the bit value of the SFN LSB field corresponding to the scrambling code. Thus, the terminal can reversely deduce the scrambling code used by the transmitting terminal in the current synchronization signal block according to the pre-decoding information.
S107, descrambling the pre-decoding information by using the scrambling code, taking the descrambled pre-decoding information as the decoding result of the current synchronous signal block, and finishing the decoding of the current synchronous signal block.
In S107, after the terminal obtains the scrambling code, the terminal may descramble the pre-decoding information using the scrambling code, so as to obtain a decoded and descrambled decoding result, and as a decoding result of the current synchronization signal block, finish decoding the current synchronization signal block.
Next, an exemplary application of the embodiment of the present application in a practical application scenario will be described.
The terminal receives the SSB packet on the PBCH channel superimposed with the white gaussian noise, scans from-15 dB to-10 dB in SNR, and decodes the received SSB packet by the method in S401-S415 as shown in fig. 14, and if the decoding method provided by the embodiment of the present application is not used, the soft bit information after descrambling by PBCH needs to be combined for correct decoding 2 times, and after the decoding method provided by the embodiment of the present application is used, correct decoding can be obtained only by the soft bit information after descrambling by PBCH 1 time. S401-S415 are specifically as follows:
s401, the terminal starts a decoding function.
S402, the terminal receives an SSB and generates current soft bit information based on the received current SSB.
The method in S402 is the same as that described in S101, and is not described here again.
S403, the terminal directly decodes the current soft bit information to obtain pre-decoding information.
The method in S403 is consistent with the description of S105, and is not described herein again.
S404, the terminal verifies whether the first decoding result can pass CRC check. If so, go to S414, otherwise, go to S405.
S405, the terminal judges whether the current SSB is the first SSB received by the terminal, if so, S406 is executed, otherwise, the terminal directly enters S407 to continue execution.
S406, when the current SSB is the first SSB, the terminal descrambles the current soft bit information by using the N kinds of predicted scrambling codes to obtain N kinds of descrambling results, and stores the N kinds of descrambling results into a cache. After that, the terminal returns to S402 to continue receiving the next SSB.
S407, the terminal sorts the N kinds of prediction scrambling codes by adopting a likelihood sorting or Euclidean distance sorting mode based on the current soft bit information to obtain the sorted N kinds of prediction scrambling codes.
The method in S407 is consistent with the description of S102, and is not described herein again.
S408, the terminal descrambles the current soft bit information based on the ith prediction scrambling code in the sequenced N prediction scrambling codes to obtain the ith current descrambling information.
S409, the terminal conducts soft bit data combination on the ith current descrambling information and the ith previous descrambling information in the cache, and the data combination result is used as the ith descrambling information.
The method in S409 is consistent with the description of S1031, and is not described herein again.
S410, the terminal decodes the ith descrambling information to obtain an ith decoding result.
S411, the terminal verifies whether the ith decoding result can pass CRC check. If so, go to S415, otherwise, go to S412.
S412, the terminal judges whether i is smaller than N. If so, executing S413, otherwise, returning to step S402, starting to receive the next SSB, and performing a new round of decoding until the decoding is successful or the SSB reception is completed.
S413, the terminal adds 1 to the value of i, and returns to the step S408 to descramble the next predicted scrambling code in the sequenced N predicted scrambling codes.
And S414, the terminal obtains the scrambling code according to the pre-decoding information, descrambles the pre-decoding information by using the scrambling code to obtain the decoding result of the current SSB, and finishes decoding.
The method in S414 is consistent with the description of S106 and S107, and is not described here again.
S415, the terminal succeeds in decoding and finishes decoding the current synchronization signal block.
It should be noted that, in the millimeter wave band, since the SSB MSB and the 2-bit or 3-bit SFN LSB of the millimeter wave band are unknown to the terminal, the number of all the predicted scrambling codes to be blind-detected is 32, and if the scheme is used, the beneficial effect will be more obvious.
Continuing with the exemplary structure of the decoding apparatus 455 provided by the embodiments of the present application implemented as software modules, in some embodiments, as shown in fig. 5, the software modules stored in the decoding apparatus 455 of the memory 450 may include:
a demodulation module 4551, configured to demodulate a received current synchronization signal block to obtain current soft bit information corresponding to the current synchronization signal block;
a sorting module 4552, configured to sort, based on the current soft bit information, the N prediction scrambling codes corresponding to the N prediction bit values to obtain N sorted prediction scrambling codes; wherein N is the power of 2;
a descrambling and merging module 4553, configured to obtain an ith descrambling information based on the ith predicted scrambling code of the N sequenced predicted scrambling codes; wherein i is a positive integer greater than or equal to 1 and less than or equal to N;
a decoding module 4554, configured to decode the ith descrambling information to obtain an ith decoding result, and when the ith decoding result passes the verification, take the ith decoding result as the decoding result of the current synchronization signal block, and end the decoding of the current synchronization signal block.
In some embodiments of the present application, the sorting module 4552 is further configured to, when the current synchronization signal block is a non-first synchronization signal block, obtain a last descrambling information set corresponding to a last synchronization signal block; the last descrambling information set is obtained by decoding the soft bit information of the last synchronous signal block through the N types of prediction scrambling codes; sorting the N kinds of predicted scrambling codes based on the current soft bit information and the last descrambling information set to obtain the N kinds of sorted predicted scrambling codes; and when the current synchronization signal block is the first synchronization signal block, sequencing the N kinds of prediction scrambling codes based on Euclidean distances between the current soft bit information and the N kinds of prediction bit values to obtain the sequenced N kinds of prediction scrambling codes.
In some embodiments of the present application, the sorting module 4552 is further configured to obtain current sub soft bit information corresponding to the N predicted bit values from the current soft bit information; carrying out the exclusive-nor operation on the current sub soft bit information and each predicted bit value to obtain the Euclidean distance corresponding to each predicted bit value; and sequencing the predicted scrambling codes corresponding to each predicted bit value according to the Euclidean distance of each predicted bit value to obtain the N kinds of sequenced predicted scrambling codes.
In some embodiments of the present application, the sorting module 4552 is further configured to descramble the current soft bit information by using a j-th predicted scrambling code of the N predicted scrambling codes, so as to obtain a j-th current descrambling information corresponding to the j-th predicted scrambling code; wherein j is a positive integer greater than or equal to 1 and less than or equal to N; determining the jth previous descrambling information corresponding to the jth predicted scrambling code in the previous descrambling information set according to the jth predicted scrambling code; the jth previous descrambling information is the previous descrambling information corresponding to the previous scrambling code of the jth predicted scrambling code in a preset sending sequence; the j type prediction scrambling code corresponds to the j type last descrambling information; and calculating the correlation between the jth current descrambling information and the jth previous descrambling information to obtain the likelihood of the jth prediction scrambling code, thereby obtaining the likelihood of each prediction scrambling code in the N prediction scrambling codes; and sequencing the N kinds of prediction scrambling codes according to the likelihood of each kind of prediction scrambling code to obtain the sequenced N kinds of prediction scrambling codes.
In some embodiments of the present application, the descrambling and merging module 4553 is further configured to perform soft bit data merging on the ith current descrambling information corresponding to the ith predicted scrambling code after sorting and the ith previous descrambling information, and use a data merging result as the ith descrambling information.
In some embodiments of the present application, the sorting module 4552 is further configured to multiply each bit value in the jth current descrambling information with a corresponding bit value in the jth previous descrambling information one by one, and use a sum of all multiplication results as a likelihood of the jth predicted scrambling code.
In some embodiments of the present application, the apparatus further comprises a storage module and an iteration module, wherein,
the storage module is used for storing the ith descrambling information in a preset storage space when the ith decoding result fails to pass the verification;
and the iteration module is used for continuing descrambling and decoding based on the i +1 th predicted scrambling code after sequencing until the i +1+ M decoding results pass verification, taking the i +1+ M decoding results as the decoding results of the current synchronization signal block, and ending the decoding of the current synchronization signal block, wherein M is a positive integer which is greater than or equal to zero and less than or equal to N-1-i.
In some embodiments of the present application, the iteration module is further configured to receive a next synchronization signal block when i +1+ M is greater than N, and perform a next decoding round using the next synchronization signal block as the current synchronization signal block.
In some embodiments of the present application, the decoding module 4554 is further configured to decode the current soft bit information to obtain pre-decoding information;
the descrambling and merging module 4553 is further configured to, when the pre-decoding information passes verification, obtain a scrambling code corresponding to the current synchronization signal block according to the pre-decoding information; and descrambling the pre-decoding information by using the scrambling code, taking the descrambled pre-decoding information as a decoding result of the current synchronous signal block, and finishing the decoding of the current synchronous signal block.
Embodiments of the present application provide a storage medium having stored therein executable instructions that, when executed by a processor, cause the processor to perform methods provided by embodiments of the present application, for example, as illustrated in fig. 6-9 and fig. 11-13.
In some embodiments, the storage medium may be memory such as FRAM, ROM, PROM, EPROM, EEPROM, flash memory, magnetic surface memory, optical disk, or CD-ROM; or may be various devices including one or any combination of the above memories.
In some embodiments, executable instructions may be written in any form of programming language (including compiled or interpreted languages), in the form of programs, software modules, scripts or code, and may be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment.
By way of example, executable instructions may correspond, but do not necessarily have to correspond, to files in a file system, and may be stored in a portion of a file that holds other programs or data, such as in one or more scripts in a hypertext markup Language (HTML) document, in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub-programs, or portions of code).
By way of example, executable instructions may be deployed to be executed on one computing device or on multiple computing devices at one site or distributed across multiple sites and interconnected by a communication network.
In summary, according to the embodiments of the present application, the terminal may sort the N types of predicted scrambling codes before decoding, so that an opportunity may be provided to select a correct scrambling code in advance for descrambling and decoding in the next step, and further obtain a correct decoding result in advance and end decoding, thereby reducing unnecessary descrambling and decoding attempts, saving decoding power consumption, and improving decoding efficiency.
The above description is only an example of the present application, and is not intended to limit the scope of the present application. Any modification, equivalent replacement, and improvement made within the spirit and scope of the present application are included in the protection scope of the present application.

Claims (12)

1. A method of decoding, comprising:
demodulating the received current synchronous signal block to obtain current soft bit information corresponding to the current synchronous signal block;
sequencing N prediction scrambling codes corresponding to the N prediction bit values based on the current soft bit information to obtain the sequenced N prediction scrambling codes; wherein N is the power of 2;
obtaining ith descrambling information based on the ith prediction scrambling code in the sequenced N prediction scrambling codes; wherein i is a positive integer greater than or equal to 1 and less than or equal to N;
and decoding the ith descrambling information to obtain an ith decoding result, and when the ith decoding result passes verification, taking the ith decoding result as the decoding result of the current synchronous signal block to finish decoding the current synchronous signal block.
2. The method of claim 1, wherein the sorting the N predicted scrambling codes corresponding to the N predicted bit values based on the current soft bit information to obtain the N sorted predicted scrambling codes comprises:
when the current synchronous signal block is a non-first synchronous signal block, acquiring a last descrambling information set corresponding to a last synchronous signal block; the last descrambling information set is obtained by decoding the soft bit information of the last synchronous signal block through the N types of prediction scrambling codes;
sorting the N kinds of predicted scrambling codes based on the current soft bit information and the last descrambling information set to obtain the sorted N kinds of predicted scrambling codes;
and when the current synchronous signal block is the first synchronous signal block, sequencing the N kinds of prediction scrambling codes based on the Euclidean distance between the current soft bit information and the N kinds of prediction bit values to obtain the sequenced N kinds of prediction scrambling codes.
3. The method according to claim 1 or 2, wherein the sorting the N predicted scrambling codes corresponding to the N predicted bit values based on the current soft bit information to obtain the sorted N predicted scrambling codes, or the sorting the N predicted scrambling codes based on the euclidean distance between the current soft bit information and the N predicted bit values comprises:
acquiring current sub soft bit information corresponding to the N predicted bit values from the current soft bit information;
carrying out the exclusive-nor operation on the current sub soft bit information and each predicted bit value to obtain the Euclidean distance corresponding to each predicted bit value;
and sequencing the predicted scrambling codes corresponding to each predicted bit value according to the Euclidean distance of each predicted bit value to obtain the N kinds of sequenced predicted scrambling codes.
4. The method of claim 2, wherein the sorting the N predicted scrambling codes based on the current soft bit information and the last descrambling information set to obtain the sorted N predicted scrambling codes comprises:
descrambling the current soft bit information by using a j type of prediction scrambling codes in the N types of prediction scrambling codes to obtain j type of current descrambling information corresponding to the j type of prediction scrambling codes; wherein j is a positive integer greater than or equal to 1 and less than or equal to N;
determining the jth previous descrambling information corresponding to the jth predictive scrambling code in the previous descrambling information set according to the jth predictive scrambling code; the jth previous descrambling information is the previous descrambling information corresponding to the previous scrambling code of the jth predicted scrambling code in a preset sending sequence; the j type prediction scrambling code corresponds to the j type last descrambling information;
calculating the correlation degree of the jth current descrambling information and the jth previous descrambling information to obtain the likelihood of the jth prediction scrambling code, thereby obtaining the likelihood of each prediction scrambling code in the N prediction scrambling codes;
and sequencing the N kinds of predicted scrambling codes according to the likelihood of each kind of predicted scrambling code to obtain the sequenced N kinds of predicted scrambling codes.
5. The method according to claim 2 or 4, wherein obtaining the ith descrambling information according to the ith predicted scrambling code of the N sequenced predicted scrambling codes comprises:
and combining the ith current descrambling information corresponding to the sorted ith prediction scrambling code with the ith previous descrambling information by using soft bit data, and taking the data combination result as the ith descrambling information.
6. The method of claim 4, wherein the correlating the jth current descrambling information with the jth previous descrambling information to obtain the likelihood of the jth predicted scrambling code comprises:
and multiplying each bit value in the jth current descrambling information by the corresponding bit value in the jth previous descrambling information one by one, and taking the sum of all multiplication results as the likelihood of the jth predicted scrambling code.
7. The method according to any one of claims 1 to 6, wherein after the decoding the ith descrambling information to obtain the ith decoding result, the method further comprises:
when the ith decoding result does not pass the verification, storing the ith descrambling information in a preset storage space;
and continuing descrambling and decoding based on the sorted (i + 1) th prediction scrambling code until the (i +1+ M) th decoding result passes the verification, taking the (i +1+ M) th decoding result as the decoding result of the current synchronization signal block, and ending the decoding of the current synchronization signal block, wherein M is a positive integer which is greater than or equal to zero and less than or equal to N-1-i.
8. The method according to claim 7, wherein after obtaining the i +1 th decoding result based on the i +1 th predicted scrambling code of the N ordered predicted scrambling codes, the method further comprises:
and when i +1+ M is larger than N, receiving the next synchronous signal block, and performing the next decoding round by taking the next synchronous signal block as the current synchronous signal block.
9. The method according to any of claims 1-8, wherein after demodulating the received current synchronization signal block to obtain the current soft bit information corresponding to the current synchronization signal block, the method further comprises:
decoding the current soft bit information to obtain pre-decoding information;
when the pre-decoding information passes verification, obtaining a scrambling code corresponding to the current synchronous signal block according to the pre-decoding information;
and descrambling the pre-decoding information by using the scrambling code, taking the descrambled pre-decoding information as the decoding result of the current synchronous signal block, and finishing the decoding of the current synchronous signal block.
10. A decoding apparatus, comprising:
the demodulation module is used for demodulating the received current synchronization signal block to obtain current soft bit information corresponding to the current synchronization signal block;
the sequencing module is used for sequencing the N types of prediction scrambling codes corresponding to the N types of prediction bit values based on the current soft bit information to obtain the sequenced N types of prediction scrambling codes; wherein N is the power of 2;
a descrambling and merging module, configured to obtain an ith descrambling information based on an ith predicted scrambling code of the N sequenced predicted scrambling codes; wherein i is a positive integer greater than or equal to 1 and less than or equal to N;
and the decoding module is used for decoding the ith descrambling information to obtain an ith decoding result, and when the ith decoding result passes the verification, the ith decoding result is used as the decoding result of the current synchronization signal block to finish the decoding of the current synchronization signal block.
11. A decoding device, characterized by comprising:
a memory for storing executable instructions;
a processor for implementing the method of any one of claims 1 to 9 when executing executable instructions stored in the memory.
12. A storage medium having stored thereon executable instructions for causing a processor to perform the method of any one of claims 1 to 9 when executed.
CN202010443472.XA 2020-05-22 2020-05-22 Decoding method, device, equipment and storage medium Active CN111614441B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010443472.XA CN111614441B (en) 2020-05-22 2020-05-22 Decoding method, device, equipment and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010443472.XA CN111614441B (en) 2020-05-22 2020-05-22 Decoding method, device, equipment and storage medium

Publications (2)

Publication Number Publication Date
CN111614441A true CN111614441A (en) 2020-09-01
CN111614441B CN111614441B (en) 2023-04-11

Family

ID=72202102

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010443472.XA Active CN111614441B (en) 2020-05-22 2020-05-22 Decoding method, device, equipment and storage medium

Country Status (1)

Country Link
CN (1) CN111614441B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111817823A (en) * 2020-09-14 2020-10-23 翱捷科技股份有限公司 PBCH (physical broadcast channel) receiving method and system
CN115173994A (en) * 2022-06-29 2022-10-11 哲库科技(北京)有限公司 PBCH receiving method, apparatus, device, storage medium, and program product

Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1652480A (en) * 2004-02-04 2005-08-10 日本电气株式会社 Mobile communication system and terminal, cell searching method and its program
WO2005119678A1 (en) * 2004-06-02 2005-12-15 Koninklijke Philips Electronics N.V. Encoding and decoding apparatus and corresponding methods
WO2009101485A1 (en) * 2008-02-11 2009-08-20 Freescale Semiconductor, Inc. Method and apparatus for decoding received data signals
CN101801014A (en) * 2010-03-05 2010-08-11 上海华为技术有限公司 Method and device for detecting physical broadcast channel
CN102035623A (en) * 2010-12-21 2011-04-27 大唐移动通信设备有限公司 Method and device for confirming system frame number
CN102075473A (en) * 2009-11-19 2011-05-25 扬智电子(上海)有限公司 Blind descrambling method and relevant device thereof and descrambling method
CN103873873A (en) * 2014-03-24 2014-06-18 上海航天电子通讯设备研究所 Method for decoding image under unreliable channel
US20180234112A1 (en) * 2015-07-16 2018-08-16 Florian Eckardt Method and related mobile device for fast blind decoding
CN108809497A (en) * 2017-05-05 2018-11-13 展讯通信(上海)有限公司 The bearing method of time index, detection method and device, storage medium, base station, terminal
CN109474369A (en) * 2017-09-07 2019-03-15 展讯通信(上海)有限公司 Physical Broadcast Channel demodulation method, device, readable storage medium storing program for executing and user terminal
CN109756947A (en) * 2017-11-01 2019-05-14 普天信息技术有限公司 The received method of PBCH, terminal, electronic equipment and storage medium
CN111066365A (en) * 2017-09-11 2020-04-24 高通股份有限公司 PBCH scrambling design

Patent Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1652480A (en) * 2004-02-04 2005-08-10 日本电气株式会社 Mobile communication system and terminal, cell searching method and its program
EP1562299A2 (en) * 2004-02-04 2005-08-10 Nec Corporation Cell search in mobile communication terminal
WO2005119678A1 (en) * 2004-06-02 2005-12-15 Koninklijke Philips Electronics N.V. Encoding and decoding apparatus and corresponding methods
WO2009101485A1 (en) * 2008-02-11 2009-08-20 Freescale Semiconductor, Inc. Method and apparatus for decoding received data signals
CN102075473A (en) * 2009-11-19 2011-05-25 扬智电子(上海)有限公司 Blind descrambling method and relevant device thereof and descrambling method
CN101801014A (en) * 2010-03-05 2010-08-11 上海华为技术有限公司 Method and device for detecting physical broadcast channel
CN102035623A (en) * 2010-12-21 2011-04-27 大唐移动通信设备有限公司 Method and device for confirming system frame number
CN103873873A (en) * 2014-03-24 2014-06-18 上海航天电子通讯设备研究所 Method for decoding image under unreliable channel
US20180234112A1 (en) * 2015-07-16 2018-08-16 Florian Eckardt Method and related mobile device for fast blind decoding
CN108809497A (en) * 2017-05-05 2018-11-13 展讯通信(上海)有限公司 The bearing method of time index, detection method and device, storage medium, base station, terminal
CN109474369A (en) * 2017-09-07 2019-03-15 展讯通信(上海)有限公司 Physical Broadcast Channel demodulation method, device, readable storage medium storing program for executing and user terminal
CN111066365A (en) * 2017-09-11 2020-04-24 高通股份有限公司 PBCH scrambling design
CN109756947A (en) * 2017-11-01 2019-05-14 普天信息技术有限公司 The received method of PBCH, terminal, electronic equipment and storage medium

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
INTEL CORPORATION: "R1-1711611 "Time Index Signaling for SS Blocks"", 《3GPP TSG_RAN\WG1_RL1》 *
王丹等: "NB-IoT***中窄带物理广播信道的盲检测", 《电讯技术》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111817823A (en) * 2020-09-14 2020-10-23 翱捷科技股份有限公司 PBCH (physical broadcast channel) receiving method and system
CN111817823B (en) * 2020-09-14 2020-12-01 翱捷科技股份有限公司 PBCH (physical broadcast channel) receiving method and system
CN115173994A (en) * 2022-06-29 2022-10-11 哲库科技(北京)有限公司 PBCH receiving method, apparatus, device, storage medium, and program product
CN115173994B (en) * 2022-06-29 2023-09-08 哲库科技(北京)有限公司 PBCH receiving method, device, equipment and storage medium

Also Published As

Publication number Publication date
CN111614441B (en) 2023-04-11

Similar Documents

Publication Publication Date Title
US11716674B2 (en) Techniques for communicating synchronization signal timing information
US11350404B2 (en) Scrambling sequence design for embedding receiver ID into frozen bits for blind detection
JP7345471B2 (en) Scramble sequence design for multimode block discrimination during DCI blind detection
TWI652909B (en) Polarization code interleaving and bit selection
US10833706B2 (en) Polar encoding and decoding using predefined information
CN110121165B (en) Communication equipment and method under high-frequency system
CN111614441B (en) Decoding method, device, equipment and storage medium
CN110890940A (en) Method and device for decoding MIB carried by PBCH, storage medium and terminal
CN109792298B (en) Sub-channel mapping
CN108401296B (en) Data transmission method and device
US11026244B2 (en) Method and device in terminal and base station for dynamic scheduling
EP4092947A1 (en) Data transmission method and apparatus, first communication node, and second communication node
JP2021516879A (en) Information determination method and device, computer storage medium
JPWO2016013456A1 (en) Base station and user equipment
CN112202531B (en) Channel blind detection method and device, communication device and storage medium
MX2011009673A (en) Method for assigning and utilizing forward error correcting (fec).
CN109565811B (en) Data scheduling method and device and computer storage medium
KR20210108789A (en) Apparatus and method for decoding in channel coding
KR20080088765A (en) An method and apparatus for decreasing interference of cells in an communication system
CN115173994B (en) PBCH receiving method, device, equipment and storage medium
WO2020098582A1 (en) Decoding method, apparatus and device
KR102689502B1 (en) Apparatus and method for decoding control channel in wireless communication system
CN116318357A (en) Access management method, device, equipment and storage medium of satellite Internet of things
CN117834347A (en) Signal scrambling method, device, terminal and computer readable storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant