arXiv subjects

Wiroonsak Santipach

Publications and source records attributed to Wiroonsak Santipach.

12 recordsLinked to original sources

arXiv2025

Neural Network Based Optimization of Transmit Beamforming and RIS Coefficients Using Channel Covariances in MISO Downlink

We propose an unsupervised beamforming neural network (BNN) and a supervised reconfigurable intelligent surface (RIS) convolutional neural network (CNN) to optimize transmit beamforming and RIS coefficients of multi-input single-output (MISO) downlink with RIS assistance. To avoid frequent beam updates, the proposed BNN and RIS CNN are based on slow-changing channel covariances and are different from most other neural networks that utilize channel instances. Numerical simulations show that the proposed BNN with RIS CNN can achieve much higher sum rates than zeroforcing beamforming with waterfilling power allocation does, especially for systems with higher load, and reduces computation time.

cs.IT↗

arXiv2023

Optimal Transmit Power and Channel-Information Bit Allocation With Zeroforcing Beamforming in MIMO-NOMA and MIMO-OMA Downlinks

In downlink, a base station (BS) with multiple transmit antennas applies zeroforcing beamforming to transmit to single-antenna mobile users in a cell. We propose the schemes that optimize transmit power and the number of bits for channel direction information (CDI) for all users to achieve the max-min signal-to-interference plus noise ratio (SINR) fairness. The optimal allocation can be obtained by a geometric program for both non-orthogonal multiple access (NOMA) and orthogonal multiple access (OMA). For NOMA, 2 users with highly correlated channels are paired and share the same transmit beamforming. In some small total-CDI rate regimes, we show that NOMA can outperform OMA by as much as 3 dB. The performance gain over OMA increases when the correlation-coefficient threshold for user pairing is set higher. To reduce computational complexity, we propose to allocate transmit power and CDI rate to groups of multiple users instead of individual users. The user grouping scheme is based on K-means over the user SINR. We also propose a progressive filling scheme that performs close to the optimum, but can reduce the computation time by almost 3 orders of magnitude in some numerical examples.

cs.IT↗

arXiv2020

Energy-Minimizing Bit Allocation For Powerline OFDM With Multiple Delay Constraints

We propose a bit-allocation scheme for powerline orthogonal frequency-division multiplexing (OFDM) that minimizes total transmit energy subject to total-bit and delay constraints. Multiple delay requirements stem from different sets of data that a transmitter must time-multiplex and transmit to a receiver. The proposed bit allocation takes into account the channel power-to-noise density ratio of subchannels as well as statistic of narrowband interference and impulsive noise that is pervasive in powerline communication (PLC) channels. The proposed scheme is optimal with 1 or 2 sets of data, and is suboptimal with more than 2 sets of data. However, numerical examples show that the proposed scheme performs close to the optimum. Also, it is less computationally complex than the optimal scheme especially when minimizing total energy over large number of data sets. We also compare the proposed scheme with some existing schemes and find that our scheme requires less total transmit energy when the number of delay constraints is large.

cs.IT↗

arXiv2018

On Optimizing Feedback Interval for Temporally Correlated MIMO Channels With Transmit Beamforming And Finite-Rate Feedback

A receiver with perfect channel state information (CSI) in a point-to-point multiple-input multiple-output (MIMO) channel can compute the transmit beamforming vector that maximizes the transmission rate. For frequency-division duplex, a transmitter is not able to estimate CSI directly and has to obtain a quantized transmit beamforming vector from the receiver via a rate-limited feedback channel. We assume that time evolution of MIMO channels is modeled as a Gauss-Markov process parameterized by a temporal-correlation coefficient. Since feedback rate is usually low, we assume rank-one transmit beamforming or transmission with single data stream. For given feedback rate, we analyze the optimal feedback interval that maximizes the average received power of the systems with two transmit or two receive antennas. For other system sizes, the optimal feedback interval is approximated by maximizing the rate difference in a large system limit. Numerical results show that the large system approximation can predict the optimal interval for finite-size system quite accurately. Numerical results also show that quantizing transmit beamforming with the optimal feedback interval gives larger rate than the existing Kalman-filter scheme does by as much as 10% and than feeding back for every block does by 44% when the number of feedback bits is small.

cs.IT↗

arXiv2017

Subcarrier-Chunk Assignment With Power Allocation and Multiple-Rate Constraints for Downlink OFDMA

We consider downlink OFDMA in which users are imposed with different proportional-rate constraints, and a base station would like to maximise user rate over subcarrier assignment (SA) and power allocation (PA). To attain the objective, we propose a chunk-based SA and low-complexity PA algorithms. Numerical results show that the proposed SA and PA can provide higher average minimum achievable rate than the existing schemes while keeping the deviation from the rate constraint small for both single-cell and multi-cell systems with fractional frequency reuse.

cs.IT↗

arXiv2016

Outage Bound for Max-Based Downlink Scheduling With Imperfect CSIT and Delay Constraint

We consider downlink max-based scheduling in which the base station and each user are equipped with a single antenna. In each time slot, the base station obtains channel gains of all users and selects the user with the largest squared channel gain. Assuming that channel state information at the transmitter (CSIT), i.e., squared channel gain, can be inaccurate, we derive lower bounds for probability of outage, which occurs when a required data rate is not satisfied under a delay constraint. The bounds are tight for Rayleigh fading and show how required rate and CSIT error affect outage performance.

cs.IT↗

arXiv2015

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

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.

cs.IT↗

arXiv2014

Power and Bit Allocation for Wireless OFDM Channels with Finite-Rate Feedback and Subcarrier Clustering

