Log in

Relevant bibliographies by topics / Linear decoder / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Linear decoder.

Dissertations / Theses on the topic 'Linear decoder'

Author: Grafiati

Published: 28 May 2022

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 17 dissertations / theses for your research on the topic 'Linear decoder.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Lim, Melvin Chi Hearn. "Linear Precoder and Decoder Design for the Multiuser MIMO Downlink." Thesis, University of Leeds, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.509007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Борисенко, Олексій Андрійович, Алексей Андреевич Борисенко, Oleksii Andriiovych Borysenko та Д. В. Гутенко. "Помехоустойчивость линейного дешифратора". Thesis, Изд-во СумГУ, 2009. http://essuir.sumdu.edu.ua/handle/123456789/4407.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Collison, Sean Michael. "Extending the Dorsch decoder for efficient soft decision decoding of linear block codes." Pullman, Wash. : Washington State University, 2009. http://www.dissertations.wsu.edu/Thesis/Spring2009/s_collison_042309.pdf.

Full text

Abstract:

Thesis (M.S. in computer engineering)--Washington State University, May 2009.<br>Title from PDF title page (viewed on May 21, 2009). "School of Electrical Engineering and Computer Science." Includes bibliographical references (p. 64-65).

APA, Harvard, Vancouver, ISO, and other styles

4

Varadarajan, Badri. "The Design of Linear Space-Time Codes for Quasi-static Flat-fading Channels." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/5030.

Full text

Abstract:

The reliability and data rate of wireless communication have traditionally been limited by the presence of multipath fading in wireless channels. However, dramatic performance improvements can be obtained by the use of multiple transmit and receive antennas. Specifically, multiple antennas increase reliability by providing diversity gain, namely greater immunity to deep channel fades. They also increase data rates by providing multiplexing gain, i.e., the ability to multiplex multiple symbols in one signaling interval. Harvesting the potential benefits of multiple antennas requires the use o

APA, Harvard, Vancouver, ISO, and other styles

5

HICKS, CHRISTOPHER D. "PERFORMANCE ANALYSIS OF MIMO LINEAR PRECODERS/DECODERS." University of Cincinnati / OhioLINK, 2006. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1154397576.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Coso, Sánchez Aitor del. "Achievable rates for Gaussian Channels with multiple relays." Doctoral thesis, Universitat Politècnica de Catalunya, 2008. http://hdl.handle.net/10803/6919.

Full text

Abstract:

Los canales múltiple-entrada-múltiple-salida (MIMO) han sido ampliamente propuestos para superar los desvanecimientos aleatorios de canal en comunicaciones inalámbricas no selectivas en frecuencia. Basados en equipar tanto transmisores como receptores con múltiple antenas, sus ventajas son dobles. Por un lado, permiten al transmisor: i) concentrar la energía transmitida en una dirección-propia determinada, o ii) codificar entre antenas con el fin de superar desvanecimientos no conocidos de canal. Por otro lado, facilitan al receptor el muestreo de la señal en el dominio espacial. Esta operació

APA, Harvard, Vancouver, ISO, and other styles

7

Gregoratti, David. "Randomized space-time block coding for the multiple-relay channel." Doctoral thesis, Universitat Politècnica de Catalunya, 2010. http://hdl.handle.net/10803/6949.

Full text

Abstract:

En la última década, la cooperación entre usuarios ha generado un gran interés por la posibilidad de mejorar la velocidad de transmisión en las redes de comunicaciones inalámbricas. El objetivo es formar un array con las antenas de todos los dispositivos y, de esta forma, aplicar técnicas de procesado espacio-temporal. El esquema de cooperación más sencillo es el canal con relays: todos los terminales que escuchen una comunicación entre dos puntos pueden ayudar a la fuente retransmitiendo lo que hayan recibido.<br/><br/>En un sistema realista, los relays no disponen de información sobre el can

APA, Harvard, Vancouver, ISO, and other styles

8

Yang, Ming-Jer, and 楊明哲. "Error Protected Code Excited Linear Predictive Decoder for Robust." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/34992554793580767872.

