arXiv subjects

Ebrahim Bedeer

Publications and source records attributed to Ebrahim Bedeer.

53 records · Page 3Linked to original sources

arXiv2020

Polar Coded Faster-than-Nyquist (FTN) Signaling with Symbol-by-Symbol Detection

Reduced complexity faster-than-Nyquist (FTN) signaling systems are gaining increased attention as they provide improved bandwidth utilization for an acceptable level of detection complexity. In order to have a better understanding of the tradeoff between performance and complexity of the reduced complexity FTN detection techniques, it is necessary to study these techniques in the presence of channel coding. In this paper, we investigate the performance a polar coded FTN system which uses a reduced complexity FTN detection, namely, the recently proposed successive symbol-by-symbol with go-backK sequence estimation (SSSgbKSE) technique. Simulations are performed for various intersymbol-interference (ISI) levels and for various go-back-K values. Bit error rate (BER) performance of Bahl-Cocke-Jelinek-Raviv (BCJR) detection and SSSgbKSE detection techniques are studied for both uncoded and polar coded systems. Simulation results reveal that polar codes can compensate some of the performance loss incurred in the reduced complexity SSSgbKSE technique and assist in closing the performance gap between BCJR and SSSgbKSE detection algorithms.

eess.SP↗

arXiv2019

Low-Complexity Detection for Faster-than-Nyquist Signaling based on Probabilistic Data Association

In this paper, we investigate the sequence estimation problem of faster-than-Nyquist (FTN) signaling as a promising approach for increasing spectral efficiency (SE) in future communication systems. In doing so, we exploit the concept of Gaussian separability and propose two probabilistic data association (PDA) algorithms with polynomial time complexity to detect binary phase-shift keying (BPSK) FTN signaling. Simulation results show that the proposed PDA algorithm outperforms the recently proposed SSSSE and SSSgb$K$SE algorithms for all SE values with a modest increase in complexity. The PDA algorithm approaches the performance of the semidefinite relaxation (SDRSE) algorithm for SE values of $0.96$ bits/sec/Hz, and it is within the $0.5$ dB signal-to-noise ratio (SNR) penalty at SE values of $1.10$ bits/sec/Hz for the fixed values of $β= 0.3$.

eess.SP↗

arXiv2019

Energy Efficiency Maximization of Self-Sustained Wireless Body Area Sensor Networks

Electronic health monitoring is one of the major applications of wireless body area networks (WBANs) that helps with early detection of any abnormal physiological symptoms. In this paper, we propose and solve an optimization problem that maximizes the energy efficiency (EE) of WBAN consisting of sensor nodes (SNs) equipped with energy harvesting capabilities communicating with an aggregator. We exploit the structure of the optimization problem to provide a sub-optimal solution at a lower computational complexity and derive the mathematical expressions of upper and lower bounds of the source rates of the SN. The simulation results reveal that the optimal allocation of the source rate to energy critical SNs improves the system performance of WBAN in terms of energy efficiency during different everyday activities.

eess.SP↗

arXiv2019

Low-Complexity Detection of M-ary PSK Faster-than-Nyquist Signaling

Faster-than-Nyquist (FTN) signaling is a promising non-orthogonal physical layer transmission technique to improve the spectral efficiency of future communication systems but at the expense of intersymbol-interference (ISI). In this paper, we investigate the detection problem of FTN signaling and formulate the sequence estimation problem of any $M$-ary phase shift keying (PSK) FTN signaling as an optimization problem that turns out to be non-convex and nondeterministic polynomial time (NP)-hard to solve. We propose a novel algorithm, based on concepts from semidefinite relaxation (SDR) and Gaussian randomization, to detect any $M$-ary PSK FTN signaling in polynomial time complexity regardless of the constellation size $M$ or the ISI length. Simulation results show that the proposed algorithm strikes a balance between the achieved performance and the computational complexity. Additionally, results show the merits of the proposed algorithm in improving the spectral efficiency when compared to Nyquist signaling and the state-of-the-art schemes from the literature. In particular, when compared to Nyquist signaling at the same error rate and signal-to-noise ratio, our scheme provides around $17\%$ increase in the spectral efficiency at a roll-off factor of 0.3.

