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 15 of 15 for “"channel codes"”.

  1. Timing channel codes for covert communication and network flow tracing

    … unintended for data transmission. In a covert channel, only the sender and receiver are aware of the communication and capable of reading the transmitted message, and any other party would not be aware of the existence of this transmission. The timing channel has been studied as a medium for …

    uiuc Repository record for Timing channel codes for covert communication and network flow tracing (opens in a new tab)

  2. Quantized Guessing Random Additive Noise Decoding - A Universal Quantized Soft-Decoder

    … evaluate error correction potential of different channel codes, particularly Polar Adjusted Convolutional codes, CA-Polar codes, and CRCs.

    mit Repository record for Quantized Guessing Random Additive Noise Decoding - A Universal Quantized Soft-Decoder (opens in a new tab)

  3. Synchronization in digital communication systems: performance bounds and practical algorithms

    Communication channels often transfer signals from different transmitters. To avoid interference the available frequency spectrum is divided into non-overlapping frequency bands (bandpass channels) and each transmitter is assigned to a different bandpass channel. The transmission of a signal over a …

    ghent Repository record for Synchronization in digital communication systems: performance bounds and practical algorithms (opens in a new tab)

  4. Joint source channel coding for progressive image transmission

    … those embedded bit streams are very sensitive to channel noise and protections from channel coding are necessary. Typical error correcting capability of channel codes varies according to different channel conditions. Thus, separate design leads to performance degradation relative to what could be …

    njit Repository record for Joint source channel coding for progressive image transmission (opens in a new tab)

  5. Design and Analysis of Multilevel Coded Modulation for Multi-Node Networks

    … additive white Gaussian noise (AWGN) broadcast channel, a multi-level coding architecture is proposed whose performance can approach the entire capacity region, and whose attractive features include a convenient partition of the two users’ data so that one and only one of the modulation bit …

    tdl Repository record for Design and Analysis of Multilevel Coded Modulation for Multi-Node Networks (opens in a new tab)

  6. Spatially Coupled Sparse Regression Codes for Single- and Multi-user Communications

    Sparse regression codes (SPARCs) are a class of channel codes for efficient communication over the single-user additive white Gaussian noise (AWGN) channel at rates approaching the channel capacity. In a standard SPARC, codewords are sparse linear combinations of columns of an i.i.d. Gaussian …

    cambridge Repository record for Spatially Coupled Sparse Regression Codes for Single- and Multi-user Communications (opens in a new tab)

  7. Multiple access networks over finite fields : optimality of separation, randomness and linearity

    … multiple access noisy as well as noise-free channel in which the received, transmit and noise alphabets belong to a finite field. We show that source-channel separation holds when the additive noise is independent of inputs. However, for input-dependent noise, separation may not hold. For …

    mit Repository record for Multiple access networks over finite fields : optimality of separation, randomness and linearity (opens in a new tab)

  8. Near-capacity fixed-rate and rateless channel code constructions

    Fixed-rate and rateless channel code constructions are designed for satisfying conflicting design tradeoffs, leading to codes that benefit from practical implementations, whilst offering a good bit error ratio (BER) and block error ratio (BLER) performance. More explicitly, two novel low-density …

    soton Repository record for Near-capacity fixed-rate and rateless channel code constructions (opens in a new tab)

  9. Sparse graph codes for compression, sensing, and secrecy

    Sparse graph codes were first introduced by Gallager over 40 years ago. Over the last two decades, such codes have been the subject of intense research, and capacity approaching sparse graph codes with low complexity encoding and decoding algorithms have been designed for many channels. Motivated …

    mit Repository record for Sparse graph codes for compression, sensing, and secrecy (opens in a new tab)

  10. Adaptation For Multi-Antenna Systems

    … to adapt MIMO systems in the presence of varying channel conditions typically focus on characterizing the performance of a limited and predefined set of joint MoDem/CoDec and MIMO configurations over a representative set of channel realizations. Other work has attempted to adapt only the MIMO …

    vt Repository record for Adaptation For Multi-Antenna Systems (opens in a new tab)

  11. Distributed medium access control for an enhanced physical-link layer interface

    … enhanced interface is supported by a distributed channel coding theory, which equips each physical layer user with an ensemble of channel codes. The coding theory allows each transmitter to choose an arbitrary code to encode its message without sharing such a decision with the receiver. The …

    colostate Repository record for Distributed medium access control for an enhanced physical-link layer interface (opens in a new tab)

  12. Digital communication receiver algorithms and architectures for reduced complexity and high throughput

    … near-optimal detection performance for MIMO channels. In order to improve the performance of tree detection, a look-ahead path metric is employed that accounts for the impact of unvisited paths of the tree via an unconstrained linear MMSE estimator. Based on an analysis of the probability of …

    uiuc Repository record for Digital communication receiver algorithms and architectures for reduced complexity and high throughput (opens in a new tab)

  13. Multi-dimensional direct-sequence spread spectrum multiple-access communication with adaptive channel coding

    … systems. This scheme is known as adaptive channel coding, and gives a system the ability to firstly sense changes in conditions, and secondly, to adapt to these changes, exploiting the fact that under good channel conditions, a very simple or even no channel coding scheme can be used for …

    pretoria Repository record for Multi-dimensional direct-sequence spread spectrum multiple-access communication with adaptive channel coding (opens in a new tab)

  14. Deep code: representation and learning algorithms for neural networks & their applications to communication codes

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms

    uiuc Repository record for Deep code: representation and learning algorithms for neural networks & their applications to communication codes (opens in a new tab)

  15. Near-capacity co-located and distributed MIMO systems

    … namely on Generalized Multi-Layer Space-Time Codes (GMLST), which may be viewed as a composite of V-BLAST and STC, hence they provide both multiplexing and diversity gains. The basic decoding procedure conceived for our GMLST arrangement is a certain ordered successive decoding scheme, which …

    soton Repository record for Near-capacity co-located and distributed MIMO systems (opens in a new tab)