Wyniki wyszukiwania - Biblioteka Nauki

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: multiuser

Sortuj według:

Ogranicz wyniki do:

Adaptive Coded Continuous-Phase Modulations for Frequency-Division Multiuser Systems

100%

Perotti A. , Remlein P. , Benedetto S.

Advances in Electronics and Telecommunications

2010

tom Vol. 1, no. 1

50--58

In this paper we study adaptive coded modulations for wireless channels. Nonlinearity due to the radio-frequency power amplifier is considered and continuous-phase modulations (CPM) are adopted in order to make the nonlinearity effects negligible. The structure and properties of CPM are reviewed in a semi-tutorial fashion and coded modulation schemes are proposed. Moreover, frequency-division multiplexing (FDM) multiuser systems employing coded CPM are considered. Modulation-coding schemes achieving increasing spectral efficiencies in a multiuser scenario with tight intercarrier frequency spacing are designed and their performance in terms of spectral efficiency and error rate is assessed.

A note on hardness of multiprocessor scheduling with scheduling solution space tree

84%

Dwibedy D. , Mohanty R.

Computer Science

2023

tom T. 24 (1)

53--74

We study the hardness of the non-preemptive scheduling problem of a list of independent jobs on a set of identical parallel processors with a makespan minimization objective. We make a maiden attempt to explore the combinatorial structure of the problem by introducing a scheduling solution space tree (SSST) as a novel data structure. We formally define and characterize the properties of SSST through our analytical results. We show that the multiprocessor scheduling problem is N P-complete with an alternative technique using SSST and weighted scheduling solution space tree (WSSST) data structures. We propose a non-deterministic polynomial-time algorithm called magic scheduling (MS) based on the reduction framework. We also define a new variant of multiprocessor scheduling by including the user as an additional input parameter, which we called the multiuser multiprocessor scheduling problem (MUMPSP). We also show that MUMPSP is N P-complete. We conclude the article by exploring several non-trivial research challenges for future research investigations.