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 20 of 151 for “"convolutional codes"”.

  1. On Woven Convolutional Codes

    Concatenation of several conventional convolutional encoders is a both powerful and practical method to obtain encoding schemes that are attractive for use in communication systems where very low error probabilities are needed. This thesis is devoted to woven convolutional codes, a construction …

    lund Repository record for On Woven Convolutional Codes (opens in a new tab) Download PDF for On Woven Convolutional Codes (opens in a new tab)

  2. Construction of ternary convolutional codes

    … reliably transfer data through noisy channels. Convolutional codes are widely used for this purpose because they are easy to encode and decode and so have been employed in numerous communication systems. The focus of this thesis is a search for new and better ternary convolutional codes with …

    uvic Repository record for Construction of ternary convolutional codes (opens in a new tab)

  3. Two-generator binary convolutional codes

    … of the spectra of two-generator binary convolutional codes was carried out. Properties of the code tree were used to minimize the computations required in the search. The codes thus obtained are then evaluated by means of comparison to best known upper and lower bounds; with respect to …

    rice Repository record for Two-generator binary convolutional codes (opens in a new tab)

  4. Concatenation of punctured convolutional codes.

    The cascading or concatenation of error control codes is a well-established technique in digital communications. This type of code can yield excellent bit error rate performance. Concatenated codes that contain short memory convolutional codes are applicable to many communication links. The …

    arizona-thes Repository record for Concatenation of punctured convolutional codes. (opens in a new tab)

  5. Some distance properties of convolutional codes

    Various representations of convolutional codes useful in analyzing distance properties are presented. Row distance, column distance, minimum distance, and free distance are defined. Known bounds on these distances are summarized, and where instructive, the methods of proof are indicated. A novel …

    nps Repository record for Some distance properties of convolutional codes (opens in a new tab)

  6. SNR-Adaptive Constellation Design for Convolutional Codes

    … this thesis aims to present an SNR-adaptive convolutionally coded transmission model where the simplicity of a convolutional encoder has combined with current advanced optimization ability. Basically, the proposed transmission model combines one-shot decoding superiority of convolutional …

    carleton Repository record for SNR-Adaptive Constellation Design for Convolutional Codes (opens in a new tab)

  7. Sequential decoding of time-varying convolutional codes.

    A discussion of convolutional encoding and sequential decoding is given as background for the experimental phase of this research. A modified stack algorithm is programmed to simulate a sequential decoder for use in the study of time-varying convolutional codes. The decoder simulator is used to …

    nps Repository record for Sequential decoding of time-varying convolutional codes. (opens in a new tab)

  8. Implementation of Parallel and Serial Concatenated Convolutional Codes

    Parallel concatenated convolutional codes (PCCCs), called "turbo codes" by their discoverers, have been shown to perform close to the Shannon bound at bit error rates (BERs) between 1e-4 and 1e-6. Serial concatenated convolutional codes (SCCCs), which perform better than PCCCs at BERs lower than …

    vt Repository record for Implementation of Parallel and Serial Concatenated Convolutional Codes (opens in a new tab)

  9. A PC-Based Simulation for Convolutional Codes Using Viterbi Decoding

    … in space and satellite communication systems is convolutional coding. Channel encoding is only practical if it provides substantial improvement over the uncoded signal with a moderate hardware investment. The optimal approach to decoding convolutional codes is the Maximum-Likelihood method. This …

    ucf Repository record for A PC-Based Simulation for Convolutional Codes Using Viterbi Decoding (opens in a new tab)

  10. The application of convolutional codes to the high frequency channel.

    … to obtain parameters for choosing appropriate convolutional codes. Short threshold decodable convolutional codes with only a moderate amount of interleaving are shown to be capable of affecting a reduction in the output error probability by at least an order of magnitude, for uncoded error …

    nps Repository record for The application of convolutional codes to the high frequency channel. (opens in a new tab)

  11. Some Optimal and Near-Optimal Low Rate Algebraic Convolutional Codes

    Made available in DSpace on 2014-12-14T13:09:41Z (GMT). No. of bitstreams: 1 8004161.pdf: 2733449 bytes, checksum: 8d8ffe6487a5994678a19af55d7627f5 (MD5) Previous issue date: 1979

    uiuc Repository record for Some Optimal and Near-Optimal Low Rate Algebraic Convolutional Codes (opens in a new tab)

  12. Dual domain decoding of high rate convolutional codes for iterative decoders

    … addresses the problem of decoding high rate convolutional codes directly without resorting to puncturing. High rate codes are necessary for applications which require high bandwidth efficiency, like high data rate communication systems and magnet recording systems. Convolutional (rate k/n) …

    adelaide Repository record for Dual domain decoding of high rate convolutional codes for iterative decoders (opens in a new tab)

Page 1 of 8