rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Performance Analysis of Block Codes over Finite-state Channels in Delay-sensitive Communications
  name:
    name part: Hamidi Sepehr, Fatemeh
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: Pfister, Henry D.
    role:
      role term: thesis advisor.
  name:
    name part: Chamberland, Jean-Francois
    role:
      role term: thesis advisor.
  name:
    name part: Texas A & M University
    role:
      role term: degree granting institution.
  type of resource: text
  genre: bibliography
  origin info:
    place:
      place term: txu
    date issued: 2015
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: remote
    extent: 1 online resource.
  abstract: As the mobile application landscape expands, wireless networks are tasked with supporting different connection profiles, including real-time traffic and delay-sensitive communications. Among many ensuing engineering challenges is the need to better understand the fundamental limits of forward error correction in non-asymptotic regimes. This dissertation seeks to characterize the performance of block codes over finite-state channels with memory and also evaluate their queueing performance under different encoding/decoding schemes. In particular, a fading formulation is considered where a discrete channel with correlation over time introduces errors. For carefully selected channel models and arrival processes, a tractable Markov structure composed of queue length and channel state is identified. This facilitates the analysis of the stationary behavior of the system, leading to evaluation criteria such as bounds on the probability of the queue exceeding a threshold. Specifically, this dissertation focuses on system models with scalable arrival profiles based on Poisson processes, and finite-state memory channels. These assumptions permit the rigorous comparison of system performance for codes with arbitrary block lengths and code rates. Based on this characterization, it is possible to optimize code parameters for delay-sensitive applications over various channels. Random codes and BCH codes are then employed as means to study the relationship between code-rate selection and the queueing performance of point-to-point data links. The introduced methodology offers a new perspective on the joint queueing-coding analysis for finite-state channels, and is supported by numerical simulations. Furthermore, classical results from information theory are revisited in the context of channels with rare transitions, and bounds on the probabilities of decoding failure are derived for random codes. An analysis framework is presented where channel dependencies within and across code wo…
  note: by Fatemeh Hamidi Sepehr.
  note: "Major Subject: Electrical Engineering"
  note: Includes vita.
  note: Doctor of Philosophy Texas A & M University 2014 http://hdl.handle.net/1969.1/152477
  note: Includes bibliographical references.
  note: Text (Dissertation)
  subject:
    topic: Major Electrical Engineering
  subject:
    topic: Queueing
  subject:
    topic: Channel Coding
  identifier: http://hdl.handle.net/1969.1/152477
  record info:
    record content source: TXA
    record creation date: 150211
    record change date: 20151206125809.0
    record identifier: in00003497198
    language of cataloging:
      language term: eng