Full text

Abstract:

碩士<br>國立成功大學<br>電機工程研究所<br>82<br>In this thesis, we propose a line spectral frequencies (LSFs) interpolation algorithm and a stochastic gain predictor in the decoder to improve the speech quality when the transmission channel is contaminated by heavy noise. The LSFs transformed from the LPC coefficients possess ordinal characteristics, which provides a potential advantage against channel errors. In addition, the stochastic gain can be successfully estimated by a predic

APA, Harvard, Vancouver, ISO, and other styles

9

Doddi, Srujana. "VLSI design and implementation of non-linear decoder combined with linear decompressor to achieve greater test vector compression." Thesis, 2010. http://hdl.handle.net/2152/ETD-UT-2010-05-1114.

Full text

Abstract:

This paper investigates the cost-tradeoffs of implementing a test data compression technique previously presented in [Lee 06] which uses a small non-linear decoder combined with a linear decompressor to achieve greater test data compressions. The non-linear decoder is a sequential non-linear decompressor that exploits bit-wise and pattern-wise correlations in test vectors. This paper further emphasizes the design and implementation side of the proposed test data compressor. The linear decompressor used in this design is a Linear Feedback Shift Register (LFSR) which after choosing the right see

APA, Harvard, Vancouver, ISO, and other styles

10

Meng, Jin. "Linear Interactive Encoding and Decoding Schemes for Lossless Source Coding with Decoder Only Side Information." Thesis, 2008. http://hdl.handle.net/10012/3928.

Full text

Abstract:

Near lossless source coding with side information only at the decoder, was first considered by Slepian and Wolf in 1970s, and rediscovered recently due to applications such as sensor network and distributed video coding. Suppose X is a source and Y is the side information. The coding scheme proposed by Slepian and Wolf, called SW coding, in which information only flows from the encoder to the decoder, was shown to achieve the rate H(X|Y) asymptotically for stationary ergodic source pairs, but not for non-ergodic case, shown by Yang and He. Recently, a new source coding paradigm called interact

APA, Harvard, Vancouver, ISO, and other styles

11

Tai, Chao-Liang, and 戴肇良. "Design and Implementation of a Soft Linear Block Code Decoder with a Modified A* algorithm." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/19648054511395897057.

Full text

Abstract:

碩士<br>臺灣大學<br>電信工程學研究所<br>98<br>A* algorithm is a tree search algorithm, which is used to find the shortest path within a graph with branch and bound approach to determine the metric of each vertex in a tree. This algorithm estimates metrics between each vertex and target so that it can prune irrelevant vertexes in the early searching phase so as to find the most likely answer in a short period of time and achieve the goal of increasing efficiency. A* algorithm has been used to implement maximum-likelihood soft-decoding of linear block codes. It can minimize the search edges so as to improve t

APA, Harvard, Vancouver, ISO, and other styles

12

Susanto, Misfa, Yim Fun Hu, and Prashant Pillai. "Joint random linear network coding and convolutional code with interleaving for multihop wireless network." 2013. http://hdl.handle.net/10454/9737.

Full text

Abstract:

No<br>Abstract: Error control techniques are designed to ensure reliable data transfer over unreliable communication channels that are frequently subjected to channel errors. In this paper, the effect of applying a convolution code to the Scattered Random Network Coding (SRNC) scheme over a multi-hop wireless channel was studied. An interleaver was implemented for bit scattering in the SRNC with the purpose of dividing the encoded data into protected blocks and vulnerable blocks to achieve error diversity in one modulation symbol while randomising errored bits in both blocks. By combining the

APA, Harvard, Vancouver, ISO, and other styles

13

KUO, I.-CHUNG, and 郭宜忠. "A Fast Calibrationless Method for Non-Linear Distortion Correction in Barcode Decoding:An Implementation of Industrial Aztec(ISO/IEC24778) 2D Barcode Decoder." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/40388974760491058253.

Full text

Abstract:

