SPATIAL HASHING FOR ENHANCED CONTROL CHANNEL SEARCH SPACES

• US 20130058285A1
• Filed: 09/02/2011
• Published: 03/07/2013
• Est. Priority Date: 09/02/2011
• Status: Abandoned Application

• Current Assignee: Avago Technologies General IP PTE Limited (Broadcom, Inc.)
• Original Assignee: Renesas Mobile Corporation (Renesas Electronics Corporation)
• Inventors: Koivisto, Tommi, Roman, Timo, Enescu, Mihai
• Application Number:
  US13/224,825
• Publication Number:
  US 20130058285A1
• Time in Patent Office: Days
• US Class Current: 370/329
• CPC Class Codes: H04L 1/0046 Code rate detection or code type detection H04L1/0038 takes precedence; detection of the data rate H04L25/0262; for packet format H04L1/0091
• CPC Class Codes: H04L 5/0053 Allocation of signaling, i.e. of overhead other than pilot signals

Abstract

The present invention provides a method, apparatus and a computer program product for spatial hashing for enhanced control channel search spaces. The present invention includes defining a control channel search space for searching for control channel candidates, defining search space locations within the search space, grouping the search space locations into a plurality of subsets of search space locations, associating each subset of search space locations with an antenna port, for each of a plurality of subframes, changing the search space locations from a first subset of search space locations to a second subset of search space locations.

Claims

1. A method, comprising:

defining a control channel search space for searching for control channel candidates,

defining search space locations within the search space,

grouping the search space locations into a plurality of subsets of search space locations,

associating each subset of search space locations with an antenna port,

for each of a plurality of subframes, changing the search space locations from a first subset of search space locations to a second subset of search space locations.

2. The method according to claim 1, further comprising

decoding the control channel candidates from the defined search space locations.

3. The method according to claim 1, wherein the subsets of search space locations corresponding to each antenna port are partially overlapping or fully non-overlapping.

4. The method according to claim 1, further comprising:

defining separate search space locations within the search space for each antenna port,

changing the subset of search space locations for one antenna port independently of the subset of search space locations for another antenna port.

5. The method according to claim 4, further comprising:

reducing the number of search space locations in a subset for each antenna port.

6. A method, comprising:

defining a control channel search space for searching for control channel candidates,

defining search space locations within the search space,

grouping the search space locations into N subsets of search space locations, wherein N is the number of antenna ports,

associating each of the N subsets of search space locations with one of the N antenna ports,

alternating the association between each of the N subsets and said antenna port for each of the N subframes,

changing the search space locations from a first subset of search space locations to a second subset of search space locations at every N subframe.

7. The method according to claim 6, wherein the subsets of search space locations corresponding to each antenna port are partially overlapping or fully non-overlapping.

8. The method according to claim 6, further comprising

decoding the control channel candidates from the defined search space locations.

9. An apparatus, comprising:

at least one processor,

and at least one memory including computer program code,

the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to perform;

defining a control channel search space for searching for control channel candidates,

defining search space locations within the search space,

grouping the search space locations into a plurality of subsets of search space locations,

associating each subset of search space locations with an antenna port,

for each of a plurality of subsets, changing the search space locations from a first subset of search space locations to a second subset of search space locations.

10. The apparatus according to claim 9, wherein the search space locations corresponding to each antenna port are partially overlapping or fully non-overlapping.

11. The apparatus according to claim 9, wherein the at least one memory and the computer program code is further configured to, with the at least one processor, cause the apparatus at least to perform:

defining separate search space locations within the search space for each antenna port,

changing the subset of search space locations for one antenna port independently of the subset of search space locations for another antenna port.

12. The apparatus according to claim 11, wherein the at least one memory and the computer program code is further configured to, with the at least one processor, cause the apparatus at least to perform:

reducing the number of search space locations in a subset for each antenna port.

13. The apparatus according to claim 9, wherein the at least one memory and the computer program code is further configured to, with the at least one processor, cause the apparatus at least to perform:

decoding the control channel candidates from the defined search space locations.

