• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 351
  • 65
  • 51
  • 33
  • 17
  • 17
  • 17
  • 17
  • 17
  • 17
  • 8
  • 5
  • 3
  • 3
  • 1
  • Tagged with
  • 846
  • 846
  • 406
  • 279
  • 267
  • 137
  • 134
  • 130
  • 111
  • 107
  • 104
  • 96
  • 87
  • 86
  • 81
  • 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.
541

Network coding for next-generation networks

Bhadra, Sandeep 29 August 2008 (has links)
Not available / text
542

Information-theoretic security under computational, bandwidth, and randomization constraints

Chou, Remi 21 September 2015 (has links)
The objective of the proposed research is to develop and analyze coding schemes for information-theoretic security, which could bridge a gap between theory an practice. We focus on two fundamental models for information-theoretic security: secret-key generation for a source model and secure communication over the wire-tap channel. Many results for these models only provide existence of codes, and few attempts have been made to design practical schemes. The schemes we would like to propose should account for practical constraints. Specifically, we formulate the following constraints to avoid oversimplifying the problems. We should assume: (1) computationally bounded legitimate users and not solely rely on proofs showing existence of code with exponential complexity in the block-length; (2) a rate-limited public communication channel for the secret-key generation model, to account for bandwidth constraints; (3) a non-uniform and rate-limited source of randomness at the encoder for the wire-tap channel model, since a perfectly uniform and rate-unlimited source of randomness might be an expensive resource. Our work focuses on developing schemes for secret-key generation and the wire-tap channel that satisfy subsets of the aforementioned constraints.
543

Fast and efficient video coding based on communication and computationscheduling on multiprocessors

Leung, Kwong-Keung., 梁光強. January 2001 (has links)
published_or_final_version / abstract / toc / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy
544

Improved processing techniques for picture sequence coding

蔡固庭, Choi, Koo-ting. January 1998 (has links)
published_or_final_version / Electrical Engineering / Master / Master of Philosophy
545

AN APPLICATION OF SERIAL, PARALLEL, AND INTEGRALITY MODELS TO THE ENCODING AND DISCRIMINATION PROCESSES

Decker, Larry Raymond, 1941- January 1972 (has links)
No description available.
546

New results on coding for M-ary runlength-limited channels

Datta, Suparna 12 1900 (has links)
No description available.
547

Error control techniques for the compound charnel.

Dmuchalsky, Theodore John. January 1971 (has links)
No description available.
548

Residue number system coded differential space-time-frequency coding.

Akol, Roseline Nyongarwizi. January 2007 (has links)
The rapidly growing need for fast and reliable transmission over a wireless channel motivates the development of communication systems that can support high data rates at low complexity. Achieving reliable communication over a wireless channel is a challenging task largely due to the possibility of multipaths which may lead to intersymbol interference (ISI). Diversity techniques such as time, frequency and space are commonly used to combat multipath fading. Classical diversity techniques use repetition codes such that the information is replicated and transmitted over several channels that are sufficiently spaced. In fading channels, the performance across some diversity branches may be excessively attenuated, making throughput unacceptably small. In principle, more powerful coding techniques can be used to maximize the diversity order. This leads to bandwidth expansion or increased transmission power to accommodate the redundant bits. Hence there is need for coding and modulation schemes that provide low error rate performance in a bandwidth efficient manner. If diversity schemes are combined, more independent dimensions become available for information transfer. The first part of the thesis addresses achieving temporal diversity through employing error correcting coding schemes combined with interleaving. Noncoherent differential modulation does not require explicit knowledge or estimate of the channel, instead the information is encoded in the transitions. This lends itself to the possibility of turbo-like serial concatenation of a standard outer channel encoder with an inner modulation code amenable to noncoherent detection through an interleaver. An iterative approach to joint decoding and demodulation can be realized by exchanging soft information between the decoder and the demodulator. This has been shown to be effective and hold hope for approaching capacity over fast fading channels. However most of these schemes employ low rate convolutional codes as their channel encoders. In this thesis we propose the use of redundant residue number system codes. It is shown that these codes can achieve comparable performance at minimal complexity and high data rates. The second part deals with the possibility of combining several diversity dimensions into a reliable bandwidth efficient communication scheme. Orthogonal frequency division multiplexing (OFDM) has been used to combat multipaths. Combining OFDM with multiple-input multiple-output (MIMO) systems to form MIMO-OFDM not only reduces the complexity by eliminating the need for equalization but also provides large channel capacity and a high diversity potential. Space-time coded OFDM was proposed and shown to be an effective transmission technique for MIMO systems. Spacefrequency coding and space-time-frequency coding were developed out of the need to exploit the frequency diversity due to multipaths. Most of the proposed schemes in the literature maximize frequency diversity predominantly from the frequency-selective nature of the fading channel. In this thesis we propose the use of residue number system as the frequency encoder. It is shown that the proposed space-time-frequency coding scheme can maximize the diversity gains over space, time and frequency domains. The gain of MIMO-OFDM comes at the expense of increased receiver complexity. Furthermore, most of the proposed space-time-frequency coding schemes assume frequency selective block fading channels which is not an ideal assumption for broadband wireless communications. Relatively high mobility in broadband wireless communications systems may result in high Doppler frequency, hence time-selective (rapid) fading. Rapidly changing channel characteristics impedes the channel estimation process and may result in incorrect estimates of the channel coefficients. The last part of the thesis deals with the performance of differential space-time-frequency coding in fast fading channels. / Thesis (Ph.D.)-University of KwaZulu-Natal, Durban, 2007.
549

Compression of computer animation frames

Yun, Hee Cheol 05 1900 (has links)
No description available.
550

An improved mixed excitation linear predicitive (MELP) coder

Unno, Takahiro 12 1900 (has links)
No description available.

Page generated in 0.0391 seconds