{"id":"34628252-dcb1-4fee-a1ce-2c79bdfec3ba","arxiv_id":"2411.16203","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"high","formal_verification":"none","parameter_count":2,"one_line_summary":"A gradient-descent decoder for real-number LDPC codes is reported to outperform GDBF at rates 1/2 and 2/3, with comparable performance at 3/4.","lead":"This paper introduces a new decoder, called GDSU, that uses gradient descent to correct errors in real-number LDPC codes. The authors report that it outperforms an existing gradient-descent bit-flipping decoder at two code rates and matches it at a third.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The claimed outperformance rests on an unnormalized SER-vs-BER comparison; without a stated quantization precision p and an information-rate-matched baseline, the headline gain may be an artifact. A secondary reproducibility issue is the inverted while-loop condition in Algorithm 1.","rationale":"I read the paper as proposing a heuristic real-number counterpart to GDBF and claiming empirical superiority over the binary GDBF decoder. The key question is whether the evidence supports that claim. The biggest soft spot is the comparability of the two reported error metrics, because the abstract's headline conclusion is drawn directly from those curves. My agreement with the reader is partial: if p>1, SER is a stricter criterion than BER, so the direction of the bias is not simply 'real decoder looks better than it is'; the real problem is that p and the amplitude-error distribution are unspecified, which makes the comparison uninterpretable and unreproducible. A secondary issue, the inverted while-loop condition in Algorithm 1, compounds the reproducibility concern. These are internal-validity problems, not disagreements with the broader consensus about real-number codes. A re-analysis with bit-level metrics at matched information rates could potentially salvage the paper, but as it stands the rejection is justified because the central empirical claim lacks a well-defined basis.","tokens_in":6030,"tokens_out":8551,"duration_ms":238329,"concrete_test":"Re-run the rate-1/2 experiment (or obtain the authors' code) with a fixed p-bit quantization; compute BER for the GDSU output by comparing each decoded symbol's p bits to the transmitted bits. Plot GDSU BER against GDBF BER at matched information rate, e.g., the same number of transmitted bits per information bit. If the GDSU BER margin over GDBF shrinks below one order of magnitude or disappears, the headline claim is an artifact of the SER/BER mismatch. Also implement Algorithm 1 with the while loop corrected to ||s||_1 != 0 to verify that the described decoder actually corrects errors.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim 'GDSU outperforms GDBF' is an empirical comparison made in Section IV between the symbol error rate of the real-number decoder and the bit error rate of the binary GDBF decoder. For the comparison to be meaningful, either each real symbol must carry exactly one bit and the two systems must have the same blocklength and per-channel-use information rate, or the real decoder's output must be converted to a bit error rate at a stated quantization precision p and the binary baseline must be matched in information rate. The paper states that fixed-point symbols use p bits (Section IV) but never reports p, never defines the amplitude-error distribution, and never reports a bit-level metric for the real decoder. Without this, an apparent two-order-of-magnitude advantage can be created by measuring different events: a symbol is a multibit object and is scored correct only if all its bits are recovered, whereas BER counts individual bit disagreements. The missing normalization is not a cosmetic issue: it is the entire basis for the abstract's 'outperforms' statement. A secondary internal inconsistency, the inverted while-loop condition in Algorithm 1 (line 4: while ... ||s||_1 = 0), means the printed algorithm would never correct any nonzero syndrome; if read literally, the simulations cannot be reproduced from the paper.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes Gradient Descent Symbol Update (GDSU), an iterative decoding algorithm for real-number QC-LDPC codes whose parity-check matrices are derived from IEEE 802.11 LDPC codes by replacing the +1 diagonal entries of the parity part with -1. The decoder uses an energy function inspired by binary GDBF, selects an active symbol set, and applies corrections whose magnitude is the smallest nonzero syndrome value and whose direction is given by a majority vote of syndrome signs. Monte Carlo simulations compare GDSU against binary GDBF for rates 1/2, 2/3, and 3/4, and the abstract claims that GDSU outperforms GDBF at rates 1/2 and 2/3 with similar performance at 3/4.","tokens_in":6289,"tokens_out":3372,"duration_ms":36061,"significance":"If the central claim were established, the paper would offer a practical decoder for a class of real-number LDPC codes using only additions, comparisons, and a maximum finder, which could be attractive for fixed-point DSP implementations and fault-tolerant computation. The idea is timely and the encoding construction is simple. However, the current manuscript does not establish the claim: the derivation of the update rule from the energy function is not valid, the algorithm as printed cannot reproduce the reported simulations, and the headline performance gain rests on comparing symbol error rate for multi-bit real symbols with bit error rate for binary symbols without the required normalization. There is no code, no stated fixed-point precision, and no detailed channel model, so the empirical results are not independently checkable. The contribution is therefore not yet ready for publication.","major_comments":[{"comment":"The paper states that Eq. (4) is the partial derivative ∂F_bin/∂s_k, but the displayed expression contains a Kronecker delta that selects the maximum of E_bin_k + β_k|D_k| and is zero otherwise. This is not a derivative; it is an ad-hoc active-set selection rule. Moreover, Eq. (6) defines the actual update as δ_k = t_k MajV(k)|s_j|, which does not follow from minimizing F_bin in any gradient-descent sense: there is no step along the negative gradient, and the sign and magnitude are chosen by a separate heuristic. The term 'gradient descent' is therefore not justified by the derivation. The authors should either provide a correct derivation or present the algorithm as a heuristic and evaluate it on that basis.","section":"Section III, Eqs. (3)-(6)"},{"comment":"The while condition reads '(i ≤ Imax) and ∥s∥_{l1} = 0'. As written, the loop body executes only when the syndrome is already zero, i.e., when x is a valid codeword and no correction is needed. The intended condition is almost certainly ∥s∥_{l1} ≠ 0. Even if this is a typographical error, it blocks reproducibility, because the algorithm printed in the paper would never correct a nonzero syndrome. Please correct the condition and, if possible, provide pseudocode that matches the simulator exactly.","section":"Algorithm 1, line 4"},{"comment":"The central claim that GDSU 'outperforms' GDBF is based on plotting symbol error rate for the real-number decoder against bit error rate for the binary GDBF decoder. These metrics are not commensurable when a symbol carries multiple bits: a symbol error occurs if any of its p bits is wrong, while a bit error counts one bit disagreement. The paper never reports p, never defines how a fixed-point symbol is mapped to bits, and never reports a bit-level metric for the real decoder or an information-rate-matched binary baseline. Under these conditions, a large SER advantage can be an artifact of the metric rather than a genuine decoding gain. Please report FER for both systems, or convert the real decoder output to BER at a stated precision p and match the binary code rate and blocklength.","section":"Section IV, SER vs. BER comparison"},{"comment":"The channel model is described as adding 'amplitude errors with α probability', but the amplitude distribution, its variance, and the fixed-point word length p are not specified. Earlier in the paper the error model is said to have Gaussian and rounding components, yet the simulations use a binary-symmetric-channel-like setup. Without a precise error model and quantization parameters, the Monte Carlo results for up to 100 million frames cannot be reproduced or interpreted. Please specify the error amplitude distribution, the signal constellation, p, and the GDBF parameters (e.g., threshold rule, maximum iterations) used in the comparison.","section":"Section IV, channel and simulation model"},{"comment":"The parameters β_i and t_i are stated to be 'code dependent' in Section III but are simply set to 1 in Section IV, and the conclusion acknowledges that they have not been properly investigated. The reported outperformance is therefore a statement about one unoptimized operating point, not a general property of the decoder. At minimum, a sensitivity study over β and t is needed to show that the claimed gains are not specific to this single choice.","section":"Section IV, parameter setting"}],"minor_comments":[{"comment":"There is a spelling error: 'Quasy-Cyclic' should be 'Quasi-Cyclic'.","section":"Section II-A"},{"comment":"The notation (x_k - y_k)_bin is not defined for real-valued symbols; please specify how binarization is performed in the real-number setting.","section":"Section III, Eq. (3a)"},{"comment":"The base matrix in Figure 1 appears garbled from formatting; the entries are not legible as a matrix, which makes the construction hard to follow.","section":"Figure 1"},{"comment":"The complexity table compares ADD and XOR operations but does not account for the additional precision bits (p + ⌈log2 dc⌉) mentioned in the text; please clarify whether the comparison is at equal throughput or equal precision.","section":"Section IV, Table I"},{"comment":"Reference [14] is cited as '7.7gbps encoder design...' with incomplete author information; please verify the citation format.","section":"References"}],"recommendation":"reject","confidential_remarks":"The SER-vs-BER mismatch alone is sufficient to undermine the abstract's central claim, and the inverted while-loop condition means the algorithm as printed cannot have produced the results. These are load-bearing issues that require a redesigned evaluation rather than a local correction, so I recommend rejection. The authors should be encouraged to resubmit with a properly normalized comparison, a corrected and complete algorithm description, and full simulation parameters."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"First thing you should know: the GDSU decoder is a genuinely new idea, but the paper's headline claim that it outperforms GDBF is not supported by the evidence as presented. The SER-vs-BER mismatch alone is enough to invalidate the comparison, and the inverted while-loop in Algorithm 1 makes the printed algorithm unreproducible.\n\nWhat's new and worth taking seriously: as far as I can tell, this is the first adaptation of Wadayama's GDBF to real-number QC-LDPC codes with an exact-decoding objective. The majority-voter direction (5) and the min-magnitude update (6) are reasonable heuristics, and the addition-only complexity analysis in Table I is a practical point. Setting the free parameters β and t to 1 rather than fitting them is honest, and the conclusion explicitly flags this as future work.\n\nNow the soft spots, in proportion. The main load-bearing problem is the empirical comparison in Section IV. They plot symbol error rate for GDSU against bit error rate for GDBF. A symbol carries multiple bits, and SER scores the symbol wrong if even one bit fails, while BER counts individual bit errors. That makes the real-number decoder look worse, not better, on the same event—so a two-order-of-magnitude 'improvement' in the plots is hard to explain unless the two systems are operating at very different information rates or precision. The paper never reports the fixed-point precision p, never gives a bit-level metric for the real decoder, and never matches the binary baseline in information rate. Without that, the abstract's 'outperforms' is not established. This is not a cosmetic issue; it is the basis for the central claim.\n\nSecond, Algorithm 1 line 4 says 'while (i ≤ Imax) and ||s||_l1 = 0'. Read literally, the decoder stops whenever the syndrome is nonzero, so it never corrects anything. That has to be a typo for '≠ 0' or '> 0', but as printed it is a reproducibility blocker. Third, Eq. (6) is presented as if it follows from the energy function, but Eq. (4) is not a derivative; it is a selection rule with a Kronecker delta that is one at the maximum. The min-magnitude step is asserted, not derived. If the method is called 'gradient descent', the authors need to either ground the update or label it a heuristic.\n\nNone of this kills the underlying idea. The decoder is simple, the encoding is cheap, and the exact-decoding energy with binarized syndromes is plausible. But the paper as it stands would not survive a careful referee.\n\nRecommendation: send it to peer review with an expectation of major revision. The idea deserves referee time; the evidence needs to be redone. Ask for bit-level results at a stated p, a matched baseline, a corrected pseudocode, and either a derivation or an honest heuristic label.","headline":"New decoder idea, but the headline performance claim rests on a SER-vs-BER mismatch and a broken while-loop; worth major revision, not acceptance as is.","tokens_in":6835,"tokens_out":4100,"would_cite":false,"duration_ms":43934,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["94B35","94B05"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper shows that a real-number LDPC code from the IEEE 802.11 standard can be decoded by an additive gradient-descent rule, outperforming binary GDBF at rates 1/2 and 2/3 and matching it at 3/4.","keywords":["real-number codes","gradient descent decoding","LDPC codes","GDSU","GDBF","QC-LDPC","IEEE 802.11","iterative decoding"],"falsifier":"For the same set of transmitted frames, convert each decoded real-number frame back to its bit representation and compute the resulting bit error rate; if the real-number decoder's apparent two-order-of-magnitude advantage over GDBF disappears under this bit-level comparison, the central 'outperforms' claim is a metric artifact rather than a genuine decoding improvement.","tokens_in":5796,"feed_emoji":"🧮","tokens_out":6602,"duration_ms":52931,"temperature":0.7,"pith_summary":"Real-number error-correcting codes work directly on symbols rather than bits, which fits DSP-style hardware and fault-tolerant computation. This paper introduces the Gradient Descent Symbol Update (GDSU) decoder for a class of real-number LDPC codes whose parity-check matrices are taken from the IEEE 802.11 standard. The paper reports that GDSU outperforms the binary gradient-descent bit-flipping (GDBF) decoder at rates 1/2 and 2/3, and performs about the same at rate 3/4. Encoding and decoding rely only on addition, comparison, counting, and maximum-finding operations, so the approach is arithmetic-friendly.","feed_headline":"Real-number LDPC decoder outperforms binary bit-flipping","feed_subtitle":"GDSU uses only additions and beats GDBF on WiFi codes at rates 1/2 and 2/3.","key_machinery":"The load-bearing mechanism is the GDSU update rule built from a modified local energy. The decoder computes the syndrome $s = Hx$, binarizes each syndrome component to $+1$ for an unsatisfied check and $-1$ for a satisfied check, and forms for each symbol $k$ a local energy $E_k^{\\mathrm{bin}}$ plus a column-agreement term $\\beta_k |D_k|$, where $D_k$ is the sum of the signs of the syndromes that contain symbol $k$. The active set is the set of symbols maximizing this local energy; the magnitude of each update is the smallest nonzero syndrome among the checks touching that symbol, and its sign is the majority vote of those syndrome signs (or the received symbol's sign if all checks are satisfied). Iterating these additive corrections until the $\\ell^1$ norm of the syndrome is zero or a maximum iteration count is reached performs approximate gradient descent on the objective $F^{\\mathrm{bin}}(x) = \\tfrac{1}{2}\\|r\\|_\\infty^2$. On the encoding side, the parity-check matrix is kept in approximate lower triangular form with the diagonal entries set to $-1$, giving a two-stage purely additive encoder.","core_discovery":"The central claim is that a real-number parity code with a QC-LDPC parity-check matrix from the IEEE 802.11 standard can be decoded by an approximate gradient-descent rule that updates symbol values rather than flipping bits. The decoder, GDSU, defines an energy function over binarized syndrome violations, selects the active symbol set as the maximum of a local gradient, and corrects each active symbol by the minimum nonzero syndrome magnitude in its parity checks, with direction given by a majority vote of syndrome signs. In Monte Carlo simulations over a binary symmetric channel with amplitude errors added to flipped symbols, GDSU outperforms the binary GDBF decoder by two orders of magnitude at rate 1/2 and one order at rate 2/3, and gives roughly equal performance at rate 3/4. The authors attribute the gap at higher rate to the unoptimized default values $\\beta_i = t_i = 1$, pointing to parameter tuning as future work.","pith_inferences":["The reported gain at rate 1/2 may shrink when symbol error rate is converted to bit error rate, because a single real-symbol error can corrupt multiple bits; the paper compares SER against BER directly.","A natural next test is to apply the same GDSU update to 5G NR base matrices, which share the quasi-cyclic structure of the 802.11 codes studied here.","Tuning $\\beta$ and $t$ per rate could change the rate-3/4 result from 'similar' to 'better'; this is testable with the paper's own simulator.","The decoder's ability to correct both amplitude and sign of errors, whereas binary bit-flipping can only flip a bit, likely explains the low-rate gains; this suggests the real-number decoder uses information the binary channel model discards."],"forward_implications":["If the claim holds, real-number LDPC codes from WiFi and similar standards can be decoded with the same arithmetic units used for signal processing, avoiding bit-level XOR operations.","The two-order-of-magnitude improvement at rate 1/2 suggests real-number codes are especially attractive at low code rates for applications such as fault-tolerant computation.","The comparable performance at rate 3/4 indicates the approach does not degrade catastrophically at higher rates even with default parameters.","Because the decoder uses only $\\ell^1$-norm syndrome checks and additive updates, it is amenable to fixed-point implementation with $p + \\lceil d_c \\rceil + 1$ bits of precision, as shown in the paper.","The parameters $\\beta$ and $t$ are code-dependent and were left at 1; tuning them is expected to change the rate-3/4 comparison."],"supporting_citations":[{"why":"Provides the GDBF algorithm that GDSU extends and compares against as the baseline.","marker":"[16]"},{"why":"Supplies the quasi-cyclic LDPC construction from circulant permutation matrices used to build the real-number parity-check matrices.","marker":"[12]"},{"why":"Gives the efficient encoding method for approximate lower triangular parity-check matrices that the two-stage additive encoder relies on.","marker":"[13]"},{"why":"Establishes that linear codes over finite fields have real-number counterparts, grounding the whole real-number coding approach.","marker":"[17]"},{"why":"Shows the IEEE 802.11n/ac encoder structure that the real-number encoder adapts.","marker":"[14]"}],"fun_headline_variants":["Real-number LDPC decoder: two orders better at half rate","Simple gradient decoder beats bit-flipping on WiFi LDPC codes","GDSU decoder uses only additions, trumps GDBF on WiFi codes","Outperforms binary bit-flipping: real-number LDPC decoder"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The paper compares symbol error rate for the real-number decoder directly against bit error rate for the binary decoder, so the claimed gains assume these two metrics are measuring the same thing.","fun_headline_variants_meta":{"raw":{"variants":["Real-number LDPC decoder: two orders better at half rate","Simple gradient decoder beats bit-flipping on WiFi LDPC codes","GDSU decoder uses only additions, trumps GDBF on WiFi codes","Outperforms binary bit-flipping: real-number LDPC decoder"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001143,"raw_usage":{"total_tokens":4718,"prompt_tokens":892,"completion_tokens":3826,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":508,"completion_tokens_details":{"reasoning_tokens":3748}},"tokens_in":508,"tokens_out":3826,"duration_ms":23900,"temperature":1.0,"reasoning_tokens":3748,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T13:22:40.242847+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For the same set of transmitted frames, convert each decoded real-number frame back to its bit representation and compute the resulting bit error rate; if the real-number decoder's apparent two-order-of-magnitude advantage over GDBF disappears under this bit-level comparison, the central 'outperforms' claim is a metric artifact rather than a genuine decoding improvement.","supporting_citations":[{"cited_title":"Gradient descent bit flipping algorithms for decoding ldpc codes,","cited_arxiv_id":null,"evidence_quote":"Provides the GDBF algorithm that GDSU extends and compares against as the baseline."},{"cited_title":"Quasicyclic low-density parity-check codes from circulant permutation matrices,","cited_arxiv_id":null,"evidence_quote":"Supplies the quasi-cyclic LDPC construction from circulant permutation matrices used to build the real-number parity-check matrices."},{"cited_title":"Efficient encoding of low-density parity- check codes,","cited_arxiv_id":null,"evidence_quote":"Gives the efficient encoding method for approximate lower triangular parity-check matrices that the two-stage additive encoder relies on."},{"cited_title":"Real-number codes for fault-tolerant matrix operations on processor arrays,","cited_arxiv_id":null,"evidence_quote":"Establishes that linear codes over finite fields have real-number counterparts, grounding the whole real-number coding approach."},{"cited_title":"7.7gbps encoder design for ieee 802.11n/ac qc-ldpc codes,","cited_arxiv_id":null,"evidence_quote":"Shows the IEEE 802.11n/ac encoder structure that the real-number encoder adapts."}],"review_version":1}