Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1410.1274

On Transmit Beamforming for MISO-OFDM Channels With Finite-Rate Feedback

Kritsada Mamat·Wiroonsak Santipach
View original source ↗Read source document ↗Export metadata ↓

Abstract

With finite-rate feedback, we propose two feedback methods for transmit beamforming in a point-to-point MISO-OFDM channel. For the first method, a receiver with perfect channel information, quantizes and feeds back the optimal transmit beamforming vectors of a few selected subcarriers, which are equally spaced. Based on those quantized vectors, the transmitter applies either constant, linear, or higher-order interpolation with the remaining beamforming vectors. With constant interpolation, we derive the approximate sum achievable rate and the optimal cluster size that maximizes the approximate rate. For linear interpolation, we derive a closed-form expression for the phase rotation by utilizing the correlation between OFDM subcarriers. We also propose a higher-order interpolation that requires more than two quantized vectors to interpolate transmit beamformers, and is based on existing channel estimation methods. Numerical results show that interpolation with the optimized cluster size can perform significantly better than that with an arbitrary cluster size. For the second proposed method, a channel impulse response is quantized with a uniform scalar quantizer. With channel quantization, we also derive the approximate sum achievable rate. We show that switching between the two methods for different feedback-rate requirements can perform better than the existing schemes.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kritsada Mamat, Wiroonsak Santipach. 2015-10-16. On Transmit Beamforming for MISO-OFDM Channels With Finite-Rate Feedback. https://doi.org/10.1109/tcomm.2015.2475420

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT↗
arXiv2026

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT↗
arXiv2026

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT↗