cs.IT↗

arXiv2019

Adaptive Bit Allocation for OFDM Cognitive Radio Systems with Imperfect Channel Estimation

Cognitive radios hold tremendous promise for increasing the spectral efficiency of wireless communication systems. In this paper, an adaptive bit allocation algorithm is presented for orthogonal frequency division multiplexing (OFDM) CR systems operating in a frequency selective fading environment. The algorithm maximizes the CR system throughput in the presence of narrowband interference, while guaranteeing a BER below a predefined threshold. The effect of imperfect channel estimation on the algorithm's performance is also studied.

cs.IT↗

arXiv2019

On Partially Overlapping Coexistence for Dynamic Spectrum Access in Cognitive Radio

In this paper, we study partially overlapping co-existence scenarios in cognitive radio environment. We consider an Orthogonal Frequency Division Multiplexing (OFDM) cognitive system coexisting with a narrow-band (NB) and an OFDM primary system, respectively. We focus on finding the minimum frequency separation between the coexisting systems to meet a certain target BER. Windowing and nulling are used as simple techniques to reduce the OFDM out-of-band radiations, and, hence decrease the separation. The effect of these techniques on the OFDM spectral efficiency and PAPR is also studied.

eess.SP↗

arXiv2019

Energy-Efficient Power Loading for OFDM-based Cognitive Radio Systems with Channel Uncertainties

In this paper, we propose a novel algorithm to optimize the energy-efficiency (EE) of orthogonal frequency division multiplexing-based cognitive radio systems under channel uncertainties. We formulate an optimization problem that guarantees a minimum required rate and a specified power budget for the secondary user (SU), while restricting the interference to primary users (PUs) in a statistical manner. The optimization problem is non-convex and it is transformed to an equivalent problem using the concept of fractional programming. Unlike all related works in the literature, we consider the effect of imperfect channel-stateinformation (CSI) on the links between the SU transmitter and receiver pairs and we additionally consider the effect of limited sensing capabilities of the SU. Since the interference constraints are met statistically, the SU transmitter does not require perfect CSI feedback from the PUs receivers. Simulation results sho w that the EE deteriorates as the channel estimation error increases. Comparisons with relevant works from the literature show that the interference thresholds at the PUs receivers can be severely exceeded and the EE is slightly deteriorated if the SU does no t account for spectrum sensing errors.

eess.SP↗

arXiv2019

Rate-Interference Tradeoff in OFDM-based Cognitive Radio Networks

In cognitive radio (CR) networks, secondary users (SUs) are allowed to opportunistically access the primary users (PUs) spectrum to improve the spectrum utilization; however, this increases the interference levels at the PUs. In this paper, we consider an orthogonal frequency division multiplexing OFDM-based CR network and investigate the tradeoff between increasing the SU transmission rate (hence improving the spectrum utilization) and reducing the interference levels at the PUs. We formulate a new multiobjective optimization (MOOP) problem that jointly maximizes the SU transmission rate and minimizes its transmit power, while imposing interference thresholds to the PUs. Further, we propose an algorithm to strike a balance between the SU transmission rate and the interference levels to the PUs. The proposed algorithm considers the practical scenario of knowing partial channel state information (CSI) of the links between the SU transmitter and the PUs receivers. Simulation results illustrate the performance of the proposed algorithm and its superiority when compared to the work in the literature.

eess.SP↗

arXiv2019

A Novel Algorithm for Rate/Power Allocation in OFDM-based Cognitive Radio Systems with Statistical Interference Constraints

