TFThomas E. Fuja

Thomas E. Fuja

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Thomas E. Fuja has a total of 16 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Hybrid-ARQ Protocols Based on Tornado Codes for the Packet Erasure Channel

    by Srinath Puducheri-Sundaravaradhan, Thomas E. Fuja

    Lossless data transfer over communication networks has traditionally been achieved by means of ARQ protocols. However, the last ten years have seen an increasing interest in using erasure-correcting codes as an alternative, with the goal of reducing latency, feedback overhead, etc. Since these two approaches possess advantages as well as drawbacks, several hybrid ARQ schemes have also been proposed as good compromise solutions, in order to attain the “best of both worlds”. Extending this principle, this paper develops new classes of hybrid ARQ protocols for erasure channels that allow for flexible trade-offs between two important cost metrics, viz., the computational complexity of coding , and the amount of feedback needed. Our hybrid schemes make use of Tornado codes – a class of low-complexity capacity-achieving erasure codes – whose coding structure is well-suited for feedback-based communications. These schemes demonstrate significant cost reductions versus coding-only and feedback-only approaches over a wide region of interest. Moreover, these schemes are easily tuned to achieve different operating points on a trade-off curve. Finally, the proposed schemes showcase novel means of interweaving coding and feedback.


  • Hybrid Constellations for Dual-Polarized Wireless Communications

    by Xiaobin Wu, Thomas G. Pratt, Thomas E. Fuja

    This paper considers constellation designs for 2 × 2 systems with a coherent dual-polarized antenna configuration. Such an architecture enables a four dimensional (4D) signal space that exploits polarization, and this paper considers hybrid constellations formed as a combination of amplitude/phase states and polarization states. For coherent detection, phase shift keying (PSK) is combined with polarization shift keying (PolSK) to produce constant-power PSK+PolSK constellations that consistently outperform PSK+PSK. Next, quadrature amplitude modulation (QAM) and amplitude phase shift keying (APSK) are combined with PolSK to construct hybrid QAM+PolSK and APSK+PolSK constellations, and constrained capacity results indicate the viability of coded modulation based on these signal spaces. For non-coherent detection, differential PSK (DPSK) is combined with PolSK to yield DPSK+PolSK signaling that does not require phase alignment at the receiver and outperforms DPSK+DPSK, both with and without the adverse effect of carrier frequency offset and symbol time offset. The methods are verified in overthe- air testing with universal software radio peripherals (USRPs) integrated in a dual-polarized testbed. Error performances of all proposed 4D hybrid constellations in an OFDM framework are analyzed under both quasi-AWGN and multipath fading scenarios.


  • Performance Bounds and Estimates for Quantized LDPC Decoders

    by Homayoon Hatami, David G. M. Mitchell, Daniel J. Costello, Thomas E. Fuja

    The performance of low-density parity-check (LDPC) codes at high signal-to-noise ratios (SNRs) is known to be limited by the presence of certain sub-graphs that exist in the Tanner graph representation of the code, for example trapping sets and absorbing sets. This paper derives a lower bound on the frame error rate (FER) of any LDPC code containing a given problematic sub-graph, assuming a particular message passing decoder and decoder quantization. A crucial aspect of the lower bound is that it is code-independent, in the sense that it can be derived based only on a problematic sub-graph and then applied to any code containing it. Due to the complexity of evaluating the exact bound, assumptions are proposed to approximate it, from which we can estimate decoder performance. Simulated results obtained for both the quantized sum-product algorithm (SPA) and the quantized min-sum algorithm (MSA) are shown to be consistent with the approximate bound and the corresponding performance estimates. Different classes of LDPC codes, including both structured and randomly constructed codes, are used to demonstrate the robustness of the approach.


  • Open Access

    Performance Bounds and Estimates for Quantized LDPC Decoders

    by Homayoon Hatami, David G. M. Mitchell, Daniel J. Costello, Thomas E. Fuja

    The performance of low-density parity-check (LDPC) codes at high signal-to-noise ratios (SNRs) is known to be limited by the presence of certain sub-graphs that exist in the Tanner graph representation of the code, for example trapping sets and absorbing sets. This paper derives a lower bound on the frame error rate (FER) of any LDPC code containing a given problematic sub-graph, assuming a particular message passing decoder and decoder quantization. A crucial aspect of the lower bound is that it is code-independent, in the sense that it can be derived based only on a problematic sub-graph and then applied to any code containing it. Due to the complexity of evaluating the exact bound, assumptions are proposed to approximate it, from which we can estimate decoder performance. Simulated results obtained for both the quantized sum-product algorithm (SPA) and the quantized min-sum algorithm (MSA) are shown to be consistent with the approximate bound and the corresponding performance estimates. Different classes of LDPC codes, including both structured and randomly constructed codes, are used to demonstrate the robustness of the approach.

  • Open Access

    Threshold Analysis of Non-Binary Spatially-Coupled LDPC Codes with Windowed Decoding

    by Lai Wei, Toshiaki Koike-Akino, David G. M. Mitchell, Thomas E. Fuja, Daniel J. Costello Jr

    In this paper we study the iterative decoding threshold performance of non-binary spatially-coupled low-density parity-check (NB-SC-LDPC) code ensembles for both the binary erasure channel (BEC) and the binary-input additive white Gaussian noise channel (BIAWGNC), with particular emphasis on windowed decoding (WD). We consider both (2,4)-regular and (3,6)-regular NB-SC-LDPC code ensembles constructed using protographs and compute their thresholds using protograph versions of NB density evolution and NB extrinsic information transfer analysis. For these code ensembles, we show that WD of NB-SC-LDPC codes, which provides a significant decrease in latency and complexity compared to decoding across the entire parity-check matrix, results in a negligible decrease in the near-capacity performance for a sufficiently large window size W on both the BEC and the BIAWGNC. Also, we show that NB-SC-LDPC code ensembles exhibit gains in the WD threshold compared to the corresponding block code ensembles decoded across the entire parity-check matrix, and that the gains increase as the finite field size q increases. Moreover, from the viewpoint of decoding complexity, we see that (3,6)-regular NB-SC-LDPC codes are particularly attractive due to the fact that they achieve near-capacity thresholds even for small q and W.

  • Signal Superposition Coded Cooperative Diversity: Analysis and Optimization

    by Lei Xiao, Thomas E. Fuja, Jorg Kliewer, Daniel J. Costello

    The performance of a coded cooperative diversity system employing the Euclidean superposition of two BPSK- modulated signals is analyzed. For an example using a convolutional code on block fading channels, the results show excellent agreement with computer simulations. The analysis makes it possible to optimize the power allocation between the local and relay signals numerically, circumventing the need for time consuming Monte Carlo simulations.


  • Algebraic Superposition of LDGM Codes for Cooperative Diversity

    by Lei Xiao, Thomas E. Fuja, Jorg Kliewer, Daniel J. Costello

    This paper presents a technique for achieving cooperative spatial diversity using serially concatenated low density generator matrix (LDGM) codes. Specifically, we consider a scenario in which a pair of transceivers employ algebraic superposition of error control codes to effect spatial diversity at their common destination. The construction of LDGM codes from a sparse generator matrix makes them a natural fit for such a cooperative diversity scheme. The simple decoder structure for graph based codes reduces the complexity at the destination compared with previously-proposed schemes using algebraic superposition of convolutional codes and turbo-like decoding. The result is a system with low encoding and decoding complexity and improved error performance.


  • Coding Schemes for an Erasure Relay Channel

    by Srinath Puducheri, Jorg Kliewer, Thomas E. Fuja

    This paper considers a simple network consisting of a source, a destination, and a relay. In this model, the source- relay and relay-destination links are lossless, while the source- destination link is subject to erasures. Four coding schemes for reliably conveying k symbols from the source to the destination are described. Three of these techniques are adapted directly from well-known point-to-point coding schemes - viz., the use of maximum-distance separable (MDS) codes and Luby Transform (LT) codes. The fourth approach is a new technique using uncoded transmission from the source in conjunction with a relay that transmits a sequence with this property: When the destination subtracts the effects of the unerased symbols from the sequence, what remains is an "LT-like" code for the erased symbols - and this property holds regardless of which symbols were erased on the source-destination link. The four approaches are compared in terms of their complexity and performance.


  • Distributed LT Codes

    by Srinath Puducheri, Jorg Kliewer, Thomas E. Fuja

    This paper proposes a novel distributed encoding procedure to realize codes that resemble LT codes (rateless codes for erasure correction) in both structure and performance. For the case of two sources communicating with a single sink via a common relay, this technique separately encodes k/2 symbols of information onto slightly more than k code symbols at each source. These two codewords are then selectively XOR-ed at the relay, such that the result can be decoded by the sink to recover all k information symbols. It is shown that, for the case of four sources communicating to a single sink, the use of a similar distributed LT code leads to a 50% reduction in overhead at the sink, compared to the use of four individual LT codes