Dmitri V. Truhachev

Learn More
—Demodulation in a random multiple access channel is considered where the signals are chosen uniformly randomly with unit energy, a model applicable to several modern transmission systems. It is shown that by lifting (replicating) the graph of this system and randomizing the graph connections, a simple iterative cancellation demodulator can be constructed(More)
—Asymptotic iterative decoding performance is analyzed for several classes of iteratively decodable codes when the block length of the codes and the number of iterations go to infinity. Three classes of codes are considered. These are Gal-lager's regular low-density parity-check (LDPC) codes, Tanner's generalized LDPC (GLDPC) codes, and the turbo codes due(More)
A portable 4 × 4 multiple-input multiple-output (MIMO) testbed that is based on field programmable gate arrays (FPGAs) and which operates in the 902–928 MHz industrial, scientific, and medical (ISM) band has been developed by the High Capacity Digital Communications (HCDC) Laboratory at the University of Alberta. We present a description of the HCDC testbed(More)
— A key advantage of viewing communications in wireless networks as multiple access rather than a plurality of point-to-point transmissions, is its robustness towards multiple access interference. Concurrent packet transmissions are allowed to coexist thus deviating from the traditional view of enforcing collision-footprints around the transmitter-receiver(More)
—Codes constructed from connected spatially coupled low-density parity-check code (SC-LDPCC) chains are proposed and analyzed. It is demonstrated that connecting coupled chains results in improved iterative decoding performance. The constructed protograph ensembles have better iterative decoding thresholds compared to an individual SC-LDPCC chain and(More)