• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 215
  • 42
  • 38
  • 10
  • 8
  • 8
  • 8
  • 8
  • 8
  • 8
  • 6
  • 4
  • 4
  • 3
  • 1
  • Tagged with
  • 381
  • 381
  • 381
  • 321
  • 316
  • 97
  • 73
  • 60
  • 57
  • 48
  • 44
  • 44
  • 44
  • 40
  • 40
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
21

Ternary error correcting line codes

Hope, John Francis 18 March 2014 (has links)
M.Ing. (Electrical and Electronic Engineering) / Please refer to full text to view abstract
22

Synchronization of cyclic codes.

Lewis, David John Head January 1969 (has links)
No description available.
23

A study of synchronization techniques for binary cyclic codes.

Tavares, Stafford Emanuel. January 1968 (has links)
No description available.
24

Study of quantum low density parity check and quantum degeneratecodes

Ho, Ki-hiu., 何其曉. January 2009 (has links)
published_or_final_version / Physics / Doctoral / Doctor of Philosophy
25

Error detection abilities of conducting students under four modes of instrumental score study.

Crowe, Don Raymond. January 1994 (has links)
This study investigated the effect of four score study styles--no score study, study with score alone, study with score and a correct aural example, and score study at the electronic keyboard--on the pitch and rhythm error detection abilities of beginning conducting students. Subjects were 30 members of undergraduate beginning conducting classes at three midwestern universities. Four tests were developed, each having 31 four- to six-measure excerpts from band literature. Each excerpt contained only one error. Excerpts were grouped according to difficulty and assigned to tests in a modified random manner to facilitate equality of difficulty between sets. Within each test, excerpts were arranged in order of increasing difficulty and rescored to contain from one to eight parts. A counterbalanced design was utilized featuring a Latin Square into which the four score study styles were entered. Over the course of four sessions subjects received all four styles and all four tests. The orders in which subjects received score study styles were assigned on a rotational basis. Each subject within a university received the tests in the same order, but this order varied between universities. Six Hypercard © (Atkinson, 1987-90) stacks were developed on a Macintosh LC computer for presentation of the tests, management of the study, and data collection. Excerpts were played through MIDI keyboards using sampled wind instrument sounds. Study with the score and a correct aural example was found to be significantly more effective than either study with the score alone or no study. No significant difference was found between score study at the keyboard and any other score study style. There were significant differences in test scores attributable to the number of parts in examples. Generally, error detection became more difficult as the number of parts in examples increased. There were no significant differences in test scores attributable to the order of presentation of score study styles, individual example sets, or groups/order of presentation of example sets. There were significant differences in means score study time per session attributable to score study style, and in mean total time per session attributable to session number.
26

Heuristic optimisation for the minimum distance problem

Chan, Evelyn Yu-San January 2000 (has links)
No description available.
27

Error control with constrained codes

04 February 2014 (has links)
M.Ing.(Electrical and Electronic Engineering) / In the ideal communication system no noise is present and no errors will be made. However, in practice, communication is over noisy channels which cause errors in the information. There is thus a necessity for the control of these errors. Furthermore, several channels impose runlength or disparity constraints on the bit stream. Until recently, the error control on these channels was applied separately to imposing the input restrictions with constrained codes. Such a system leads to poor performance under certain conditions. and is more complex and expensive to apply than systems where the error control is an integral part of the constrained code or decoder. In this study, we firstly investigate the error multiplication phenomena of constrained codes. An algorithm is presented that minimizes the error propagation probabilities of memoryless decoders according to two criteria. Another algorithm is presented along with the first to calculate the resulting bit error probabilities. The second approach to the error control of constrained codes is the construction of combined error-correcting constrained finite-state machine codes. We investigate the known construction techniques and construct several new codes using extensions of the known techniques. These codes complement or improve on the known error-correcting constrained codes with regards to either complexity, rate or error-correcting capability. Furthermore, these codes have good error behaviour and favourable power spectral densities.
28

Coding structure and properties for correcting insertion/deletion errors

