Skip to content

Sociedade Brasileira de Telecomunicações

2010 - VII International Telecommunications Symposium

Matrix Expansions for Computing the Discrete Hartley Transform

A new fast algorithm for computing the discrete Hartley transform (DHT) is presented, which is based on the expansion of the transform matrix. The algorith...

SBrT 2010

Cyclotomic Basis for Computing the Discrete Fourier Transform

This paper presents a new fast algorithm for computing an N-point discrete Fourier transform. The algorithm meets the Heideman multiplicative complexity low...

SBrT 2010

Interference Analysis of Coexistence Scenarios in TV White Spaces

Broadband wireless systems in TV White Spaces have gained considerable attention since FCC started the process in 2004 and later 2008 published the first r...

SBrT 2010

Reduced Complexity Viterbi Decoding Based on the M-Algorithm and the Minimal

In this paper we propose sub-optimum, reduced complexity decoding algorithms for convolutional codes. The algorithms are based on the minimal trellis repre...

SBrT 2010

Performance Analysis of HARQ in WiMAX Networks Considering Imperfect Channel Estimation

Hybrid Automatic Repeat Query (HARQ) is an error correction technique that has become an integral part of most current broadband wireless standards such a...

SBrT 2010