Pith. sign in

REVIEW 4 major objections 5 minor 18 references

Fixed Point Exploration For CV-QKD IR QC-MET-LDPC Toward Hardware Implementation

T0 review · 4 major / 5 minor · reviewed 2026-08-01 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper claims that a fixed-point sum-product decoder at Q8.4 precision offers the best reliability-to-hardware-cost balance for low-SNR LDPC decoding in CV-QKD reconciliation.

desk verdict Plausible fixed-point comparison for CV-QKD reconciliation hardware, but the precision-threshold claims are weakened by an internal contradiction and an unspecified SPA datapath. read the letter →

arxiv 2607.17960 v1 pith:FQS57K3J submitted 2026-07-20 cs.AR cs.ITmath.ITquant-ph

Guilherme Vergne de Oliveira , Mauro Queiroz Nooblath Neto , Micael Andrade Dias , Francisco Revson Fernandes Pereira , Francisco Marcos de Assis , Valéria Loureiro da Silva , Nelson Alves Ferreira This is my paper · ORCID
classification cs.ARcs.ITmath.ITquant-ph
keywords fixed-pointLDPCdecodingCV-QKDreconciliationsum-productalgorithmnormalizedmin-sumMET-LDPCcodeslow-SNRhardwareimplementationframeerrorrate
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper sets out to determine which LDPC decoding algorithm and which fixed-point number format should be used when moving continuous-variable quantum key distribution reconciliation from floating-point simulation to hardware. It compares SPA, MSA, and NMS under the same parity-check matrix, graph representation, clipping policy, and quantization pipeline, sweeping four fixed-point formats. The central claim is that SPA preserves excellent decoding performance even at Q8.4, while reduced-complexity decoders need Q16.8 to operate reliably, where NMS clearly beats MSA. A sympathetic reader would care because these choices directly affect memory footprint, arithmetic cost, and achievable secret-key rate in practical CV-QKD systems.

What carries the argument

The central mechanism is the fixed-point quantization pipeline, where real-valued messages are quantized as xq = round(x*2^nf), clipped to [−Lmax, Lmax] with Lmax=8.0, and saturated to the signed integer range of the chosen Qnt.nf format. The three decoders share this pipeline and differ only in the check-node update rule: SPA uses the exact tanh/atanh product rule, MSA uses the min-sum approximation, and NMS scales the min-sum output by α=0.65. This design isolates the interaction between arithmetic precision and decoding rule.

What would settle it

Implement an SPA decoder on an FPGA using a concrete tanh/atanh lookup table with Q8.4 message storage and the same MET-LDPC code at SNR around −17 dB; if the measured FER degrades noticeably relative to the paper's simulated Q8.4 curve, or if a different tanh approximation changes the decoder ranking, the central recommendation would not carry over to hardware.

Watch

Extended reading notes

Core claim

Under a unified low-SNR fixed-point decoding framework, the sum-product algorithm (SPA) consistently achieved the lowest frame error rate and the clearest waterfall behavior across all tested precisions, remaining stable even at Q8.4. For reduced-complexity decoders, Q16.8 was the lowest precision that maintained reliable operation, and normalized min-sum (NMS) with normalization factor 0.65 outperformed plain min-sum (MSA). The practical conclusion is that SPA combined with Q8.4 is the most favorable operating point when both decoding reliability and implementation scalability are considered.

Load-bearing premise

The load-bearing premise is that the paper's fixed-point model—round-to-nearest quantization, Lmax=8.0 clipping, and the implicit fixed-point implementation of SPA's tanh/atanh update—faithfully represents the arithmetic that a real FPGA decoder would perform.

Editorial extensions

