arXiv subjects

Gokhan M. Guvensen

Publications and source records attributed to Gokhan M. Guvensen.

14 recordsLinked to original sources

arXiv2026

An Efficient Blind Detection of OFDM Signals with Unknown Parameters

This study investigates efficient detector designs for the blind detection of orthogonal frequency-division multiplexing (OFDM) signals with unknown power, bandwidth, and carrier frequency in wideband spectrum sensing. We first describe the received signal model and conduct an asymptotic covariance analysis to obtain a tractable discrete-time representation. Based on this model, generalized likelihood ratio test (GLRT) detectors are derived for both known and unknown noise power cases in a single-antenna receiver setting. The proposed framework is subsequently extended to multi-antenna receivers, and the corresponding multi-antenna GLRT detectors are developed for both known and unknown noise power cases. Importantly, using the cumulative-sum (CUSUM) operations, the resulting detectors reduce to an efficient one-dimensional (1D) search in both single-antenna and multi-antenna settings. We also provide theoretical analysis for the conventional energy detector (Conv-ED) and the hypothetical uniformly most powerful (UMP) test to reveal the impact of system parameters on detection performance. In addition, computational complexity analysis is presented for both the proposed and conventional detectors. Finally, comprehensive simulation results are provided to evaluate the probability of detection. The results demonstrate that the proposed detectors achieve performance close to that of a genie-aided detector while significantly outperforming conventional detection approaches.

eess.SP↗

arXiv2026

FTN Signaling: Spectral Efficiency from BPSK to 16-QAM

Faster-than-Nyquist (FTN) signaling can improve spectral efficiency by transmitting symbols closer together than the Nyquist limit, at the cost of additional inter-symbol interference (ISI). In this letter, we study the finite-alphabet symbol-wise achievable information rate (AIR) of FTN signaling for BPSK, QPSK, and 16-QAM under a transmit-power constraint and a common minimum mean square error (MMSE) channel-shortening (CS) detection framework, cross-validated for BPSK against an independent reduced-state Ungerboeck Bahl-Cocke-Jelinek-Raviv (BCJR) benchmark. Our results show a clear trend. Lower-order constellations can benefit from more aggressive time acceleration, while higher-order constellations become less tolerant of acceleration and achieve their best spectral efficiency closer to the Nyquist limit. At a reference signal-to-noise ratio (SNR) of 6 dB the optimum acceleration factor shifts from $τ^\star\approx0.65$ for BPSK to 0.75 for QPSK and 0.90 for 16-QAM. We further show that this trend is preserved in coded systems and remains robust to the detector memory. The impact of FTN operation on the instantaneous-to-average power ratio (IAPR) is also examined. Overall, the results highlight how constellation order should be considered when selecting the operating point for FTN signaling.

cs.IT↗

arXiv2026

Constrained Capacity for Faster-than-Nyquist Signaling in Frequency-Selective Fading Channels

In this paper, we investigate the constrained capacity of discrete Fourier transform (DFT)-precoded faster-than-Nyquist (FTN) signaling over frequency-selective channels with finite-alphabet inputs. With a cyclic prefix (CP) and cyclic suffix (CS), the FTN and multipath induced intersymbol interference (ISI) is decomposed into parallel eigenchannels, whose gains are jointly determined by the folded FTN spectrum and the channel frequency response. Based on this decomposition, we derive the constrained capacity for finite-alphabet constellations and formulate a mismatched decoding achievable information rate for DFT-precoded FTN signaling without CP/CS, quantifying the finite-block rate loss caused by imperfect diagonalization. We find that even under mismatched decoding, FTN significantly improves upon Nyquist transmission.

cs.IT↗

arXiv2026

Constrained Capacity Analysis for Faster-than-Nyquist Signaling

