2001
DOI: 10.1109/90.909025
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic slot allocation (DSA) in indoor SDMA/TDMA using a smart antenna basestation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
52
0

Year Published

2004
2004
2020
2020

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 106 publications
(52 citation statements)
references
References 10 publications
0
52
0
Order By: Relevance
“…We finally note that STDMA with smart antennas for indoor environments has been well studied. However, unlike previous models [16], [1], [12], [11], [10] that rely on multipath and RAKE receivers, in our case we only use the LOS path and null the NLOS paths. Therefore, the channel allocation problem is very different as we show in the remainder of this paper.…”
Section: Related Workmentioning
confidence: 99%
“…We finally note that STDMA with smart antennas for indoor environments has been well studied. However, unlike previous models [16], [1], [12], [11], [10] that rely on multipath and RAKE receivers, in our case we only use the LOS path and null the NLOS paths. Therefore, the channel allocation problem is very different as we show in the remainder of this paper.…”
Section: Related Workmentioning
confidence: 99%
“…Since the MIMO techniques allow more users to be served at the same time in the same frequency, they are emerging as a novel approach for spectrally efficient terrestrial HIPERMAN systems. In the recent years, the focus of MIMO-OFDM research in HIPERMAN was on STC and beamforming [3], and some of them have been standardised [4]. Since MUD allows the parallel operation of multiple radio links and has very good performance in NLOS environment, using MUD in OFDM-based HIPERMAN system to improve the system capacity is emerging as a new research area.…”
Section: Introductionmentioning
confidence: 99%
“…the complexity increases exponentially with the number of variables. It is shown in [2] by graph theory that the problem of minimizing the length of an SDMA/TDMA frame, while ensuring a minimum SINR for each terminal, is NP-complete. In our case, the proof follows directly from linear programming, in which several combinatorial problems are known to be NP-complete, among others the Knapsack.…”
Section: A Towards a Simple Tool To The User Clusteringmentioning
confidence: 99%
“…[2] for an example of the uplink of an SDMA/TDMA system. In [3] the authors extend [2] to take into account several QoS parameters. In this paper, we justify and propose a greedy algorithm based on the normalized scalar product to allocate the users into groups.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation