COMPATIBLE SUBSET GENERATION TO FACILITATE MULTI-RADIO COEXISTENCE

• US 20120213303A1
• Filed: 08/16/2011
• Published: 08/23/2012
• Est. Priority Date: 08/17/2010
• Status: Abandoned Application

• Current Assignee: Qualcomm, Inc.
• Original Assignee: Qualcomm, Inc.
• Inventors: Kadous, Tamer Adel, Mantravadi, Ashok
• Application Number:
  US13/210,995
• Publication Number:
  US 20120213303A1
• Time in Patent Office: Days
• US Class Current: 375/267
• CPC Class Codes: H04L 5/0023 Time-frequency-space
• CPC Class Codes: H04L 5/0073 Allocation arrangements that take into account other cell interferences for intercell interference mitigation or co-ordination in orthogonal multiplex systems H04J11/005
• CPC Class Codes: H04W 72/541 using the level of interference
• CPC Class Codes: H04W 88/06 adapted for operation in multiple networks or having at least two operational modes, e.g. multi-mode terminals

Abstract

Radios in a multi-radio device may be represented by parameter nodes, each parameter node representing a communication configuration of a particular radio. A coexistence manager may determine compatible subsets of parameter nodes. The subsets represent communication configurations of the radios that are compatible for simultaneous operation which reduces interference. Compatible subset generation may occur during an evaluation phase of a coexistence manager of a multi-radio device. Compatible subsets are generated based on resolvability of radio events or other potential collisions of the subsets, such as by use of a progressive resolution (PR) graph, associated compatibility graphs, and instructions and logic corresponding to such graphs.

Claims

1. A method of wireless communication, the method comprising:

determining a set of radios of a multi-radio device that may potentially interfere with each other;

representing the set of radios as a set of parameter nodes, each parameter node representing a communication configuration of one of the set of radios; and

determining a subset of parameter nodes, the subset including parameter nodes representing radio communication configurations that are compatible with each other.

2. The method of claim 1 further comprising determining a subset containing a maximum number of compatible parameter nodes from a cluster of radios not completely compatible with each other.

3. The method of claim 2, further comprising applying a Bron-Kerbosch algorithm to determine the subset containing the maximum number of compatible parameter nodes.

4. The method of claim 1 executed during an evaluation phase of a co-existence manager operatively associated with the multi-radio device.

5. The method of claim 1, in which the determining a subset of parameter nodes comprises excluding nodes having connectivity to no other nodes.

6. An apparatus for wireless communications, comprising:

means for determining a set of radios of a multi-radio device that may potentially interfere with each other;

means for representing the set of radios as a set of parameter nodes, each parameter node representing a communication configuration of one of the set of radios; and

means for determining a subset of parameter nodes, the subset including parameter nodes representing radio communication configurations that are compatible with each other.

7. A computer program product configured for wireless communication, the computer program product comprising:

a non-transitory computer-readable medium having non-transitory program code recorded thereon, the non-transitory program code comprising;

program code to determine a set of radios of a multi-radio device that may potentially interfere with each other;

program code to represent the set of radios as a set of parameter nodes, each parameter node representing a communication configuration of one of the set of radios; and

program code to determine a subset of parameter nodes, the subset including parameter nodes representing radio communication configurations that are compatible with each other.

8. An apparatus configured for wireless communication, the apparatus comprising:

a memory; and

at least one processor coupled to the memory, the at least one processor being configured;

to determine a set of radios of a multi-radio device that may potentially interfere with each other;

to represent the set of radios as a set of parameter nodes, each parameter node representing a communication configuration of one of the set of radios; and

to determine a subset of parameter nodes, the subset including parameter nodes representing radio communication configurations that are compatible with each other.

9. The apparatus of claim 8 in which the at least one processor is further configured to determine a subset containing a maximum number of compatible parameter nodes from a cluster of radios not completely compatible with each other.

10. The apparatus of claim 9 in which the at least one processor is further configured to apply a Bron-Kerbosch algorithm to determine the subset containing the maximum number of compatible parameter nodes.

11. The apparatus of claim 8 in which the at least one processor is configured to operate during an evaluation phase of a co-existence manager operatively associated with the multi-radio device.

