{"id":"56fd8502-7d6a-4157-b09d-f229ae575e07","arxiv_id":"1908.08836","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":1.0,"correctness_risk":"high","formal_verification":"none","parameter_count":2,"one_line_summary":"The double mapping modulation is a relabeled QPSK, and the claimed beyond-capacity result follows from an invalid additive decomposition of mutual information.","lead":"One paper claims a 'double mapping modulation' can send information faster than ordinary BPSK and even go beyond the BPSK channel capacity. The proposed constellation is just standard QPSK, so the result is a well-known comparison between QPSK and BPSK, not a new capacity limit.","discovery_kind":"incremental","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Eq. (5)'s additive decomposition of mutual information is invalid for the actual QPSK channel; the beyond-BPSK conclusion rests on this unsupported decomposition and on a non-information-theoretic subtraction of simulated coding gains.","rationale":"The reader's weakest assumption identifies Eq. (5) as the load-bearing step, and my reading confirms that it is the point of failure. The actual DMM channel is QPSK, and the mutual information obeys the chain rule; the paper's summation of two unconditional BPSK mutual informations at the same SNR is not derived and is generally larger than the true mutual information. The paper also makes an internal numerical inconsistency (0.052 dB vs. 0.52 dB) and treats a finite-length BER simulation gain as subtractable from a Shannon-gap figure, which is not an information-theoretic operation. These are internal-consistency problems, not merely disagreements with common practice. Since the central claim of beyond-BPSK capacity relies on Eq. (5) and on this invalid extension, the rejection remains appropriate; no change to the reader's verdict is needed.","tokens_in":4482,"tokens_out":10174,"duration_ms":105324,"concrete_test":"Numerically evaluate I(X1,B;Y) for the four equiprobable symbols at Es/N0 = 0 dB by Monte Carlo integration over y = s_k + n, and evaluate the right-hand side of Eq. (5) using the exact BPSK capacity formula for I_x1(Es/sigma_N^2) and I_x2(Es/sigma_N^2). If the sum exceeds I(X1,B;Y), Eq. (5) is invalid and the beyond-capacity conclusion is unsupported. Repeat at several SNRs around the operating region of Fig. 3 to see whether the inequality is systematic.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim depends on Eq. (5), which writes the total achievable bit rate as I_t = I_x1(Ex1/sigma_N^2) + I_x2(Ex2/sigma_N^2). The actual channel in Section II is y = Gamma_beta x1 + n, not two separate observations y1 = x1+n and y2 = x2+n. The transmitted set {s1,...,s4} is exactly a QPSK constellation: one bit chooses the sign of x1 and one bit chooses beta in {0, pi/2}. The only exact decomposition is the chain rule I(X1,B;Y) = I(B;Y) + I(X1;Y|B). The second term is a conditional mutual information, equal to BPSK capacity only when B is known perfectly; the first term is the information conveyed by the quadrature-phase choice while x1's sign is unknown, not the independent BPSK term I_x2(Es/sigma_N^2) used in Eq. (5). Hence Eq. (5) has no derivation and generally overestimates the actual mutual information. The 'theoretical' extension in Section III is also not a capacity proof: it subtracts a simulated BER gain (given as 0.052 dB in the text and then as 0.52 dB in the following sentence) from the 0.0045 dB gap of a particular LDPC code to BPSK capacity. Simulated coding gains relative to a specific finite-length code do not add to the Shannon gap to produce a negative gap, and changing the input alphabet to QPSK means the relevant upper bound is C_QPSK, not C_BPSK. The claim 'beyond the channel capacity of BPSK input' therefore reduces to the unremarkable fact that a different, larger input alphabet can carry more bits; it does not establish a rate beyond the capacity of the actual input distribution.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes a 'double mapping modulation' (DMM) scheme in which two independent binary streams are combined into one complex symbol: the first stream determines the sign of x1 and the second selects a rotation angle β ∈ {0, π/2}. The receiver successively estimates the rotation to recover the second stream and then de-rotates to recover the first. The authors claim that the achievable bit rate is the sum of the two individual mutual informations (Eq. (5)), and they report a simulated gain of 0.052 dB (later 0.52 dB) over BPSK with LDPC codes. They then subtract this gain from the 0.0045 dB gap of a rate-1/2 LDPC code to BPSK capacity, obtaining a negative gap and concluding that the scheme operates beyond the BPSK channel capacity.","tokens_in":4929,"tokens_out":6750,"duration_ms":62734,"significance":"If the paper's central claim were correct, it would contradict the standard capacity formula for a fixed input alphabet, because the transmitted set {s1, s2, s3, s4} is exactly a QPSK constellation. The paper is clearly written and the simulation setup is described in enough detail to be reproducible in its essentials, but the information-theoretic argument rests on an incorrect additive decomposition of mutual information. The correct treatment shows that the DMM is QPSK with two bits per symbol; the observation that QPSK can exceed BPSK capacity at the same symbol energy is well known and does not require the proposed construction. The paper's quantitative extension is also invalid because it subtracts a simulated coding gain from a Shannon gap. The manuscript's central contribution is therefore not established.","major_comments":[{"comment":"Equation (5) asserts that the overall mutual information is the sum of two separate mutual informations, I_x1(E_s/σ_N^2) + I_x2(E_s/σ_N^2). This is not the mutual information of the actual channel in Eq. (10), y = x1 e^{jβ} + n, which is a single observation corrupted by one noise term. The correct decomposition is the chain rule I(V1,V2;Y) = I(V2;Y) + I(V1;Y|V2), and the second term is not equal to the BPSK mutual information unless V2 is known perfectly. The signal set in Table I and Fig. 1 is the standard QPSK constellation, whose capacity is the relevant upper bound. Thus Eq. (5) double-counts the received signal and overestimates the achievable rate; the central premise of the paper is false.","section":"Section II, Eq. (5)"},{"comment":"The calculation G = 0.0045 dB − 0.52 dB = −0.516 dB is not a valid information-theoretic result. The 0.0045 dB quantity in [1] is the gap of a particular rate-1/2 LDPC code to the BPSK capacity at a particular operating point, and the simulated gain of the proposed scheme is a finite-length, finite-SNR coding gain. Subtracting these two numbers does not produce a bound on the gap to capacity. Furthermore, because the DMM alphabet is QPSK, the correct capacity to compare against is C_QPSK, so the conclusion that the scheme achieves a rate beyond BPSK capacity is an immediate consequence of using a two-bit-per-symbol constellation and does not follow from the proposed separation.","section":"Section III, paragraph beginning 'An extension is made'"},{"comment":"The manuscript reports a gain of '0.052dB' and then, in the next sentence, '0.52dB' for the same simulation. This order-of-magnitude inconsistency is not resolved, and the BER curves in Fig. 3 are shown without error bars or any statistical confidence measure. Since the extension in the following paragraph uses the 0.52 dB value, the numerical basis of the beyond-capacity claim is unreliable. The authors should clarify the correct value and provide confidence intervals or repeated trials.","section":"Section III, Fig. 3 and the following sentence"}],"minor_comments":[{"comment":"The first sentence uses 'The paper proposed' and 'the ABR's summation'; these should be 'This paper proposes' and 'the summation of the ABRs' for grammatical correctness and clarity.","section":"Abstract"},{"comment":"The text uses 'infinitive length' and 'arbitrary small'; these should be 'infinite length' and 'arbitrarily small'.","section":"Section III"},{"comment":"'Shannon theorem' should be 'Shannon's channel coding theorem' or 'the Shannon coding theorem'.","section":"Section III"},{"comment":"Table I is difficult to read; a standard table with columns for v(2), β, and the resulting symbol points would be much clearer.","section":"Table I"},{"comment":"The statement about the 'target spectral efficiency is at 0.5bit/Hz/s' is unclear because the DMM symbol carries two code bits; the overall spectral efficiency depends on the two code rates and should be explicitly computed.","section":"Section III"}],"recommendation":"reject","confidential_remarks":"This manuscript contains a fundamental information-theoretic error in Eq. (5) and a numerically inconsistent extension in Section III. The proposed DMM is equivalent to QPSK, so the beyond-BPSK-capacity claim is either trivial (a larger alphabet can carry more bits) or false as derived. I recommend rejection. The authors should be encouraged to study the chain rule for mutual information and the capacity of QPSK before resubmitting."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear colleague,\n\nYou should know upfront: the central claim is wrong. The scheme transmits four points, ±√Es on the real axis and ±√Es on the imaginary axis. That is QPSK. Calling it double mapping modulation does not change the alphabet. The capacity of that alphabet is the textbook QPSK capacity, which is higher than BPSK capacity at the same symbol energy. So finding a rate above BPSK capacity is nothing new.\n\nThe load-bearing math is Eq. (5), which asserts that total mutual information is the sum of two independent BPSK mutual informations at the same SNR. For y = Γβ x1 + n, the correct chain rule is I(x1,β;Y) = I(β;Y) + I(x1;Y|β). The second term is conditional, not the unconditional BPSK mutual information, and the first term is not I_x2(E_s/σ²). Eq. (5) overestimates the true mutual information, and no derivation is offered. Section III's \"extension\" is not a capacity proof either: subtracting a simulated coding gain (0.052 dB in one sentence, 0.52 dB in the next) from the 0.0045 dB Shannon gap does not produce a negative gap to the BPSK capacity. Simulated gains relative to specific finite-length LDPC codes do not change the Shannon limit.\n\nWhat the paper does well is modest. The constellation and the two-stage decoder (first estimate the rotation, then de-rotate and decode the BPSK component) are clearly described. The BER simulations show that at rate 1/16 for the second stream, the scheme beats plain BPSK with the same rate-1/2 code by a small margin at BER 10⁻⁸. That is plausible because QPSK can carry more information than BPSK. But there are no error bars, no code, and the inconsistent 0.052/0.52 dB numbers make the simulation claim hard to trust as reported.\n\nWho should read this? Someone teaching a course on why constellation choice matters might use it as a cautionary example of what happens when you confuse a different input alphabet with a capacity-pushing scheme. As a research contribution, it does not deserve referee time. The error in Eq. (5) is fundamental, and the conclusion is not merely overstated; it is false.\n\nRecommendation: desk reject, or send back with a short note explaining why the transmitted alphabet is QPSK and why the chain rule invalidates the additive decomposition. I would not cite it.\n\nBest,","headline":"The paper's 'beyond BPSK capacity' claim collapses because the transmitted constellation is just QPSK and Eq. (5)'s additive mutual information decomposition is invalid; what remains is a modest, plausible BER gain from a relabeled QPSK with successive decoding.","tokens_in":5419,"tokens_out":1269,"would_cite":false,"duration_ms":15355,"reading_group":"no","serious_thinker":"no","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper claims that a four-symbol constellation formed by rotating BPSK, called double mapping modulation, reaches an achievable bit rate beyond the channel capacity of BPSK input.","keywords":["achievable bit rate","BPSK","channel capacity","double mapping modulation","mutual information","AWGN channel","LDPC codes","Hamming space"],"falsifier":"Take the four-symbol DMM constellation at the SNRs of Fig. 2 and compute the true mutual information $I(V_1,V_2;Y)$ by numerical entropy estimation; then compare it with the sum in Eq. (5) and with the single-BPSK mutual-information curve. If the true value is no larger than BPSK's curve at any SNR, the claimed $-0.516$ dB surplus is not achievable; if the sum exceeds the true value, the decomposition itself is the reason for the apparent gain.","tokens_in":4283,"feed_emoji":"📡","tokens_out":10291,"duration_ms":99837,"temperature":0.7,"pith_summary":"This paper proposes a transmission and detection scheme called double mapping modulation (DMM), in which a second binary stream is encoded in the rotation angle of a BPSK symbol, producing a four-point constellation in the complex plane. It argues that after the receiver first decodes the rotation bit and then de-rotates the received symbol, the overall mutual information splits additively into the mutual informations of the two separated streams, each evaluated at the same signal-to-noise ratio. Because mutual information is a nonlinear function of signal power, the split can yield a larger total achievable bit rate than a single BPSK stream at the same energy. Simulations with LDPC codes are reported to show a small BER gain over conventional BPSK, and the authors extend this gain to the 0.0045 dB coding gap, concluding that the method reaches a rate beyond the channel capacity of BPSK input.","feed_headline":"Twin BPSK streams are claimed to pass BPSK capacity","feed_subtitle":"A rotation bit turns one BPSK symbol into two streams, splitting mutual information into a sum that can beat a single stream.","key_machinery":"The load-bearing object is DMM, defined by mapping each bit of the second stream to a rotation $\\beta \\in \\{0, \\pi/2\\}$ of a BPSK point, so each transmitted symbol carries two bits: one in the sign of $x_1$ and one in the rotation. The Hamming-to-Euclidean mapping produces four points and lets the receiver separate the two streams in two stages: decode the rotation bit, de-rotate the stored signal, then decode the BPSK bit. The specific mechanism claimed to create the gain is Eq. (5), the additive decomposition of total mutual information into the two per-stream mutual informations. Since mutual information is a nonlinear function of signal-to-noise ratio, the decomposition turns the capacity question into a sum of two per-stream mutual informations, and the receiver's de-rotation step is what makes that additive form available.","core_discovery":"The central claim is that double mapping modulation (DMM) raises the achievable bit rate of a BPSK-based system above the channel capacity of BPSK input. The first stream is mapped to ordinary BPSK symbols $x_1$; the second stream chooses a rotation angle $\\beta = 0$ or $\\beta = \\pi/2$ applied to $x_1$, yielding the four-symbol constellation $s_1,\\dots,s_4$ in the complex plane. At the receiver the rotation bit is decoded first, the stored signal is de-rotated to recover $x_1$, and then the BPSK bit is decoded. The paper replaces the single mutual information with the additive form $\\tilde{I}_t = \\tilde{I}_{x_1}(E_{x_1}/\\sigma_N^2) + \\tilde{I}_{x_2}(E_{x_2}/\\sigma_N^2)$, and because both streams use the same symbol energy, the sum is claimed to be larger than the single-stream BPSK mutual information at the same SNR. Simulations of the two-stage receiver with LDPC codes show a BER gain over plain BPSK, and the paper's extension subtracts this gain from the 0.0045 dB coding gap, obtaining $G = 0.0045\\,\\mathrm{dB} - 0.52\\,\\mathrm{dB} = -0.516\\,\\mathrm{dB}$, which it reads as going beyond BPSK capacity.","pith_inferences":["The same construction could be layered: more than one rotation angle per BPSK point would add more streams, but each extra layer would inherit the estimation errors of the layers decoded before it.","The paper uses one strong code on the first stream and a weaker repeated code on the rotation stream; a natural design search would optimize the rate split between the two layers, since spending too much rate on the rotation stream erodes the claimed net gain.","If Eq. (5) is replaced by the exact chain rule, any gap between the two formulas would show whether the gain is a property of the constellation or a property of the additive decomposition; this is a direct numerical check the paper does not perform."],"forward_implications":["With error-free recovery of the rotation bit, the first stream retains exactly BPSK's BER, so the second stream's information is a pure addition to the achievable rate.","If the additive split in Eq. (5) holds, the design problem for a binary-input system becomes choosing two codes, one for each layer, with the total rate being the sum of their rates rather than the single-constellation capacity.","The reported gain would close and cross the 0.0045 dB gap between LDPC-coded BPSK and the BPSK input channel capacity, placing the operating point in a region normally forbidden for BPSK.","At the target spectral efficiency of 0.5 bit/s/Hz, the same LDPC code that serves the first stream can be kept, while the added rotation stream uses a lower-rate repeated code, giving a small positive energy-per-bit advantage over plain BPSK."],"supporting_citations":[{"why":"Supplies the 0.0045 dB coding gap and the LDPC-coded BPSK baseline that the proposed scheme is compared against.","marker":"[1]"},{"why":"Defines channel capacity via the entropy difference in Eq. (2), the reference point for the beyond-capacity claim.","marker":"[2]"},{"why":"Introduces the double-space cooperation and signal-separation idea that motivates separating x into x1 and x2 and the additive ABR treatment.","marker":"[3]"},{"why":"Provides the averaged-SNR mutual-information representation used for the per-stream terms in Eq. (5).","marker":"[4]"}],"fun_headline_variants":["Rotation bit splits BPSK into twin streams, beating capacity","Double mapping modulation lifts BPSK above its own capacity","One BPSK symbol, two streams: capacity exceeded","Splitting mutual information lets BPSK beat capacity","Twin-stream BPSK with rotation bit claims capacity gain"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The whole argument depends on Eq. (5): the total mutual information of the two-stream signal is exactly the sum of the individual mutual informations computed at the same noise level, with no extra term for how much the first stream's bits depend on knowing the second stream's rotation.","fun_headline_variants_meta":{"raw":{"variants":["Rotation bit splits BPSK into twin streams, beating capacity","Double mapping modulation lifts BPSK above its own capacity","One BPSK symbol, two streams: capacity exceeded","Splitting mutual information lets BPSK beat capacity","Twin-stream BPSK with rotation bit claims capacity gain"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00021,"raw_usage":{"total_tokens":1418,"prompt_tokens":963,"completion_tokens":455,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":579,"completion_tokens_details":{"reasoning_tokens":372}},"tokens_in":579,"tokens_out":455,"duration_ms":4933,"temperature":1.0,"reasoning_tokens":372,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T11:28:54.481510+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take the four-symbol DMM constellation at the SNRs of Fig. 2 and compute the true mutual information $I(V_1,V_2;Y)$ by numerical entropy estimation; then compare it with the sum in Eq. (5) and with the single-BPSK mutual-information curve. If the true value is no larger than BPSK's curve at any SNR, the claimed $-0.516$ dB surplus is not achievable; if the sum exceeds the true value, the decomposition itself is the reason for the apparent gain.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the 0.0045 dB coding gap and the LDPC-coded BPSK baseline that the proposed scheme is compared against."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Defines channel capacity via the entropy difference in Eq. (2), the reference point for the beyond-capacity claim."},{"cited_title":"Jiao and D","cited_arxiv_id":null,"evidence_quote":"Introduces the double-space cooperation and signal-separation idea that motivates separating x into x1 and x2 and the additive ABR treatment."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the averaged-SNR mutual-information representation used for the per-stream terms in Eq. (5)."}],"review_version":1}