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 performance computations for trellis-coded modulation
Date
1999-06-01
Author
Abou Rajab, H
Yucel, MD
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
196
views
0
downloads
Cite This
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 complexity of the distance spectrum dependent on the number of states as compared to the complexity of Rouanne and Costello algorithm which depends on the number of paths to be extended.
Subject Keywords
Distance spectrum
,
Mapping by set partitioning
,
Subset selector distance polynomial
URI
https://hdl.handle.net/11511/65513
Journal
IEEE TRANSACTIONS ON COMMUNICATIONS
DOI
https://doi.org/10.1109/26.771329
Collections
Department of Electrical and Electronics Engineering, Article
Suggestions
OpenMETU
Core
Complexity reduction in radial basis function (RBF) networks by using radial B-spline functions
Saranlı, Afşar; Baykal, Buyurman (1998-01-01)
In this paper, new basis consisting of radial cubic and quadratic B-spline functions are introduced together with the CORDIC algorithm, within the context of RBF networks as a means of reducing computational complexity in real-time signal-processing applications. The new basis are compared with two other existing and popularly used basis families, namely the Gaussian functions and the inverse multiquadratic functions (IVMQ) in terms of approximation performance and computational requirements. The new basis ...
AUTOMATIC MULTI-SCALE SEGMENTATION OF HIGH SPATIAL RESOLUTION SATELLITE IMAGES USING WATERSHEDS
Sahin, Kerem; Ulusoy, İlkay (2013-07-26)
An automatic segmentation algorithm that is based on watersheds and region merging type multi-scale segmentation (MSS) is proposed, which can be used as the initial step of an object-based classifier. First, the image is segmented using watershed segmentation. Then, primitive segments are merged to create meaningful objects by the proposed hybrid region merging algorithm. During these steps, an unsupervised segmentation accuracy metric is considered so that best performing parameters of the proposed algorit...
Fine resolution frequency estimation from three DFT samples: Case of windowed data
Candan, Çağatay (2015-09-01)
An efficient and low complexity frequency estimation method based on the discrete Fourier transform (DFT) samples is described. The suggested method can operate with an arbitrary window function in the absence or presence of zero-padding. The frequency estimation performance of the suggested method is shown to follow the Cramer-Rao bound closely without any error floor due to estimator bias, even at exceptionally high signal-to-noise-ratio (SNR) values.
Improved Polynomial Multiplication Algorithms over Characteristic Three Fields and Applications to NTRU Prime
Yeniaras, Esra; Cenk, Murat (2022-01-01)
This paper introduces a new polynomial multiplication algorithm which decreases the arithmetic complexity and another modified algorithm that speeds up the implementation run-time over the characteristic three fields. We first introduce a new polynomial multiplication algorithm using a 4-way split approach and observe that its asymptotic arithmetic complexity is better than Bernstein’s 3-way method for characteristic three fields. We then define an unbalanced split version a 5-way split method which is fast...
Least squares differential quadrature time integration scheme in the dual reciprocity boundary element method solution of convection-diffusion problems
Bozkaya, Canan (2005-03-18)
The least squares differential quadrature method (DQM) is used for solving the ordinary differential equations in time, obtained from the application of the dual reciprocity boundary element method (DRBEM) for the spatial partial derivatives in convection-diffusion type problems. The DRBEM enables us to use the fundamental solution of the Laplace equation which is easy to implement computationally. The time derivative and the convection terms are considered as the nonhomogeneity in the equation which are ap...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
H. Abou Rajab and M. Yucel, “Efficient performance computations for trellis-coded modulation,”
IEEE TRANSACTIONS ON COMMUNICATIONS
, pp. 796–798, 1999, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65513.