12. The apparatus of claim 8, in which the at least one processor is configured to determine a subset of parameter nodes by excluding nodes having connectivity to no other nodes.

13. A method of wireless communication, the method comprising:

determining a set of radios of a multi-radio device that may potentially interfere with each other;

representing a set of parameter nodes as a progressive resolution graph, each parameter node representing a communication configuration of one of the set of radios;

representing the set of radios as a radio compatibility graph, each radio node representing one of the set of radios; and

determining a subset of radio nodes based on at least one of the radio compatibility graph and the progressive resolution graph, the subset including radio nodes representing radios that are compatible with each other.

14. The method of claim 13 further comprising determining edges in the radio compatibility graph from connectivity of parameter nodes in the progressive resolution graph.

15. The method of claim 13 further comprising splitting a first radio node into multiple new radio nodes, each new radio node representing a subset of communication configurations of a radio of the first radio node.

16. The method of claim 15 further comprising excluding a new radio node split from the first radio node having connectivity that is a subset of connectivity of another new radio node of the first radio node when forming edges of the radio compatibility graph.

17. The method of claim 13 further comprising determining a subset containing a maximum number of compatible radio nodes from a cluster of radios not completely compatible with each other.

18. The method of claim 17, further comprising applying a Bron-Kerbosch algorithm to determine the subset containing the maximum number of compatible radio nodes.

19. The method of claim 13 executed during an evaluation phase of a co-existence manager operatively associated with the multi-radio device.

20. An apparatus for wireless communications, comprising:

means for determining a set of radios of a multi-radio device that may potentially interfere with each other;

means for representing a set of parameter nodes as a progressive resolution graph, each parameter node representing a communication configuration of one of the set of radios;

means for representing the set of radios as a radio compatibility graph, each radio node representing one of the set of radios; and

means for determining a subset of radio nodes based on at least one of the radio compatibility graph and the progressive resolution graph, the subset including radio nodes representing radios that are compatible with each other.

21. A computer program product configured for wireless communication, the computer program product comprising:

a non-transitory computer-readable medium having non-transitory program code recorded thereon, the non-transitory program code comprising;

program code to determine a set of radios of a multi-radio device that may potentially interfere with each other;

program code to represent a set of parameter nodes as a progressive resolution graph, each parameter node representing a communication configuration of one of the set of radios;

program code to represent the set of radios as a radio compatibility graph, each radio node representing one of the set of radios; and

program code to determine a subset of radio nodes based on at least one of the radio compatibility graph and the progressive resolution graph, the subset including radio nodes representing radios that are compatible with each other.

22. An apparatus configured for wireless communication, the apparatus comprising:

a memory; and

at least one processor coupled to the memory, the at least one processor being configured;

to determine a set of radios of a multi-radio device that may potentially interfere with each other;

to represent a set of parameter nodes as a progressive resolution graph, each parameter node representing a communication configuration of one of the set of radios;

to represent the set of radios as a radio compatibility graph, each radio node representing one of the set of radios; and

to determine a subset of radio nodes based on at least one of the radio compatibility graph and the progressive resolution graph, the subset including radio nodes representing radios that are compatible with each other.

23. The apparatus of claim 22 in which the at least one processor is further configured to determine edges in the radio compatibility graph from connectivity of parameter nodes in the progressive resolution graph.

24. The apparatus of claim 22 in which the at least one processor is further configured to split a first radio node into multiple new radio nodes, each new radio node representing a subset of communication configurations of a radio of the first radio node.

25. The apparatus of claim 24 in which the at least one processor is further configured to exclude a new radio node split from the first radio node having connectivity that is a subset of connectivity of another new radio node of the first radio node when forming edges of the radio compatibility graph.

26. The apparatus of claim 22 in which the at least one processor is further configured to determine a subset containing a maximum number of compatible radio nodes from a cluster of radios not completely compatible with each other.

27. The apparatus of claim 26, in which the at least one processor is further configured to apply a Bron-Kerbosch algorithm to determine the subset containing the maximum number of compatible radio nodes.

28. The apparatus of claim 22 in which the at least one processor is configured to operate during an evaluation phase of a co-existence manager operatively associated with the multi-radio device.