08 August 2012 (has links)
D. Ing. / The digital transmission of information necessitates the compensation for disturbances introduced by the channel. The compensation method usually used in digital communications is error correcting coding. The errors usually encountered are additive in nature, i.e. errors where only symbol values are changed. Understandably, the field of additive error correcting codes has become a mature research field. Remarkable progress has been made during the past 50 years, to such an extent that near Shannon capacity can be reached using suitable coding techniques. Sometimes the channel disturbances may result in the loss and/or gain of symbols and a subsequent loss of word or frame synchronisation. Unless some precautions were made, a synchronisation error may propagate and corrupt large blocks of data. Typical precautions taken against synchronisation errors are: out-of-band clock signals distributed to the transmission equipment in a network; stringent requirements on clock stability and jitter; limits on the number of repeaters and regeneration to curb jitter and delays; line coding to facilitate better clock extraction; and - use of framing methods on the coding level. Most transmission systems in use today will stop data transmission until reliable synchronisation is restored. El multiplexing systems are still the predominantly used technology in fixed telephone line operators and GSM operators, and recovering from a loss of synchronisation (the FAS alarm) typically lasts approximately 10 seconds. Considering that the transmission speed is 2048 KB/s, a large quantity of data is lost in during this process. The purpose of this study is therefore to broaden the understanding of insertion/deletion correcting binary codes. This will be achieved by presenting new properties and coding techniques for multiple insertion/deletion correcting codes. Mostly binary codes will be considered, but in some instances, the results may also hold for non-binary codes. As a secondary purpose, we hope to generate interest in this field of study and enable other researchers to continue to deeper explore the mechanisms of insertion and/or deletion correcting codes.
29

Investigation of the use of infinite impulse response filters to construct linear block codes

Chandran, Aneesh January 2016 (has links)
A dissertation submitted in ful lment of the requirements for the degree of Masters in Science in the Information Engineering School of Electrical and Information Engineering August 2016 / The work presented extends and contributes to research in error-control coding and information theory. The work focuses on the construction of block codes using an IIR lter structure. Although previous works in this area uses FIR lter structures for error-detection, it was inherently used in conjunction with other error-control codes, there has not been an investigation into using IIR lter structures to create codewords, let alone to justify its validity. In the research presented, linear block codes are created using IIR lters, and the error-correcting capabilities are investigated. The construction of short codes that achieve the Griesmer bound are shown. The potential to construct long codes are discussed and how the construction is constrained due to high computational complexity is shown. The G-matrices for these codes are also obtained from a computer search, which is shown to not have a Quasi-Cyclic structure, and these codewords have been tested to show that they are not cyclic. Further analysis has shown that IIR lter structures implements truncated cyclic codes, which are shown to be implementable using an FIR lter. The research also shows that the codewords created from IIR lter structures are valid by decoding using an existing iterative soft-decision decoder. This represents a unique and valuable contribution to the eld of error-control coding and information theory. / MT2017
30

A system on chip based error detection and correction implementation for nanosatellites

Hillier, Caleb Pedro January 2018 (has links)
Thesis (Master of Engineering in Electrical Engineering)--Cape Peninsula University of Technology, 2018. / This thesis will focus on preventing and overcoming the effects of radiation in RAM on board the ZA cube 2 nanosatellite. The main objective is to design, implement and test an effective error detection and correction (EDAC) system for nanosatellite applications using a SoC development board. By conducting an in-depth literature review, all aspects of single-event effects are investigated, from space radiation right up to the implementation of an EDAC system. During this study, Hamming code was identified as a suitable EDAC scheme for the prevention of single-event effects. During the course of this thesis, a detailed radiation study of ZA cube 2’s space environment is conducted. This provides insight into the environment to which the satellite will be exposed to during orbit. It also provides insight which will allow accurate testing should accelerator tests with protons and heavy ions be necessary. In order to understand space radiation, a radiation study using ZA cube 2’s orbital parameters was conducted using OMERE and TRIM software. This study included earth’s radiation belts, galactic cosmic radiation, solar particle events and shielding. The results confirm that there is a need for mitigation techniques that are capable of EDAC. A detailed look at different EDAC schemes, together with a code comparison study was conducted. There are two types of error correction codes, namely error detection codes and error correction codes. For protection against radiation, nanosatellites use error correction codes like Hamming, Hadamard, Repetition, Four Dimensional Parity, Golay, BCH and Reed Solomon codes. Using detection capabilities, correction capabilities, code rate and bit overhead each EDAC scheme is evaluated and compared. This study provides the reader with a good understanding of all common EDAC schemes. The field of nanosatellites is constantly evolving and growing at a very fast speed. This creates a growing demand for more advanced and reliable EDAC systems that are capable of protecting all memory aspects of satellites. Hamming codes are extensively studied and implemented using different approaches, languages and software. After testing three variations of Hamming codes, in both Matlab and VHDL, the final and most effective version was Hamming [16, 11, 4]2. This code guarantees single error correction and double error detection. All developed Hamming codes are suited for FPGA implementation, for which they are tested thoroughly using simulation software and optimised.

Page generated in 0.0298 seconds