A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
), denoted as OST-CPM, by maintaining the orthogonality (for the fast ML decoding/demodulation) and the phase continuity of two signals from two transmit antennas. ... In this paper, we design orthogonal-like space-time coded CPM systems for three and four transmit antennas based on orthogonal and quasi-orthogonal space-time codes. ... ACKNOWLEDGMENT The authors would like to thank the anonymous reviewers for their useful comments and suggestions that have helped the clarity of the presentation of this paper. ...doi:10.1109/tit.2009.2039058 fatcat:vll73p4jcff6nfh3r4xxf72m4m
Posner (1968) has recently discussed a decoding scheme for certain orthogonal and biorthogonal codes which is based on the fast Fourier transform on a finite abelian group. ... This approach is easily understood by anyone familiar with matrix theory, and it yields results in a form convenient for implementation and generalization. ... INTRODUCTION Posner (1968) has recently discussed a scheme for decoding orthogonal and biorthogonal Reed-Muller codes which is based on the fast Fourier transform on a finite abelian group. ...doi:10.1016/s0019-9958(69)90601-9 fatcat:452mmzr76fc2tbfo6qlcoulcq4
A new code is presented that tests commonly accepted design principles and for which decoding by conditional optimization is both fast and ML. ... This paper focuses on conditional optimization as a decoding primitive for high rate space-time codes that are obtained by multiplexing in the spatial and code domains. ... Section VII presents a new code that tests commonly accepted design principles for space-time block codes (STBC) and for which decoding by conditional optimization is both fast and ML. ...doi:10.1109/tit.2009.2039069 fatcat:z7zotzbrvfcu7b3alzmoytztb4
2008 IEEE International Zurich Seminar on Communications
We focus on full-rate, fast-decodable space-time block codes (STBCs) for 2 2 2 and 4 2 2 multiple-input multiple-output (MIMO) transmission. ... Index Terms-Alamouti code, decoding complexity, multiple-input multiple-output (MIMO), quasi-orthogonal space-time block codes (STBCs), sphere decoder. ... ACKNOWLEDGMENT The authors are grateful for the constructive comments of the anonymous reviewers. ...doi:10.1109/izs.2008.4497289 fatcat:djfhfr64xngjzncalsoreamufq
We focus on full-rate, fast-decodable space-time block codes (STBCs) for 2 2 2 and 4 2 2 multiple-input multiple-output (MIMO) transmission. ... Index Terms-Alamouti code, decoding complexity, multiple-input multiple-output (MIMO), quasi-orthogonal space-time block codes (STBCs), sphere decoder. ... ACKNOWLEDGMENT The authors are grateful for the constructive comments of the anonymous reviewers. ...doi:10.1109/tit.2008.2009817 fatcat:s7tph4xutjdrfmiqtulf3chsji
This letter introduces two fast maximum-likelihood (ML) detection methods for 4*4 quasi-orthogonal space-time block code (QOSTBC). ... Both decoders utilize a novel decomposition technique for ML metric which divides the metric into independent positive parts and a positive interference part. ... QUASI-ORTHOGONAL SPACE TIME BLOCK CODE where , and the data symbols , , belong to constellation . ...arXiv:1706.03833v1 fatcat:jazhpkhlyva6jc7z6zcv3ji4ci
Moreover, a fast decoding method is developed and tested by comparing the obtained results with both the uncoded system performance and two approximate message passing (AMP) algorithms. ... The recently proposed superposition codes (SCs) have been mathematically proved to be decoded at any rate below the capacity, for additive white Gaussian noise (AWGN) channels. ... algorithm We here propose a novel fast and simple decoding scheme for superposition codes. ...doi:10.1186/s13638-017-0927-y fatcat:o2cmd2bbkjcztb6vlbgtsmdeem
We focus on full-rate, fast-decodable space-time block codes (STBCs) for 2x2 and 4x2 multiple-input multiple-output (MIMO) transmission. ... In particular, we describe a reduced-complexity sphere decoding algorithm suitable for QAM signal constellations. ... FAST-DECODABLE CODES FOR 2 × 2 MIMO, AND ML DECODING Consider now full-rate (R = 2) and full-diversity fastdecodable 2 × 2 STBCs, i.e., with κ = 4 symbols/codeword and r = n t . ...arXiv:0708.2804v2 fatcat:ox27npmlfbhjzphgdcrpmgl37u
ORTHOGONAL FREQUENCY DIVISION MULTIPLEXINGTECHNIQUE OFDM make possible the higher and fast wireless data communication for various compatible application because of its main feature of high data rate and ... RELATED WORK Krishna Kumar  proposes effective performance of three different algorithms (Selective Mapping (SLM), Partial Transmit Sequence (PTS), Clipping and Filtering) for PAPR reduction of OFDM ...doi:10.21172/1.81.006 fatcat:nigawlrebvhvhi7djoozswarly
It is shown that decoding algorithms for Reed-Solomon codes over GF(q) can be transformed into self- checking algorithms for a set F of single algorithm errors. ... (RS-AOS-PC; Moscow) Self-checking decoding algorithm for Reed-Solomon codes. (English summary) Error control, cryptology, and speech compression (Moscow, 1993), 63-68, Lecture Notes in Comput. ...
Summary: “We show how the fast decoding algorithm of J. Juste- sen et al. [IEEE Trans. Inform. ... We present an algorithm for the con- catenated decoding of such codes, and prove that this algorithm achieves a lower bound for code distance.” 95¢:94027 95g:94024 94B15 05B30 94B35 Chen, Xuemin (1-SCA-EE ...
This invariance can be used to match fractal image, and 2-D Fast Fourier Transform (FFT) algorithm is easily used to calculate CEMs. ... The encoding in fractal image compressions are very time-consuming, because a large numbers of sequential search through a list of domains are needed to find the best match for a given range block. ... For algorithm with CEMs, it also shows that the coding and decoding time are reduced significantly with better quality of the decoding image. ...doi:10.12783/dtcse/aics2016/8170 fatcat:ewcryso4z5g3lohfar6r2jabxm
There are a number of choices for which signal points to condition on and the underlying structure of the code guarantees that one of the choices is good with high probability. ... A maximum likelihood decoder based on the sphere decoder has been used for efficient decoding of perfect STBCs. However the worst-case complexity for the sphere decoder is an exhaustive search. ... The approach is an extension of the ideas used to derive the fast optimal algorithm for multiplexing orthogonal design developed in  , and applied to Golden code to obtain a fast essentially ML performance ...doi:10.1109/icassp.2009.4960186 dblp:conf/icassp/HowardSC09 fatcat:avhx42uvvzg7pj3tix3uhocw3m
Unlike the DCT-II that has fast computing algorithms, the DST-VII and DCT-VIII rely on more complex matrix multiplication. ... The genetic algorithm is then used to solve the optimization problem and find the adjustment band-matrix that minimizes a trade-off between error and orthogonality. ... Several studies have investigated fast computing algorithms for DCTs/DSTs. ...doi:10.1109/pcs48520.2019.8954535 dblp:conf/pcs/HamidouchePMKMD19 fatcat:oibknlpdbrf6ldunzemilmiwgu
The traditional decoder has been replaced with a threshold-log-MAP algorithm based interleaver for improved noise tolerance. ... The current level of mobile device usage and data exchange over the internet has raised the need for such a fast and secure communication system. ... The novel interleaving and the decoding algorithms used in the turbo codes help boost the performance of the system. ...doi:10.26782/jmcms.2019.02.00033 fatcat:cx5a7baibvcstkapu3imhzwwcy
« Previous Showing results 1 — 15 out of 15,455 results