This paper studies the constrained-capacity for precoded faster-than-Nyquist (FTN) signaling with finite-alphabet inputs. Despite the promise of accelerated transmission, the fundamental rate limit of precoded FTN signaling under practical finite-alphabet constraints remains unclear. By introducing cyclic prefix (CP) and cyclic suffix (CS), the FTN channel is decomposed into a set of parallel eigenchannels by the discrete Fourier transform (DFT) matrix, based on which the constrained capacity is derived. The results demonstrate that time acceleration can improve spectral efficiency over Nyquist signaling even when a fixed modulation order is employed. Moreover, in the low and moderate signal-to-noise ratio (SNR) regimes, a smaller constellation combined with stronger time acceleration can outperform a larger constellation with weaker acceleration. Next, the asymptotic behavior of the constrained capacity is analyzed as the acceleration factor tends to zero under both fixed transmit-SNR and fixed receive-SNR definitions. It is shown that the constrained capacity for DFT-precoded FTN is fundamentally limited by the constellation size. In addition, the constrained capacity under channel mismatch is studied and a mismatched achievable information rate (AIR) formulation is developed to show the effects of practical constraints on the performance degradation. Finally, adaptive bit loading across eigenchannels is investigated to exploit the higher-quality eigenchannels.

cs.IT↗

arXiv2026

Pushing the Limits: Unlocking the Potential of Faster-than-Nyquist Signaling

Faster-than-Nyquist (FTN) signaling is gaining attention as a smart way to pack more data into limited spectrum by intentionally breaking the traditional symbol-spacing rules. This article takes a fresh look at FTN's potential to boost capacity, examining how performance varies across different acceleration factors and signal-to-noise ratio (SNR) definitions. Beyond the theory, we explore what it takes to make FTN work in practice, such as dealing with power amplifier constraints, managing high peak-to-average power, and designing practical coding strategies. We also highlight real-world issues like spectrum sharing, short-packet communication, and receiver complexity. With applications ranging from low-latency links to integrated sensing and satellite systems, FTN offers a compelling path forward for future wireless technologies.

eess.SP↗

arXiv2025

Capacity and IAPR Analysis for MIMO Faster-than-Nyquist Signaling with High Acceleration Rate

Faster-than-Nyquist (FTN) signaling is a non-orthogonal transmission technique offering a promising solution for future generations of communications. This paper studies the capacity of FTN signaling in multiple-input multiple-output (MIMO) channels for high acceleration factors. In our previous study [1], we found the capacity for MIMO FTN channels if the acceleration factor is larger than a certain threshold, which depends on the bandwidth of the pulse shape used. In this paper, we extend the capacity analysis to acceleration factors smaller than this mentioned threshold. In addition to capacity, we conduct peak-to-average power ratio (PAPR) analysis and simulation for MIMO FTN for varying acceleration factors for both Gaussian and QPSK symbol sets. Our analysis reveals important insights about transmission power and received signal-to-noise ratio (SNR) variation in FTN. As the acceleration factor approaches 0, if the transmission power is fixed, the received SNR diminishes, or if the received SNR is fixed, PAPR at the transmitter explodes.

cs.IT↗

arXiv2025

PAPR Analysis for MIMO FTN Signaling with Gaussian Symbols

Faster-than-Nyquist signaling serves as a promising solution for improving spectral efficiency in future generations of communications. However, its nature of fast acceleration brings highly overlapped pulses that lead to worse peak-to-average power ratio (PAPR) performance. In this paper, we investigate the PAPR behavior of MIMO FTN using Gaussian symbols under optimal power allocation for two power constraints: fixed transmit power and fixed received signal-to-noise-ratio (SNR). Our findings reveal that PAPR is mainly determined by the acceleration factor and the power constraint, but power allocation optimization does not change the PAPR behavior for Gaussian signaling.

eess.SP↗

arXiv2025

Sensing and Mitigation of Multi-Scatterer Self-Interference for Full-Duplex MIMO Communications

