PBCH Bit Mapping and Successive Decoding for 5G Synchronization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current 5G New Radio (NR) technology faces challenges in improving synchronization signal decoding efficiency and reliability, particularly in the construction and decoding of physical broadcast channels (PBCH) due to the transmission of multiple burst-sets within a broadcast channel, which affects user equipment (UE) performance.
Innovation Solution
The solution involves constructing a physical broadcast channel (PBCH) payload by selecting bit locations based on estimated reliability for frozen, potentially known, and unknown bits, and decoding these bits using a successive decoding order, where potentially known bits are decoded first and unknown bits subsequently, to enhance decoding performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple burst-sets are transmitted within a broadcast channel TTI, then the synchronization signal coverage and reliability are improved, but the decoding complexity and latency at user equipment increase
Solution Approach 1:
The PBCH payload is segmented into different bit types (frozen bits, potentially known bits, unknown bits) with different reliability requirements. This segmentation allows the UE to prioritize decoding of critical unknown bits while using potentially known bits to accelerate the process, thereby reducing overall decoding latency while maintaining synchronization reliability.
Solution Approach 2:
The base station performs preliminary actions by strategically placing potentially known bits in the PBCH payload at positions that can be quickly identified and used by the UE. This preliminary preparation enables the UE to start decoding process more efficiently by first processing the potentially known bits, which reduces the overall decoding time for the synchronization signal.
2Productivity
If bit locations are selected based on estimated reliability for different bit types, then the decoding efficiency is improved, but the base station processing complexity increases
Solution Approach 1:
Different bit locations in the PBCH payload are assigned different quality levels based on their reliability characteristics. Frozen bits are placed in locations with highest reliability, potentially known bits in medium reliability locations, and unknown bits in locations optimized for their specific decoding requirements. This local quality differentiation improves overall decoding efficiency while keeping the base station processing manageable through systematic bit placement rules.
3Loss of time
If potentially known bits are decoded first in successive decoding order, then the overall decoding time is reduced, but the decoding algorithm complexity increases
Solution Approach 1:
The decoding process is segmented into multiple stages with different decoding orders. Potentially known bits are decoded first in a simplified manner, then unknown bits are decoded subsequently using the results from the first stage. This segmentation of the decoding process reduces overall decoding time by processing bits in an optimized sequence, while the increased algorithm complexity is confined to the second stage only.
Data Source
AI summary
An apparatus is provided for wireless communication at a base station with improved PBCH construction and decoding. The base station apparatus constructs a PBCH payload, wherein a bit location is selected for encoding a plurality of bits of the PBCH based on an estimated reliability for the corresponding bits location wherein the plurality of bits comprises frozen bits, unknown bits that are unknown to a user equipment, and potentially known bits that are potentially known by the user equipment. The apparatus transmits the PBCH payload in at least one of a plurality of SS blocks. A UE receiving the PBCH decodes the PBCH based on a successive decoding order. The successive decoding order may be based on an estimated reliability for the corresponding bits, e.g., in which potentially known bits are decoded prior to unknown bits.