pith. sign in

arxiv: 2605.03805 · v2 · pith:WUK6KQRPnew · submitted 2026-05-05 · 💻 cs.IT · math.IT

Complex Analysis of Channel Polarization on Discrete BMS Channels

Dongxiao Xu , Moritz Wiese , Holger Boche This is my paper

Pith reviewed 2026-05-20 23:32 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords channel polarizationBhattacharyya parametercomplex analysisBMS channelspolar codescomponent evolutionfinite blocklength
0
0 comments X

The pith

Complex function theory derives exact Bhattacharyya parameters for polarized bit-channels on any discrete BMS channel

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops a framework called component evolution that uses complex analysis to track how the Bhattacharyya parameter changes during the polarization process for any discrete binary-input memoryless symmetric channel. Instead of relying on numerical recursions, it produces closed-form analytic expressions for the parameter at any given level of polarization. A reader might care because this provides precise, non-asymptotic understanding of how well polar codes perform on specific channels at finite lengths, and it strengthens the known extremal properties of the erasure channel and the binary symmetric channel.

Core claim

We develop component evolution (CE), a framework based on complex function theory for finite-blocklength channel polarization on discrete BMS channels. In this view, the Bhattacharyya parameter is treated as a real-valued instance of a broader class of complex-valued channel functionals. CE systematically derives analytic expressions for the Bhattacharyya parameters of the bit-channels of a given discrete BMS channel at arbitrary polarization levels.

What carries the argument

Component evolution, a framework based on complex function theory that models the recursive transformation of complex-valued channel functionals under polarization operations

Load-bearing premise

The complex-valued extension of the Bhattacharyya parameter and the component evolution recursions preserve the polarization properties and extremality relations for all discrete BMS channels without additional restrictions.

What would settle it

Direct numerical comparison of the closed-form Bhattacharyya parameter expression obtained after two or three polarization steps on a binary symmetric channel with crossover probability 0.11 against the value obtained from repeated application of the standard real-valued recursion.

Figures

Figures reproduced from arXiv: 2605.03805 by Dongxiao Xu, Holger Boche, Moritz Wiese.

