Dmitri V. Truhachev

Orcid: 0000-0002-4455-3825

Affiliations:
  • Dalhousie University, Halifax, NS, Canada


According to our database1, Dmitri V. Truhachev authored at least 61 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Unsourced Random Access With Threshold-Based Feedback.
IEEE Trans. Commun., December, 2023

A Single-TSV and Single-DCDL Approach for Skew Compensation of Multi-Dies Clock Synchronization in 3-D-ICs.
IEEE Trans. Very Large Scale Integr. Syst., April, 2023

Ordered Reliability Direct Error Pattern Testing Decoding Algorithm.
CoRR, 2023

Ordered Reliability Direct Error Pattern Testing (ORDEPT) Algorithm.
Proceedings of the IEEE Global Communications Conference, 2023

2022
Memory Optimized Hardware Implementation of Open FEC Encoder.
IEEE Trans. Very Large Scale Integr. Syst., 2022

Unsourced Random Access Over Fading Channels via Data Repetition, Permutation, and Scrambling.
IEEE Trans. Commun., 2022

A Blind Background Calibration Technique for Super-Regenerative Receivers.
IEEE Trans. Circuits Syst. II Express Briefs, 2022

Spread Unsourced Random Access With an Iterative MIMO Receiver.
IEEE Commun. Lett., 2022

2021
Efficient Implementation of 400 Gbps Optical Communication FEC.
IEEE Trans. Circuits Syst. I Regul. Pap., 2021

Low-Complexity Coding and Spreading for Unsourced Random Access.
IEEE Commun. Lett., 2021

2020
Area- and Power-Efficient Staircase Encoder Implementation for High-Throughput Fiber-Optical Communications.
IEEE Trans. Very Large Scale Integr. Syst., 2020

Self-Coupling Data Transmission for Random Multiple Access Communications.
IEEE Commun. Lett., 2020

2019
Coupling Information Transmission With Window Decoding.
IEEE Wirel. Commun. Lett., 2019

Coupling Data Transmission for Multiple-Access Communications.
IEEE Trans. Inf. Theory, 2019

Code Design Based on Connecting Spatially Coupled Graph Chains.
IEEE Trans. Inf. Theory, 2019

2018
Spatially Coupled Split-Component Codes With Iterative Algebraic Decoding.
IEEE Trans. Inf. Theory, 2018

2017
Continuous Transmission of Spatially Coupled LDPC Code Chains.
IEEE Trans. Commun., 2017

Effective Communications over Doubly-Selective Acoustic Channels using Iterative Signal Cancelation.
Proceedings of the International Conference on Underwater Networks & Systems, 2017

2016
Coupling Information Transmission With Approximate Message-Passing.
IEEE Commun. Lett., 2016

Decoding analysis accounting for mis-corrections for spatially-coupled split-component codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Spatially-coupled split-component codes with bounded-distance component decoding.
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.
CoRR, 2014

Improving the finite-length performance of long SC-LDPC code chains by connecting consecutive chains.
Proceedings of the 8th International Symposium on Turbo Codes and Iterative Information Processing, 2014

Packet acquisition for spatially coupling information transmission.
Proceedings of the IEEE International Conference on Communications, 2014

2013
Multiple Access Demodulation in the Lifted Signal Graph With Spatial Coupling.
IEEE Trans. Inf. Theory, 2013

A finite length performance analysis of LDPC codes constructed by connecting spatially coupled chains.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Universal multiple access via spatially coupling data transmission.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Spatially coupled streaming modulation.
Proceedings of IEEE International Conference on Communications, 2013

2012
Achieving AWGN Multiple Access Channel Capacity with Spatial Graph Coupling.
IEEE Commun. Lett., 2012

Capacity Achieving Spatially Coupled Sparse Graph Modulation and Iterative Demodulation
CoRR, 2012

New codes on graphs constructed by connecting spatially coupled chains.
Proceedings of the 2012 Information Theory and Applications Workshop, 2012

Achieving gaussian multiple access channel capacity with spatially coupled sparse graph multi-user modulation.
Proceedings of the 2012 Information Theory and Applications Workshop, 2012

Improving spatially coupled LDPC codes by connecting chains.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Connecting spatially coupled LDPC code chains.
Proceedings of IEEE International Conference on Communications, 2012

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

Asymptotic analysis of joint timing acquisition and multiple packet reception.
Proceedings of the 2011 IEEE Wireless Communications and Networking Conference, 2011

2010
Impact of traffic localization on communication rates in ad-hoc networks.
Wirel. Networks, 2010

Distance bounds for periodically time-varying and tail-biting LDPC convolutional codes.
IEEE Trans. Inf. Theory, 2010

Generalized Superposition Modulation and Iterative Demodulation: A Capacity Investigation.
J. Electr. Comput. Eng., 2010

Multi-stream information transmission over K-user interference networks.
Proceedings of the Information Theory and Applications Workshop, 2010

2009
A Two-Stage Capacity-Achieving Demodulation/Decoding Method for Random Matrix Channels.
IEEE Trans. Inf. Theory, 2009

Braided block codes.
IEEE Trans. Inf. Theory, 2009

Throughput/Reliability Tradeoffs in Spread Spectrum Multi-Hop Ad-Hoc Wireless Networks with Multi-Packet Detection.
Proceedings of IEEE International Conference on Communications, 2009

2008
Two-stage detection of partitioned random CDMA.
Eur. Trans. Telecommun., 2008

Transmitter Layering for Multiuser MIMO Systems.
EURASIP J. Wirel. Commun. Netw., 2008

Analysis of a Random Channel Access Scheme with Multi-Packet Reception.
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.
IEEE Trans. Inf. Theory, 2007

2006
A Portable MIMO Testbed and Selected Channel Measurements.
EURASIP J. Adv. Signal Process., 2006

On upper bounds on communication rates in ad-hoc networks with non-uniform traffic pattern.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2006

Encoders and Decoders for Braided Block Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Achievable Communication Rates in Ad hoc Wireless Networks Using Local Node Cooperation.
Proceedings of IEEE International Conference on Communications, 2006

2005
An analysis of the block error probability performance of iterative decoding.
IEEE Trans. Inf. Theory, 2005

On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices.
Probl. Inf. Transm., 2005

2004
On the Construction and Analysis of Iteratively Decodable Codes.
PhD thesis, 2004

Analytic Expressions for the Bit Error Probabilities of Rate-1/2 Memory 2 Convolutional Encoders.
IEEE Trans. Inf. Theory, 2004

On permutor designs based on cycles for serially concatenated convolutional codes.
IEEE Trans. Commun., 2004

On the free distance of LDPC convolutional codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Turbo codes and Shannon's condition for reliable communication.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2001
Some Results Concerning the Design and Decoding of Turbo-Codes.
Probl. Inf. Transm., 2001

To the Theory of Low-Density Convolutional Codes. II.
Probl. Inf. Transm., 2001

New Decoding Error Probability Bounds for Fixed Convolutional Codes used in BSC.
Electron. Notes Discret. Math., 2001


  Loading...