Garimella Rama Murthy
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Garimella Rama Murthy has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Chandan Pradhan
Signal Processing and Communication Research Center, International Institute of Information Technology, Hyderabad, India
4 shared publications Deepti Singhal
International Institute of Information Technology 500 032 Hyderabad India
2 shared publications- Kunal Sankhe
Signal Processing and Communication Research Center International Institute of Information Technology Hyderabad India
2 shared publications - Moncef Gabbouj
Faculty of Information Technology and Communication Sciences, Tampere University, Tampere, Finland
2 shared publications - Sumit Kumar
Signal Processing and Communication Research Center International Institute of Information Technology Hyderabad India
2 shared publications - Vasanth Iyer
Troy Univ. (United States)
2 shared publications
Latest Publications
- 18 May 2017
- Published by Springer Nature
- p. 351-361
Dynamics of Quaternionic Hopfield Type Neural Networks
- 18 May 2017
- Published by Springer Nature
- p. 351-361
Dynamics of Quaternionic Hopfield Type Neural Networks
- 18 May 2017
- Published by Springer Nature
- p. 327-338
Optimal Spherical Separability: Artificial Neural Networks
- 18 May 2017
- Published by Springer Nature
- p. 327-338
Optimal Spherical Separability: Artificial Neural Networks
- Open Access
Time Optimal Spectrum Sensing
Spectrum sensing is a fundamental operation in cognitive radio environment. It gives information about spectrum availability by scanning the bands. Usually a fixed amount of time is given to scan individual bands. Most of the times, historical information about the traffic in the spectrum bands is not used. But this information gives the idea, how busy a specific band is. Therefore, instead of scanning a band for a fixed amount of time, more time can be given to less occupied bands and less time to heavily occupied ones. In this paper we have formulated the time assignment problem as integer linear programming and source coding problems. The time assignment problem is solved using the associated stochastic optimization problem.
Open AccessTime Optimal Spectrum Sensing
Spectrum sensing is a fundamental operation in cognitive radio environment. It gives information about spectrum availability by scanning the bands. Usually a fixed amount of time is given to scan individual bands. Most of the times, historical information about the traffic in the spectrum bands is not used. But this information gives the idea, how busy a specific band is. Therefore, instead of scanning a band for a fixed amount of time, more time can be given to less occupied bands and less time to heavily occupied ones. In this paper we have formulated the time assignment problem as integer linear programming and source coding problems. The time assignment problem is solved using the associated stochastic optimization problem.
- 1 June 2016
- Published by Elsevier in Physical Communication
- Vol. 19, 61-69
Full-duplex communication for future wireless networks: Dynamic resource block allocation approach
- 1 June 2016
- Published by Elsevier in Physical Communication
- Vol. 19, 61-69
Full-duplex communication for future wireless networks: Dynamic resource block allocation approach
- Open Access
Spatial Modulation- Spatial Multiplexing in Massive MIMO
Massive MIMO, a candidate for 5G technology, promises significant gains in wireless data rates and link reliability by using large numbers of antennas (more than 64) at the base transceiver station (BTS). Extra antennas help by focusing the transmission and reception of signal energy into ever-smaller regions of space. This brings huge improvements in throughput. However, it requires a large number of Radio Frequency (RF) chains (usually equal to number of transmit antennas), which is a major drawback. One approach to overcome these issues is to use Spatial Modulation (SM). In SM, an index of transmit antenna is used as an additional source of information to improve the overall spectral efficiency. In particular, a group of any number of information bits is mapped into two constellations: a signal constellation based on modulation scheme and a spatial constellation to encode the index of the transmit antenna. However, a low spectral efficiency is main drawback of SM. Therefore, a combination of SM with Spatial Multiplexing is an effective way to increase spectral efficiency with limited number of RF chains.
Open AccessSpatial Modulation- Spatial Multiplexing in Massive MIMO
Massive MIMO, a candidate for 5G technology, promises significant gains in wireless data rates and link reliability by using large numbers of antennas (more than 64) at the base transceiver station (BTS). Extra antennas help by focusing the transmission and reception of signal energy into ever-smaller regions of space. This brings huge improvements in throughput. However, it requires a large number of Radio Frequency (RF) chains (usually equal to number of transmit antennas), which is a major drawback. One approach to overcome these issues is to use Spatial Modulation (SM). In SM, an index of transmit antenna is used as an additional source of information to improve the overall spectral efficiency. In particular, a group of any number of information bits is mapped into two constellations: a signal constellation based on modulation scheme and a spatial constellation to encode the index of the transmit antenna. However, a low spectral efficiency is main drawback of SM. Therefore, a combination of SM with Spatial Multiplexing is an effective way to increase spectral efficiency with limited number of RF chains.
- 9 December 2015
- Published by Springer Nature
- p. 356-364
Convolutional Associative Memory: FIR Filter Model of Synapse
- 9 December 2015
- Published by Springer Nature
- p. 356-364
Convolutional Associative Memory: FIR Filter Model of Synapse
- Open Access
Analysis of Path Loss mitigation through Dynamic Spectrum Access: Software Defined Radio
In this paper, an analysis is carried out for a method to mitigate the path loss through the dynamic spectrum access (DSA) method. The path loss is a major component which determines the QoS of a wireless link. Its effect is complemented by the presence of obstruction between the transmitter and receiver. The future cellular network (5G) focuses on operating with the millimeter-wave (mmW). In higher frequency, path loss can play a significant role in degrading the link quality due to higher attenuation. In a scenario, where the operating environment is changing dynamically, sudden degradation of operating conditions or arrival of obstruction between transmitter and receiver may result in link failure. The method analyzed here includes dynamically allocating spectrum at a lower frequency band for a link suffering from high path loss. For the analysis, a wireless link was set up using Universal Software Radio Peripherals (USRPs). The received power is observed to increase by dynamically changing the operating frequency from 1.9 GHz to 830 MHz. Finally the utility of software defined radio (SDR) in the RF front end, to combat the path loss in the future cellular networks, is studied.
Open AccessAnalysis of Path Loss mitigation through Dynamic Spectrum Access: Software Defined Radio
In this paper, an analysis is carried out for a method to mitigate the path loss through the dynamic spectrum access (DSA) method. The path loss is a major component which determines the QoS of a wireless link. Its effect is complemented by the presence of obstruction between the transmitter and receiver. The future cellular network (5G) focuses on operating with the millimeter-wave (mmW). In higher frequency, path loss can play a significant role in degrading the link quality due to higher attenuation. In a scenario, where the operating environment is changing dynamically, sudden degradation of operating conditions or arrival of obstruction between transmitter and receiver may result in link failure. The method analyzed here includes dynamically allocating spectrum at a lower frequency band for a link suffering from high path loss. For the analysis, a wireless link was set up using Universal Software Radio Peripherals (USRPs). The received power is observed to increase by dynamically changing the operating frequency from 1.9 GHz to 830 MHz. Finally the utility of software defined radio (SDR) in the RF front end, to combat the path loss in the future cellular networks, is studied.
- Open Access
Full-Duplex Transceiver for Future Cellular Network: A Smart Antenna Approach
In this paper, we propose a transceiver architecture for full-duplex (FD) eNodeB (eNB) and FD user equipment (UE) transceiver. For FD communication,.i.e., simultaneous in-band uplink and downlink operation, same subcarriers can be allocated to UE in both uplink and downlink. Hence, contrary to traditional LTE, we propose using single-carrier frequency division multiple accesses (SC-FDMA) for downlink along with the conventional method of using it for uplink. The use of multiple antennas at eNB and singular value decomposition (SVD) in the downlink allows multiple users (MU) to operate on the same set of ubcarriers. In the uplink, successive interference cancellation with optimal ordering (SSIC-OO) algorithm is used to decouple signals of UEs operating in the same set of subcarriers. A smart antenna approach is adopted which prevents interference, in downlink of a UE, from uplink signals of other UEs sharing same subcarriers. The approach includes using multiple antennas at UEs to form directed beams towards eNode and nulls towards other UEs. The proposed architecture results in significant improvement of the overall spectrum efficiency per cell of the cellular network.
Open AccessFull-Duplex Transceiver for Future Cellular Network: A Smart Antenna Approach
In this paper, we propose a transceiver architecture for full-duplex (FD) eNodeB (eNB) and FD user equipment (UE) transceiver. For FD communication,.i.e., simultaneous in-band uplink and downlink operation, same subcarriers can be allocated to UE in both uplink and downlink. Hence, contrary to traditional LTE, we propose using single-carrier frequency division multiple accesses (SC-FDMA) for downlink along with the conventional method of using it for uplink. The use of multiple antennas at eNB and singular value decomposition (SVD) in the downlink allows multiple users (MU) to operate on the same set of ubcarriers. In the uplink, successive interference cancellation with optimal ordering (SSIC-OO) algorithm is used to decouple signals of UEs operating in the same set of subcarriers. A smart antenna approach is adopted which prevents interference, in downlink of a UE, from uplink signals of other UEs sharing same subcarriers. The approach includes using multiple antennas at UEs to form directed beams towards eNode and nulls towards other UEs. The proposed architecture results in significant improvement of the overall spectrum efficiency per cell of the cellular network.
- 6 June 2015
- Published by Springer Nature
- p. 356-369
Existence and Synthesis of Complex Hopfield Type Associative Memories
- 6 June 2015
- Published by Springer Nature
- p. 356-369
Existence and Synthesis of Complex Hopfield Type Associative Memories
- Open Access
Machine Learning Based Cooperative Relay Selection in Virtual MIMO
In cellular systems, virtual multiple-input multiple-output (V-MIMO) technology promises to achieve performance gains comparable to conventional MIMO. In this paper, we propose cooperative relay selection algorithm based on machine learning techniques. Willingness of user to cooperate in V-MIMO depends on his current battery power, time and day along with incentives offered by service provider. Every user has different criterion to participate in V-MIMO, but allows a specific behavior pattern. Therefore, it is required to predict willing users in the neighborhood of source user (SU), before selecting users as cooperative nodes. Only inactive users belonging to Virtual Antenna Array (VAA) cell of SU are assumed to cooperate. This reduces control overheads in cooperative node discovery. In this paper, we employ prediction algorithm using two machine learning techniques i.e. ANN and SVM to find out inactive willing users within VAA cell. The parameters such as MSE, accuracy, precision and recall are calculated to evaluate performance of ANN and SVM model. Prediction using ANN has MSE of 3% with average accuracy of 97% (variance 0.37), whereas SVM has MSE of 2.58% with average accuracy of 97.56% (variance 0.17). We also observe that proposed prediction method reduces the node discovery time by approximately 29%.
Open AccessMachine Learning Based Cooperative Relay Selection in Virtual MIMO
In cellular systems, virtual multiple-input multiple-output (V-MIMO) technology promises to achieve performance gains comparable to conventional MIMO. In this paper, we propose cooperative relay selection algorithm based on machine learning techniques. Willingness of user to cooperate in V-MIMO depends on his current battery power, time and day along with incentives offered by service provider. Every user has different criterion to participate in V-MIMO, but allows a specific behavior pattern. Therefore, it is required to predict willing users in the neighborhood of source user (SU), before selecting users as cooperative nodes. Only inactive users belonging to Virtual Antenna Array (VAA) cell of SU are assumed to cooperate. This reduces control overheads in cooperative node discovery. In this paper, we employ prediction algorithm using two machine learning techniques i.e. ANN and SVM to find out inactive willing users within VAA cell. The parameters such as MSE, accuracy, precision and recall are calculated to evaluate performance of ANN and SVM model. Prediction using ANN has MSE of 3% with average accuracy of 97% (variance 0.37), whereas SVM has MSE of 2.58% with average accuracy of 97.56% (variance 0.17). We also observe that proposed prediction method reduces the node discovery time by approximately 29%.