Figure 1
Figure 1. Figure 1: Relations between the check-domain and variable -do view at source ↗
Figure 2
Figure 2. Figure 2: Left panel: Relations among Fa,i(s), Fψ,i(s), i ∈ {1, 2}, with Fϕ. Right panel: Their acquisition via the Fourier transform along τ = 1/2 + iu. Corollary IV.2.1. Let ϕ(s) , Fa,1(s)Fa,2(s). Let τ , c + iu ∈ C with any c ∈ R fixed, then ϕ˜(u) , ϕ(τ) = (n−1) X2 k=1 A (c) k · e iωku ∈ C, (21) where the k-index runs over all finite ordered pairs (i, j) for every i, j = 1, . . . , n − 1, with A (c) ij , βiβ−j (w… view at source ↗
Figure 3
Figure 3. Figure 3: Left panel: Conversion from Fa,1(s) to G|a|(ν). Right panel: Conversion from G|a|(ν) to Fa,1(s). from which identifying with (44) and (127) it follows that n 2 = 3, α 2 1 = 4CS2, α 2 2 = S4, and w 2 1 = e2∆ > w2 2 = e4∆, which implies that z 2 1 = (1 − w 2 1 )/(1 + w 2 1 ) = D2/S2 < z2 2 = D4/S4. Therefore, we have G|a2|(ν) = 4CDν 2S 1−ν 2 + Dν 4S 1−ν 4 . (47) Moreover, the only atom that does no… view at source ↗
Figure 4
Figure 4. Figure 4: Bhattacharyya parameters of bit-channels of view at source ↗
Figure 5
Figure 5. Figure 5: Bhattacharyya parameters of bit-channels of view at source ↗
Figure 6
Figure 6. Figure 6: Recursions of Bhattacharyya parameters: solid arro view at source ↗
read the original abstract

We develop component evolution (CE), a framework based on complex function theory for finite-blocklength channel polarization on discrete binary-input memoryless output-symmetric (BMS) channels. In this view, the Bhattacharyya parameter is treated as a real-valued instance of a broader class of complex-valued channel functionals. CE systematically derives analytic expressions for the Bhattacharyya parameters of the bit-channels of a given discrete BMS channel at arbitrary polarization levels. CE also enables structural analysis, providing new evidence of extremality of the binary erasure channel (BEC) and binary symmetric channel (BSC), and revealing new channel-dependent recursions for a class of BSC bit-channels.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The manuscript introduces 'Component Evolution' (CE), a framework using complex function theory to analyze channel polarization on discrete BMS channels. It extends the Bhattacharyya parameter to complex values and derives analytic expressions for the Bhattacharyya parameters of bit-channels at arbitrary polarization levels. The work also offers structural analysis providing evidence for the extremality of BEC and BSC, and new recursions for certain BSC bit-channels.

Significance. If the complex-valued extensions are rigorously shown to preserve all relevant polarization properties, this could provide a significant advance by enabling closed-form analysis of finite-length polar code constructions, which is currently limited to recursive computations. The approach may also yield new insights into channel extremality and polarization dynamics.

major comments (1)
  1. [Complex Extension and Recursions (Sections 3-4)] The central claim that the complex extension and component-evolution recursions reproduce the known real-valued polarization behavior (including Z(W^-) ≤ 2Z(W) - Z(W)^2, extremality of BEC/BSC, and convergence to 0/1) for arbitrary n and every discrete BMS channel is load-bearing. Explicit verification is needed that the recursions introduce no spurious fixed points, branch-cut crossings, or violations for a non-extremal BMS channel at finite polarization levels (e.g., n=2).
minor comments (2)
  1. [Notation and Definitions] Clarify the precise definition of the complex-valued functional versus its real restriction to avoid notation ambiguity when stating that expressions reduce to the standard Bhattacharyya parameter.
  2. [Figures] If any figures illustrate complex trajectories or recursions, add labels indicating branch cuts and confirm they align with real-line polarization behavior.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their thorough review and valuable feedback on our manuscript. We address the major comment below and have made revisions to provide the requested explicit verification while preserving the analytic character of the work.

read point-by-point responses

  1. Referee: [Complex Extension and Recursions (Sections 3-4)] The central claim that the complex extension and component-evolution recursions reproduce the known real-valued polarization behavior (including Z(W^-) ≤ 2Z(W) - Z(W)^2, extremality of BEC/BSC, and convergence to 0/1) for arbitrary n and every discrete BMS channel is load-bearing. Explicit verification is needed that the recursions introduce no spurious fixed points, branch-cut crossings, or violations for a non-extremal BMS channel at finite polarization levels (e.g., n=2).

    Authors: We agree that explicit verification at finite polarization levels for a non-extremal channel strengthens the central claims. The derivations in Sections 3 and 4 establish the complex recursions by direct analytic continuation of the real-valued Bhattacharyya parameter, ensuring that all real-line properties (including the inequality Z(W^-) ≤ 2Z(W) - Z(W)^2) are preserved by construction for any BMS channel. Convergence to 0 or 1 for arbitrary n follows from an inductive argument on the closed-form expressions. To address the request for concrete checks, the revised manuscript adds a new subsection (Section 4.3) containing explicit numerical verification for n=2 on a non-extremal BMS channel (a Z-channel with crossover probabilities 0.1 and 0.2). This verification confirms exact agreement with the real-valued recursions, absence of spurious fixed points, and no branch-cut crossings within the domain of interest. We believe these additions fully resolve the concern. revision: yes

Circularity Check

0 steps flagged

No circularity: derivation builds independent complex-analytic expressions from standard polarization recursions

full rationale

The paper introduces component evolution as a complex-function-theoretic extension of the Bhattacharyya parameter and derives closed-form expressions for polarized bit-channels. No quoted step reduces the target analytic expressions to a fitted parameter, self-citation chain, or definitional renaming of the input; the framework is presented as generating new structural results (extremality evidence, channel-dependent recursions) from the complex continuation rather than presupposing them. The derivation chain therefore remains self-contained against external polarization theory.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review yields no explicit free parameters, axioms, or invented entities; the framework appears to rest on standard complex analysis applied to existing channel functionals.

pith-pipeline@v0.9.0 · 5632 in / 1023 out tokens · 45274 ms · 2026-05-20T23:32:05.863616+00:00 · methodology

Review history (2 revisions) →

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

29 extracted references · 29 canonical work pages

  1. [1]

    Channel polarization: A method for constr ucting capacity-achieving codes for symmetric binary-inp ut memoryless channels

    Erdal Arikan. Channel polarization: A method for constr ucting capacity-achieving codes for symmetric binary-inp ut memoryless channels. IEEE Transactions on information Theory, 55(7):3051–3073, 2009

    work page 2009

  2. [2]

    Performance and const ruction of polar codes on symmetric binary-input memoryles s channels

    Ryuhei Mori and Toshiyuki Tanaka. Performance and const ruction of polar codes on symmetric binary-input memoryles s channels. In 2009 IEEE International symposium on information theory , pages 1496–1500. IEEE, 2009

    work page 2009

  3. [3]

    Performance of polar c odes with the construction using density evolution

    Ryuhei Mori and Toshiyuki Tanaka. Performance of polar c odes with the construction using density evolution. IEEE Communications Letters, 13(7):519– 521, 2009. 34

    work page 2009

  4. [4]

    How to construct polar codes

    Ido Tal and Alexander V ardy. How to construct polar codes . IEEE Transactions on Information Theory, 59(10):6562–6582, 2013

    work page 2013

  5. [5]

    Efficient design and decoding of polar co des

    Peter Trifonov. Efficient design and decoding of polar co des. IEEE transactions on communications , 60(11):3221–3227, 2012

    work page 2012

  6. [6]

    Does gaussian approximation work well for the long-leng th polar code construction? IEEE Access, 5:7950–7963, 2017

    Jincheng Dai, Kai Niu, Zhongwei Si, Chao Dong, and Jiaru L in. Does gaussian approximation work well for the long-leng th polar code construction? IEEE Access, 5:7950–7963, 2017

    work page 2017

  7. [7]

    A partial order for the synthesized c hannels of a polar code

    Christian Schürch. A partial order for the synthesized c hannels of a polar code. In 2016 IEEE International Symposium on Information Theory (ISIT), pages 220–224. IEEE, 2016

    work page 2016

  8. [8]

    C onstruction of polar codes with sublinear complexity

    Marco Mondelli, S Hamed Hassani, and Rüdiger L Urbanke. C onstruction of polar codes with sublinear complexity. IEEE Transactions on Information Theory, 65(5):2782–2791, 2018

    work page 2018

  9. [9]

    Beta- expansion: A theoretical framework for fast and recursive c onstruction of polar codes

    Gaoning He, Jean-Claude Belfiore, Ingmar Land, Ganghua Y ang, Xiaocheng Liu, Ying Chen, Rong Li, Jun Wang, Yiqun Ge, Ra n Zhang, et al. Beta- expansion: A theoretical framework for fast and recursive c onstruction of polar codes. In GLOBECOM 2017-2017 IEEE Global Communications Conference, pages 1–6. IEEE, 2017

    work page 2017

  10. [10]

    Align ment of polarized sets

    Joseph M Renes, David Sutter, and S Hamed Hassani. Align ment of polarized sets. IEEE Journal on Selected Areas in Communications , 34(2):224–238, 2015

    work page 2015

  11. [11]

    Polar codes for channel and source coding

    Satish Babu Korada. Polar codes for channel and source coding . PhD thesis, V erlag nicht ermittelbar, 2009

    work page 2009

  12. [12]

    The fractality of polar and reed–mul ler codes

    Bernhard C Geiger. The fractality of polar and reed–mul ler codes. Entropy, 20(1):70, 2018

    work page 2018

  13. [13]

    Channel polarization and polar codes

    Mine Alsan. Channel polarization and polar codes. Technial Report, Information Theory Laboratory, School of Computer Communications Sciences , 2012

    work page 2012

  14. [14]

    Modern coding theory

    Tom Richardson and Ruediger Urbanke. Modern coding theory. Cambridge university press, 2008

    work page 2008

  15. [15]

    Asymptotics and mellin-barnes integrals, volume 85

    Richard B Paris and David Kaminski. Asymptotics and mellin-barnes integrals, volume 85. Cambridge University Press, 2001

    work page 2001

  16. [16]

    On the mellin transfo rms of dirac’s delta function, the hausdorff dimension func tion, and the theorem by mellin

    Norbert Südland and Gerd Baumann. On the mellin transfo rms of dirac’s delta function, the hausdorff dimension func tion, and the theorem by mellin. Fractional Calculus and Applied Analysis, 7(4):409–420, 2004

    work page 2004

  17. [17]

    Mellin-transform method for integral evaluation: introduction and applications to electromagnetics

    George Fikioris. Mellin-transform method for integral evaluation: introduction and applications to electromagnetics . Springer Nature, 2022

    work page 2022

  18. [18]

    Sub-4.7 scaling exponent of polar codes

    Hsin-Po Wang, Ting-Chun Lin, Alexander V ardy, and Ryan Gabrys. Sub-4.7 scaling exponent of polar codes. IEEE Transactions on Information Theory , 69(7):4235–4254, 2023

    work page 2023

  19. [19]

    Asymptotics and special functions

    Frank Olver. Asymptotics and special functions. AK Peters/CRC Press, 1997

    work page 1997

  20. [20]

    Handbook of mathematical functions: with formulas, graphs, and mathematical tables , volume 55

    Milton Abramowitz and Irene A Stegun. Handbook of mathematical functions: with formulas, graphs, and mathematical tables , volume 55. Courier Corporation, 1965

    work page 1965

  21. [21]

    Generalized functions

    Izrail’ Moiseevi ˇc Gel’fand, Izrail’ Moiseevi ˇc Gel’fand, and Georgij Evgen’evi ˇc. Generalized functions. V ol. 1, Properties and operations . Academic Press, 1969

    work page 1969

  22. [22]

    Complex variables: introduction and applications

    Mark J Ablowitz and Athanassios S Fokas. Complex variables: introduction and applications . Cambridge University Press, 2003

    work page 2003

  23. [23]

    https://dlmf.nist.gov/, Release 1.2.4 of 2025-03-15

    NIST Digital Library of Mathematical Functions . https://dlmf.nist.gov/, Release 1.2.4 of 2025-03-15

    work page 2025

  24. [24]

    Complex analysis, volume 2

    Elias M Stein and Rami Shakarchi. Complex analysis, volume 2. Princeton University Press, 2010

    work page 2010

  25. [25]

    Asymptotic expansions of integrals

    Norman Bleistein and Richard A Handelsman. Asymptotic expansions of integrals . Ardent Media, 1975

    work page 1975

  26. [26]

    An introduction to the theory of infinite series , volume 335

    Thomas John I’Anson Bromwich. An introduction to the theory of infinite series , volume 335. American Mathematical Soc., 2005

    work page 2005

  27. [27]

    Rainville

    D. Rainville. Special Functions. Macmillan, 1960

    work page 1960

  28. [28]

    Probability, random processes, and statistical analysis: applications to communications, signal processing, queueing theory and mathematical finance

    Hisashi Kobayashi, Brian L Mark, and William Turin. Probability, random processes, and statistical analysis: applications to communications, signal processing, queueing theory and mathematical finance . Cambridge University Press, 2011

    work page 2011

  29. [29]

    Bernstein functions: theory and applications , volume 37

    René L Schilling, Renming Song, and Zoran V ondracek. Bernstein functions: theory and applications , volume 37. Walter de Gruyter, 2012

    work page 2012