Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rakshith Rajashekar

dblp:54/10799 · DBLP profile ↗
← Back
15ranked-venue papers
11as first author
1since 2021 · last 2021
0000-0002-7688-7539ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 12 · 8 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
9 papers
Physical-layer communications · 89% Vehicular, aerial and satellite networks · 7% Wireless networking · 4%
Theoretical computer science
4 papers
Information theory · 92% Coding theory · 8%

Topics — the 30 heaviest of 33, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications
MIMO
1.242019
Finite-Cardinality Single-RF Differential Space-Time Modulation for Improving the Diversity-Throughput Tradeoff · IEEE Trans. Commun. 2019
"Near-Perfect" Finite-Cardinality Generalized Space-Time Shift Keying · IEEE J. Sel. Areas Commun. 2019
Differential Space-Time Coding Dispensing With Channel Estimation Approaches the Performance of Its Coherent Counterpart in the Open-Loop Massive MIMO-OFDM Downlink · IEEE Trans. Commun. 2018
Physical-layer communications › MIMO › space-time modulation
space-time shift keying
0.822019
Finite-Cardinality Single-RF Differential Space-Time Modulation for Improving the Diversity-Throughput Tradeoff · IEEE Trans. Commun. 2019
"Near-Perfect" Finite-Cardinality Generalized Space-Time Shift Keying · IEEE J. Sel. Areas Commun. 2019
Physical-layer communications
modulation
0.722019
Finite-Cardinality Single-RF Differential Space-Time Modulation for Improving the Diversity-Throughput Tradeoff · IEEE Trans. Commun. 2019
Algebraic Differential Spatial Modulation Is Capable of Approaching the Performance of Its Coherent Counterpart · IEEE Trans. Commun. 2017
Physical-layer communications › MIMO › space-time modulation
differential space-time modulation
0.412019
Finite-Cardinality Single-RF Differential Space-Time Modulation for Improving the Diversity-Throughput Tradeoff · IEEE Trans. Commun. 2019
Physical-layer communications › MIMO › spatial modulation
generalized spatial modulation
0.412019
"Near-Perfect" Finite-Cardinality Generalized Space-Time Shift Keying · IEEE J. Sel. Areas Commun. 2019
Physical-layer communications › modulation
index modulation
0.412019
"Near-Perfect" Finite-Cardinality Generalized Space-Time Shift Keying · IEEE J. Sel. Areas Commun. 2019
Wireless networking
simultaneous wireless information and power transfer
0.412019
A Finite Input Alphabet Perspective on the Rate-Energy Tradeoff in SWIPT Over Parallel Gaussian Channels · IEEE J. Sel. Areas Commun. 2019
Physical-layer communications › MIMO
spatial modulation
0.422014
Reduced-Complexity ML Detection and Capacity-Optimized Training for Spatial Modulation Systems · IEEE Trans. Commun. 2014
Spatial Modulation Aided Zero-Padded Single Carrier Transmission for Dispersive Channels · IEEE Trans. Commun. 2013
Vehicular, aerial and satellite networks › aeronautical communication
air-to-ground communication
0.312018
A Beamforming-Aided Full-Diversity Scheme for Low-Altitude Air-to-Ground Communication Systems Operating With Limited Feedback · IEEE Trans. Commun. 2018
Physical-layer communications
beamforming
0.312018
A Beamforming-Aided Full-Diversity Scheme for Low-Altitude Air-to-Ground Communication Systems Operating With Limited Feedback · IEEE Trans. Commun. 2018
Physical-layer communications › MIMO › space-time coding
differential space-time coding
0.312018
Differential Space-Time Coding Dispensing With Channel Estimation Approaches the Performance of Its Coherent Counterpart in the Open-Loop Massive MIMO-OFDM Downlink · IEEE Trans. Commun. 2018
Physical-layer communications › beamforming › adaptive beamforming
limited feedback beamforming
0.312018
A Beamforming-Aided Full-Diversity Scheme for Low-Altitude Air-to-Ground Communication Systems Operating With Limited Feedback · IEEE Trans. Commun. 2018
Vehicular, aerial and satellite networks
UAV communication
0.312018
A Beamforming-Aided Full-Diversity Scheme for Low-Altitude Air-to-Ground Communication Systems Operating With Limited Feedback · IEEE Trans. Commun. 2018
Physical-layer communications › signal detection
differential detection
0.312017
Algebraic Differential Spatial Modulation Is Capable of Approaching the Performance of Its Coherent Counterpart · IEEE Trans. Commun. 2017
Physical-layer communications › MIMO › spatial modulation
differential spatial modulation
0.312017
Algebraic Differential Spatial Modulation Is Capable of Approaching the Performance of Its Coherent Counterpart · IEEE Trans. Commun. 2017
Physical-layer communications
signal detection
0.312017
Algebraic Differential Spatial Modulation Is Capable of Approaching the Performance of Its Coherent Counterpart · IEEE Trans. Commun. 2017
Physical-layer communications › information theory
finite-alphabet input
0.212016
Hybrid Beamforming in mm-Wave MIMO Systems Having a Finite Input Alphabet · IEEE Trans. Commun. 2016
Physical-layer communications › beamforming
hybrid beamforming
0.212016
Hybrid Beamforming in mm-Wave MIMO Systems Having a Finite Input Alphabet · IEEE Trans. Commun. 2016
Physical-layer communications › MIMO
millimeter wave MIMO
0.212016
Hybrid Beamforming in mm-Wave MIMO Systems Having a Finite Input Alphabet · IEEE Trans. Commun. 2016
Physical-layer communications › MIMO
mutual information maximization
0.212016
Hybrid Beamforming in mm-Wave MIMO Systems Having a Finite Input Alphabet · IEEE Trans. Commun. 2016
Physical-layer communications
channel estimation
0.212014
Reduced-Complexity ML Detection and Capacity-Optimized Training for Spatial Modulation Systems · IEEE Trans. Commun. 2014
Physical-layer communications › diversity
multipath diversity
0.212013
Spatial Modulation Aided Zero-Padded Single Carrier Transmission for Dispersive Channels · IEEE Trans. Commun. 2013
Physical-layer communications › modulation
single-carrier transmission
0.212013
Spatial Modulation Aided Zero-Padded Single Carrier Transmission for Dispersive Channels · IEEE Trans. Commun. 2013
Physical-layer communications
power allocation
0.112019
A Finite Input Alphabet Perspective on the Rate-Energy Tradeoff in SWIPT Over Parallel Gaussian Channels · IEEE J. Sel. Areas Commun. 2019
Information theory › communication channels › MIMO › MIMO channel
diversity-multiplexing tradeoff
0.112019
"Near-Perfect" Finite-Cardinality Generalized Space-Time Shift Keying · IEEE J. Sel. Areas Commun. 2019
Physical-layer communications › channel state information
channel quantization
0.112018
A Beamforming-Aided Full-Diversity Scheme for Low-Altitude Air-to-Ground Communication Systems Operating With Limited Feedback · IEEE Trans. Commun. 2018
Physical-layer communications › MIMO › massive MIMO
massive MIMO-OFDM
0.112018
Differential Space-Time Coding Dispensing With Channel Estimation Approaches the Performance of Its Coherent Counterpart in the Open-Loop Massive MIMO-OFDM Downlink · IEEE Trans. Commun. 2018
Physical-layer communications › MIMO › precoder design
codebook design
0.112016
Hybrid Beamforming in mm-Wave MIMO Systems Having a Finite Input Alphabet · IEEE Trans. Commun. 2016
Physical-layer communications › coding theory › joint source-channel coding
vector quantization
0.112016
Hybrid Beamforming in mm-Wave MIMO Systems Having a Finite Input Alphabet · IEEE Trans. Commun. 2016
Information theory
channel capacity
0.112014
Reduced-Complexity ML Detection and Capacity-Optimized Training for Spatial Modulation Systems · IEEE Trans. Commun. 2014

