default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitri V. Truhachev
Person information
- affiliation: Dalhousie University, Halifax, NS, Canada
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j37]Roshanak Soltani
, Dmitri V. Truhachev, Alireza Bayesteh, Monirosharieh Vameghestahbanati:
Location-Based Unsourced Random Access. IEEE Access 12: 51166-51175 (2024)- [j36]Ehsan Nassaji, Dmitri V. Truhachev:
Dynamic Compressed Sensing Approach for Unsourced Random Access. IEEE Commun. Lett. 28(7): 1644-1648 (2024) - [j35]Yang Ge, Dmitri V. Truhachev, Abolfazl Zokaei, Xiaotong Lu, Xiaoting Huang, Kamal El-Sankary:
Efficient Address-Embedded Time-Domain Implementation of Minima Finders for Soft Error-Correction Decoders. IEEE Trans. Circuits Syst. II Express Briefs 71(10): 4471-4475 (2024) - [c24]Alireza Karami, Iman Pazouki, Roshanak Soltani, Dmitri V. Truhachev:
An Approach to Asynchronous Unsourced Random Access (URA). WCNC 2024: 1-6 - 2023
- [j34]Murwan Bashir, Ehsan Nassaji, Dmitri V. Truhachev, Alireza Bayesteh, Monirosharieh Vameghestahbanati:
Unsourced Random Access With Threshold-Based Feedback. IEEE Trans. Commun. 71(12): 7072-7086 (2023) - [j33]Yang Ge, Tejinder Singh Sandhu, Dmitri V. Truhachev, Kamal El-Sankary:
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. 31(4): 567-577 (2023) - [c23]Reza Hadavian, Dmitri V. Truhachev, Kamal El-Sankary, Hamid Ebrahimzad, Hossein Najafi:
Ordered Reliability Direct Error Pattern Testing (ORDEPT) Algorithm. GLOBECOM 2023: 6983-6988 - [i10]Reza Hadavian, Xiaoting Huang, Dmitri V. Truhachev, Kamal El-Sankary, Hamid Ebrahimzad, Hossein Najafi:
Ordered Reliability Direct Error Pattern Testing Decoding Algorithm. CoRR abs/2310.12039 (2023) - 2022
- [j32]Ehsan Nassaji, Roshanak Soltani, Murwan Bashir, Dmitri V. Truhachev:
Spread Unsourced Random Access With an Iterative MIMO Receiver. IEEE Commun. Lett. 26(10): 2495-2499 (2022) - [j31]Ximing Fu, Kamal El-Sankary, Yang Ge, Yadong Yin, Dmitri V. Truhachev:
A Blind Background Calibration Technique for Super-Regenerative Receivers. IEEE Trans. Circuits Syst. II Express Briefs 69(2): 344-348 (2022) - [j30]Ehsan Nassaji, Murwan Bashir, Dmitri V. Truhachev:
Unsourced Random Access Over Fading Channels via Data Repetition, Permutation, and Scrambling. IEEE Trans. Commun. 70(2): 1029-1042 (2022) - [j29]Abolfazl Zokaei, Dmitri V. Truhachev, Kamal El-Sankary:
Memory Optimized Hardware Implementation of Open FEC Encoder. IEEE Trans. Very Large Scale Integr. Syst. 30(10): 1548-1552 (2022) - [i9]Murwan Bashir, Ehsan Nassaji, Dmitri V. Truhachev, Alireza Bayesteh, Monirosharieh Vameghestahbanati:
Unsourced Random Access with Threshold-Based Feedback. CoRR abs/2211.12358 (2022) - 2021
- [j28]Dmitri V. Truhachev, Murwan Bashir, Alireza Karami, Ehsan Nassaji:
Low-Complexity Coding and Spreading for Unsourced Random Access. IEEE Commun. Lett. 25(3): 774-778 (2021) - [j27]Dmitri V. Truhachev, Kamal El-Sankary, Alireza Karami, Abolfazl Zokaei, Shizhong Li:
Efficient Implementation of 400 Gbps Optical Communication FEC. IEEE Trans. Circuits Syst. I Regul. Pap. 68(1): 496-509 (2021) - 2020
- [j26]Alireza Karami, Dmitri V. Truhachev:
Self-Coupling Data Transmission for Random Multiple Access Communications. IEEE Commun. Lett. 24(6): 1168-1172 (2020) - [j25]Shizhong Li, Kamal El-Sankary, Alireza Karami, Dmitri V. Truhachev:
Area- and Power-Efficient Staircase Encoder Implementation for High-Throughput Fiber-Optical Communications. IEEE Trans. Very Large Scale Integr. Syst. 28(3): 843-847 (2020)
2010 – 2019
- 2019
- [j24]Dmitri V. Truhachev, Christian Schlegel:
Coupling Data Transmission for Multiple-Access Communications. IEEE Trans. Inf. Theory 65(7): 4550-4574 (2019) - [j23]Dmitri V. Truhachev, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr., Alireza Karami:
Code Design Based on Connecting Spatially Coupled Graph Chains. IEEE Trans. Inf. Theory 65(9): 5604-5617 (2019) - [j22]Alireza Karami, Dmitri V. Truhachev:
Coupling Information Transmission With Window Decoding. IEEE Wirel. Commun. Lett. 8(2): 560-563 (2019) - 2018
- [j21]Lei M. Zhang, Dmitri V. Truhachev, Frank R. Kschischang:
Spatially Coupled Split-Component Codes With Iterative Algebraic Decoding. IEEE Trans. Inf. Theory 64(1): 205-224 (2018) - 2017
- [j20]Pablo M. Olmos, David G. M. Mitchell, Dmitri V. Truhachev, Daniel J. Costello Jr.:
Continuous Transmission of Spatially Coupled LDPC Code Chains. IEEE Trans. Commun. 65(12): 5097-5109 (2017) - [c22]Christian Schlegel, Dmitri V. Truhachev, Zahra Alavizadeh, Amir Vaezi:
Effective Communications over Doubly-Selective Acoustic Channels using Iterative Signal Cancelation. WUWNet 2017: 17:1-17:8 - 2016
- [j19]Dmitri V. Truhachev, David McNutt:
Coupling Information Transmission With Approximate Message-Passing. IEEE Commun. Lett. 20(10): 1995-1998 (2016) - [c21]Dmitri V. Truhachev, Alireza Karami, Lei M. Zhang, Frank R. Kschischang:
Decoding analysis accounting for mis-corrections for spatially-coupled split-component codes. ISIT 2016: 2124-2128 - [i8]Pablo M. Olmos, David G. M. Mitchell, Dmitri V. Truhachev, Daniel J. Costello Jr.:
Continuous Transmission of Spatially-Coupled LDPC Code Chains. CoRR abs/1606.02087 (2016) - 2015
- [c20]Lei M. Zhang, Dmitri V. Truhachev, Frank R. Kschischang:
Spatially-coupled split-component codes with bounded-distance component decoding. ISIT 2015: 56-60 - [i7]Lei M. Zhang, Dmitri V. Truhachev, Frank R. Kschischang:
Spatially-coupled Split-component Codes with Iterative Algebraic Decoding. CoRR abs/1512.01132 (2015) - 2014
- [c19]Dmitri V. Truhachev:
Packet acquisition for spatially coupling information transmission. ICC Workshops 2014: 495-500 - [c18]Pablo M. Olmos, David G. M. Mitchell, Dmitri V. Truhachev, Daniel J. Costello Jr.:
Improving the finite-length performance of long SC-LDPC code chains by connecting consecutive chains. ISTC 2014: 72-76 - [i6]Pablo M. Olmos, David G. M. Mitchell, Dmitri V. Truhachev, Daniel J. Costello Jr.:
Improving the Finite-Length Performance of Spatially Coupled LDPC Codes by Connecting Multiple Code Chains. CoRR abs/1402.7170 (2014) - 2013
- [j18]Christian Schlegel, Dmitri V. Truhachev:
Multiple Access Demodulation in the Lifted Signal Graph With Spatial Coupling. IEEE Trans. Inf. Theory 59(4): 2459-2470 (2013) - [c17]Dmitri V. Truhachev, Christian Schlegel:
Spatially coupled streaming modulation. ICC 2013: 3418-3422 - [c16]Dmitri V. Truhachev:
Universal multiple access via spatially coupling data transmission. ISIT 2013: 1884-1888 - [c15]Pablo M. Olmos, David G. M. Mitchell, Dmitri V. Truhachev, Daniel J. Costello Jr.:
A finite length performance analysis of LDPC codes constructed by connecting spatially coupled chains. ITW 2013: 1-5 - [i5]Dmitri V. Truhachev, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.:
New Codes on Graphs Constructed by Connecting Spatially Coupled Chains. CoRR abs/1312.3368 (2013) - 2012
- [j17]Dmitri V. Truhachev:
Achieving AWGN Multiple Access Channel Capacity with Spatial Graph Coupling. IEEE Commun. Lett. 16(5): 585-588 (2012) - [c14]Dmitri V. Truhachev, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.:
Connecting spatially coupled LDPC code chains. ICC 2012: 2176-2180 - [c13]Dmitri V. Truhachev, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.:
Improving spatially coupled LDPC codes by connecting chains. ISIT 2012: 468-472 - [c12]Dmitri V. Truhachev:
Achieving gaussian multiple access channel capacity with spatially coupled sparse graph multi-user modulation. ITA 2012: 331-337 - [c11]Dmitri V. Truhachev, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.:
New codes on graphs constructed by connecting spatially coupled chains. ITA 2012: 392-397 - [i4]Dmitri V. Truhachev, Christian Schlegel:
Capacity Achieving Spatially Coupled Sparse Graph Modulation and Iterative Demodulation. CoRR abs/1209.5785 (2012) - 2011
- [c10]Christian Schlegel, Dmitri V. Truhachev:
Multiple access demodulation in the lifted signal graph with spatial coupling. ISIT 2011: 2989-2993 - [c9]Dmitri V. Truhachev:
Asymptotic analysis of joint timing acquisition and multiple packet reception. WCNC 2011: 1869-1874 - [i3]Christian Schlegel, Dmitri V. Truhachev:
Multiple Access Demodulation in the Lifted Signal Graph with Spatial Coupling. CoRR abs/1107.4797 (2011) - [i2]Dmitri V. Truhachev:
Achieving AWGN Channel Capacity with Sparse Graph Modulation and "In the Air" Coupling. CoRR abs/1111.3696 (2011) - [i1]Dmitri V. Truhachev, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.:
Connecting Spatially Coupled LDPC Code Chains. CoRR abs/1111.5668 (2011) - 2010
- [j16]Christian Schlegel, Marat V. Burnashev, Dmitri V. Truhachev:
Generalized Superposition Modulation and Iterative Demodulation: A Capacity Investigation. J. Electr. Comput. Eng. 2010: 153540:1-153540:9 (2010) - [j15]Dmitri V. Truhachev, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Distance bounds for periodically time-varying and tail-biting LDPC convolutional codes. IEEE Trans. Inf. Theory 56(9): 4301-4308 (2010) - [j14]Sumeeth Nagaraj, Dmitri V. Truhachev, Christian Schlegel:
Impact of traffic localization on communication rates in ad-hoc networks. Wirel. Networks 16(2): 497-510 (2010) - [c8]Dmitri V. Truhachev:
Multi-stream information transmission over K-user interference networks. ITA 2010: 491-499
2000 – 2009
- 2009
- [j13]Dmitri V. Truhachev, Christian Schlegel, Lukasz Krzymien:
A Two-Stage Capacity-Achieving Demodulation/Decoding Method for Random Matrix Channels. IEEE Trans. Inf. Theory 55(1): 136-146 (2009) - [j12]Alberto Jiménez Feltström, Dmitri V. Truhachev, Michael Lentmaier, Kamil Sh. Zigangirov:
Braided block codes. IEEE Trans. Inf. Theory 55(6): 2640-2658 (2009) - [c7]Dmitri V. Truhachev, Sumeeth Nagaraj, Christian Schlegel:
Throughput/Reliability Tradeoffs in Spread Spectrum Multi-Hop Ad-Hoc Wireless Networks with Multi-Packet Detection. ICC 2009: 1-5 - 2008
- [j11]Christian Schlegel, Dmitri V. Truhachev, Zachary Bagley:
Transmitter Layering for Multiuser MIMO Systems. EURASIP J. Wirel. Commun. Netw. 2008 (2008) - [j10]Lukasz Krzymien, Dmitri V. Truhachev, Christian Schlegel, Marat V. Burnashev:
Two-stage detection of partitioned random CDMA. Eur. Trans. Telecommun. 19(5): 499-509 (2008) - [c6]Sumeeth Nagaraj, Dmitri V. Truhachev, Christian Schlegel:
Analysis of a Random Channel Access Scheme with Multi-Packet Reception. GLOBECOM 2008: 330-334 - 2007
- [j9]Arvind Sridharan, Dmitri V. Truhachev, Michael Lentmaier, Daniel J. Costello Jr., Kamil Sh. Zigangirov:
Distance Bounds for an Ensemble of LDPC Convolutional Codes. IEEE Trans. Inf. Theory 53(12): 4537-4555 (2007) - 2006
- [j8]Paul Goud, Robert Hang, Dmitri V. Truhachev, Christian Schlegel:
A Portable MIMO Testbed and Selected Channel Measurements. EURASIP J. Adv. Signal Process. 2006 (2006) - [c5]Sumeeth Nagaraj, Dmitri V. Truhachev, Christian Schlegel:
Achievable Communication Rates in Ad hoc Wireless Networks Using Local Node Cooperation. ICC 2006: 4052-4058 - [c4]Kamil Sh. Zigangirov, Alberto Jiménez Feltström, Michael Lentmaier, Dmitri V. Truhachev:
Encoders and Decoders for Braided Block Codes. ISIT 2006: 1808-1812 - [c3]Sumeeth Nagaraj, Christian Schlegel, Dmitri V. Truhachev:
On upper bounds on communication rates in ad-hoc networks with non-uniform traffic pattern. WCNC 2006: 349-354 - 2005
- [j7]Arvind Sridharan, Michael Lentmaier, Dmitri V. Truhachev, Daniel J. Costello Jr., Kamil Sh. Zigangirov:
On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices. Probl. Inf. Transm. 41(1): 33-44 (2005) - [j6]Michael Lentmaier, Dmitri V. Truhachev, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
An analysis of the block error probability performance of iterative decoding. IEEE Trans. Inf. Theory 51(11): 3834-3855 (2005) - 2004
- [b1]Dmitri V. Truhachev:
On the Construction and Analysis of Iteratively Decodable Codes. Lund University, Sweden, 2004 - [j5]Axel Huebner, Dmitri V. Truhachev, Kamil Sh. Zigangirov:
On permutor designs based on cycles for serially concatenated convolutional codes. IEEE Trans. Commun. 52(9): 1494-1503 (2004) - [j4]Michael Lentmaier, Dmitri V. Truhachev, Kamil Sh. Zigangirov:
Analytic Expressions for the Bit Error Probabilities of Rate-1/2 Memory 2 Convolutional Encoders. IEEE Trans. Inf. Theory 50(6): 1303-1311 (2004) - [c2]Arvind Sridharan, Dmitri V. Truhachev, Michael Lentmaier, Daniel J. Costello Jr., Kamil Sh. Zigangirov:
On the free distance of LDPC convolutional codes. ISIT 2004: 311 - [c1]Michael Lentmaier, Dmitri V. Truhachev, Kamil Sh. Zigangirov, Daniel J. Costello Jr.:
Turbo codes and Shannon's condition for reliable communication. ISIT 2004: 442 - 2001
- [j3]Dmitri V. Truhachev, Karin Engdahl, Kamil Sh. Zigangirov:
New Decoding Error Probability Bounds for Fixed Convolutional Codes used in BSC. Electron. Notes Discret. Math. 6: 123-131 (2001) - [j2]Dmitri V. Truhachev, Michael Lentmaier, Kamil Sh. Zigangirov:
Some Results Concerning the Design and Decoding of Turbo-Codes. Probl. Inf. Transm. 37(3): 190-205 (2001) - [j1]Michael Lentmaier, Dmitri V. Truhachev, Kamil Sh. Zigangirov:
To the Theory of Low-Density Convolutional Codes. II. Probl. Inf. Transm. 37(4): 288-306 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
