Pith. sign in

REVIEW

Distributed and Optimal Reduced Primal-Dual Algorithm for Uplink OFDM Resource Allocation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1012.4874 v1 pith:XMPVOOZ3 submitted 2010-12-22 cs.NI cs.CCcs.DC

Distributed and Optimal Reduced Primal-Dual Algorithm for Uplink OFDM Resource Allocation

classification cs.NI cs.CCcs.DC
keywords algorithmofdmoptimalresourceallocationdistributedglobalprimal-dual
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Orthogonal Frequency Division Multiplexing (OFDM) is the key component of many emerging broadband wireless access standards. The resource allocation in OFDM uplink, however, is challenging due to heterogeneity of users' Quality of Service requirements, channel conditions, and individual resource constraints. We formulate the resource allocation problem as a non-strictly convex optimization problem, which typically has multiple global optimal solutions. We then propose a reduced primal-dual algorithm, which is distributed, low in computational complexity, and probably globally convergent to a global optimal solution. The performance of the algorithm is studied through a realistic OFDM simulator. Compared with the previously proposed centralized optimal algorithm, our algorithm not only significantly reduces the message overhead but also requires less iterations to converge.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.