If this is right

  • Hardware designers can target an SPA decoder with Q8.4 fixed-point arithmetic for low-SNR CV-QKD reconciliation, reducing memory and datapath width compared to wider formats.
  • For simplified implementations, Q16.8 NMS is a viable reduced-complexity alternative that outperforms MSA at the same precision.
  • Wider fixed-point formats beyond the identified thresholds do not improve FER and can introduce saturation issues in intermediate operations.
  • Decoder selection must consider numerical precision jointly with the decoding rule, since MSA is markedly more sensitive to quantization than SPA.
  • The ranking SPA > NMS > MSA under fixed-point constraints provides a concrete baseline for FPGA-oriented LDPC decoder design in the negative-SNR regime.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The paper's SPA results assume a particular fixed-point realization of the tanh/atanh check-node update; in real hardware a lookup-table or polynomial approximation may alter the Q8.4 recommendation, so a companion hardware-emulation study would be a natural next step.
  • The precision thresholds found here for a rate-0.02, length-10000 MET-LDPC code may shift with code rate, block length, or different MET-LDPC degree profiles, meaning the Q8.4/Q16.8 guidance is best treated as a starting point rather than a universal rule.
  • A testable extension would be to measure decoding throughput and resource utilization on an FPGA for SPA Q8.4 versus NMS Q16.8, converting the FER-based ranking into an explicit area-latency-reliability trade-off.
  • Because SPA proved robust at low precision, combining it with learned or optimized quantization of the nonlinear check node could push the practical operating point below Q8.4 while preserving waterfall performance.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The manuscript compares three LDPC decoding algorithms—SPA, MSA, and NMS—under a common fixed-point quantization framework, targeting low-SNR reconciliation for CV-QKD. The authors use a single MET-LDPC code with rate 0.02, block length 10000, SNR range -20 to -15 dB, and four fixed-point formats (Q8.4, Q12.6, Q16.8, Q24.12) with a common clipping limit Lmax=8.0. They report FER and average iterations, concluding that SPA is the most reliable decoder, that Q16.8 is the lowest reliable precision for reduced-complexity decoders, that NMS outperforms MSA, and that SPA in Q8.4 offers the best performance/efficiency trade-off for hardware implementation.

Significance. If the central claim holds, the paper gives useful practical guidance to hardware designers: an 8-bit SPA with 4 fractional bits may be sufficient for low-SNR CV-QKD reconciliation without a large FER penalty, and Q16.8 NMS is a promising reduced-complexity fallback. The study's unified simulation setup—same parity-check matrix, same quantization pipeline, same SNR grid—is a genuine strength, and the disclosure of the NMS α sweep is transparent. The equations for SPA, MSA, and NMS are standard. However, the quantitative conclusions currently rest on an incompletely specified fixed-point SPA model, a parameter-tuned NMS comparison, and no floating-point baseline or statistical uncertainty estimates, so the practical hardware recommendation is not yet fully supported.

major comments (4)
  1. [Secs. I-C/I-D, Eq. (5)] The central recommendation to implement SPA with Q8.4 assumes that the SPA check-node update itself is computed in fixed-point arithmetic, but the manuscript never specifies how Eq. (5), 2 atanh(prod tanh(...)), is evaluated. The text in Sec. I-C says SPA 'keeps message storage in fixed-point form,' which suggests the nonlinear functions may be computed in floating point and quantized only at message boundaries. If so, the reported Q8.4 SPA results describe a hybrid float/fixed decoder, not an 8-bit datapath. Real FPGA implementations of tanh/atanh use LUTs, CORDICs, or polynomial approximations with finite intermediate word lengths, and those approximations can shift the FER curve and potentially change the ranking versus NMS. Please specify the fixed-point realization of every intermediate in Eq. (5), including input/output word lengths, product accumulation/saturation, and the tanh/at
  2. [Sec. II, Eq. (7)] The NMS normalization factor α=0.65 was selected by sweeping α from 0.40 to 0.85 on the same code, the same decoder, and the same SNR range used in the main experiments. MSA corresponds to α=1 and SPA has no such tunable parameter. The comparison 'NMS clearly outperformed MSA' and the Q16.8 threshold for reduced-complexity decoders are therefore not parameter-free. Please report the sensitivity of the NMS results to α, or use a protocol that selects α on held-out SNR points, before drawing general conclusions about the NMS/MSA ranking.
  3. [Secs. III--IV] There is no floating-point baseline in the reported curves, so the claim that Q8.4 SPA 'preserves excellent decoding performance' cannot be quantitatively supported—one cannot tell how much degradation is due to quantization. In addition, only 2000 frames are simulated per SNR point with no error bars; near a waterfall, this makes differences in FER and the claimed optimum precisions statistically fragile. Finally, 'hardware efficiency' is inferred only from bit width; no area, throughput, memory, or power estimates are given. Please add a floating-point reference, confidence intervals or enough frames for stable FER estimates, and at least first-order complexity estimates to substantiate the 'best balance' conclusion.
  4. [Sec. III] There is an internal inconsistency in the reported optimum precisions. Sec. III says 'both MSA and NMS achieve their most suitable operating condition under the Q16.8 and Q12.6 formats respectively,' but the conclusion states that 'Q16.8 emerged as the optimal precision threshold' for reduced-complexity decoders. If NMS is best at Q12.6, Q16.8 is not the lowest reliable format. Also, Sec. III describes SPA as 'reaching its quantization-limited behavior at Q8.4' while Sec. IV recommends Q8.4 as preserving excellent performance. Please clarify the criterion used for 'optimal' and align the statements in Secs. III and IV.