In this paper, we adopt a multiobjective optimization approach to jointly optimize the rate and power in OFDM-based cognitive radio (CR) systems. We propose a novel algorithm that jointly maximizes the OFDM-based CR system throughput and minimizes its transmit power, while guaranteeing a target bit error rate per subcarrier and a total transmit power threshold for the secondary user (SU), and restricting both co-channel and adjacent channel interferences to existing primary users (PUs) in a statistical manner. Since the interference constraints are met statistically, the SU transmitter does not require perfect channel-state-information (CSI) feedback from the PUs receivers. Closed-form expressions are derived for bit and power allocations per subcarrier. Simulation results illustrate the performance of the proposed algorithm and compare it to the case of perfect CSI. Further, the results show that the performance of the proposed algorithm approaches that of an exhaustive search for the discrete global optimal allocations with significantly reduced computational complexity.

eess.SP↗

arXiv2019

A Novel Algorithm for Joint Bit and Power Loading for OFDM Systems with Unknown Interference

In this paper, a novel low complexity bit and power loading algorithm is formulated for orthogonal frequency division multiplexing (OFDM) systems operating in fading environments and in the presence of unknown interference. The proposed non-iterative algorithm jointly maximizes the throughput and minimizes the transmitted power, while guaranteeing a target bit error rate (BER) per subcarrier. Closed-form expressions are derived for the optimal bit and power distributions per subcarrier. The performance of the proposed algorithm is investigated through extensive simulations. A performance comparison with the algorithm in [1] shows the superiority of the proposed algorithm with reduced computational effort.

eess.SP↗

arXiv2019

Optimal Bit and Power Loading for OFDM Systems with Average BER and Total Power Constraints

In this paper, a novel joint bit and power loading algorithm is proposed for orthogonal frequency division multiplexing (OFDM) systems operating in fading environments. The algorithm jointly maximizes the throughput and minimizes the transmitted power, while guaranteeing a target average bit error rate (BER) and meeting a constraint on the total transmit power. Simulation results are described that illustrate the performance of the proposed scheme and demonstrate its superiority when compared to the algorithm in [1].

eess.SP↗

arXiv2019

Constrained Joint Bit and Power Allocation for Multicarrier Systems

This paper proposes a novel low complexity joint bit and power suboptimal allocation algorithm for multicarrier systems operating in fading environments. The algorithm jointly maximizes the throughput and minimizes the transmitted power, while guaranteeing a target bit error rate (BER) per subcarrier and meeting a constraint on the total transmit power. Simulation results are described that illustrate the performance of the proposed scheme and demonstrate its superiority when compared to the algorithm in [4] with similar or reduced computational complexity. Furthermore, the results show that the performance of the proposed suboptimal algorithm approaches that of an optimal exhaustive search with significantly lower computational complexity.

eess.SP↗

arXiv2019

Joint Optimization of Bit and Power Loading for Multicarrier Systems

In this letter, a novel low complexity bit and power loading algorithm is formulated for multicarrier communication systems. The proposed algorithm jointly maximizes the throughput and minimizes the transmit power through a weighting coefficient $α$, while meeting constraints on the target bit error rate (BER) per subcarrier and on the total transmit power. The optimization problem is solved by the Lagrangian multiplier method if the initial $α$ causes the transmit power not to violate the power constraint; otherwise, a bisection search is used to find the appropriate $α$. Closed-form expressions are derived for the close-to-optimal bit and power allocations per subcarrier, average throughput, and average transmit power. Simulation results illustrate the performance of the proposed algorithm and demonstrate its superiority with respect to existing allocation algorithms. Furthermore, the results show that the performance of the proposed algorithm approaches that of the exhaustive search for the discrete optimal allocations.

eess.SP↗

arXiv2017

Enabling Sphere Decoding for SCMA

In this paper, we propose a reduced-complexity optimal modified sphere decoding (MSD) detection scheme for SCMA. As SCMA systems are characterized by a number of resource elements (REs) that are less than the number of the supported users, the channel matrix is rank-deficient, and sphere decoding (SD) cannot be directly applied. Inspired by the Tikhonov regularization, we formulate a new full-rank detection problem that it is equivalent to the original rank-deficient detection problem for constellation points with constant modulus and an important subset of non-constant modulus constellations. By exploiting the SCMA structure, the computational complexity of MSD is reduced compared with the conventional SD. We also employ list MSD to facilitate channel coding. Simulation results demonstrate that in uncoded SCMA systems the proposed MSD achieves the performance of the optimal maximum likelihood (ML) detection. Additionally, the proposed MSD benefits from a lower average complexity compared with MPA.

