Dmitri V. Truhachev

IEEE Commun. Lett., July, 2024

Location-Based Unsourced Random Access.

[BibT_eX]

[DOI]

Roshanak Soltani

Monirosharieh Vameghestahbanati

Alireza Bayesteh

IEEE Access, 2024

An Approach to Asynchronous Unsourced Random Access (URA).

[BibT_eX]

[DOI]

Proceedings of the IEEE Wireless Communications and Networking Conference, 2024

2023

Unsourced Random Access With Threshold-Based Feedback.

[BibT_eX]

[DOI]

Monirosharieh Vameghestahbanati

IEEE Trans. Commun., December, 2023

A Single-TSV and Single-DCDL Approach for Skew Compensation of Multi-Dies Clock Synchronization in 3-D-ICs.

[BibT_eX]

[DOI]

Yang Ge

Tejinder Singh Sandhu

Kamal El-Sankary

IEEE Trans. Very Large Scale Integr. Syst., April, 2023

Ordered Reliability Direct Error Pattern Testing Decoding Algorithm.

[BibT_eX]

[DOI]

CoRR, 2023

Ordered Reliability Direct Error Pattern Testing (ORDEPT) Algorithm.

[BibT_eX]

[DOI]

Proceedings of the IEEE Global Communications Conference, 2023

2022

Memory Optimized Hardware Implementation of Open FEC Encoder.

[BibT_eX]

[DOI]

Abolfazl Zokaei

Kamal El-Sankary

IEEE Trans. Very Large Scale Integr. Syst., 2022

Unsourced Random Access Over Fading Channels via Data Repetition, Permutation, and Scrambling.

[BibT_eX]

[DOI]

Ehsan Nassaji

Murwan Bashir

IEEE Trans. Commun., 2022

A Blind Background Calibration Technique for Super-Regenerative Receivers.

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst. II Express Briefs, 2022

Spread Unsourced Random Access With an Iterative MIMO Receiver.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2022

2021

Efficient Implementation of 400 Gbps Optical Communication FEC.

[BibT_eX]

[DOI]

IEEE Trans. Circuits Syst. I Regul. Pap., 2021

Low-Complexity Coding and Spreading for Unsourced Random Access.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2021

2020

Area- and Power-Efficient Staircase Encoder Implementation for High-Throughput Fiber-Optical Communications.

[BibT_eX]

[DOI]

IEEE Trans. Very Large Scale Integr. Syst., 2020

Self-Coupling Data Transmission for Random Multiple Access Communications.

[BibT_eX]

[DOI]

Alireza Karami

IEEE Commun. Lett., 2020

2019

Coupling Information Transmission With Window Decoding.

[BibT_eX]

[DOI]

Alireza Karami

IEEE Wirel. Commun. Lett., 2019

Coupling Data Transmission for Multiple-Access Communications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Code Design Based on Connecting Spatially Coupled Graph Chains.

[BibT_eX]

[DOI]

Alireza Karami

IEEE Trans. Inf. Theory, 2019

2018

Spatially Coupled Split-Component Codes With Iterative Algebraic Decoding.

[BibT_eX]

[DOI]

Lei M. Zhang

Frank R. Kschischang

IEEE Trans. Inf. Theory, 2018

2017

Continuous Transmission of Spatially Coupled LDPC Code Chains.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2017

Effective Communications over Doubly-Selective Acoustic Channels using Iterative Signal Cancelation.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Underwater Networks & Systems, 2017

2016

Coupling Information Transmission With Approximate Message-Passing.

[BibT_eX]

[DOI]

David McNutt

IEEE Commun. Lett., 2016

Decoding analysis accounting for mis-corrections for spatially-coupled split-component codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Spatially-coupled split-component codes with bounded-distance component decoding.

[BibT_eX]

[DOI]

Lei M. Zhang

Frank R. Kschischang

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Improving the Finite-Length Performance of Spatially Coupled LDPC Codes by Connecting Multiple Code Chains.

[BibT_eX]

[DOI]

CoRR, 2014

Improving the finite-length performance of long SC-LDPC code chains by connecting consecutive chains.

[BibT_eX]

[DOI]

Proceedings of the 8th International Symposium on Turbo Codes and Iterative Information Processing, 2014

Packet acquisition for spatially coupling information transmission.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2014

2013

Multiple Access Demodulation in the Lifted Signal Graph With Spatial Coupling.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