14. An apparatus, comprising:

at least one processor,

and at least one memory including computer program code,

the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to perform;

defining a control channel search space for searching for control channel candidates,

defining search space locations within the search space,

grouping the search space locations into N subsets of search space locations, wherein N is the number of antenna ports,

associating each of the N subsets of search space locations with one of the N antenna ports,

alternating the association between each of the N subsets and said antenna port for each of the N subframes,

changing the search space locations from a first subset of search space locations to a second subset of search space locations at every N subframe.

15. The apparatus according to claim 14, wherein the subsets of search space locations corresponding to each antenna port are partially overlapping or fully non-overlapping.

16. The apparatus according to claim 14, wherein the at least one memory and the computer program code is further configured to, with the at least one processor, cause the apparatus at least to perform:

decoding the control channel candidates from the defined search space locations.

17. A method comprising:

defining a control channel search space for scheduling control channels,

defining search space locations within the search space,

scheduling one or a plurality of control channels in the defined search space locations, wherein

the search space locations are grouped into subsets,

each subset of search space locations is associated with an antenna port, and

for each of a plurality of subframes, the search space locations are changed from a first subset of search space locations to a second subset of search space locations.

18. The method according to claim 17, wherein the search space locations corresponding to each antenna port are partially overlapping or fully non-overlapping.

19. The method according to claim 17, further comprising:

defining separate search space locations within the search space for each antenna port,

changing the subset of search space locations for one antenna port independently of the subset of search space locations for another antenna port.

20. The method according to claim 19, further comprising:

reducing the number of search space locations in a subset for each antenna port.

21. A method, comprising:

defining a control channel search space for scheduling control channels,

defining search space locations within the search space,

scheduling one or a plurality of control channels in the defined search space locations, wherein

the search space locations are grouped into N subsets of search space locations, wherein N is the number of antenna ports,

each of the N subsets of search space locations is associated with one of the N antenna ports,

the association between each of the N subsets of search space locations and said antenna port for each of the N subframes is alternated,

the search space locations are changed from a first subset of search space locations to a second subset of search space locations at every N subframe.

22. The method according to claim 21, wherein the subsets of search space locations corresponding to each antenna port are partially overlapping or fully non-overlapping.

23. An apparatus, comprising:

at least one processor,

and at least one memory including computer program code,

the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to perform;

defining a control channel search space for scheduling control channels,

defining search space locations within the search space,

scheduling one or a plurality of control channels in the defined search space locations, wherein

the search space locations are grouped into a plurality subsets,

each subset of search space locations is associated with an antenna port, and

for each of a plurality of subframes, the search space locations are changed from a first subset of search space locations to a second subset of search space locations.

24. The apparatus according to claim 23, wherein the subsets of search space locations corresponding to each antenna port are partially overlapping or fully non-overlapping.

25. The apparatus according to claim 23, wherein the at least one memory and the computer program code is further configured to, with the at least one processor, cause the apparatus at least to perform:

defining separate search space locations within the search space for each antenna port,

changing the subset of search space locations for one antenna port independently of the subset of search space locations for another antenna port.

26. The apparatus according to claim 25, wherein the at least one memory and the computer program code is further configured to, with the at least one processor, cause the apparatus at least to perform:

reducing the number of search space locations in a subset for each antenna port.

27. An apparatus, comprising:

at least one processor,

and at least one memory including computer program code,

the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus at least to perform;

defining a control channel search space for scheduling control channels,

defining search space locations within the search space,

scheduling one or a plurality of control channels in the defined search space locations, wherein

the search space locations are grouped into N subsets of search space locations, wherein N is the number of antenna ports,

each of the N subsets of search space locations is associated with one of the N antenna ports,

the association between each of the N subsets and said antenna port for each of the N subframes is alternated,

the search space locations are changed from a first subset of search space locations to a second subset of search space locations at every N subframe.

28. The apparatus according to claim 27, wherein the subsets of search space locations corresponding to each antenna port are partially overlapping or fully non-overlapping.