IP Library Granted Patent US 8,971,435
Granted Patent B2
US 8,971,435 · App. 13/558,014 · Granted Mar 3, 2015

Multi-user communication using sparse space codes

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,971,435
App. No.
13/558,014
Granted
Mar 3, 2015
Kind
B2
Abstract

Multi-user sparse space codes are proposed as a new transmission scheme for uplink communication over a multi-user multiple-input-multiple-output (MIMO) communication channel.

Claims (14)

1. A method of detecting first user data from a first user equipment (UE) having a first number of transmit antennas and second user data from a second UE having a second number of transmit antennas, the method comprising:

receiving a composite signal over multiple evolved base node (eNodeB) receive antennas in a given reception time interval, wherein the composite signal comprises two UE waveforms arising from the first UE mapping the first user data with a first sparse space code of a first sparsity and the second UE mapping the second user data with a second sparse space code of a second sparsity; and

forming from the composite signal a first user data candidate and a second user data candidate based on a sum sparsity, such that a first statistic and a second statistic corresponding to the first user data and to the second user data, respectively, have been obtained.

2. The method of claim 1 , wherein the sum sparsity is equal to the sum of the first sparsity and the second sparsity.

3. The method of claim 2 , wherein the first user data candidate and the second user data candidate are formed using a basis pursuit algorithm.

4. The method of claim 2 , wherein the first user data candidate and the second user data candidate are formed using a maximum likelihood algorithm.

5. An evolved base node (eNodeB) comprising:

multiple receive antennas operative to receive a composite signal in a given reception time interval, wherein the composite signal comprises two user equipment (UE) waveforms arising from a first UE mapping first user data with a first sparse space code of a first sparsity and from a second UE mapping second user data with a second sparse space code of a second sparsity, the first UE having a first number of transmit antennas and the second UE having a second number of transmit antennas;

radio frequency (RF) circuitry coupled to the multiple receive antennas; and

a baseband processor coupled to the RF circuitry via an RF-to-digital interface,

wherein a decoder implemented in the baseband processor is operative to form from the composite signal a first user data candidate and a second user data candidate based on a sum sparsity.

6. The eNodeB of claim 5 , wherein the sum sparsity is equal to the sum of the first sparsity and the second sparsity.

7. The eNodeB of claim 6 , wherein the decoder is operative to use a basis pursuit algorithm to form the first user data candidate and the second user data candidate.

8. The eNodeB of claim 6 , wherein the decoder is operative to use a maximum likelihood algorithm to form the first user data candidate and the second user data candidate.

Assignments (3)
NUNC PRO TUNC ASSIGNMENT Recorded Jun 19, 2023
From: BLACKBERRY LIMITED
To: MALIKIE INNOVATIONS LIMITED
Reel/Frame 064271/0199 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 16, 2023
From: BLACKBERRY LIMITED
To: MALIKIE INNOVATIONS LIMITED
Reel/Frame 064104/0103 →
CHANGE OF NAME Recorded Jun 6, 2014
From: RESEARCH IN MOTION LIMITED
To: BLACKBERRY LIMITED
Reel/Frame 033104/0150 →