• Publications
  • Influence
An Unconstrained Likelihood Ascent Based Detection Algorithm for Large MIMO Systems
  • A. Sah, A. Chaturvedi
  • Mathematics, Computer Science
  • IEEE Transactions on Wireless Communications
  • 1 April 2017
Neighborhood search algorithms have been proposed for detection in large multiple-input multiple-output systems. They iteratively search for the best vector in a fixed neighborhood. A better wayExpand
  • 18
  • 1
  • PDF
Sequential and Global Likelihood Ascent Search-Based Detection in Large MIMO Systems
TLDR
Neighborhood search algorithms have been proposed for low complexity detection in large/massive multiple-input multiple-output systems. Expand
  • 8
  • 1
  • PDF
Quasi-Orthogonal Combining for Reducing RF Chains in Massive MIMO Systems
TLDR
We address the issue of reducing the number of radio frequency (RF) chains in large/massive multiple input multiple output systems while retaining their detection performance. Expand
  • 6
  • 1
  • PDF
An upper bound on the performance of K-best detection for MIMO systems
  • A. Sah, A. Chaturvedi
  • Mathematics
  • International Conference on Signal Processing and…
  • 22 July 2014
K-best detection is known to be a useful breadth first tree search detection technique for multiple input multiple output (MIMO) systems. In the process of the tree search a number of possibleExpand
  • 2
  • 1
  • PDF
Bit-Level Reduced Neighborhood Search for Low-Complexity Detection in Large MIMO Systems
TLDR
We propose a bit-level metric design which significantly reduces the detection complexity in a multiple-input multiple-output (MIMO) system equipped with a large number of antennas. Expand
  • 4
  • PDF
An MMP-Based Approach for Detection in Large MIMO Systems Using Sphere Decoding
  • A. Sah, A. Chaturvedi
  • Mathematics, Computer Science
  • IEEE Wireless Communications Letters
  • 1 April 2017
TLDR
We present an MMP based approach for using sphere decoding over the dimensions which are erroneously detected by a linear detector. Expand
  • 20
  • PDF
Reduced Neighborhood Search Algorithms for Low Complexity Detection in MIMO Systems
TLDR
Neighborhood search algorithms such as likelihood ascent search (LAS) and reactive tabu search (RTS) have been proposed for low complexity detection in multiple-input multiple-output systems having a large number of antennas. Expand
  • 11
Stopping Rule-Based Iterative Tree Search for Low-Complexity Detection in MIMO Systems
TLDR
Breadth first tree search (BFTS) algorithms are known to provide a close to maximum likelihood (quasi-ML) solution at a low-complexity if the received sequence is detected in the right order. Expand
  • 2
  • PDF
Likelihood-Based Tree Search for Low Complexity Detection in Large MIMO Systems
TLDR
A recently reported result on large/massive multiple-input multiple-output (MIMO) detection shows the utility of the branch and bound (BB)-based tree search approach for this problem, that too at a lower computational complexity. Expand
  • 8
  • PDF
New Block-Based Spatial Modulation
TLDR
We introduce a new block-based SM (BSM) scheme wherein transmit vectors can have different number of active antennas, with the constraint that the total number the active antennas over a transmission block is fixed. Expand
  • 5
  • PDF
...
1
2
3
...