3 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.IT2007★ 1 cited
Space-time codes with controllable ML decoding complexity for any number of transmit antennas
Naresh Sharma, Pavan R. Pinnamraju, Constantinos B. Papadias
We construct a class of linear space-time block codes for any number of transmit antennas that have controllable ML decoding complexity with a maximum rate of 1 symbol per channel…
cs.IT2006★ 3 cited
Is the cyclic prefix necessary?
Naresh Sharma, Ashok Armen Tikku
We show that one can do away with the cyclic prefix (CP) for SC-FDE and OFDM at the cost of a moderate increase in the complexity of a DFT-based receiver. Such an approach effectiv…