{"id":"b2725206-bf72-4e07-ba83-c21909d66296","arxiv_id":"1908.07119","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":1,"one_line_summary":"A unified weighted-sum-utility framework with greedy algorithms is proposed for joint feedback bit partitioning, user scheduling, subcarrier assignment, and cluster-size selection in multi-carrier CoMP systems with limited feedback.","lead":"This paper designs resource allocation algorithms for multi-carrier coordinated base stations with limited feedback, jointly choosing users, subcarriers, cluster sizes, and feedback bit allocations. It aims to improve network speed, quality-of-service, and energy efficiency in 5G systems.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Admitted false independence in capacity approximations is inherited by the simulation utilities, so the reported gains are self-evaluated against an unvalidated model.","rationale":"The reader's weakest assumption correctly identifies the admitted false independence in Appendix A as the key vulnerability. My stress-test confirms this is the most load-bearing concern: the optimization algorithms and the performance evaluation both use the approximate utilities (Results 1–4), so the reported gains are self-referential. Because Result 2 is the default capacity expression used in simulations, the independence approximation in Eq. (31) is not confined to a rarely used formula; it affects the objective being optimized. The paper provides only single-link accuracy comparisons (Fig. 1), not a system-level check against the exact SINR model, so the magnitude of the bias is unknown. The concrete Monte Carlo test I propose would settle whether the approximation is good enough. I also note the abstract's 'several orders-of-magnitude' overstates the reported 4.5x–7x gains, and Result 4's restriction to b=1 limits the effective-capacity results, but these are secondary to the approximation-validation gap. The paper does contribute a unified WSU formulation and greedy algorithms with reasonable structure, so a conditional verdict remains appropriate pending the proposed validation.","tokens_in":14733,"tokens_out":4491,"duration_ms":44459,"concrete_test":"Run a full Monte Carlo simulation of the Section VI setup in which the actual CDI quantization is performed with random vector quantization codebooks (as in [45]) and the true per-link SINR is computed from Eq. (2), then compute the average WSU for the allocation produced by the greedy algorithms and for the random initial allocation. Compare the resulting gain ratio to the reported 4.5x-7x from Fig. 3. If the true gain is within a factor of two of the reported values, the independence approximation is adequate for the qualitative claim; if the true gain is much smaller or negative, the central claim is unsupported.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central performance claim rests on approximate utility expressions. Appendix A derives Result 1 via Eq. (31), explicitly assuming that two random variables are independent 'which clearly are not.' This approximation propagates into Result 2 (Eq. 10), which the paper states is 'primarily considered' as the achievable capacity, and into Results 3–4 for effective capacity. All four simulation objectives (WSC, WSEC, WSEE, WSEEE) are evaluated using these approximate utilities, and the reported 4.5–7-fold gains (Remark 3, Fig. 3) are computed as the difference between the optimized and random-allocation values of the same approximate utility. If the independence assumption is biased, the greedy bit allocation and cluster-size selection may optimize an incorrect objective, and the true SINR gains could be materially different from those reported. Fig. 1 validates the approximation only for a single link under one parameter set; no system-level comparison to the exact SINR expression (2) or to Monte Carlo simulation of the true effective capacity is provided. The claim that joint FBP, cluster-size, and scheduling yields large gains is therefore not yet established against the true system model.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies downlink resource allocation in multi-carrier coordinated multi-point (CoMP) systems with limited feedback. It proposes a unified weighted-sum-utility (WSU) framework and instantiates it for four objectives: weighted sum capacity (WSC), weighted sum effective capacity (WSEC), weighted sum energy efficiency (WSEE), and weighted sum effective energy efficiency (WSEEE). The resource variables include feedback bit partitioning (FBP) across subcarriers, cells, and users, per-subcarrier cluster size, user scheduling, and subcarrier assignment. Two greedy algorithms are developed: gFBP for feedback bit allocation and C-bSA for cluster-size determination, scheduling, and subcarrier assignment. The paper derives approximate closed-form expressions for capacity and effective capacity under quantized CDI, and reports simulation results showing convergence in about two iterations and gains of up to 4.5-7-fold over random allocation, with the abstract claiming improvement 'by several orders-of-magnitude.'","tokens_in":14935,"tokens_out":4428,"duration_ms":47746,"significance":"If the results hold against the true system model, the paper would make a useful contribution: it provides a unified analytical treatment of four practically important objectives in a complex limited-feedback CoMP setting, and it offers computationally feasible greedy algorithms for a combinatorial problem that would otherwise be intractable. The single-link Monte Carlo validation in Fig. 1 is a genuine strength, as is the attempt to model the interaction between feedback-bit allocation, cluster size, and user scheduling. However, the paper does not supply machine-checked proofs or code, and the analytical results are approximations, not bounds. The practical insights on cluster sizing and BS placement are potentially valuable but are obtained from simulations that evaluate the same approximate objective functions that the algorithms maximize; their validity therefore depends on the accuracy of those approximations at system level, which is not established.","major_comments":[{"comment":"The central performance claim is computed inside the approximation domain. The reported gains (4.5- to 7-fold, and 'several orders-of-magnitude' in the abstract) compare optimized and random allocations using utilities built from Results 2 and 4. Those results inherit the independence assumption of Appendix A, Eq. (31), where the authors state that the random variables 'clearly are not' independent. The only validation, Fig. 1, is for a single link under one parameter set; there is no system-level comparison against the exact SINR in Eq. (2) or a Monte Carlo evaluation of the true effective capacity. Consequently, the paper's central claim that joint FBP, cluster-size, and scheduling yields large gains is not yet established against the true system model. I request a system-level validation of the final allocations under Eq. (2) or an analytical bound on the approximation error.","section":"Section VI, Remark 3, Fig. 3, and Appendix A, Eq. (31)"},{"comment":"Result 4 is derived only under the restriction b=1, and the text states that the general case is 'too complicated' to evaluate. Since WSEC and WSEEE are two of the four headline objectives, the QoS-related simulation results in Section VI are limited to a single statistical-delay exponent unless the more complex Result 3 is used. The paper should state explicitly which approximation was used in each simulation figure and should validate the b=1 case against the true effective capacity in Eq. (11) at the operating points of Section VI; this is load-bearing for the QoS claims.","section":"Appendix D, Eq. (15) and Eq. (44)"},{"comment":"The claim that the algorithms converge in about two iterations is demonstrated only in terms of the approximate utility, and no optimality gap or comparison with a near-optimal solution is provided for any non-trivial instance. Because the greedy structure is a core contribution, the paper would be substantially strengthened by a small-scale comparison against exhaustive search on a reduced problem (e.g., few subcarriers and a small cluster), or at least by a discussion of how the greedy decisions can deviate from the optimum. Without such a check, the reported gains relative to a random initial allocation cannot be separated from the possibility that the algorithms simply escape a deliberately poor starting point.","section":"Section V, Algorithm 4, and Fig. 3"}],"minor_comments":[{"comment":"The abstract claims improvement 'by several orders-of-magnitude', while Remark 3 and Fig. 3 report up to 7-fold gains; please align the abstract with the numerical results.","section":"Abstract and Remark 3"},{"comment":"'C-bCA' appears in the text and should be 'C-bSA' for consistency with Algorithm 4.","section":"Section VI, text near Fig. 3"},{"comment":"The conclusion states that the paper derives 'analytical bounds on the capacity', but Results 1-4 are approximations, not bounds; please correct the wording.","section":"Section VII, Conclusions"},{"comment":"The manuscript contains many missing mathematical symbols and incomplete sentences, which makes verification difficult; a clean, typeset revision is needed.","section":"Throughout, especially Section II and figure captions"},{"comment":"'Jonsen's Inequality' should be 'Jensen's Inequality'.","section":"Eq. (16)"},{"comment":"The caption does not state the QoS exponent b used in the effective-capacity plots; please add this parameter so the validation can be interpreted.","section":"Fig. 1 caption"}],"recommendation":"major_revision","confidential_remarks":"The manuscript has a long review history, but my assessment is based only on the current content. The main risk is not the combinatorial formulation or the algorithmic structure; it is that the headline gains are measured inside an admittedly false independence approximation. If the authors can supply system-level validation against the exact SINR model or otherwise bound the approximation error, the paper could be suitable for publication. I do not see a basis for rejection on novelty or scope."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Two things you should know up front. First, the actual contribution is a unified weighted-sum-utility (WSU) framework that lets one set of greedy algorithms handle capacity, effective capacity, energy efficiency, and effective energy efficiency in multi-carrier CoMP with limited feedback. The multi-level feedback bit partitioning (gFBP, across subcarriers, cells, and UEs) is a genuine extension of earlier single-carrier per-UE algorithms, and the C-bSA cluster-size/UE-scheduling loop is a reasonable way to keep complexity in check. Second, the performance claims are not yet established against the true system model. The capacity and effective capacity approximations rest on an admitted false independence assumption, and the simulations evaluate exactly those approximations. So the reported 4.5-7x gains are measured in the approximation domain, not against the actual SINR in (2).\n\nCredit where it is due: the single-link Monte Carlo validation in Fig. 1 is real evidence that Results 1-4 behave sensibly, at least for the one parameter set shown. The design insights—an optimal BS distance around 300 m and that |C|=3 is nearly as good as |C|=5—are useful, though they are also delivered on the approximate metric.\n\nThe soft spot is load-bearing. Appendix A, around Eq. (31), says the authors assumed independence between two random variables that \"clearly are not\" independent. That approximation flows into Results 1-4, which define the utilities that gFBP and C-bSA optimize and that Fig. 3 uses to report gains. A system-level Monte Carlo of the true SINR, or of the true effective capacity, would tell us whether the optimization is chasing the right objective. Without that, the abstract's \"several orders-of-magnitude\" claim is overweighted—the actual numbers top out at 7x, which is less than one order of magnitude. Result 4 also restricts the QoS exponent to b=1, which is okay for capacity but not for arbitrary delay constraints. Minor but not fatal: no code, data, or error bars, and the convergence plot shows only two iterations without a tolerance analysis.\n\nBottom line: this is a solid framework and a serious algorithmic effort, but the central gain claim is conditional on validating the approximation bias at system level. I would send it to peer review, asking the authors to add a system-level comparison to the exact SINR model and to revise the abstract's magnitude claims. A reader working on CoMP resource allocation would get value from the framework and the greedy designs, provided they treat the numerical gains as indicative rather than established.","headline":"The unified WSU framework and multi-level greedy FBP are a real step forward, but the headline gains are computed with an approximation the authors admit is false, so the paper is worth reviewing with a strong request for system-level validation.","tokens_in":15442,"tokens_out":2254,"would_cite":true,"duration_ms":25444,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper argues that feedback-bit allocation, per-subcarrier cluster size, user scheduling, and subcarrier assignment must be optimized jointly in multi-carrier CoMP with limited feedback, and it supplies a single greedy framework that…","keywords":["CoMP","limited feedback","resource allocation","feedback bit partitioning","cluster size","energy efficiency","effective capacity","OFDMA"],"falsifier":"Take the converged feedback-bit partition and per-subcarrier cluster-size allocation from the paper's algorithms, simulate the exact SINR of Eq. (2) with actual vector-quantization codebooks instead of the quantization-cell-approximation densities, and recompute weighted sum capacity and energy efficiency; if the four-to-seven-fold gains over random or equal feedback baselines shrink or reverse, the Appendix A independence approximation is the load-bearing error.","tokens_in":14537,"feed_emoji":"📶","tokens_out":11801,"duration_ms":108910,"temperature":0.7,"pith_summary":"This paper argues that in a multi-carrier coordinated multi-point (CoMP) network where users send back only quantized channel direction information, feedback-bit allocation, per-subcarrier base-station cluster size, user scheduling, and subcarrier assignment should be decided jointly rather than independently. It packs these decisions into a single weighted-sum-utility (WSU) problem that can represent weighted sum capacity, statistical-delay-constrained capacity, energy efficiency, and delay-constrained energy efficiency by swapping one link-utility function. Two greedy algorithms, one that partitions the finite feedback budget among subcarriers, cells, and channel directions and one that selects users and switches base stations on or off per subcarrier, solve all four objectives with the same code. The paper derives closed-form capacity and effective-capacity approximations under the quantization-cell approximation and reports fast convergence in about two iterations, up to a seven-fold gain from user scheduling and cluster-size choice, and overall improvement of several orders of magnitude.","feed_headline":"Seven-fold gains come from joint scheduling and cluster-size choices","feed_subtitle":"Merging feedback-bit allocation with per-subcarrier base-station choice produces the jump in capacity and energy efficiency.","key_machinery":"The load-bearing object is the weighted sum utility (WSU) of Eq. (7), a single combinatorial objective in which the utilization of each scheduled user-subcarrier pair can be swapped between capacity, effective capacity, energy efficiency, or effective energy efficiency, so that one algorithmic core serves all four problems. Inside that core is a three-level greedy feedback-bit partitioner: gFBP first gives bits to subcarriers, C-lFBP divides each subcarrier's bits among active cells, and U-lFBP divides a cell's bits among the channel directions a user must quantize. The cluster-based subcarrier assignment (C-bSA) then re-selects users and switches base stations off per subcarrier when their contribution to the cluster utility is too small. The analytical glue is the quantization-cell approximation of Eq. (3), which models the CDI quantization error of a codebook as a beta/exponential pair and converts feedback-bit counts into the closed-form capacity and effective-capacity expressions labeled Results 1-4 that every greedy step evaluates.","core_discovery":"The paper's central claim is that the resource-allocation problem in a multi-carrier coordinated multi-point downlink with per-user quantized feedback can and should be cast as a single weighted-sum-utility maximization over three interacting sets of variables: which users are scheduled on each subcarrier, which base stations remain active on each subcarrier (the per-subcarrier cluster size), and how the finite feedback bit budget is split among subcarriers, cells, and links. It derives closed-form approximations for four link utilities, capacity, statistical-delay-constrained effective capacity, energy efficiency, and delay-constrained energy efficiency, all under the quantization-cell approximation, so the same greedy machinery applies to all four. The proposed alternating algorithm, greedy feedback-bit partitioning (gFBP) together with cluster-based subcarrier assignment (C-bSA), converges in about two iterations in the reported scenarios, delivers up to a seven-fold utility gain from user scheduling and cluster-size choice alone, and, by the paper's simulations, improves system performance by several orders of magnitude relative to equal or interference-minimizing feedback partitions.","pith_inferences":["Because the WSU core is agnostic to the link-utility function, the same gFBP/C-bSA machinery could be retargeted to other objectives the paper does not study, such as outage probability, secrecy rate, or minimum-rate guarantees, without redesigning the combinatorial engine.","A direct stress test the paper does not run is to implement the converged allocations with actual random-vector-quantization codebooks and the exact SINR of Eq. (2); if the reported four-to-seven-fold gains shrink or reverse, the false-independence approximation admitted in Appendix A is the culprit.","The optimal base-station spacing and the saturation of gains beyond about five base stations suggest an implicit design rule: moderate cluster sizes and regular geometry capture most of the limited-feedback CoMP benefit, so operators can save on base-station count and backhaul.","The algorithm assumes path-loss information is roughly static between executions, so a practical extension would be a mobility-triggered reallocation that reuses the previous feedback-bit partition as a warm start."],"forward_implications":["Treating feedback-bit partitioning and per-subcarrier cluster size as separate design stages forfeits the largest part of the gain: the simulations attribute up to a seven-fold improvement to joint user scheduling and cluster-size choice, with further gains from coordinated bit partitioning over equal or interference-minimizing baselines.","One algorithmic implementation covers capacity, statistical-delay QoS, energy efficiency, and delay-aware energy efficiency, because all four are instances of the same WSU problem.","Increasing the number of antennas without increasing the feedback budget can slightly hurt performance, since CDI quantization errors then degrade both the desired signal and the ability to null interference; antenna count and feedback capacity need to be scaled together.","Geometric placement matters: there is an optimal base-station distance (about 300 m in the reported cluster), and most of the cluster-size benefit is captured with 3 to 5 active base stations, so adding more base stations yields diminishing returns.","The combinatorial resource-allocation problem is computationally tractable in practice, since the greedy iterations converge in roughly two rounds."],"supporting_citations":[{"why":"Supplies the inter-cell interference cancellation beamforming construction and the residual-interference statistical model used by the SINR and capacity derivations.","marker":"[34]"},{"why":"Provides the quantization-cell-approximation theory, including the beta distribution of the inner product between true and quantized channel directions, that underlies Results 1-4.","marker":"[37]"},{"why":"Provides the adaptive bit-partitioning framework for multicell interference nulling with limited feedback that the paper extends from a single carrier and per-UE budgets to multi-carrier coordinated FBP.","marker":"[38]"},{"why":"Supplies the quantization-cell approximation and the multi-user selection rationale behind the capacity formulas and the greedy user scheduling.","marker":"[45]"},{"why":"Supplies the exponential-distribution model for the beamforming residual that Appendix A uses to close the capacity integrals.","marker":"[51]"},{"why":"Provides the base-station power-consumption model used to define the energy-efficiency objectives WSEE and WSEEE.","marker":"[11]"},{"why":"Defines the statistical-delay effective-capacity measure that converts the capacity utility into the QoS-constrained objectives WSEC and WSEEE.","marker":"[47]"},{"why":"Provides the per-UE greedy feedback-bit allocation that U-lFBP generalizes to subcarrier and cluster levels.","marker":"[43]"}],"fun_headline_variants":["Greedy CoMP RA: one utility for capacity, QoS, and EE","7x gain from joint scheduling and cluster-size in CoMP","Unified RA for limited-feedback CoMP: orders-of-magnitude gains","Single weighted-sum utility drives all CoMP resource allocation"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The formulas the optimizer depends on were derived by treating certain quantization-error random variables as independent, which the paper's own Appendix A says they clearly are not, so if that simplification is materially biased the scheduling and feedback allocations may be optimizing the wrong objective and the reported gains may not survive on the true signal-to-interference-plus-noise ratio.","fun_headline_variants_meta":{"raw":{"variants":["Greedy CoMP RA: one utility for capacity, QoS, and EE","7x gain from joint scheduling and cluster-size in CoMP","Unified RA for limited-feedback CoMP: orders-of-magnitude gains","Single weighted-sum utility drives all CoMP resource allocation"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000359,"raw_usage":{"total_tokens":2005,"prompt_tokens":1070,"completion_tokens":935,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":686,"completion_tokens_details":{"reasoning_tokens":858}},"tokens_in":686,"tokens_out":935,"duration_ms":9614,"temperature":1.0,"reasoning_tokens":858,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:25:23.238971+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take the converged feedback-bit partition and per-subcarrier cluster-size allocation from the paper's algorithms, simulate the exact SINR of Eq. (2) with actual vector-quantization codebooks instead of the quantization-cell-approximation densities, and recompute weighted sum capacity and energy efficiency; if the four-to-seven-fold gains over random or equal feedback baselines shrink or reverse, the Appendix A independence approximation is the load-bearing error.","supporting_citations":[],"review_version":1}