minor comments (5)
  1. [Sec. II] The manuscript says decoder performance was evaluated in terms of FER and average number of iterations, but no figure or table presents the average iteration results. Please include them or remove the claim.
  2. [Fig. 1 caption] The caption reads 'BIT ERROR RATE (FER)'; the metric is frame error rate. Use the correct term consistently.
  3. [Sec. III] The statement that 'increased fractional precision reduces the available dynamic range in fixed-width accumulators' is not applicable as written: Q24.12 has a larger dynamic range than Q16.8 because the total word length also increases. Clarify the intended comparison.
  4. [Title and Sec. I-B] The title mentions QC-MET-LDPC, but the quasi-cyclic lifting/construction is never described. Either define the quasi-cyclic structure or adjust the title to 'MET-LDPC'.
  5. [Ref. [16]] Reference [16] is incomplete: it lacks the full title and publisher details. Please complete it.

Circularity Check

1 steps flagged · score 5.0 of 10

NMS-vs-MSA ranking is partly fitted via α=0.65 sweep on the same data; the SPA Q8.4 recommendation remains independent.

  1. fitted input called prediction [Section II (Experimental Configuration), NMS parameter selection; Section IV (Conclusion)]
    "For NMS, α was preliminarily swept from 0.40 to 0.85 in steps of 0.05, and α= 0.65 was selected for the main experiments. ... Under this condition, NMS clearly outperformed MSA and became the best simplified alternative to SPA."

    The NMS normalization factor α is a free parameter fitted on the same code, SNR range, quantization pipeline, and simulation setup used for the final comparison. Since MSA corresponds to α=1, selecting the best α over 0.40–0.85 on the same test conditions means the reported 'NMS > MSA' result is the output of that selection, not a parameter-free prediction. The paper does not validate α on an independent dataset or report sensitivity, so the reduced-complexity ranking is partly constructed by the tuning procedure. The SPA recommendation itself does not depend on this fit.

full rationale

The central SPA-Q8.4 result does not reduce to its inputs: the decoding equations (5)–(7) are standard belief-propagation and min-sum formulas, the quantization model (1)–(4) is an explicitly stated assumption, and the FER evaluation is an external simulation benchmark with common graph, matrix, and precision settings. There is no self-citation chain or uniqueness theorem: the cited works are external and do not include the present authors, and no ansatz is smuggled in via self-citation. The only load-bearing fitted input is the NMS normalization α, selected by sweeping 0.40–0.85 on the same conditions that are later used to claim NMS outperforms MSA; that particular comparison is therefore not parameter-free and is partly constructed by the tuning procedure. The unspecified fixed-point realization of SPA's tanh/atanh check-node update (Eq. 5) is a hardware-validity and reproducibility gap, but it is not a circularity: it does not make the SPA result equivalent to an input. Overall, one partial circularity affects a secondary claim, while the primary recommendation is independent, justifying a moderate score rather than a high one.

Assumptions & free parameters 2 free parameters · 4 assumptions · 0 invented entities

The central comparison rests on three kinds of imported assumptions: the MDR-to-BI-AWGN channel mapping (from [15]), the representativeness of the chosen MET-LDPC ensemble, and the fidelity of the fixed-point quantization model (including the hand-set Lmax=8.0). The only explicitly tuned free parameter is the NMS normalization α=0.65. No new entities are introduced.

free parameters (2)
  • NMS normalization factor α = 0.65
    Swept from 0.40 to 0.85 in Section II and selected for main experiments; the NMS-vs-MSA comparison depends on this tuned value.
  • Channel LLR clipping limit Lmax = 8.0
    Set as a design parameter in Section II; chosen by hand and not justified by data or hardware constraints, affecting saturation behavior across all formats.
assumptions (4)
  • domain assumption Multidimensional reconciliation maps the CV-QKD Gaussian channel to a BI-AWGN channel
    Invoked in Section I-A via [15]; all simulations use BI-AWGN, so if this mapping is inaccurate at the tested SNR, the channel model is not representative.
  • domain assumption The MET-LDPC ensemble defined by ν(x) and μ(x) is a suitable low-rate code for the low-SNR regime
    Code polynomials are taken as given in Section II from prior design work [5]; results may not generalize to other ensembles.
  • ad hoc to paper Fixed-point quantization with round-to-nearest, saturation to [qmin, qmax], and Lmax=8.0 clipping faithfully represents hardware behavior
    Defined in Section I-C and fixed in Section II without validation against an actual FPGA implementation; the SPA nonlinear check-node update is not specified in fixed-point form.
  • standard math Standard check-node update equations for SPA, MSA, and NMS are valid in the LLR domain
    Equations (5)-(7) from [16,17]; not proven here but accepted background.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Fixed Point Exploration For CV-QKD IR QC-MET-LDPC Toward Hardware Implementation." pith.science (2026). https://pith.science/paper/FQS57K3J

