Search Results - "Narayanan, Krishna R."

Refine Results
  1. 1

    Polar Coding and Random Spreading for Unsourced Multiple Access by Pradhan, Asit Kumar, Amalladinne, Vamsi K., Narayanan, Krishna R., Chamberland, Jean-Francois

    “…This article presents a novel transmission scheme for the unsourced, uncoordinated Gaussian multiple access problem. The proposed scheme leverages notions from…”
    Get full text
    Conference Proceeding
  2. 2

    An Enhanced Decoding Algorithm for Coded Compressed Sensing with Applications to Unsourced Random Access by Amalladinne, Vamsi K, Ebert, Jamison R, Chamberland, Jean-Francois, Narayanan, Krishna R

    Published in Sensors (Basel, Switzerland) (01-01-2022)
    “…Unsourced random access (URA) has emerged as a pragmatic framework for next-generation distributed sensor networks. Within URA, concatenated coding structures…”
    Get full text
    Journal Article
  3. 3

    A Coded Compressed Sensing Scheme for Unsourced Multiple Access by Amalladinne, Vamsi K., Chamberland, Jean-Francois, Narayanan, Krishna R.

    Published in IEEE transactions on information theory (01-10-2020)
    “…This article introduces a novel scheme, termed coded compressed sensing, for unsourced multiple-access communication. The proposed divide-and-conquer approach…”
    Get full text
    Journal Article
  4. 4

    A User-Independent Successive Interference Cancellation Based Coding Scheme for the Unsourced Random Access Gaussian Channel by Vem, Avinash, Narayanan, Krishna R., Chamberland, Jean-Francois, Cheng, Jun

    Published in IEEE transactions on communications (01-12-2019)
    “…This work introduces a novel coding paradigm for the unsourced multiple access channel model. The envisioned framework builds on a select few key components…”
    Get full text
    Journal Article
  5. 5

    Random Forests Are Able to Identify Differences in Clotting Dynamics from Kinetic Models of Thrombin Generation by Arumugam, Jayavel, Bukkapatnam, Satish T S, Narayanan, Krishna R, Srinivasa, Arun R

    Published in PloS one (12-05-2016)
    “…Current methods for distinguishing acute coronary syndromes such as heart attack from stable coronary artery disease, based on the kinetics of thrombin…”
    Get full text
    Journal Article
  6. 6

    Unsourced Random Access With Coded Compressed Sensing: Integrating AMP and Belief Propagation by Amalladinne, Vamsi K., Pradhan, Asit Kumar, Rush, Cynthia, Chamberland, Jean-Francois, Narayanan, Krishna R.

    Published in IEEE transactions on information theory (01-04-2022)
    “…Sparse regression codes with approximate message passing (AMP) decoding have gained much attention in recent times. The concepts underlying this coding scheme…”
    Get full text
    Journal Article
  7. 7

    An MSE-Based Transfer Chart for Analyzing Iterative Decoding Schemes Using a Gaussian Approximation by Bhattad, K., Narayanan, K.R.

    Published in IEEE transactions on information theory (01-01-2007)
    “…An alternative to extrinsic information transfer (EXIT) charts called mean-square error (MSE) charts that use a measure related to the MSE instead of mutual…”
    Get full text
    Journal Article
  8. 8

    FASURA: A Scheme for Quasi-Static Fading Unsourced Random Access Channels by Gkagkos, Michail, Narayanan, Krishna R., Chamberland, Jean-Francois, Georghiades, Costas N.

    Published in IEEE transactions on communications (01-11-2023)
    “…Unsourced random access emerged as a novel wireless paradigm enabling massive device connectivity on the uplink. We consider quasi-static Rayleigh fading…”
    Get full text
    Journal Article
  9. 9

    Sparse IDMA: A Joint Graph-Based Coding Scheme for Unsourced Random Access by Pradhan, Asit Kumar, Amalladinne, Vamsi K., Vem, Avinash, Narayanan, Krishna R., Chamberland, Jean-Francois

    Published in IEEE transactions on communications (01-11-2022)
    “…This article introduces a novel communication paradigm for the unsourced, uncoordinated Gaussian multiple access problem. The major components of the…”
    Get full text
    Journal Article
  10. 10

    Approaching Capacity at High Rates With Iterative Hard-Decision Decoding by Yung-Yih Jian, Pfister, Henry D., Narayanan, Krishna R.

    Published in IEEE transactions on information theory (01-09-2017)
    “…A variety of low-density parity-check (LDPC) ensembles have now been observed to approach capacity with message-passing decoding. However, all of them use soft…”
    Get full text
    Journal Article
  11. 11

    Interleaved Concatenations of Polar Codes With BCH and Convolutional Codes by Ying Wang, Narayanan, Krishna R., Yu-Chih Huang

    “…We analyze interleaved concatenation schemes of polar codes with outer binary BCH codes and convolutional codes. We show that both BCH-polar and Conv-polar…”
    Get full text
    Journal Article
  12. 12

    Coded Demixing for Unsourced Random Access by Ebert, Jamison R., Amalladinne, Vamsi K., Rini, Stefano, Chamberland, Jean-Francois, Narayanan, Krishna R.

    “…Unsourced random access (URA) is a recently proposed multiple access paradigm tailored to the uplink channel of machine-type communication networks. By…”
    Get full text
    Journal Article
  13. 13

    Symmetric Block-Wise Concatenated BCH Codes for NAND Flash Memories by Kim, Daesung, Narayanan, Krishna R., Ha, Jeongseok

    Published in IEEE transactions on communications (01-10-2018)
    “…This paper introduces a high rate error-correcting coding scheme called symmetric block-wise concatenated Bose-Chaudhuri-Hocquenghem (symmetric BC-BCH) codes…”
    Get full text
    Journal Article
  14. 14

    Factored LT and Factored Raptor Codes for Large-Scale Distributed Matrix Multiplication by Pradhan, Asit Kumar, Heidarzadeh, Anoosheh, Narayanan, Krishna R.

    “…We propose two coding schemes for distributed matrix multiplication in the presence of stragglers. These coding schemes are adaptations of Luby Transform (LT)…”
    Get full text
    Journal Article
  15. 15

    Lattices Over Algebraic Integers With an Application to Compute-and-Forward by Huang, Yu-Chih, Narayanan, Krishna R., Wang, Ping-Chung

    Published in IEEE transactions on information theory (01-10-2018)
    “…In this paper, we extend Construction A of lattices to the ring of algebraic integers of a general imaginary quadratic field that may not form a principal…”
    Get full text
    Journal Article
  16. 16

    Construction \pi and \pi Lattices: Construction, Goodness, and Decoding Algorithms by Yu-Chih Huang, Narayanan, Krishna R.

    Published in IEEE transactions on information theory (01-09-2017)
    “…A novel construction of lattices is proposed. This construction can be thought of as a special class of Construction A from codes over finite rings that can be…”
    Get full text
    Journal Article
  17. 17

    Multilevel Coding Schemes for Compute-and-Forward With Flexible Decoding by Hern, Brett, Narayanan, Krishna R.

    Published in IEEE transactions on information theory (01-11-2013)
    “…We consider the design of coding schemes for the wireless two-way relaying channel when there is no channel state information at the transmitter. In the spirit…”
    Get full text
    Journal Article
  18. 18

    Noisy Group Testing with Side Information by Karimi, Esmaeil, Heidarzadeh, Anoosheh, Narayanan, Krishna R., Sprintson, Alex

    “…Group testing (GT) has recently received significant attention due to its broad range of applications. Motivated by practical scenarios, such as testing for…”
    Get full text
    Conference Proceeding
  19. 19

    Iterative Soft-Input Soft-Output Decoding of Reed-Solomon Codes by Adapting the Parity-Check Matrix by Jing Jiang, Narayanan, K.R.

    Published in IEEE transactions on information theory (01-08-2006)
    “…An iterative algorithm is presented for soft-input soft-output (SISO) decoding of Reed-Solomon (RS) codes. The proposed iterative algorithm uses the…”
    Get full text
    Journal Article
  20. 20

    Asynchronous Neighbor Discovery Using Coupled Compressive Sensing by Amalladinne, Vamsi K., Narayanan, Krishna R., Chamberland, Jean-Francois, Guo, Dongning

    “…The neighbor discovery paradigm finds wide application in Internet of Things networks, where the number of active devices is orders of magnitude smaller than…”
    Get full text
    Conference Proceeding