Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 9 of 9 for “"Channels With Memory"”.

  1. Error Correcting Coding on Channels With Memory

    Made available in DSpace on 2014-12-10T19:07:17Z (GMT). No. of bitstreams: 1 7412137.pdf: 2813565 bytes, checksum: 22d195bc45e38e25ea5f2a8f178fc7ae (MD5) Previous issue date: 1973

    uiuc Repository record for Error Correcting Coding on Channels With Memory (opens in a new tab)

  2. Efficient coding/decoding strategies for channels with memory

    Many digital communication channels are affected by errors that tend to occur in bursts. A great deal of work has been devoted to finding good burst-error-correcting codes and developing burst-error-correcting schemes. However, burst-error-correcting codes are generally useless for long bursts. …

    ubc Repository record for Efficient coding/decoding strategies for channels with memory (opens in a new tab)

  3. Models and Efficient Receivers for Communication Channels With Memory

    Made available in DSpace on 2014-12-12T20:54:34Z (GMT). No. of bitstreams: 1 7709225.pdf: 3689826 bytes, checksum: 6a0b7d704073d46f7146ff91cf00a053 (MD5) Previous issue date: 1976

    uiuc Repository record for Models and Efficient Receivers for Communication Channels With Memory (opens in a new tab)

  4. Linear Programming Decoding for Non-Uniform Sources and for Binary Channels With Memory

    … is assumed that communication takes place over a memoryless channel and that the source is uniform. Here, we extend the LP decoding paradigm by studying its application to scenarios with source non-uniformity and to decoding over channels with memory. We develop two decoders for the scenario of …

    queens Repository record for Linear Programming Decoding for Non-Uniform Sources and for Binary Channels With Memory (opens in a new tab)

  5. Coding for Frequency-Hopped Spread-Spectrum Channels With Partial-Band Interference

    … of codes on frequency-hopped spread-spectrum channels with partial-band interference is investigated. The asymptotic performance of codes is measured by the channel capacity and the random coding exponent. The performance of specific codes is measured by the bit error probability. The channel …

    uiuc Repository record for Coding for Frequency-Hopped Spread-Spectrum Channels With Partial-Band Interference (opens in a new tab)

  6. Polar Coding in Certain New Transmission Environments

    … as an asymptotically capacity-achieving code with sufficient performance advantages to merit inclusion in the 5G standard. Polar codes are constructed directly from an explicit model of the communication channel, so their performance is dependent on a detailed understanding of the transmission …

    vt Repository record for Polar Coding in Certain New Transmission Environments (opens in a new tab)

  7. Equalization Using Graphical Models

    … for the equalization of digital communication channels with memory. Graphical models provide a framework in which the structure of large systems can be exploited to derive efficient estimation algorithms. Furthermore, properties of a graph on which an algorithm is based can be used for …

    uiuc Repository record for Equalization Using Graphical Models (opens in a new tab)

  8. Joint Equalization and Decoding via Convex Optimization

    … parity-check (LDPC) codes on finite-state channels (FSCs). Hard-disk drives (or magnetic recording systems), where the required error rate (after decoding) is too low to be verifiable by simulation, are most important applications of this research. Recently, LDPC codes have attracted a lot …

    tdl Repository record for Joint Equalization and Decoding via Convex Optimization (opens in a new tab)

  9. Metrics, fundamental trade-offs and control policies for delay-sensitive applications in volatile environments

    With the explosion of consumer demand, media streaming will soon be the dominant type of Internet traffic. Since such applications are intrinsically delay-sensitive, the conventional network control policies and coding algorithms may not be appropriate tools for data dissemination over networks. …

    mit Repository record for Metrics, fundamental trade-offs and control policies for delay-sensitive applications in volatile environments (opens in a new tab)