@misc{pith2026260717960,
  author       = {Pith},
  title        = {Pith review of: Fixed Point Exploration For CV-QKD IR QC-MET-LDPC Toward Hardware Implementation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/FQS57K3J}},
  note         = {Machine review of arXiv:2607.17960}
}
read the original abstract

High-speed LDPC decoding is a major bottleneck in CV-QKD and motivates hardware acceleration with fixed-point arithmetic. This work compares SPA, MSA, and NMS under a unified low-SNR fixed-point framework using common graph, matrix, and quantization settings. Multiple formats are evaluated through FER, and average iterations. The results show that performance depends strongly on the interaction between decoder rule and numerical precision. SPA achieved the best overall performance. For reduced-complexity decoders, Q16.8 was the lowest consistent precision, with NMS outperforming MSA. Practically, SPA with Q8.4 offered the best balance between reliability and hardware efficiency for large-scale implementations.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

18 extracted references · 4 linked inside Pith

  1. [1]

    Multiedge-type low-density parity-check codes for continuous- variable quantum key distribution,

    H. Mani, T. Gehring, P. Grabenweger, B. Ömer, C. Pacher, and U. L. An- dersen, “Multiedge-type low-density parity-check codes for continuous- variable quantum key distribution,” Physical Review A, vol. 103, no. 6, p. 062419, 2021, [Fontes 520, 521] - Justifica o uso de MET-LDPC no regime de baixo SNR

    2021

  2. [2]

    High speed error correction for continuous-variable quantum key distribution with multi-edge type ldpc code,

    X. Wang, Y . Zhang, S. Yu, and H. Guo, “High speed error correction for continuous-variable quantum key distribution with multi-edge type ldpc code,” Scientific Reports, vol. 8, no. 1, p. 10543, 2018, [Fonte 348] - Corrobora a importância do LDPC para QKD em baixo SNR

    2018

  3. [3]

    Long-distance continuous- variable quantum key distribution with a gaussian modulation,

    P. Jouguet, S. Kunz-Jacques, and A. Leverrier, “Long-distance continuous- variable quantum key distribution with a gaussian modulation,” Physical Review A, vol. 84, no. 6, p. 062317, 2011, [Fonte 256, 360] - Relação direta entre a eficiência de decodificação e a taxa/distância da chave secreta

    2011

  4. [4]

    Continuous-variable quantum key distribution system: Past, present, and future,

    Y . Zhang, Y . Bian, Z. Li, S. Yu, and H. Guo, “Continuous-variable quantum key distribution system: Past, present, and future,” Applied Physics Reviews, vol. 11, no. 1, p. 011318, 2024, [Fonte 247]

    2024

  5. [5]

    Quasi-cyclic multi-edge ldpc codes for long-distance quantum cryptography,

    M. Milicevic, C. Feng, L. M. Zhang, and P. G. Gulak, “Quasi-cyclic multi-edge ldpc codes for long-distance quantum cryptography,” npj Quantum Information, vol. 4, no. 1, Apr. 2018. [Online]. Available: http://dx.doi.org/10.1038/s41534-018-0070-6

    doi:10.1038/s41534-018-0070-6 2018

  6. [6]

    High-speed post-processing in continuous-variable quantum key distribution based on fpga implementa- tion,

    S.-S. Yang, Z.-G. Lu, and Y .-M. Li, “High-speed post-processing in continuous-variable quantum key distribution based on fpga implementa- tion,” Journal of Lightwave Technology, vol. 38, no. 15, pp. 3935–3941, 2020, [Fonte 354] - Aborda as restrições de implementação em FPGA para LDPC

    2020

  7. [7]

    An fpga-based ldpc decoder with ultra-long codes for continuous-variable quantum key distribution,

    S.-S. Yang, J.-Q. Liu, Z.-G. Lu, Z.-L. Bai, X.-Y . Wang, and Y .-M. Li, “An fpga-based ldpc decoder with ultra-long codes for continuous-variable quantum key distribution,” IEEE Access, vol. 9, pp. 47 687–47 697, 2021, [Fontes 389, 402] - Discute especificamente o problema de quantização uniforme e consumo de recursos para LDPC no CV-QKD

    2021

  8. [8]

    High-throughput decoder of quasi-cyclic ldpc codes with limited precision for continuous-variable quantum key distribution systems,

    C. Zhou, Y . Li, L. Ma, J. Yang, W. Huang, H. Wang, Y . Luo, F. C. M. Lau, Y . Li, and B. Xu, “High-throughput decoder of quasi-cyclic ldpc codes with limited precision for continuous-variable quantum key distribution systems,” 2022. [Online]. Available: https://arxiv.org/abs/2207.01860

    arXiv 2022