A finite length performance analysis of LDPC codes constructed by connecting spatially coupled chains.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Universal multiple access via spatially coupling data transmission.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Spatially coupled streaming modulation.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2013

2012

Achieving AWGN Multiple Access Channel Capacity with Spatial Graph Coupling.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2012

Capacity Achieving Spatially Coupled Sparse Graph Modulation and Iterative Demodulation

[BibT_eX]

[DOI]

CoRR, 2012

New codes on graphs constructed by connecting spatially coupled chains.

[BibT_eX]

[DOI]

Proceedings of the 2012 Information Theory and Applications Workshop, 2012

Achieving gaussian multiple access channel capacity with spatially coupled sparse graph multi-user modulation.

[BibT_eX]

[DOI]

Proceedings of the 2012 Information Theory and Applications Workshop, 2012

Improving spatially coupled LDPC codes by connecting chains.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Connecting spatially coupled LDPC code chains.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2012

2011

Achieving AWGN Channel Capacity with Sparse Graph Modulation and "In the Air" Coupling

[BibT_eX]

[DOI]

CoRR, 2011

Asymptotic analysis of joint timing acquisition and multiple packet reception.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE Wireless Communications and Networking Conference, 2011

2010

Impact of traffic localization on communication rates in ad-hoc networks.

[BibT_eX]

[DOI]

Wirel. Networks, 2010

Distance bounds for periodically time-varying and tail-biting LDPC convolutional codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Generalized Superposition Modulation and Iterative Demodulation: A Capacity Investigation.

[BibT_eX]

[DOI]

Marat V. Burnashev

J. Electr. Comput. Eng., 2010

Multi-stream information transmission over K-user interference networks.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2010

2009

A Two-Stage Capacity-Achieving Demodulation/Decoding Method for Random Matrix Channels.

[BibT_eX]

[DOI]

Alberto Jiménez Feltström

Lukasz Krzymien

IEEE Trans. Inf. Theory, 2009

Braided block codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Throughput/Reliability Tradeoffs in Spread Spectrum Multi-Hop Ad-Hoc Wireless Networks with Multi-Packet Detection.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2009

2008

Two-stage detection of partitioned random CDMA.

[BibT_eX]

[DOI]

Eur. Trans. Telecommun., 2008

Transmitter Layering for Multiuser MIMO Systems.

[BibT_eX]

[DOI]

Zachary Bagley

EURASIP J. Wirel. Commun. Netw., 2008

Analysis of a Random Channel Access Scheme with Multi-Packet Reception.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

2007

Distance Bounds for an Ensemble of LDPC Convolutional Codes.

[BibT_eX]

[DOI]

Arvind Sridharan

IEEE Trans. Inf. Theory, 2007

2006

A Portable MIMO Testbed and Selected Channel Measurements.

[BibT_eX]

[DOI]

EURASIP J. Adv. Signal Process., 2006

On upper bounds on communication rates in ad-hoc networks with non-uniform traffic pattern.

[BibT_eX]

[DOI]

Proceedings of the IEEE Wireless Communications and Networking Conference, 2006

Encoders and Decoders for Braided Block Codes.

[BibT_eX]

[DOI]

Alberto Jiménez Feltström

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Achievable Communication Rates in Ad hoc Wireless Networks Using Local Node Cooperation.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2006

2005

An analysis of the block error probability performance of iterative decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices.

[BibT_eX]

[DOI]

Arvind Sridharan

Probl. Inf. Transm., 2005

2004

On the Construction and Analysis of Iteratively Decodable Codes.

[BibT_eX]

[DOI]

PhD thesis, 2004

Analytic Expressions for the Bit Error Probabilities of Rate-1/2 Memory 2 Convolutional Encoders.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

On permutor designs based on cycles for serially concatenated convolutional codes.

[BibT_eX]

[DOI]

Axel Huebner

IEEE Trans. Commun., 2004

On the free distance of LDPC convolutional codes.

[BibT_eX]

[DOI]

Arvind Sridharan

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Turbo codes and Shannon's condition for reliable communication.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2001

Some Results Concerning the Design and Decoding of Turbo-Codes.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2001

To the Theory of Low-Density Convolutional Codes. II.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2001

New Decoding Error Probability Bounds for Fixed Convolutional Codes used in BSC.

[BibT_eX]

[DOI]

Karin Engdahl