碩士<br>亞洲大學<br>生物資訊學系碩士班<br>99<br>In this study, we follow international standard ISO/IEC 24778 to design and implement, under an industrial vision development platform, a high-performance Aztec 2D barcode decoder with a new calibrationless correction method for non-linear distortion. The proposed correction method horizontally and vertically fits the edges of a non-linear distorted barcode images to two sets of trajectory equations, respectively. References of the trajectory behaviors are those four distorted barcode boundary lines, which were straight before distortion. These best-fit traject

APA, Harvard, Vancouver, ISO, and other styles

14

Abediseid, Walid. "Efficient Lattice Decoders for the Linear Gaussian Vector Channel: Performance & Complexity Analysis." Thesis, 2011. http://hdl.handle.net/10012/6271.

Full text

Abstract:

The theory of lattices --- a mathematical approach for representing infinite discrete points in Euclidean space, has become a powerful tool to analyze many point-to-point digital and wireless communication systems, particularly, communication systems that can be well-described by the linear Gaussian vector channel model. This is mainly due to the three facts about channel codes constructed using lattices: they have simple structure, their ability to achieve the fundamental limits (the capacity) of the channel, and most importantly, they can be decoded using efficient decoders called lattice de

APA, Harvard, Vancouver, ISO, and other styles

15

Tu, Ying-Wei, and 杜英維. "Reduction of Linear Crosstalk over Arrayed-Waveguide-Grating-Based Optical CDMA Network Coder/Decoders." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/36054097598998016436.

Full text

Abstract:

碩士<br>國立成功大學<br>電腦與通信工程研究所<br>97<br>This paper presents a compact optical code-division multiple-access (OCDMA) network coder-decoder (codec) with crosstalk reduction mechanism. The transmitter/receiver codecs is constructed based on cascaded dual AWGs which generate a pure crosstalk term, named a pilot signal in the paper. The pilot signal has the same spectral distribution with every user’s coherent term of in-band crosstalk noise, but the intensity of pilot signal and crosstalk noise are different. In order to apply this pilot signal to eliminate the in-band linear crosstalk beat noise comp

APA, Harvard, Vancouver, ISO, and other styles

16

Staphorst, Leonard. "Viterbi Decoded Linear Block Codes for Narrowband and Wideband Wireless Communication Over Mobile Fading Channels." Diss., 2005. http://hdl.handle.net/2263/27090.

Full text

Abstract:

Since the frantic race towards the Shannon bound [1] commenced in the early 1950’s, linear block codes have become integral components of most digital communication systems. Both binary and non-binary linear block codes have proven themselves as formidable adversaries against the impediments presented by wireless communication channels. However, prior to the landmark 1974 paper [2] by Bahl et al. on the optimal Maximum a-Posteriori Probability (MAP) trellis decoding of linear block codes, practical linear block code decoding schemes were not only based on suboptimal hard decision algorithms, b

APA, Harvard, Vancouver, ISO, and other styles

17

Μέρμιγκας, Παναγιώτης. "Αποκωδικοποιητής μέγιστης πιθανοφάνειας για κώδικες LDPC και υλοποίηση σε FPGA". Thesis, 2013. http://hdl.handle.net/10889/6012.

Full text

Abstract:

Στο πρώτο μέρος της παρούσας Διπλωματικής Εργασίας εισάγονται οι βασικές έννοιες της Θεωρίας Κωδικοποίησης και των Τηλεπικοινωνιακών Συστημάτων. Για τη διόρθωση λαθών στην περίπτωση της μετάδοσης μέσω ενός θορυβώδους καναλιού εφαρμόζεται κωδικοποίηση καναλιού με Γραμμικούς Μπλοκ Κώδικες, και πιο συγκεκριμένα Κώδικες Χαμηλής Πυκνότητας Ελέγχου Ισοτιμίας (Low-Density Parity-Check Codes, LDPC). Ορίζεται η μαθηματική περιγραφή των κωδίκων αυτών και διατυπώνονται σχετικοί ορισμοί και θεωρήματα. Επίσης, διατυπώνεται το κριτήριο Μέγιστης Πιθανοφάνειας, στο οποίο βασίζεται η ανάπτυξη του αντίστοιχου α

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!