This paper proposes the joint use of digital self-interference cancellation (DSIC) and spatial suppression to mitigate far-field self-interference (SI) in full-duplex multiple-input multiple-output (MIMO) systems. Far-field SI, caused by echoes from environmental scatterers, is modeled based on the scatterers' angle and delay parameters, stored in a scatterer map. For each scatterer, the most suitable action regarding communication is selected from transmit beamforming, receive beamforming, DSIC, and no-action. This selection is based on simple metrics that show the expected uplink and downlink communication performance. In addition, emerging scatterers that deteriorate the communication are detected, and their delay and angles are acquired, providing an up-to-date scatterer map and presenting a \emph{sensing for communication} case. The proposed selection policy is compared with the individual implementations of DSIC and spatial suppression, highlighting the failure cases for each. It is shown that the proposed policy stays unaffected in these problematic cases and achieves SI-free performance.

eess.SP↗

arXiv2023

Capacity Region of Asynchronous Multiple Access Channels with FTN

This paper studies the capacity region of asynchronous multiple access channel (MAC) with faster-thanNyquist (FTN) signaling. We first express the capacity region in the frequency domain. Next, we calculate an achievable rate region in time domain and prove that it is identical to the capacity region calculated in the frequency domain. Our analysis confirms that asynchronous transmission and FTN bring in significant gains.

cs.IT↗

arXiv2023

Robust Statistical Beamforming with Multi-Cluster Tracking for Time-Varying Massive MIMO (Extended Version)

In this paper, a joint design of instantaneous channel estimation, beam tracking, and adaptive beamformer construction for a massive multiple-input multiple-output (MIMO) system is proposed. This design focuses on efficiency in terms of performance and computational complexity under the adverse effects of time variation and mobility of sources, the presence of multiuser and multipath components, or simply multi-clusters, and the near-far effect. The design is also suitable for hybrid beamforming and frequency-selective channels. In the proposed system, channel parameters are estimated in time-domain duplex (TDD) uplink mode using a per-cluster approach rather than a joint approach, which significantly reduces the complexity. Per-cluster estimation is possible thanks to the proposed interference-aware statistical beamforming method, namely reduced dimensional Generalized Eigenbeamformer (RD-GEB), which undertakes the computational load of interference mitigation and enables a simpler design for the remaining stages. In addition, the overall design is based on the separation of channel parameters as fast-time and slow-time, leaving only the instantaneous channel estimation and channel matched filtering as fast-time operations, which are handled inside cluster-specific reduced dimensional subspaces. Beam tracking and beamformer construction are held in slow-time rarely, which reduces the time-averaged complexity. Furthermore, beam tracking is performed by leveraging a batch of instantaneous channel estimates, which removes the need for an additional training process. The proposed low-complexity design is shown to outperform the conventional methods.

cs.IT↗

arXiv2019

An Efficient Beam and Channel Acquisition via Sparsity Map and Joint Angle-Delay Power Profile Estimation for Wideband Massive MIMO Systems

In this paper, an efficient beam and channel acquisition scheme together with joint angle-delay power profile (JADPP) construction are proposed for single-carrier mm-wave wideband sparse massive multiple-input multiple-output (MIMO) channels when hybrid beamforming architecture is utilized. We consider two different modes of operation, namely slow-time beam acquisition and fast-time instantaneous channel estimation, for training stage of time division duplex based systems. In the first mode, where pre-structured hybrid beams are formed to scan intended angular sectors, the joint angle-delay sparsity map together with power intensities of each user channels are obtained by using a novel constant false alarm rate thresholding algorithm inspired from adaptive radar detection theory. The proposed thresholding algorithm employs a spatio-temporal adaptive matched filter type estimator, taking the strong interference due to simultaneously active multipath components of different user channels into account, in order to estimate JADPP of each user. After applying the proposed thresholding algorithm on the estimated power profile, the angle-delay sparsity map of the massive MIMO channel is constructed, based on which the channel covariance matrices (CCMs) are formed with significantly reduced amount of training snapshots. Then, by using the estimated CCMs, the analog beamformer is reconstructed by means of a virtual sectorization while taking the inter-group and inter-symbol interference into account. Finally, for the second mode of operation, two novel reduced-rank instantaneous channel estimators, operating in a proper beamspace formed by the hybrid structure, are proposed. The proposed beam and channel acquisition techniques attain the channel estimation accuracy of minimum mean square error filter with true knowledge of CCMs.

