Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Efficient decoding algorithms for block coded modulation.
Download
023400.pdf
Date
1992
Author
Işıklı, Ali
Metadata
Show full item record
Item Usage Stats
86
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/12046
Collections
Graduate School of Natural and Applied Sciences, Thesis
Suggestions
OpenMETU
Core
Efficient algorithms for the frame packing and slot allocation of FlexRay V3.0
Çakmak, Cumhur; Schmidt, Şenan Ece; Schmidt, Klaus Verner; Department of Electrical and Electronics Engineering (2017)
Recently, near-field ultra-wideband radar imaging algorithms have an important place in short range imaging applications by providing high resolution in both range and cross-range. In this study, the near-field ultra-wideband radar imaging algorithms in the literature such as Holographic Image Reconstruction Algorithm, Range Migration Algorithm, MIMO Based Range Migration Algorithm and MIMO Based Kirchhoff Migration Algorithm have been implemented using MATLAB. The algorithms are applied to modeled transmit...
Efficient performance computations for trellis-coded modulation
Abou Rajab, H; Yucel, MD (1999-06-01)
In this letter, the algorithm given by Rouanne and Costello for the computation of the distance spectrum is improved for trellis-coded modulation schemes having uncoded bits, i.e., for trellis diagrams having parallel paths, It is shown that, when through a trellis corresponding to such kind of codes, all parallel transitions (labeled by signal selectors) between states are considered as a single branch labeled by a subset, then defining subset selector distance polynomials makes the computational complexit...
Efficient index structures for video databases
Açar, Esra; Yazıcı, Adnan; Department of Computer Engineering (2008)
Content-based retrieval of multimedia data has been still an active research area. The efficient retrieval of video data is proven a difficult task for content-based video retrieval systems. In this thesis study, a Content-Based Video Retrieval (CBVR) system that adapts two different index structures, namely Slim-Tree and BitMatrix, for efficiently retrieving videos based on low-level features such as color, texture, shape and motion is presented. The system represents low-level features of video data with ...
Efficient performance computations for trellis coded modulations
Abou Rajab, Hassan; Yücel, Melek ; Department of Electrical and Electronics Engineering (1995)
Efficient DSP algorithm development for GSM baseband signal processing
Biçen, K. Berat; Ergül, Rüyal; Department of Electrical and Electronics Engineering (1994)
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. Işıklı, “Efficient decoding algorithms for block coded modulation.,” Middle East Technical University, 1992.