BUIR logo
Communities & Collections
All of BUIR
  • English
  • Türkçe
Log In
Please note that log in via username/password is only available to Repository staff.
Have you forgotten your password?
  1. Home
  2. Browse by Subject

Browsing by Subject "Spreading sequences"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Results Per Page
  • Sort Options
  • Loading...
    Thumbnail Image
    ItemOpen Access
    Counting surrounding nodes using DS-SS signals and de Bruijn sequences in blind environment
    (IEEE, 2013-03) Warty, C.; Seçer, Görkem; Yu, R.W.; Spinsante, S.
    In recent years the technological development has encouraged several applications based on node to node communications without any fixed infrastructure. This paper presents preliminary evaluation of popular estimating techniques to populate active nodes in the neighborhood using De Bruijn sequences. They have much higher cardinality compared to any other family of binary sequences at a parity of length. This characteristic of De Bruijn sequences can be exploited to identify the presence of an active node in a dense surrounding, to assist the primary node in making intelligent decisions in a blind or foggy environment. The simulation model in this paper evaluates the use of eigenvalue estimation to estimate the spreading sequence among noisy signals, based on eigenvalues analysis techniques. The received signal is divided into windows, from which a covariance matrix is computed; the sequence can be reconstructed from the two first eigenvectors of this matrix, and that useful information, such as the desynchronization time, can be extracted from the eigenvalues. © 2013 IEEE.
  • Loading...
    Thumbnail Image
    ItemOpen Access
    Random spreading for unsourced MAC with power diversity
    (IEEE, 2021-10-11) Ahmadi, Mohammad Javad; Duman, Tolga M.
    We propose an improvement of the random spreading approach with polar codes for unsourced multiple access, for which each user first encodes its message by a polar code, and then the coded bits are spread using a random spreading sequence. The proposed approach divides the active users into different groups, and employs different power levels for each group in such a way that the average power constraint is satisfied. We formulate and solve an optimization problem to determine the number of groups, and the corresponding user numbers and power levels. Extensive simulations show that the proposed approach outperforms the existing methods, especially when the number of active users is large.

About the University

  • Academics
  • Research
  • Library
  • Students
  • Stars
  • Moodle
  • WebMail

Using the Library

  • Collections overview
  • Borrow, renew, return
  • Connect from off campus
  • Interlibrary loan
  • Hours
  • Plan
  • Intranet (Staff Only)

Research Tools

  • EndNote
  • Grammarly
  • iThenticate
  • Mango Languages
  • Mendeley
  • Turnitin
  • Show more ..

Contact

  • Bilkent University
  • Main Campus Library
  • Phone: +90(312) 290-1298
  • Email: dspace@bilkent.edu.tr

Bilkent University Library © 2015-2025 BUIR

  • Privacy policy
  • Send Feedback