Methods — techniques the papers use, named apart from their topics

convex optimization · 1.1maximum likelihood detection · 1.0time-sharing · 0.8signal selection · 0.8power splitting · 0.8index modulation · 0.8threaded algebraic space-time · 0.4diagonal algebraic space-time · 0.4amplitude phase-shift keying · 0.4inverse fourier transform · 0.3partial interference cancellation · 0.2
YearPublicationVenuePosition
2021 Space-, Time- and Frequency-Domain Index Modulation for Next-Generation Wireless: A Unified Single-/Multi-Carrier and Single-/Multi-RF MIMO Framework
abstract
As the enabling technologies move up to the mmWave and even to the TeraHertz bands for the next-generation wireless systems, the signal processing of high-bandwidth orthogonal frequency division multiplexing (OFDM) becomes increasingly power-thirsty, owing to the following OFDM deficiencies: (1) the high peak-to-average power ratio (PAPR); (2) the bandwidth efficiency loss due to the cyclic prefix (CP) overhead; (3) the sensitivity to carrier frequency offset; (4) the complex out-of-band (OOB) filtering. Over the past six decades, a variety of waveforms have been developed in order to mitigate these deficiencies, which are generally achieved at the cost of compromising some of OFDM’s beneficial properties, such as its subcarrier (SC) orthogonality, its high throughput and its straighforward adoption to multiple-input multiple-output (MIMO) systems. Against this background, we propose a new waveform termed as multi-band discrete Fourier transform spread-OFDM with index modulation (MB-DFT-S-OFDM-IM), where the component multi-carrier techniques are conceived to constructively function together in order to mitigate the OFDM deficiencieswithout compromising the beneficial OFDM properties. More explicitly, first of all, the PAPR is reduced by the DFT-precoding. Secondly, thanks to the IM design, MB-DFT-S-OFDM-IM is capable of achieving a high throughput that is strictly equal to or higher than the OFDM throughput. Thirdly, MB-DFT-S-OFDM-IM achieves a beneficial frequency diversity gain, which leads to a higher tolerance to carrier frequency offset. Fourthly, the OOB filters are placed in each sub-band before DFT, so that the SC orthogonality remains intact, which is unique to the proposed MB-DFT-S-OFDM-IM structure. Last but not least, we extend the proposed MB-DFT-S-OFDM-IM to support a variety of MIMO schemes, where the IM philosophy is integrated with the space-, time- and frequency-domains within a singleunifiedplatform.
Chao Xu 0005, Yifeng Xiong, Naoki Ishikawa, Rakshith Rajashekar, Shinya Sugiura, Zhaocheng Wang 0001, Soon Xin Ng, Lie-Liang Yang, Lajos Hanzo
IEEE Trans. Wirel. Commun.4
2019 A Finite Input Alphabet Perspective on the Rate-Energy Tradeoff in SWIPT Over Parallel Gaussian Channels
abstract
Simultaneous wireless information and power transfer (SWIPT) has gained significant popularity in the recent past owing to its applications in a wide range of use cases. Although SWIPT has been fairly well investigated in the literature, the existing work has mainly focused on attaining the optimal rate energy (RE) tradeoff assuming Gaussian input alphabet. However, practical systems operate with finite input alphabets such as quadratic-amplitude modulation (QAM)/phase-shift keying. We characterize the attainable RE tradeoff in SWIPT systems employing finite input alphabet for transmission over parallel Gaussian channels of say orthogonal frequency-division multiplexing subcarriers or multiple-input multiple-output streams. Some of the key results in the literature that assume Gaussian input alphabet are shown to be special cases of our results. Furthermore, we provide insights into our results with the aid of graphical illustrations, which throw light on the optimal power allocation policy for various energy-harvesting constraints. Furthermore, we consider practically relevant time-sharing and power-splitting schemes operating with finite input alphabet and characterize their RE tradeoff. Their optimal solutions in the asymptotic regime are obtained, which serve as low-complexity solutions suitable for practical implementation. Our simulation studies have demonstrated that the Gaussian input assumption significantly over-estimates the attainable RE tradeoff, especially when the signal set employed is small. Furthermore, it is observed through numerical simulations that the proposed optimal power allocation performs significantly better than the power allocation based on the Gaussian input assumption. Specifically, as much as 30% rate improvement is observed when employing the classic 4-QAM signal set.
Rakshith Rajashekar, Marco Di Renzo, Lie-Liang Yang, K. V. S. Hari, Lajos Hanzo
IEEE J. Sel. Areas Commun.1
2019 "Near-Perfect" Finite-Cardinality Generalized Space-Time Shift Keying
abstract
Two decades of full-diversity high-rate MIMO research has created perfect Space-Time Block Codes (STBCs), including the Golden code. However, the major stumbling block of their wide-spread employment is their limited energy-efficiency. On one hand, the superposition of their signals results in a high Peak-to-Average Power Ratio (PAPR). On the other hand, the total number of equivalent Inter-Antenna Interference (IAI) contributions that the receiver has to deal with is increased to IAI = M2upon using M Transmit Antennas (TAs), which is a substantial extra price compared to the IAI = M of V-BLAST. Against this background, we propose a new family of Finite-Cardinality Generalized Space-Time Shift Keying (FC-GSTSK). More explicitly, the proposed FC-GSTSK is capable of outperforming both V-BLAST and STBC, which is the ultimate objective of full-diversity high-rate MIMO design. Furthermore, following the index modulation philosophy, the proposed FC-GSTSK replaces the signal-additions by the data-carrying signal-selection process. As a benefit, the FC-GSTSK substantially reduces the PAPR of signal transmission. As a further advantage, the equivalent IAI imposed on signal detection is reduced back to the same level as that of the V-BLAST. Moreover, the proposed FC-GSTSK is even capable of consistently outperforming the perfect STBCs in terms of its Peak Signal to Noise-power Ratio (PSNR) that takes into account the power consumption at the transmitter. As a further advance, the reduced-RF-chain based version of FC-GSTSK is also capable of outperforming both Generalized Spatial Modulation (GSM) and Space-Time Block Coded Spatial Modulation (STBC-SM) without increasing the PAPR and the equivalent IAI.
Chao Xu 0005, Peichang Zhang, Rakshith Rajashekar, Naoki Ishikawa, Shinya Sugiura, Zhaocheng Wang 0001, Lajos Hanzo
IEEE J. Sel. Areas Commun.3
2019 Finite-Cardinality Single-RF Differential Space-Time Modulation for Improving the Diversity-Throughput Tradeoff
abstract
The matrix-based differential encoding invoked by Differential Space-Time Modulation (DSTM) typically results in an infinite-cardinality of arbitrary signals, despite the fact that the transmit antennas (TAs) can only radiate a limited number of patterns. As a remedy, the recently developed differential spatial modulation (DSM) is capable of avoiding this problem by conceiving a beneficial sparse signal matrix design, which also facilitates low-complexity single-RF signal transmission. Inspired by this development, the differential space-time block code using index shift keying (DSTBC-ISK) further introduces a beneficial diversity gain without compromising the DSM's appealingly low transceiver complexity. However, the DSTBC-ISK's performance advantage tends to diminish as the throughput increases, especially when an increased number of Receive Antennas (RAs) is used. By contrast, the classic Differential Group Code (DGC) that actively maximizes its diversity gain for different multiple-input-multiple-output (MIMO) system setups is capable of achieving a superior performance, but its detection complexity grows exponentially with the throughput. Against this background, we propose the differential space-time shift keying using Diagonal Algebraic Space-Time scheme, which is the first DSTM that is capable of achieving the DGC's superior diversity gain at high throughputs without compromising the DSM's low transceiver complexity. As a further advance, we also conceive a new differential space-time shift keying using Threaded Algebraic Space-Time arrangement, which is capable of achieving an even further improved diversity gain at a substantially reduced signal detection complexity compared to the best DGCs. Furthermore, in order to strike a practical tradeoff, we develop a generic multi-element and multi-level-ring Amplitude Phase Shift Keying design, and we also arrange for multiple reduced-size DSTM sub-blocks to be transmitted in a permuted manner, which exhibits an improved diversity-throughput tradeoff.
Chao Xu 0005, Peichang Zhang, Rakshith Rajashekar, Naoki Ishikawa, Shinya Sugiura, Li Wang 0024, Lajos Hanzo
IEEE Trans. Commun.3
2018 Differential Space-Time Coding Dispensing With Channel Estimation Approaches the Performance of Its Coherent Counterpart in the Open-Loop Massive MIMO-OFDM Downlink
abstract
In this paper, we propose a simple yet powerful mapping scheme that converts any conventional square-matrix-based differential space-time coding (DSTC) into a nonsquare-matrix-based DSTC. This allows DSTC schemes to be used practically in open-loop large-scale multiple-input multiple-output scenarios. Our proposed scheme may be viewed as the differential counterpart of coherent spatial modulation (SM), of the generalized SM, of Bell Laboratories layered space-time architecture, and of subcarrier-index modulation. The fundamental impediment of the existing DSTC schemes is the excessive complexity imposed by the unitary constraint. Specifically, the transmission rate of conventional DSTC schemes decays as the number of transmit antennas increases. Our proposed scheme eliminates this impediment and thus achieves a significantly higher transmission rate. We introduce four novel construction methods for the nonsquare codewords, some of which include an arbitrary number of nonzero elements in each codeword column. Our analysis shows that the proposed encoding technique reduces the complexity of both the inverse Fourier transform and the detection processes. Our proposed scheme is shown to approach the performance of its coherent counterpart for low-mobility scenarios, where the number of transmit antennas is increased up to 256.
Naoki Ishikawa, Rakshith Rajashekar, Chao Xu 0005, Shinya Sugiura, Lajos Hanzo
IEEE Trans. Commun.2
2018 A Beamforming-Aided Full-Diversity Scheme for Low-Altitude Air-to-Ground Communication Systems Operating With Limited Feedback
abstract
Unmanned aerial vehicles (UAVs) have gained a significant popularity in the recent past owing to their easy deployability and wide range of applications. In most of the short- and medium-range applications, Wi-Fi is used as the access technology for establishing communication between the ground stations and the UAVs. Although Wi-Fi is known to perform well in most of the scenarios, it is important to note that Wi-Fi has been mainly designed for indoor communication in rich scattering environments, whereas the air-to-ground (A2G) channel is characterized by sparse scattering. Considering this important difference in the channel characteristics, we revisit some of the Wi-Fi features and propose efficient design alternatives. First, we provide a statistical model for the sparse A2G channel and design an optimal time-domain quantizer (TDQ) for its feedback. In contrast to the frequency-domain quantizer (FDQ) of the IEEE 802.11n/ac Standard, the proposed TDQ exploits the time-domain sparsity in the channel and requires about 15 times lesser quantization bits than FDQ. Second, we propose a beamforming (BF) scheme with the aid of full-diversity rotation (FDR) matrices and analytically evaluate its symbol error probability in order to quantify the attainable diversity order. Our numerical simulations demonstrate that the proposed FDR-BF scheme outperforms the relevant benchmark schemes in both coded as well as uncoded scenarios. Specifically, the proposed FDR-BF scheme was observed to attain a signal-to-noise ratio gain as high as 6dB compared with the popular geometric mean decomposition-based BF scheme, when operating at an elevation angle of 7.5°.
Rakshith Rajashekar, Marco Di Renzo, K. V. S. Hari, Lajos Hanzo
IEEE Trans. Commun.1
2017 Algebraic Differential Spatial Modulation Is Capable of Approaching the Performance of Its Coherent Counterpart
abstract
We show that certain signal constellations invoked for classic differential encoding result in a phenomenon we term as the unbounded differential constellation size (UDCS). Various existing differential transmission schemes that suffer from this issue are identified. Then, we propose an enhanced algebraic field extension-based differential spatial modulation (AFE-DSM) scheme and its enhanced counterpart that strikes a diversityrate tradeoff (AFE-DSM-DR), both of which overcome the UDCS issue without compromising its full transmit diversity advantage. Furthermore, the proposed schemes are extended to incorporate amplitude and phase shift keying (APSK) in order to exploit all the available degrees of freedom. Additionally, we propose a pair of detection schemes specially designed for APSK-aided differential transmission schemes. Explicitly, we conceive the buffered minimum mean squared error (B-MMSE) detector and buffered maximum likelihood (B-ML) detector, which exploit the knowledge of previously detected symbols in order to further improve the detection performance. Our simulation results have shown that the proposed detectors are capable of bridging the performance gap between the conventional differential detector (CDD) and the coherent detector that has full channel state information. Specifically, when employing the proposed APSKaided AFE-DSM scheme operating at a rate of 2 b per channel use, the B-MMSE and B-ML detectors are observed to give about 3and 3.5-dB signal-to-noise ratio gain with respect to their CDD counterpart at a bit error ratio of 10-5.
Rakshith Rajashekar, Chao Xu 0005, Naoki Ishikawa, Shinya Sugiura, K. V. S. Hari, Lajos Hanzo
IEEE Trans. Commun.1
2017 Iterative Matrix Decomposition Aided Block Diagonalization for mm-Wave Multiuser MIMO Systems
abstract
Considering the dearth for spectrum in the congested microwave band, the next generation of cellular communication systems is envisaged to incorporate part of the millimeter wave (mm-wave) band. Hence, recently, there has been a significant interest in beamforming aided mm-wave systems. We consider a downlink multiuser mm-wave system employing a large number of antennas combined with fewer radio frequency chains both at the base station (BS) and at each of the user equipments (UEs). The BS and each of the UE are assumed to have a hybrid beamforming architecture, where a set of analog phase shifters is followed by digital precoding/combining blocks. In this paper, we propose an iterative matrix decomposition based hybrid beamforming (IMD-HBF) scheme for a single-user scenario, which accurately approximates the unconstrained beamforming solution, we show that the knowledge of the angle of departure (AoD) of the various channel paths is sufficient for the block diagonalization (BD) of the downlink mm-wave channel and hence for achieving interference free channels for each of the UEs, we propose a novel subspace projection based AoD aided BD (SP-AoD-BD) that achieves significantly better performance than the conventional BD, while still only requiring the knowledge of the AoD of various channel paths, and we use IMD-HBF in order to employ SP-AoD-BD in the hybrid beamforming architecture and study its performance with respect to the unconstrained system. We demonstrate using simulation results that the proposed IMD-HBF gives the same spectral efficiency as that of the unconstrained system in the single user scenario. Furthermore, we study the achievable sum rate of the users, when employing SP-AoD-BD with the aid of IMD-HBF and show that the loss in the performance with respect to the unconstrained system as well as the existing schemes is negligible, provided that the number of users is not excessive.
Rakshith Rajashekar, Lajos Hanzo
IEEE Trans. Wirel. Commun.1
2016 Hybrid Beamforming in mm-Wave MIMO Systems Having a Finite Input Alphabet
abstract
Recently, there has been significant research effort toward achieving high data rates in the millimeter wave bands by employing large antenna systems. These systems are considered to have only a fraction of the RF chains compared with the total number of antennas and employ analog phase shifters to steer the transmit and receive beams in addition to the conventional beamforming (BF)/combining invoked in the baseband domain. This scheme, which is popularly known as hybrid BF, has been extensively studied in the literature. To the best of our knowledge, all the existing schemes focus on obtaining the BF/combining matrices that maximize the system capacity computed using a Gaussian input alphabet. However, this choice of matrices may be suboptimal for practical systems, since they employ a finite input alphabet, such as quadrature amplitude modulation/phase-shift keying constellations. Hence, in this paper, we consider a hybrid BF/combining system operating with a finite input alphabet and optimize the analog as well as digital BF/combining matrices by maximizing the mutual information (MI). This is achieved by an iterative gradient ascent algorithm that exploits the relationship between the minimum mean-squared error and the MI. Furthermore, an iterative algorithm is proposed for designing a codebook for the analog and digital BF/combining matrices based on a vector quantization approach. Our simulation results demonstrate that the proposed gradient ascent algorithm achieves an ergodic rate improvement of up to 0.4 bits per channel use (bpcu) compared with the Gaussian input scenario. Furthermore, the gain in the ergodic rate achieved by employing the vector quantization-based codebook is about 0.5 bpcu compared with the Gaussian input scenario.
Rakshith Rajashekar, Lajos Hanzo
IEEE Trans. Commun.1
2015 Quantifying the Transmit Diversity Order of Euclidean Distance Based Antenna Selection in Spatial Modulation
abstract
In this letter, we quantify the transmit diversity order of the SM system operating in a closed-loop scenario. Specifically, the SM system relying on Euclidean distance based antenna subset selection (EDAS) is considered and the achievable diversity gain is evaluated. Furthermore, the resultant trade-off between the achievable diversity gain and switching gain is studied. Simulation results confirm our theoretical results. Specifically, switching gain is studied. Simulation results confirm our theoretical results. Specifically, at a symbol error rate of about 10-4the signal-to-noise ratio gain achieved by EDAS is about 7 dBat a symbol error rate of about 10-4the signal-to-noise ratio gain achieved by EDAS is about 7 dB in case of 16-QAM and about 5 dB in case of 64-QAM.
Rakshith Rajashekar, K. V. S. Hari, Lajos Hanzo
IEEE Signal Process. Lett.1
2014 Reduced-Complexity ML Detection and Capacity-Optimized Training for Spatial Modulation Systems
abstract
Spatial Modulation (SM) is a recently developed low-complexity Multiple-Input Multiple-Output scheme that jointly uses antenna indices and a conventional signal set to convey information. It has been shown that the Maximum-Likelihood (ML) detector of an SM system involves joint detection of the transmit antenna index and of the transmitted symbol, hence, the ML search complexity grows linearly with the number of transmit antennas and the size of the signal set. To circumvent the problem, we show that the ML search complexity of an SM system may be rendered independent of the constellation size, provided that the signal set employed is a square- or a rectangular-QAM. Furthermore, we derive bounds for the capacity of the SM system and derive the optimal power allocation between the data and the training sequences by maximizing the worst-case capacity bound of the SM system operating with imperfect channel state information. We show, with the aid of our simulation results, that the proposed detector is ML-optimal, despite its lowest complexity amongst the existing detectors. Furthermore, we show that employing the proposed optimal power allocation provides a substantial gain in terms of the SM system's capacity as well as signal-to-noise ratio compared to its equal-power-allocation counterpart. Finally, we compare the performance of the SM system to that of the conventional Multiple-Input Multiple-Output (MIMO) system and show that the SM system is capable of outperforming the conventional MIMO system by a significant margin, when both the systems are employing optimal power splitting.
Rakshith Rajashekar, K. V. S. Hari, Lajos Hanzo
IEEE Trans. Commun.1
2013 Structured dispersion matrices from division algebra codes for space-time shift keying
abstract
We propose a novel method of constructing Dispersion Matrices (DM) for Coherent Space-Time Shift Keying (CSTSK) relying on arbitrary PSK signal sets by exploiting codes from division algebras. We show that classic codes from Cyclic Division Algebras (CDA) may be interpreted as DMs conceived for PSK signal sets. Hence various benefits of CDA codes such as their ability to achieve full diversity are inherited by CSTSK. We demonstrate that the proposed CDA based DMs are capable of achieving a lower symbol error ratio than the existing DMs generated using the capacity as their optimization objective function for both perfect and imperfect channel estimation.
Rakshith Rajashekar, K. V. S. Hari, Lajos Hanzo
IEEE Signal Process. Lett.1
2013 A Reduced-Complexity Partial-Interference-Cancellation Group Decoder for STBCs
abstract
In this letter, we propose a reduced-complexity implementation of partial interference cancellation group decoder with successive interference cancellation (PIC-GD-SIC) by employing the theory of displacement structures. The proposed algorithm exploits the block-Toeplitz structure of the effective matrix and chooses an ordering of the groups such that the zero-forcing matrices associated with the various groups are obtained through Schur recursions without any approximations. We show using an example that the proposed implementation offers a significantly reduced computational complexity compared to the direct approach without any loss in performance.
Rakshith Rajashekar, K. V. S. Hari, Lajos Hanzo
IEEE Signal Process. Lett.1
2013 Spatial Modulation Aided Zero-Padded Single Carrier Transmission for Dispersive Channels
abstract
In this paper, we consider spatial modulation (SM) operating in a frequency-selective single-carrier (SC) communication scenario and propose zero-padding instead of the cyclic-prefix considered in the existing literature. We show that the zero-padded single-carrier (ZP-SC) SM system offers full multipath diversity under maximum-likelihood (ML) detection, unlike the cyclic-prefix based SM system. Furthermore, we show that the order of ML detection complexity in our proposed ZP-SC SM system is independent of the frame length and depends only on the number of multipath links between the transmitter and the receiver. Thus, we show that the zero-padding applied in the SC SM system has two advantages over the cyclic prefix: 1) achieves full multipath diversity, and 2) imposes a relatively low ML detection complexity. Furthermore, we extend the partial interference cancellation receiver (PIC-R) proposed by Guo and Xia for the detection of space-time block codes (STBCs) in order to convert the ZP-SC system into a set of narrowband subsystems experiencing flat-fading. We show that full rank STBC transmissions over these subsystems achieves full transmit, receive as well as multipath diversity for the PIC-R. Furthermore, we show that the ZP-SC SM system achieves receive and multipath diversity for the PIC-R at a detection complexity order which is the same as that of the SM system in flat-fading scenario. Our simulation results demonstrate that the symbol error ratio performance of the proposed linear receiver for the ZP-SC SM system is significantly better than that of the SM in cyclic prefix based orthogonal frequency division multiplexing as well as of the SM in the cyclic-prefixed and zero-padded single carrier systems relying on zero-forcing/minimum mean-squared error equalizer based receivers.
Rakshith Rajashekar, K. V. S. Hari, Lajos Hanzo
IEEE Trans. Commun.1
2011 Field Extension Code Based Dispersion Matrices for Coherently Detected Space-Time Shift Keying
abstract
Motivated by the recent Coherent Space-Time Shift Keying (CSTSK) philosophy, we construct new dispersion matrices for rotationally invariant PSK signaling sets. Given a specific PSK signal constellation, the dispersion matrices of the existing CSTSK scheme were chosen by maximizing the mutual information over randomly generated sets of dispersion matrices. In this contribution we propose a general method for constructing a set of structured dispersion matrices for arbitrary PSK signaling sets using Field Extension (FE) codes and then study the attainable Symbol Error Rate (SER) performance of some example constructions. We demonstrate that the proposed dispersion scheme is capable of outperforming the existing dispersion arrangement at medium to high SNRs.
Rakshith Rajashekar, K. V. S. Hari, Lajos Hanzo
GLOBECOM1