Multiple-Block Combined Decoding for Cell Search With Polar Codes
Bibliographic record
Abstract
Polar codes have been applied in many applications due to the excellent decoding performance as well as relatively low encoding and decoding complexity. In the cell search procedure for the fifth generation (5G) systems, part of the common information bits (CIBs) is transmitted in successive transmission blocks. In this paper, multiple-block combined decoding (MBCD) schemes are proposed for both non-systematic and systematic polar codes to enhance cell search. In the proposed MBCD schemes, the log-likelihood ratios (LLRs) of the CIBs are combined to improve the reliabilities of the corresponding sub-channels. The common information sets are further optimized. For both schemes, low-complexity optimization methods are proposed. Meanwhile, the closed-form expression of block error rate (BLER) performance is derived, which is verified by simulation results. The simulation results show that the proposed MBCD schemes can significantly improve the BLER performance, leading to a latency reduction in cell search.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".