Show all 18 references
  1. [9]

    Log-log domain sum-product algorithm for information reconciliation in continuous-variable quantum key distribution,

    E. E. Cil and L. Schmalen, “Log-log domain sum-product algorithm for information reconciliation in continuous-variable quantum key distribution,” 2024. [Online]. Available: https://arxiv.org/abs/2401.13748

    2024 arXiv

  2. [10]

    Reconstruction-computation-quantization (rcq): A paradigm for low bit width ldpc decoding,

    L. Wang, C. Terrill, M. Stark, Z. Li, S. Chen, C. Hulse, C. Kuo, R. Wesel, G. Bauch, and R. Pitchumani, “Reconstruction-computation-quantization (rcq): A paradigm for low bit width ldpc decoding,” 2022. [Online]. Available: https://arxiv.org/abs/2111.08920

    2022 arXiv

  3. [11]

    Learning quantization in ldpc decoders,

    M. Geiselhart, A. Elkelesh, J. Clausius, F. Liang, W. Xu, J. Liang, and S. ten Brink, “Learning quantization in ldpc decoders,” 2022. [Online]. Available: https://arxiv.org/abs/2208.05186

    2022 arXiv

  4. [12]

    Reduced-complexity decoding of ldpc codes,

    J. Chen, A. Dholakia, E. Eleftheriou, M. P. Fossorier, and X.-Y . Hu, “Reduced-complexity decoding of ldpc codes,” IEEE Transactions on Communications, vol. 53, no. 8, pp. 1288–1299, 2005, [Fontes 364, 417] - Literatura fundamental discutindo a diferença de performance entre S...

    2005

  5. [13]

    Rate compati- ble reconciliation for continuous-variable quantum key distribution using raptor-like ldpc codes,

    C. Zhou, X. Wang, Z. Zhang, S. Yu, Z. Chen, and H. Guo, “Rate compati- ble reconciliation for continuous-variable quantum key distribution using raptor-like ldpc codes,” Science China Physics, Mechanics & Astronomy, vol. 64, p. 260311, 2021, [Fontes 377, 423] - Investiga a con...

    2021

  6. [14]

    A survey on high-throughput non-binary ldpc decoders: Asic, fpga, and gpu architectures,

    O. Ferraz, S. Subramaniyan, R. Chinthala, J. Andrade, J. R. Cavallaro, S. K. Nandy, V . Silva, X. Zhang, M. Purnaprajna, and G. Falcao, “A survey on high-throughput non-binary ldpc decoders: Asic, fpga, and gpu architectures,” IEEE Communications Surveys & Tutorials, vol. 24, ...

    2022

  7. [15]

    Multidimensional reconciliation for continuous-variable quantum key distribution,

    A. Leverrier, R. Alléaume, J. Boutros, G. Zémor, and P. Grangier, “Multidimensional reconciliation for continuous-variable quantum key distribution,” Physical Review A, vol. 77, p. 042325, 2008

    2008

  8. [16]

    Error correction coding: Mathematical methods and algorithms,

    T. K. Moon, “Error correction coding: Mathematical methods and algorithms,” Hoboken, NJ, 2021

    2021

  9. [17]

    Density evolution for two improved bp- based decoding algorithms of ldpc codes,

    J. Chen and M. Fossorier, “Density evolution for two improved bp- based decoding algorithms of ldpc codes,”IEEE Communications Letters, vol. 6, no. 5, pp. 208–210, 2002

    2002

  10. [100]

    For NMS, α was preliminarily swept from 0.40 to 0.85 in steps of 0.05, and α= 0.65 was selected for the main experiments

    In this notation, Qnt.nf denotes a signed fixed-point representation withn t total bits andn f fractional bits. For NMS, α was preliminarily swept from 0.40 to 0.85 in steps of 0.05, and α= 0.65 was selected for the main experiments. The MSA results correspond to the particula...

    2023

Pith tools

Reviewed August 1, 2026 · model on record in the stance chip above.