• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 233
  • 45
  • 42
  • 10
  • 10
  • 8
  • 8
  • 8
  • 8
  • 8
  • 8
  • 6
  • 6
  • 4
  • 3
  • Tagged with
  • 433
  • 408
  • 388
  • 322
  • 318
  • 99
  • 74
  • 64
  • 60
  • 51
  • 47
  • 45
  • 45
  • 41
  • 41
  • 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.
91

LDPC Codes over Large Alphabets and Their Applications to Compressed Sensing and Flash Memory

Zhang, Fan 2010 August 1900 (has links)
This dissertation is mainly focused on the analysis, design and optimization of Low-density parity-check (LDPC) codes over channels with large alphabet sets and the applications on compressed sensing (CS) and flash memories. Compared to belief-propagation (BP) decoding, verification-based (VB) decoding has significantly lower complexity and near optimal performance when the channel alphabet set is large. We analyze the verification-based decoding of LDPC codes over the q-ary symmetric channel (q-SC) and propose the list-message-passing (LMP) decoding which off ers a good tradeoff between complexity and decoding threshold. We prove that LDPC codes with LMP decoding achieve the capacity of the q-SC when q and the block length go to infinity. CS is a newly emerging area which is closely related to coding theory and information theory. CS deals with the sparse signal recovery problem with small number of linear measurements. One big challenge in CS literature is to reduce the number of measurements required to reconstruct the sparse signal. In this dissertation, we show that LDPC codes with verification-based decoding can be applied to CS system with surprisingly good performance and low complexity. We also discuss modulation codes and error correcting codes (ECC’s) design for flash memories. We design asymptotically optimal modulation codes and discuss their improvement by using the idea from load-balancing theory. We also design LDPC codes over integer rings and fields with large alphabet sets for flash memories.
92

Propagation of updates to replicas using error correcting codes

Palaniappan, Karthik. January 2001 (has links)
Thesis (M.S.)--West Virginia University, 2001. / Title from document title page. Document formatted into pages; contains vi, 68 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 67-68).
93

A systematic approach to the design and analysis of linear algebra algorithms

Gunnels, John Andrew. January 2001 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2001. / Vita. Includes bibliographical references. Available also from UMI/Dissertation Abstracts International.
94

Reed-Muller codes in error correction in wireless adhoc networks /

Tezeren, Serdar U. January 2004 (has links) (PDF)
Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, March 2004. / Thesis advisor(s): Murali Tummala, Roberto Cristi. Includes bibliographical references (p. 133-134). Also available online.
95

A study on low complexity near-maximum likelihood spherical MIMO decoders

Liang, Ying, January 2010 (has links)
Thesis (M. Phil.)--University of Hong Kong, 2010. / Includes bibliographical references (leaves 59-61). Also available in print.
96

Error resilient video streaming over lossy networks

Lee, Yen-Chi, January 2003 (has links) (PDF)
Thesis (Ph. D.)--School of Electrical and Computer Engineering, Georgia Institute of Technology, 2004. Directed by Yucel Altunbasak. / Vita. Includes bibliographical references (leaves 141-146).
97

Hybrid ARQ with parallel and serial concatenated convolutional codes for next generation wireless communications

Chandran, Naveen, January 2001 (has links)
Thesis (M.S.)--West Virginia University, 2001. / Title from document title page. Document formatted into pages; contains xi, 113 p. : ill. (some col.). Vita. Includes abstract. Includes bibliographical references (p. 110-112).
98

MIMO wireless communications in frequency selective fading channels /

So, Daniel Ka Chun. January 2003 (has links)
Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2003. / Includes bibliographical references (leaves 136-144). Also available in electronic version. Access restricted to campus users.
99

Efficient design and decoding of the rate-compatible low-density parity-check codes /

Wu, Xiaoxiao. January 2009 (has links)
Includes bibliographical references (p. 64-67).
100

High code rate, low-density parity-check codes with guaranteed minimum distance and stopping weight /

Miller, John January 2003 (has links)
Thesis (Ph. D.)--University of California, San Diego, 2003. / Vita. Includes bibliographical references.

Page generated in 0.0474 seconds