cs.IT↗

arXiv2017

Reduced Complexity Optimal Detection of Binary Faster-than-Nyquist Signaling

In this paper, we investigate the detection problem of binary faster-than-Nyquist (FTN) signaling and propose a novel sequence estimation technique that exploits its special structure. In particular, the proposed sequence estimation technique is based on sphere decoding (SD) and exploits the following two characteristics about the FTN detection problem: 1) the cor- relation between the noise samples after the receiver matched filter, and 2) the structure of the intersymbol interference (ISI) matrix. Simulation results show that the proposed SD-based sequence estimation (SDSE) achieves the optimal performance of the maximum likelihood sequence estimation (MLSE) at reduced computational complexity. This paper demonstrates that FTN signaling has the great potential of increasing the data rate and spectral efficiency substantially, when compared to Nyquist signaling, for the same bit-error-rate (BER) and signal-to-noise ratio (SNR).

cs.IT↗

arXiv2017

A Very Low Complexity Successive Symbol-by-Symbol Sequence Estimator for Faster-than-Nyquist Signaling

In this paper, we investigate the sequence estimation problem of binary and quadrature phase shift keying faster-than-Nyquist (FTN) signaling and propose two novel low-complexity sequence estimation techniques based on concepts of successive interference cancellation. To the best of our knowledge, this is the first approach in the literature to detect FTN signaling on a symbol-by-symbol basis. In particular, based on the structure of the self-interference inherited in FTN signaling, we first find the operating region boundary---defined by the root-raised cosine (rRC) pulse shape, its roll-off factor, and the time acceleration parameter of the FTN signaling---where perfect estimation of the transmit data symbols on a symbol-by-symbol basis is guaranteed, assuming noise-free transmission. For noisy transmission, we then propose a novel low-complexity technique that works within the operating region and is capable of estimating the transmit data symbols on a symbol-by-symbol basis. To reduce the error propagation of the proposed successive symbol-by-symbol sequence estimator (SSSSE), we propose a successive symbol-by-symbol with go-back-$K$ sequence estimator (SSSgb$K$SE) that goes back to re-estimate up to $K$ symbols, and subsequently improves the estimation accuracy of the current data symbol. Simulation results show that the proposed sequence estimation techniques perform well for low intersymbol interference (ISI) scenarios and can significantly increase the data rate and spectral efficiency. Additionally, results reveal that choosing the value of $K$ as low as $2$ or $3$ data symbols is sufficient to significantly improve the bit-error-rate performance. Results also show that the performance of the proposed SSSgb$K$SE, with $K = 1$ or $2$, surpasses the performance of the lowest complexity equalizers reported in the literature, with reduced computational complexity.

cs.IT↗

arXiv2016

Optimal Link Adaptation for Multicarrier Communication Systems

Link adaptation is the terminology used to describe techniques that improve multicarrier communication systems performance by dynamically adapting the transmission parameters, i.e., transmit power and number of bits per subcarrier, to the changing quality of the wireless link. The research literature has focused on single objective optimization techniques to optimize the multicarrier communication systems performance, e.g., maximizing the throughput/capacity or minimizing the transmit power subject to a set of constraints. In this dissertation, we adopt a novel optimization concept, namely multiobjective optimization, where our objective is to simultaneously optimize the conflicting and incommensurable throughput and power objectives. More specifically, in some of the following Chapters, we propose novel algorithms that jointly maximize the multicarrier system throughput and minimize its total transmit power subject to quality-of-service, total transmit power, and maximum allocated bits per subcarrier constraints. The proposed algorithms require prior knowledge about the importance of the competing objective functions in terms of pre-determined weighting coefficients, or they can adapt the weighting coefficients during the solution process while meeting the constraints, in order to reduce the computational complexity. Simulation results show significant performance gains in terms of the achieved throughput and transmit power when compared to single optimization approaches, at the cost of no additional complexity.

cs.IT↗