The study investigated the allocation of transmission power and bits for a point-to-point orthogonal frequency-division multiplexing channel assuming perfect channel information at the receiver, but imperfect channel information at the transmitter. Channel information was quantized at the receiver and was sent back to the transmitter via a finite-rate feedback channel. Based on limited feedback from the receiver, the corresponding transmitter adapted the power level and/or modulation across subcarriers. To reduce the amount of feedback, subcarriers were partitioned into different clusters and an on/off threshold-based power allocation was applied to subcarrier clusters. In addition, two options were proposed to interpolate a channel frequency response from a set of quantized channel gains and apply the optimal water-filling allocation or a greedy bit allocation based on channel interpolation. Proposed schemes with finite feedback rates were shown to perform close to the optimal allocation without a feedback-rate constraint. In the numerical example, channel capacity decreased about 6% from the optimum when one bit of feedback per subcarrier was used.

cs.IT↗

arXiv2011

Tree-Structured Random Vector Quantization for Limited-Feedback Wireless Channels

We consider the quantization of a transmit beamforming vector in multiantenna channels and of a signature vector in code division multiple access (CDMA) systems. Assuming perfect channel knowledge, the receiver selects for a transmitter the vector that maximizes the performance from a random vector quantization (RVQ) codebook, which consists of independent isotropically distributed unit-norm vectors. The quantized vector is then relayed to the transmitter via a rate-limited feedback channel. The RVQ codebook requires an exhaustive search to locate the selected entry. To reduce the search complexity, we apply generalized Lloyd or $k$-dimensional (kd)-tree algorithms to organize RVQ entries into a tree. In examples shown, the search complexity of tree-structured (TS) RVQ can be a few orders of magnitude less than that of the unstructured RVQ for the same performance. We also derive the performance approximation for TS-RVQ in a large system limit, which predicts the performance of a moderate-size system very well.

cs.IT↗

arXiv2011

Signature Quantization in Fading CDMA With Limited Feedback

In this work, we analyze the performance of a signature quantization scheme for reverse-link Direct Sequence (DS)- Code Division Multiple Access (CDMA). Assuming perfect estimates of the channel and interference covariance, the receiver selects the signature that minimizes interference power or maximizes signal-to-interference plus noise ratio (SINR) for a desired user from a signature codebook. The codebook index corresponding to the optimal signature is then relayed to the user with a finite number of bits via a feedback channel. Here we are interested in the performance of a Random Vector Quantization (RVQ) codebook, which contains independent isotropically distributed vectors. Assuming arbitrary transmit power allocation, we consider additive white Gaussian noise (AWGN) channel first with no fading and subsequently, with multipath fading. We derive the corresponding SINR in a large system limit at the output of matched filter and linear minimum mean squared error (MMSE) receiver. Numerical examples show that the derived large system results give a good approximation to the performance of finite-size system and that the MMSE receiver achieves close to a single-user performance with only one feedback bit per signature element.

cs.IT↗

arXiv2010

Optimization of Training and Feedback Overhead for Beamforming over Block Fading Channels

We examine the capacity of beamforming over a single-user, multi-antenna link taking into account the overhead due to channel estimation and limited feedback of channel state information. Multi-input single-output (MISO) and multi-input multi-output (MIMO) channels are considered subject to block Rayleigh fading. Each coherence block contains $L$ symbols, and is spanned by $T$ training symbols, $B$ feedback bits, and the data symbols. The training symbols are used to obtain a Minimum Mean Squared Error estimate of the channel matrix. Given this estimate, the receiver selects a transmit beamforming vector from a codebook containing $2^B$ {\em i.i.d.} random vectors, and sends the corresponding $B$ bits back to the transmitter. We derive bounds on the beamforming capacity for MISO and MIMO channels and characterize the optimal (rate-maximizing) training and feedback overhead ($T$ and $B$) as $L$ and the number of transmit antennas $N_t$ both become large. The optimal $N_t$ is limited by the coherence time, and increases as $L/\log L$. For the MISO channel the optimal $T/L$ and $B/L$ (fractional overhead due to training and feedback) are asymptotically the same, and tend to zero at the rate $1/\log N_t$. For the MIMO channel the optimal feedback overhead $B/L$ tends to zero faster (as $1/\log^2 N_t$).

cs.IT↗

arXiv2009

Capacity of a Multiple-Antenna Fading Channel with a Quantized Precoding Matrix

Given a multiple-input multiple-output (MIMO) channel, feedback from the receiver can be used to specify a transmit precoding matrix, which selectively activates the strongest channel modes. Here we analyze the performance of Random Vector Quantization (RVQ), in which the precoding matrix is selected from a random codebook containing independent, isotropically distributed entries. We assume that channel elements are i.i.d. and known to the receiver, which relays the optimal (rate-maximizing) precoder codebook index to the transmitter using B bits. We first derive the large system capacity of beamforming (rank-one precoding matrix) as a function of B, where large system refers to the limit as B and the number of transmit and receive antennas all go to infinity with fixed ratios. With beamforming RVQ is asymptotically optimal, i.e., no other quantization scheme can achieve a larger asymptotic rate. The performance of RVQ is also compared with that of a simpler reduced-rank scalar quantization scheme in which the beamformer is constrained to lie in a random subspace. We subsequently consider a precoding matrix with arbitrary rank, and approximate the asymptotic RVQ performance with optimal and linear receivers (matched filter and Minimum Mean Squared Error (MMSE)). Numerical examples show that these approximations accurately predict the performance of finite-size systems of interest. Given a target spectral efficiency, numerical examples show that the amount of feedback required by the linear MMSE receiver is only slightly more than that required by the optimal receiver, whereas the matched filter can require significantly more feedback.

cs.IT↗