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 38 for “"Sphere decoding"”.
-
Adaptive Sphere Decoding and Radius Selection with Error Analysis in Sphere Decoding
… the closest lattice point to a given point. Sphere decoding is often applied to the searching of the closest lattice point.</p> <p>An improved sphere decoding method, named adaptive sphere decoding, is discussed in this thesis. This method is examined from various views such as geometric …
-
A Fast Sphere Decoding Algorithm for Rank Deficient MIMO Systems
… the complexity and the processing time of the decoding algorithms, some suboptimal algorithms were introduced. One of the most efficient suboptimal solutions for this problem is based on the Minimum mean square error decision-feedback equalizer (MMSE-DFE) followed by either sphere decoder or …
-
Recursive Tree Search Maximum-Likelihood Detection for Underdetermined Systems
… squares (UBILS) can be used to represent the decoding problem of overloaded communication networks. Maximum likelihood (ML) detection provides optimal performance but suffers from high exponential complexity. User-by-user sequential interference cancellation (SIC), which decodes users in power …
-
Co-located and distributed multicarrier space-time shift keying for wideband channels
… Furthermore, a multiple-symbol differential sphere decoding (MSDSD) aided multicarrier STSK arrangement is proposed to dispense with channel estimation (CE).<br/><br/>We design a novel modality of realizing STSK amalgamated with OFDM for facilitating high-rate data-transmissions through a …
-
Efficient soft decoding techniques for reed-solomon codes
… focus of this thesis is on finding efficient decoding methods for Reed-Solomon (RS) codes, i.e., algorithms with acceptable performance and affordable complexity. Three classes of decoders are considered including sphere decoding, belief propagation decoding and interpolation-based decoding. …
-
Polar Codes Decoding Algorithms and FPGA-based Hardware Architectures
… weakness, various polar code constructions and decoding algorithms have been proposed. In this thesis, we first study all the significant developments in the field of polar coding covering 1) major signal-to-noise ratio (SNR)-dependent code constructions as well as universal reliability …
-
Iterative joint detection and decoding of LDPC-Coded V-BLAST systems
Soft iterative detection and decoding techniques have been shown to be able to achieve near-capacity performance in multiple-antenna systems. To obtain the optimal soft information by marginalization over the entire observation space is intractable; and the current literature is unable to guide us …
-
Ανάπτυξη αλγορίθμων για χωροχρονικούς εξισωτές ασύρματων τηλεπικοινωνιακών διαύλων
… estimation. The proposed schemes use the sphere decoding algorithm for data detection, and short training sequences for an initial channel estimation. Three new algorithms were developed for block- and continuous-fading frequency flat MIMO channels. The effects on the algorithms' …
-
Performance Evaluation of 5G MIMO DetectorsWith Deep Learning
… and benchmarked against Maximum likelihood (ML), sphere decoding, and MMSE detection. Performance metrics including bit error rate (BER), symbol error rate (SER), processing speed, and computational complexity are evaluated. The results highlight trade-offs between accuracy and efficiency and …
-
Efficient Lattice Decoders for the Linear Gaussian Vector Channel: Performance & Complexity Analysis
… (MIMO) wireless communication systems, sphere decoders has become an attractive efficient implementation of lattice decoders, especially for small signal dimensions and/or moderate to large signal-to-noise ratios (SNRs). In the first part of this dissertation, we consider sphere decoding …
-
Single Input Multiple Output Media Based Modulation
… detection algorithm for MBM using ideas from sphere decoding. Various methods of improving computation speed at a cost of introducing approximation error are also presented. An approximate ML symbol detection algorithm is presented in which the search radius is determined by the infinity norm …
-
Algoritmos paralelos para la solución de problemas de optimización discretos aplicados a la decodificación de señales
… no basados en derivadas) y de los métodos Sphere-Decoding (pertenecientes al esquema de Ramificación y Poda). En segundo lugar, se ha abordado la paralelización de estos métodos dirigida a distintas arquitecturas, bien sea arquitecturas con memoria compartida, memoria distribuida y esquemas …
-
VLSI Implementation of Low Power Reconfigurable MIMO Detector
… to different modulation schemes. MIMO decoding in our detector is based on the fixed sphere decoding algorithm which has been simplified for an effective VLSI implementation without considerably degrading the near optimal bit error rate performance. The regularity of the architecture …
-
Blind detection designs with unique identification in two-way relay channels
… the LSE receiver, a parallel iterative sphere decoding scheme is investigated. The low complexity of this scheme allows that the joint estimation and detection of the channel coe?cients and transmitted symbols can be e?ciently implemented. In the third system, multiple antennas are …
-
Machine Learning Approaches for Faster-than-Nyquist (FTN) Signaling Detection
… the computational complexity of the known list sphere decoding (LSD) algorithm. In essence, the LSD is one of the algorithm that can be used for the detection process of the FTN signaling; however, at huge computational complexity. Simulation results show the proposed DL-based LSD reduces …
-
A new generic maximum-likelihood metric expression for space-time block codes with applications to decoding
… a simple low-complexity maximum-likelihood (ML) decoding algorithm. However, OSTBCs are limited in their error performance. This has led to the development of more general linear space-time block codes, such as quasi-orthogonal space-time block codes (QOSTBCs). QOSTBCs offer better error …
-
Algorithms for sparse and structurally constrained discrete optimization problems in bioinformatics and communications
… problem. We propose the sparsity-aware sphere decoding algorithm for finding a near-optimal solution to this problem, analyze its computational complexity for commonly used alphabets, and propose its fast variant. These algorithms can be successfully applied to a variety of settings, as …
-
Gallager’s random coding exponent for differential space time modulation
… with low to moderate code lengths, i.e. with decoding delay constraints. In this context we also analyze space-time transmission systems with spatial correlation between antennas. Such an analysis allows for a fair comparison of DSTM with MSDD where the window size may vary but the coded …
-
Low-dimensional Lattice Codes for Bidirectional Relaying
… been shown that using lattice codes and lattice decoding, a rate of 1/2 log_2(1/2 plus snr) can be obtained asymptotically, which is essentially optimal at high SNR. However, there has been a lack of practical encoding/decoding schemes for the above mentioned system. We address this issue in this …
-
Designing Multidimensional Constellations and Efficient Detection Schemes for Sparse Code Multiple Access (SCMA) Systems
… and in the presence of 5G-compliant LDPC codes. Sphere decoding (SD) based detection schemes for SCMA have recently received attention due to their promising features. However, the existing SD-based schemes can only be applied to systems with constellations that possess a certain structure. In …
Page 1 of 2