NEW DECODING STRATEGY FOR THE 32-DIMENSIONAL BARNES-WALL LATTICE

1993-06-24
YUCEL, MD
ISIKLI, A
For QAM signalling, a new decoding strategy which reduces the average decoding complexity of the 32-dimensional Barnes-Wall lattice is presented. The reduction is by an order of magnitude at an SNR per bit of 10.5 dB. The strategy is based on partitioning the 32-D code space into disjoint subsets. The average decoding complexity is highly dependent on the number of these subsets.
ELECTRONICS LETTERS

Suggestions

A Hierarchical Partitioning Strategy for an Efficient Parallelization of the Multilevel Fast Multipole Algorithm
Ergül, Özgür Salih (Institute of Electrical and Electronics Engineers (IEEE), 2009-06-01)
We present a novel hierarchical partitioning strategy for the efficient parallelization of the multilevel fast multipole algorithm (MLFMA) on distributed-memory architectures to solve large-scale problems in electromagnetics. Unlike previous parallelization techniques, the tree structure of MLFMA is distributed among processors by partitioning both clusters and samples of fields at each level. Due to the improved load-balancing, the hierarchical strategy offers a higher parallelization efficiency than previ...
Improvements in DOA estimation by array interpolation in non-uniform linear arrays
Yaşar, Temel Kaya; Tuncer, Temel Engin; Department of Electrical and Electronics Engineering (2006)
In this thesis a new approach is proposed for non-uniform linear arrays (NLA) which employs conventional subspace methods to improve the direction of arrival (DOA) estimation performance. Uniform linear arrays (ULA) are composed of evenly spaced sensor elements located on a straight line. ULA's covariance matrix have a Vandermonde matrix structure, which is required by fast subspace DOA estimation algorithms. NLA differ from ULA only by some missing sensor elements. These missing elements cause some gaps in...
New Pulse Shapes for CPM Signals
Doyuran, Enis; Tanık, Yalçın (2006-05-10)
A study on finding new pulse shapes for binary CPM (Continuous Phase Modulation) signals to achieve better spectral and detection performance is carried out. Under the constraint that the power spectral density stays below the GSM spectral envelope, pulse shape is optimized to minimize the error probability. Polynomials are utilized in representing pulse shapes. The performance depends on the degree of the polynomials and the pulse length (L). With 8(th) degree polynomials having 4 free parameters, optimiza...
A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions
Uyanik, K.; Turgut, Sadi (Springer Science and Business Media LLC, 2013-11-01)
In two recent papers, a sure-success version of the Grover iteration has been applied to solve the weight decision problem of a Boolean function and it is shown that it is quadratically faster than any classical algorithm (Braunstein et al. in J Phys A Math Theor 40:8441, 2007; Choi and Braunstein in Quantum Inf Process 10:177, 2011). In this paper, a new approach is proposed to generalize the Grover's iteration so that it becomes exact and its application to the same problem is studied. The regime where a ...
New Prediction for Extended Targets With Random Matrices
Granstrom, Karl; Orguner, Umut (Institute of Electrical and Electronics Engineers (IEEE), 2014-04-01)
This paper presents a new prediction update for extended targets whose extensions are modeled as random matrices. The prediction is based on several minimizations of the Kullback-Leibler divergence (KL-div) and allows for a kinematic state dependent transformation of the target extension. The results show that the extension prediction is a significant improvement over the previous work carried out on the topic.
Citation Formats
M. YUCEL and A. ISIKLI, “NEW DECODING STRATEGY FOR THE 32-DIMENSIONAL BARNES-WALL LATTICE,” ELECTRONICS LETTERS, pp. 1231–1232, 1993, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/64570.