cs.IT↗

arXiv2019

The Effect of Spatial Correlation on the Performance of Uplink and Downlink Single-Carrier Massive MIMO Systems

We present the analysis of a single-carrier massive MIMO system for the frequency selective Gaussian multi-user channel, in both uplink and downlink directions. We develop expressions for the achievable sum rate when there is spatial correlation among antennas at the base station. It is known that the channel matched filter precoder (CMFP) performs the best in a spatially uncorrelated downlink channel. However, we show that, in a spatially correlated downlink channel with two different correlation patterns and at high long-term average power, two other precoders have better performance. For the uplink channel, part of the equivalent noise in the channel goes away, and implementing two conventional equalizers leads to a better performance compared to the channel matched filter equalizer (CMFE). These results are verified for uniform linear and uniform planar arrays. In the latter, due to more correlation, the performance drop with a spatially correlated channel is larger, but the performance gain against channel matched filter precoder or equalizer is also bigger. In highly correlated cases, the performance can be a significant multiple of that of the channel matched filter precoder or equalizers.}

cs.IT↗

arXiv2017

Beamspace Aware Adaptive Channel Estimation for Single-Carrier Time-varying Massive MIMO Channels

In this paper, the problem of sequential beam construction and adaptive channel estimation based on reduced rank (RR) Kalman filtering for frequency-selective massive multiple-input multiple-output (MIMO) systems employing single-carrier (SC) in time division duplex (TDD) mode are considered. In two-stage beamforming, a new algorithm for statistical pre-beamformer design is proposed for spatially correlated time-varying wideband MIMO channels under the assumption that the channel is a stationary Gauss-Markov random process. The proposed algorithm yields a nearly optimal pre-beamformer whose beam pattern is designed sequentially with low complexity by taking the user-grouping into account, and exploiting the properties of Kalman filtering and associated prediction error covariance matrices. The resulting design, based on the second order statistical properties of the channel, generates beamspace on which the RR Kalman estimator can be realized as accurately as possible. It is observed that the adaptive channel estimation technique together with the proposed sequential beamspace construction shows remarkable robustness to the pilot interference. This comes with significant reduction in both pilot overhead and dimension of the pre-beamformer lowering both hardware complexity and power consumption.

cs.IT↗

arXiv2016

A Generalized Framework on Beamformer Design and CSI Acquisition for Single-Carrier Massive MIMO Systems in Millimeter Wave Channels

In this paper, we establish a general framework on the reduced dimensional channel state information (CSI) estimation and pre-beamformer design for frequency-selective massive multiple-input multiple-output MIMO systems employing single-carrier (SC) modulation in time division duplex (TDD) mode by exploiting the joint angle-delay domain channel sparsity in millimeter (mm) wave frequencies. First, based on a generic subspace projection taking the joint angle-delay power profile and user-grouping into account, the reduced rank minimum mean square error (RR-MMSE) instantaneous CSI estimator is derived for spatially correlated wideband MIMO channels. Second, the statistical pre-beamformer design is considered for frequency-selective SC massive MIMO channels. We examine the dimension reduction problem and subspace (beamspace) construction on which the RR-MMSE estimation can be realized as accurately as possible. Finally, a spatio-temporal domain correlator type reduced rank channel estimator, as an approximation of the RR-MMSE estimate, is obtained by carrying out least square (LS) estimation in a proper reduced dimensional beamspace. It is observed that the proposed techniques show remarkable robustness to the pilot interference (or contamination) with a significant reduction in pilot overhead.

cs.IT↗