Faculty Publications
Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736
Publications by NITK Faculty
Browse
8 results
Search Results
Item Redesigned Spatial Modulation for Spatially Correlated Fading Channels(Springer New York LLC barbara.b.bertram@gsk.com, 2017) G.D., G.S.; Koila, K.; Neha, N.; Raghavendra, R.; Sripati, U.In this paper, a new variant of Spatial Modulation (SM) Multiple-Input Multiple-Output (MIMO) transmission technique, designated as Redesigned Spatial Modulation (ReSM) has been proposed. In ReSM scheme, a dynamic mapping for antenna selection is adopted. This scheme employs both single antenna as well as double antenna combinations depending upon channel conditions to combat the effect of spatial correlation. When evaluated over spatially correlated channel conditions, for a fixed spectral efficiency and number of transmit antennas, ReSM exhibits performance improvement of at least 3 dB over all the conventional SM schemes including Trellis Coded Spatial Modulation (TCSM) scheme. Furthermore, a closed form expression for the upper bound on Pairwise Error Probability (PEP) for ReSM has been derived. This has been used to calculate the upper bound for the Average Bit Error Probability (ABEP) for spatially correlated channels. The results of Monte Carlo simulations are in good agreement with the predictions made by analytical results. The relative gains of all the comparison plots in the paper are specified at an ABER of 10?4. © 2017, Springer Science+Business Media, LLC.Item A comprehensive framework for Double Spatial Modulation under imperfect channel state information(Elsevier B.V., 2017) G.D., G.S.; Koila, K.; Raghavendra, R.; Shripathi Acharya, U.The essential requirement for a 5G wireless communication system is the realization of energy efficient as well as spectrally efficient modulation schemes. Double Spatial Modulation (DSM) is a recently proposed high rate Index Modulation (IM) scheme, designed for use in Multiple Input Multiple Output (MIMO) wireless systems. The aim of this scheme is to increase the spectral efficiency of conventional Spatial Modulation (SM) systems while keeping the energy efficiency intact. In this paper, the impact of imperfect channel knowledge on the performance of DSM system under Rayleigh, Rician and Nakagami-m fading channels has been quantified. Later, a modified low complexity decoder for the DSM scheme has been designed using ordered block minimum mean square error (OB-MMSE) criterion. Its performance under varied fading environments have been quantified via Monte Carlo simulations. Finally, a closed form expression for the pairwise error probability (PEP) for a DSM scheme under conditions of perfect and imperfect channel state information has been derived. This is employed to calculate the upper bound on the average bit error probability (ABEP) over aforementioned fading channels. It is observed that, under perfect and imperfect channel conditions DSM outperforms all the other variants of SM by at least 2dB at an average bit error ratio (ABER) of 10?5. Tightness of the derived upper bound is illustrated by Monte Carlo simulation results. © 2017 Elsevier B.V.Item Signal constellations employing multiplicative groups of Gaussian and Eisenstein integers for Enhanced Spatial Modulation(Elsevier B.V., 2017) G.D., G.S.; Raghavendra, R.; Koila, K.; Shripathi Acharya, U.In this paper, we propose two new signal constellation designs employing Gaussian and Eisenstein Integers for Enhanced Spatial Modulation (ESM). ESM is a novel technique which was propounded by Cheng et al. The advantage of ESM over other Spatial Modulation (SM) schemes lies in its ability to enhance spectral efficiency while keeping the energy efficiency intact. This is done by activating either one or two antennas judiciously depending upon the required trade-off. In ESM, information radiated from the antennas depends upon index of the active transmit antenna combination(s) and also on the set of constellation points chosen, which may include points from multiple constellations. In this paper, we propose signal constellations based on multiplicative groups of Gaussian and Eisenstein integers. The set comprising of Gaussian and Eisenstein integers serves as primary and secondary constellation points for Gaussian Enhanced Spatial Modulation (GESM) scheme. The secondary constellation points are deduced from a single geometric interpolation from the primary constellation points. The Monte Carlo simulation results indicate that the proposed nonuniform constellations achieve impressive SNR gains compared to conventional constellation points used in the design of ESM. This new design has been described for MIMO employing 4 × 4 and 8 × 8 antenna configurations with only two active antennas. Furthermore, a closed form expression for the pairwise error probability (PEP) for the GESM scheme has been deduced. The PEP is utilized to determine the upper bound on the average bit error probability (ABEP). Our simulations indicate that the proposed GESM from Gaussian and Eisenstein integers scheme outperforms all the other variants of SM including conventional ESM by at least 2.5 dB at an average bit error ratio (ABER) of 10?5. Close correspondence between the theoretical analysis and the Monte Carlo simulation results are observed. © 2017 Elsevier B.V.Item Non-orthogonal space–frequency block codes from cyclic codes for wireless systems employing MIMO-OFDM with index modulation(Elsevier B.V., 2019) Raghavendra, R.; Shripathi Acharya, U.S.Space–frequency codes (SFC) having error correcting structure can be used to enhance the bit error rate (BER) performance of modern wireless systems (5G and beyond) employing multiple-input multiple-output (MIMO) and multi-carrier communication. In this work, the construction of non-orthogonal space–frequency block codes (NSFBC) from (n,k) cyclic codes has been proposed. In which, n represents the number of symbols in the codeword and k represents the number of symbols in the information sequence. The performance of proposed codes has been evaluated in MIMO systems employing orthogonal frequency division multiplexing and index modulation (MIMO-OFDM-IM). We initially obtained (n,k) full rank cyclic codes for any 1 q m . Further, NSFBCs are obtained from full rank codes using Rank preserving maps. In a 2 × 2 system and a 10-path MIMO channel, the proposed full rank NSFBC with rank-preserving IM mapping (FR-NSFBC-IM), over F 5 2 , provides he similar BER performance when compared to MIMO-OFDM-IM system with Rate-1 Alamouti code and QPSK. Moreover, it provides an improvement in spectral efficiency of about 0.9 b/s/Hz. When compared to the MIMO-OFDM-IM with BPSK, FR-NSFBC-IM codes over F 5 2 provide an asymptotic SNR gain of about 1 dB and also the spectral efficiency has been improved by about 0.6 b/s/Hz. In the 4 × 4 scenario, full rank NSFBCs over F 5 4 with rank deficient IM mapping (RD-NSFBC-IM) provide an improvement in spectral efficiency of about 1.3 b/s/Hz. However, BER performance is similar to that of MIMO-OFDM-IM with BPSK. © 2019Item Spatially Modulated Non Orthogonal Space Time Block Code: Construction and design from cyclic codes over Galois Field(Elsevier B.V., 2019) Godkhindi Shrutkirthi, G.S.; G.D., G.S.; Shripathi Acharya, U.S.A new class of non-binary Spatially Modulated Non-orthogonal Space Time Block Code designs (SM-NSTBC) has been proposed. These designs employ full rank, length n,(n|qm?1,m?n) cyclic codes defined over GF(qm). The underlying cyclic code constructions have the property that the codewords when viewed as m×n matrices over GF(q) have rank equal to m (Full rank). These codes are punctured to yield m×m full rank matrices over GF(q). Rank preserving transformations are used to map the codewords of full rank codes over a finite field to full rank Space Time Block Codes. The proposed scheme can be generalized to handle any number of transmit antenna greater than two. Due to the characteristics of Full rank cyclic codes employed, a coding gain of approximately 1.5 dB to 5 dB is obtained over conventional STBC-SM and SM-OSTBC schemes. This is demonstrated for spectral efficiencies of 4, 5, 7 and 8 bpcu. Analytical as well as Monte-Carlo simulations show that proposed SM-NSTBC outperforms STBC-SM and its variants. The upper bound on average bit error rate has been derived and the computation complexity for ML detection has been estimated. © 2019Item Index modulation aided multi carrier power line communication employing rank codes from cyclic codes(Elsevier B.V., 2020) Raghavendra, M.A.N.S.; Shripathi Acharya, U.In a multi-carrier power line communication (mPLC) with dominant Narrowband and Impulse noise, crisscross errors can be clearly observed. In this work, mPLC employing Rank codes with Index modulation (mPLC-IM) has been considered to provide a reliable high data rate communication over the powerline channel. The rank codes required for this implementation have been derived from cyclic codes over GF(qm) viewed as m×n matrices over GF(q). Encoding has been performed by employing the Galois Field Fourier Transform (GFFT) domain description of cyclic codes. This scheme is able to correct a variety of crisscross errors in mPLC-IM The GFFT approach provides an additional degree of freedom that is offered by choice of free transform component indices. It can be used to design an index key scheme which can enhance the physical layer security of an mPLC system. In the absence of knowledge of the index key, it is observed that the probability of error reaches an error floor of ?10?2, highlighting the need for index key for appropriate decoding. Further, a novel check matrix construction is proposed and used in devising a decoding strategy. It is observed that the proposed decoder is capable of correcting any errors of rank ??m?12?. In mPLC-IM with OFDM, the proposed codes over GF(24) provide an asymptotic gain of approximately 3 dB when compared to the uncoded system. For mPLC-IM with multi-tone Frequency Shift Keying (FSK), the proposed RC over GF(24) provides a 25% improvement in symbol error rate (SER) at lower values of p (probability of occurrence of narrowband noise) when compared to Reed-Solomon (RS) based Constant Weight (CW) CW(13,6,5)2?RS[15,14,2]16 codes. Further, a SER improvement of around 30% is achieved using rank codes (RCs) over GF(28) when compared with CW(9,4,4)2?RS[15,14,2]16. In the presence of dominant background noise, the BER graphs show that the proposed codes are equivalent (slightly superior) in performance as that of Low Rank Parity Check (LRPC)/Gabidulin based designs. In the presence of dominant impulse noise, the proposed system is providing significant gain when compared with the Linearly Pre-coded Orthogonal Frequency Division Multiplexing (LP-OFDM) system and LRPC based scheme. Additionally, simulation results show that, in the absence of an index key, the probability of error reaches the error floor, highlighting the need for index key for appropriate decoding. This can be viewed as the code capable of providing an additional layer of security. © 2019 Elsevier B.V.Item Generalized designs for precoded receive spatial modulation derived from non-orthogonal space time block codes(Springer, 2022) Shashikant, S.G.; G.D., G.D.G.; Shripathi Acharya, U.S.In this paper, a new MIMO scheme termed as precoded Spatially Modulated Non-orthogonal Space Time Block Code (precoded SM-NSTBC) is proposed. The primary concept of precoded SM-NSTBC is to activate a subset of receive antennas in a pre-defined manner and choose specific activated patterns to represent information symbols. We have synthesized schemes derived from full rank Cyclic codes defined over Galois field Rank preserving transformations are used to map the full rank codewords over a finite field to full rank Space Time Block Codes. Due to the characteristics of full rank Cyclic codes employed, a performance improvement of approximately 2 dB to 7 dB is observed. This advantage is realized when the performance of these schemes is compared with precoded SM-OSTBC and precoded STBC-SM. The improvement due to the coding gain is observed in both uncorrelated as well as correlated Rayleigh fading environments. An upper bound on the average bit error rate (ABER) is derived. Close correspondence between Monte-Carlo simulations and analytic values are observed. © 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.Item On the Design of SSRS and RS Codes for Enhancing the Integrity of Information Storage in NAND Flash Memories(Institute of Electrical and Electronics Engineers Inc., 2023) Achala, G.; Shripathi Acharya, U.S.; Srihari, P.The revolution in the field of information processing systems has created a huge demand for reliable and enhanced data storage capabilities. This demand is being met by advances in channel coding algorithms along with upward scaling of the capacities of hardware devices. NAND Flash memory is a type of non-volatile memory. Scaling of the size of flash memories from Single Level Cell (SLC) devices to Multilevel cell (MLC) devices has increased the storage capacity. However, these multi-bit per cell architectures are characterized by significantly higher Raw Bit Error Rate (RBER) values when compared with SLC architectures. The requirement of low Undetected Bit Error Rate (UBER) values has motivated us to synthesize powerful channel codes for enhancing the integrity of information Storage in multi-level NAND Flash Memory devices. This paper describes the synthesis of novel Subfield Subcodes of Reed Solomon Codes (SSRS) and Reed-Solomon (RS) codes which are matched to multi-bit per cell architectures. UBER values have been calculated for each of the synthesized codes described in this paper. This allows the determination of the performance and the improvement in data storage integrity brought by using these codes. We have shown that the synthesized SSRS and RS codes can provide very low UBER even when the corresponding RBER values are appreciable. As RS codes permit the detection and correction of a greater number of errors for a given code length, their performance is superior to that of SSRS codes. This improved performance is obtained at the cost of greater complexity of encoding and decoding processes. © 2013 IEEE.