{"id":"8387c0af-2e88-44c9-b436-e01434f8c5c3","arxiv_id":"2411.13878","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A new class of sparse 2D arrays with zero periodic correlation zones, constructed from restricted generalized Boolean functions, yields spatial modulation training matrices with twice the ZCZ width of prior CZCP-based designs.","lead":"This paper introduces sparse zero correlation zone (SZCZ) arrays and uses them as training matrices for channel estimation in spatial modulation systems. The proposed construction doubles the zero correlation zone width compared with existing cross Z-complementary pair based training designs, allowing better tolerance for multipath delay spread.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Proofs of Theorems 1 and 3 use a nonexistent π(v−2) bit when the first differing unrestricted bit is at v=2, a case that occurs at the claimed ZCZ boundary.","rationale":"The reader's conditional verdict is appropriate, but their stated weakest assumption (m_1 = |I_1| = 1 making π1(2) undefined) is not the most load-bearing flaw. A far more central issue is the v = 2 case in the correlation proofs of both Theorem 1 and Theorem 3: the manuscript's Equation (34) (and its Theorem 3 analogue) references j_{π(v−2)} when v = 2, where π(v−2) does not exist. This case is not a degenerate parameter choice; it occurs at the boundary shift u = 2^{π(2)−1}, which is precisely the width the theorems claim as the ZCZ parameter. If the cancellation genuinely fails there, the proposed SZCZ matrices would not meet criterion (C2) at their stated width, directly undermining the superiority claim over CZCP/CZCS training matrices. A quick numerical check on a small instance can settle whether the construction itself is valid; if it passes, the issue is a fixable proof gap and conditional acceptance remains appropriate. I therefore do not change the reader's verdict, but I identify 'fix the v = 2 proof case' as the concrete condition that should be met before final acceptance.","tokens_in":18032,"tokens_out":9099,"duration_ms":78120,"concrete_test":"Construct the Theorem 1 instance with m = 4, n = 1, π = (4,3,2,1), q = 2, f = x4x3 + x3x2, yielding a claimed (2,16,4,1/2)-SZCZ matrix, and directly compute θ(C_g,C_k;4) for all g,k ∈ {0,1}. Also compute the correlation at shift u = 8 for the Example 4 matrix in Theorem 3. If any of these boundary-shift correlations is nonzero, the central claim is false; if all are zero, the construction survives but the proof needs a corrected v = 2 argument.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is that the 2D RGBF constructions in Theorem 1 and Theorem 3 directly give SM training matrices with the stated ZCZ width. Both proofs of criterion (C2) rely on a pairwise cancellation argument: in Appendix A, Case 1, with v the smallest index such that i_{π(v)} ≠ j_{π(v)}, the proof flips the bit at position π(v−1) and derives Equation (34), which contains the term j_{π(v−2)}. This term is undefined when v = 2, and v = 2 is not excluded: it occurs whenever i_{π(1)} = j_{π(1)} but i_{π(2)} ≠ j_{π(2)}, exactly the situation at the boundary shift |u| = 2^{π(2)−1}. The same unhandled v = 2 case appears in Appendix C, Case 1, after the proof establishes j_{πα(1)} = i_{πα(1)} for all α; the smallest differing bit within a block can be β = 2, again making π(v−2) undefined. Because the proof as written breaks precisely at the maximal shift promised by the ZCZ parameter, this is not a cosmetic boundary issue. The construction may still be correct — preliminary small instances suggest the cancellation can be recovered from the x_{π(1)}x_{π(2)} term alone — but the manuscript does not provide that argument. The reader's m_1 = |I_1| = 1 boundary concern is related but secondary: adding the condition m_1 ≥ 2 fixes the statement's undefined Z, but the v = 2 gap persists even when m_1 ≥ 2 and affects the proof of the main generality of Theorem 3.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper introduces sparse zero correlation zone (SZCZ) arrays as training matrices for spatial modulation (SM) systems. It defines SZCZ arrays, derives the condition under which an SZCZ array yields minimum-NMSE channel estimation, and proposes two direct constructions based on 2D restricted generalized Boolean functions (RGBFs): Theorem 1 and Theorem 3. The authors claim that the constructions satisfy the SM-specific column-sparsity criterion (C1) and the zero-correlation criterion (C2), and that the best construction achieves a ZCZ width twice that of the existing CZCP/CZCS-based training matrices. Simulation results for a 4x64 training matrix show that the proposed SZCZ design attains the minimum NMSE for up to nine multipaths and improves BER relative to the compared schemes.","tokens_in":18406,"tokens_out":6400,"duration_ms":55655,"significance":"If the construction theorems are correct, the paper makes a useful contribution to SM training design: it provides a direct, kernel-free construction of sparse training matrices with controllable sparsity and larger ZCZ widths than existing CZCP/CZCS-based frameworks. The use of 2D RGBFs is a natural extension of prior Boolean-function-based sequence designs, and the paper honestly notes that the prior CZCP construction arises as a special case (Corollary 2). The worked examples and simulations support the claimed performance for the specific parameters shown. However, the proof of the main theorems contains an unhandled boundary case at the claimed maximal shift, and Theorem 3's statement omits a necessary condition on the partition block size; these issues need to be fixed before the central claims are fully established.","major_comments":[{"comment":"The proof of Theorem 1 uses the expression j_{π(v−2)} in Eq. (34), but when v=2 the index π(v−2)=π(0) does not exist. The case v=2 is not excluded: it occurs when i_{π(1)}=j_{π(1)} and i_{π(2)}≠j_{π(2)}, which happens at the boundary shift |u|=2^{π(2)−1}. Since the claimed ZCZ width is exactly 2^{π(2)−1}, the proof as written breaks precisely at the maximal promised shift. The cancellation can likely be recovered from the x_{π(1)}x_{π(2)} term alone (the missing j_{π(v−2)} term is absent for v=2), but the manuscript does not provide this argument. Please add a separate treatment of v=2 or define the term as zero in that case and show the cancellation still holds.","section":"Appendix A, Case 1, Eq. (34)"},{"comment":"The same undefined-index issue appears in the proof of Theorem 3. After establishing j_{πα(1)}=i_{πα(1)} for all α, the proof lets v be the smallest index with j_{π_ˆα(v)}≠i_{π_ˆα(v)} and flips the bit at position π_ˆα(v−1). If v=2, then π_ˆα(v−2) is undefined in the analog of Eq. (34). This case is not merely hypothetical: it can occur when the first differing unrestricted bit inside the block is the second one, which is compatible with the shift bound u≤2^{π1(2)−1}. Please add the v=2 boundary argument here as well.","section":"Appendix C, Case 1, Eq. (47)"},{"comment":"Theorem 3 asserts that the constructed array is a (2^n, 2^m, 2^{π_1(2)−1}, S)-SZCZ matrix, but π_1(2) is undefined when m_1=|I_1|=1. The stated hypothesis m>n does not prevent m_1=1. Please add the condition m_1≥2 (or otherwise handle the m_1=1 case and give a valid ZCZ-width formula for it). This is a statement-level, not merely cosmetic, fix because the ZCZ width is the paper's central claimed improvement.","section":"Theorem 3 statement"}],"minor_comments":[{"comment":"In the definition of the 2D GBF, the text says '1 ≤ m ≤ m' where the second 'm' should be a different index; this is a typo that should read, e.g., '1 ≤ i ≤ m'.","section":"Section II.A"},{"comment":"The condition on π reads 'π(m − n + a) ∈ {m − n, m− n + 1, . . . , m− 1} for α = 1, 2, . . . , n'; the symbol 'a' should be 'α'.","section":"Theorem 1"},{"comment":"The simulation figures do not include error bars or confidence intervals. Since the claimed NMSE saturation at the minimum value is central to the comparison, adding error bars or repeated-trial statistics would strengthen the evidence.","section":"Section IV, Figs. 5 and 6"},{"comment":"The CZCS-based scheme of [31] is listed with ZCZ width 3 for the 4×64 case, while Table I uses the parameter k; it would help the reader to spell out the exact values of k and n,m used in the comparison in the table caption or in Example 4.","section":"Example 4 and Table I"}],"recommendation":"major_revision","confidential_remarks":"The construction idea is sound and the comparison with prior work is honest, including the explicit reduction to CZCP-based training matrices. The problems identified in the proofs are local and likely repairable, but they occur at the boundary of the claimed ZCZ width and in the statement of Theorem 3, so they should be fixed before publication. I see no evidence of circularity or fitted parameters; the simulations are straightforward. The manuscript is within the scope of the journal."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take on arXiv 2411.13878. The paper introduces sparse ZCZ arrays and uses 2D restricted GBFs to build SM training matrices with twice the ZCZ width of the CZCP/CZCS-based schemes. That is a real, useful incremental result for the SM training literature, and the relation to [23] is handled honestly: Corollary 2 shows the earlier design is a special case, and Theorem 3 exceeds it. The construction is direct, parameter-free, and the worked examples and simulations line up with the claims. The sparsity control through variable restriction is neat.\n\nThe soft spots are in the proofs, not the architecture. The reader flagged the missing m_1 ≥ 2 condition in Theorem 3; I agree, and it is a one-line fix. The stress-test note goes further: in both Appendix A and Appendix C, the pairing argument defines i', j' by flipping bit π(v−1), then writes equations involving j_{π(v−2)}. When v=2 that index is undefined. I checked whether v=2 can actually occur under the ZCZ bound. It can: a small shift like u=1 can propagate through lower bits and flip bit π(2) even though u ≤ 2^{π(2)−1}. So the gap is real, and it sits exactly at the boundary shift the theorem promises. The construction may still be correct—the x_{π(1)}x_{π(2)} term alone might rescue the cancellation—but the manuscript does not give that argument. This is not a fatal flaw; it looks like a repairable proof gap rather than a false theorem.\n\nEverything else is in good shape. The simulations lack error bars and the comparison is to only two baselines, but for a sequences-design paper that is minor. The citation pattern is clean; self-citations are to the authors' own foundational GBF work, which is appropriate here.\n\nBottom line: this deserves a serious referee, but the referee should ask for the v=2 boundary case to be handled explicitly and for m_1 ≥ 2 to be stated. If those are fixed, the result stands as a useful extension of the CZCP framework.","headline":"Solid construction paper with a genuine factor-two ZCZ improvement, but both main proofs have an unhandled v=2 case that the referee should ask to patch.","tokens_in":18909,"tokens_out":4540,"would_cite":false,"duration_ms":40239,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["94A05","94A12"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper constructs sparse zero-correlation-zone arrays, directly usable as training matrices in spatial modulation, with ZCZ width twice that of existing CZCP-based designs.","keywords":["sparse zero correlation zone arrays","spatial modulation","training matrix design","restricted generalized Boolean functions","channel estimation","zero correlation zone","frequency-selective fading","cross Z-complementary pairs/sets"],"falsifier":"Compute the periodic correlations $\\theta(C_g,C_k;u)$ for the Theorem 3 construction in the boundary case $|I_1|=1$, for instance $m=3,n=2$ with $I_1=\\{3\\}$ and $I_2=\\{2,1\\}$. The formula $Z=2^{\\pi_1(2)-1}$ is undefined there because $\\pi_1(2)$ does not exist, so the theorem as stated makes no claim; the decisive test is whether such a matrix nevertheless has zero-correlation-zone width $2^{m-n-1}=2$, which would show the condition $|I_1|>1$ is not actually needed, or a smaller width, which would require amending the theorem.","tokens_in":1996,"feed_emoji":"📡","tokens_out":1923,"duration_ms":94190,"temperature":0.7,"pith_summary":"This paper introduces sparse zero-correlation-zone (SZCZ) arrays as training matrices for spatial-modulation systems and shows they can be built directly from two-dimensional restricted generalized Boolean functions. The central claim is that a particular parametric construction, Theorem 3, produces a $2^n \\times 2^m$ training matrix with one non-zero entry per column and zero periodic auto- and cross-correlation for all shifts up to $Z = 2^{\\pi_1(2)-1}$. For the best choice of parameters this gives $Z = 2^{m-n-1}$, twice the zero-correlation-zone width of the CZCP-based training matrices that current practice builds from kernel pairs. The paper argues this larger width translates directly into tolerance to longer multipath delay spread, and supports the claim by showing the constructed matrix reaches the minimum NMSE in least-squares channel estimation while CZCP- and CZCS-based schemes degrade once the delay spread exceeds their smaller zones.","feed_headline":"Sparse arrays double multipath tolerance in SM training","feed_subtitle":"A direct Boolean-function construction keeps channel estimation at minimum NMSE up to 9 multipaths.","key_machinery":"The machine is the 2D restricted generalized Boolean function: a Boolean function on $n+m$ binary variables whose array has entry $\\xi^{f(g,i)}$ exactly when certain prescribed bits of the column index $i$ match the row index $g$, and $0$ otherwise. Restricting $x_{\\pi_\\alpha(m_\\alpha)} = y_\\alpha$ for each block $I_\\alpha$ places one non-zero entry per column, and the chain of quadratic terms within each block, capped by the cross term $x_{\\pi_\\alpha(m_\\alpha)} y_\\alpha$, makes the phase differences cancel in pairs. The cancellation is driven by an involution that flips the bit at position $\\pi_1(1)=m$: in the proof each non-zero correlation term $C_{g,j}C^*_{k,i}$ is paired with a twin term $C_{g,j'}C^*_{k,i'}$ whose phase differs by a factor of $-1$, so the contribution vanishes. The extra condition $\\mu_m \\in \\{0,q/2\\}$ keeps the paired phases opposite, and the width $Z = 2^{\\pi_1(2)-1}$ is exactly the shift range for which the pairing argument holds.","core_discovery":"The discovery is that the SZCZ training matrix, unlike prior kernel-based designs, does not need any pre-existing cross Z-complementary pair or set as a building block. Theorem 3 constructs the matrix as a sparse array associated to a 2D RGBF $f|_{x=y}$, where variables $x_{\\pi_\\alpha(m_\\alpha)}$ are equated with row-index bits $y_\\alpha$; this restriction forces every column to contain exactly one non-zero entry, satisfying criterion (C1). The quadratic design $\\frac{q}{2}\\sum_{\\alpha=1}^n\\sum_{\\beta=1}^{m_\\alpha-1} x_{\\pi_\\alpha(\\beta)}x_{\\pi_\\alpha(\\beta+1)} + x_{\\pi_\\alpha(m_\\alpha)}y_\\alpha$ plus linear terms with $\\mu_m \\in \\{0,q/2\\}$ makes the periodic correlations vanish for shifts $1 \\le u \\le 2^{\\pi_1(2)-1}$, satisfying criterion (C2). The paper shows that when the first block $I_1$ has at least two elements and $\\pi_1(2)=m-n$, the ZCZ width reaches $2^{m-n-1}$, twice the width of the CZCP-based training matrix and larger than the CZCS-based one. Simulations for a $4\\times64$ matrix with 9 multipaths show NMSE coinciding with the theoretical minimum and a BER close to the perfect-CSI curve, about 2 dB away.","pith_inferences":["Beyond the paper, the partition of $\\{1,\\dots,m\\}$ into blocks $I_1,\\dots,I_n$ is a free parameter family: different partitions permute the arrangement of non-zero entries while preserving the ZCZ width, so one can search over partitions for training matrices with additional properties such as low peak-to-average power ratio or structured sparsity.","The paper's analysis is for periodic correlations; the same RGBF construction may extend to aperiodic ZCZ training matrices for zero-padded single-carrier SM, connecting to the equalizer used in [37].","Because the width formula is $2^{m-n-1}$, the doubling gain appears only when the training length exceeds the number of antennas by more than one order of magnitude; for $m$ close to $n$ the advantage shrinks to a single-shift zone."],"forward_implications":["An SZCZ training matrix with $Z \\ge \\lambda$ achieves the minimum NMSE $\\sigma_v^2(\\lambda+1)/M$ in least-squares channel estimation, so increasing $Z$ raises the number of multipaths the system tolerates without estimation loss.","Theorem 3 yields $(2^n, 2^m, 2^{m-n-1}, (2^n-1)/2^n)$-SZCZ training matrices, doubling the largest ZCZ width of [23]'s CZCP-based framework and exceeding [31]'s CZCS-based width.","The CZCP-based training matrices of [23] are a special case of the new construction, obtained by taking $\\pi(2)=m-n-1$ in Theorem 1, as stated in Corollary 2.","The sparsity of the training matrix is $S=(2^n-1)/2^n$, determined by the number of transmit antennas $2^n$, while the ZCZ width is controlled through $m-n$.","The construction works for any even $q$, so the training entries can be polyphase rather than only binary."],"supporting_citations":[{"why":"Introduces the zero-correlation-zone sequence concept that SZCZ arrays generalize.","marker":"[1]"},{"why":"Supplies the least-squares channel estimator and the minimum-NMSE condition $XX^H = M I$ that the training design targets.","marker":"[9]"},{"why":"Provides the single-carrier spatial-modulation system model over broadband channels that the training matrix fits.","marker":"[17]"},{"why":"Defines the CZCP-based training framework and serves as the benchmark whose ZCZ width is doubled.","marker":"[23]"},{"why":"Defines the CZCS-based training framework, the second benchmark with a smaller ZCZ width.","marker":"[31]"},{"why":"Gives the two-dimensional generalized Boolean functions from which the sparse arrays are derived.","marker":"[36]"},{"why":"Supplies the MMSE equalizer used in the BER simulations.","marker":"[37]"}],"fun_headline_variants":["Sparse ZCZ arrays double multipath tolerance in SM","No CZCP needed: sparse arrays widen ZCZ for SM","Sparse arrays boost SM channel estimation range","Direct Boolean construction doubles ZCZ width in SM"],"cache_read_input_tokens":20992,"weakest_assumption_plain":"The correlation-cancellation proof requires the first block $I_1$ to contain at least two variables, because the zero-correlation-zone width is read from $\\pi_1(2)$, the second entry of that block; the theorem statement allows $|I_1|=1$, where the claimed width is not defined.","fun_headline_variants_meta":{"raw":{"variants":["Sparse ZCZ arrays double multipath tolerance in SM","No CZCP needed: sparse arrays widen ZCZ for SM","Sparse arrays boost SM channel estimation range","Direct Boolean construction doubles ZCZ width in SM"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000546,"raw_usage":{"total_tokens":2643,"prompt_tokens":1011,"completion_tokens":1632,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":627,"completion_tokens_details":{"reasoning_tokens":1568}},"tokens_in":627,"tokens_out":1632,"duration_ms":12470,"temperature":1.0,"reasoning_tokens":1568,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T15:49:46.555280+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the periodic correlations $\\theta(C_g,C_k;u)$ for the Theorem 3 construction in the boundary case $|I_1|=1$, for instance $m=3,n=2$ with $I_1=\\{3\\}$ and $I_2=\\{2,1\\}$. The formula $Z=2^{\\pi_1(2)-1}$ is undefined there because $\\pi_1(2)$ does not exist, so the theorem as stated makes no claim; the decisive test is whether such a matrix nevertheless has zero-correlation-zone width $2^{m-n-1}=2$, which would show the condition $|I_1|>1$ is not actually needed, or a smaller width, which would require amending the theorem.","supporting_citations":[{"cited_title":"Class of binary sequences with zero correlation zone,","cited_arxiv_id":null,"evidence_quote":"Introduces the zero-correlation-zone sequence concept that SZCZ arrays generalize."},{"cited_title":"Optimal binary training sequence design for multiple-antenna systems over dispersive fading channels,","cited_arxiv_id":null,"evidence_quote":"Supplies the least-squares channel estimator and the minimum-NMSE condition $XX^H = M I$ that the training design targets."},{"cited_title":"Single-carrier SM-MIMO: A promising design for broadband large-scale antenna systems,","cited_arxiv_id":null,"evidence_quote":"Provides the single-carrier spatial-modulation system model over broadband channels that the training matrix fits."},{"cited_title":"Cross Z-complementary pairs for optimal training in spatial modulation over frequency selective channels,","cited_arxiv_id":null,"evidence_quote":"Defines the CZCP-based training framework and serves as the benchmark whose ZCZ width is doubled."},{"cited_title":"Cross Z-complementary sets for training design in spatial modulation,","cited_arxiv_id":null,"evidence_quote":"Defines the CZCS-based training framework, the second benchmark with a smaller ZCZ width."},{"cited_title":"Two-dimensional Golay complementary array pairs/sets with bounded row and column sequence PAPRs,","cited_arxiv_id":null,"evidence_quote":"Gives the two-dimensional generalized Boolean functions from which the sparse arrays are derived."},{"cited_title":"Spatial modulation aided zero-padded single carrier transmission for dispersive channels,","cited_arxiv_id":null,"evidence_quote":"Supplies the MMSE equalizer used in the BER simulations."}],"review_version":1}