Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:1102.5535 (cs)
[Submitted on 27 Feb 2011]

Title:Full Rate Collaborative Diversity Scheme for Multiple Access Fading Channels

Authors:Indu Shakya, Falah H. Ali, Elias Stipidis
View PDF
Abstract:User cooperation is a well-known approach to achieve diversity without multiple antennas, however at the cost of inevitable loss of rate mostly due to the need of additional channels for relaying. A new collaborative diversity scheme is proposed here for multiple access fading channels to attain full rate with near maximum diversity. This is achieved by allowing two users and their corresponding relays to transmit/forward data on the same channel by exploiting unique spatial-signatures of their fading channels. The base-station jointly detects the co-channel users' data using maximum-likelihood search algorithm over small set of possible data combinations. Full data rate with significant diversity gain near to two-antenna Alamouti scheme is shown.
Subjects: Information Theory (cs.IT)
Cite as: arXiv:1102.5535 [cs.IT]
  (or arXiv:1102.5535v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.1102.5535

Submission history

From: Indu Shakya [view email]
[v1] Sun, 27 Feb 2011 18:43:47 UTC (355 KB)
Full-text links:

Access Paper:

  • View PDF
  • Other Formats
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2011-02
Change to browse by:
cs
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Indu Shakya
Falah H. Ali
Elias Stipidis
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)