Pith. sign in

REVIEW

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 1305.2592 v1 pith:IC5UKI7W submitted 2013-05-12 cs.IT math.IT

On the Performance Limits of Scalar Coding Over MISO Channels

classification cs.IT math.IT
keywords codingscalarbeamformingbitschannelslimitsperformancerandomized
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The performance limits of scalar coding for multiple-input single-output channels are revisited in this work. By employing randomized beamforming, Narula et al. demonstrated that the loss of scalar coding is universally bounded by ~ 2.51 dB (or 0.833 bits/symbol) for any number of antennas and channel gains. In this work, by using randomized beamforming in conjunction with space-time codes, it is shown that the bound can be tightened to ~ 1.1 dB (or 0.39 bits/symbol).

discussion (0)

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