Patent US5752194A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5752194A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for assigning channels to transmitters in a radio communication system

Assignee: Motorola Solutions Inc
•
Filing: 1996-08-01
•
Granted: 1998-05-12
•
Expires: 2016-08-01
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract Channels are assigned to a plurality of transmitters (206) in a radio communication system. First, interference constraints are defined (402) for the plurality of transmitters, and channel capacity required to handle traffic for each of the plurality of transmitters is measured (404). Then a mathematical programming technique is applied (406) to minimize the total number of channels assigned in the system, consistent with the interference constraints and the channel capacity required. The programming technique is selected from an integer programming technique (414) and a linear programming technique (408).

Inventors

  • 👤 Jyh-Han Lin
  • 👤 Alain Charles Louis Briancon

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-07 09:30
CPC Classifications
H; H04; H04W; H04W16/00; H04W16/18; H04W24/00; H04W24/10; H04W72/00; H04W72/50; H04W72/54; H04W72/541

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 337 words
A method for assigning a plurality of channels to a plurality of transmitters in a radio communication system, the method comprising the steps of: defining interference constraints for the plurality of transmitters; measuring a channel capacity required to handle traffic for each of the plurality of transmitters; applying a linear programming technique to minimize a total number of channels assigned in the system, consistent with the interference constraints and the channel capacity required, which can result in a fractional solution of channel-to-transmitter assignment values; and generating an integer solution based upon values of the fractional solution by performing a process selected from a group of processes consisting of process (a), process (b), and process (c), wherein process (a) comprises the step of time-sharing the channel-to-transmitter assignment values in proportion to values of the fractional solution, and wherein process (b) comprises the step of randomly rounding the fractional solution periodically, wherein a probability of rounding a channel-to-transmitter assignment value to unity is equal to a fractional solution value corresponding to the channel-to-transmitter assignment value before rounding, and wherein process (c) comprises the steps of: sorting by transmitter the traffic queued for the plurality of transmitters during a predetermined period; selecting a transmitter having a highest channel capacity required that is not yet processed; sorting the channel-to-transmitter assignment values associated with the transmitter selected; choosing a highest non-zero one of the channel-to-transmitter assignment values that has not yet been processed; rounding up the highest non-zero one to unity when no interference constraint is violated as a result; rounding down the highest non-zero one to zero when an interference constraint would be violated by rounding to unity; checking how much accumulated channel capacity has been accumulated for the transmitter by the rounding up and rounding down steps; repeating the choosing, rounding up and rounding down steps when the accumulated channel capacity is less than the channel capacity required for the transmitter; and otherwise, returning to the selecting step to select another transmitter for processing until all transmitters have been processed.
Claim 2
Independent Claim 337 words
A method for assigning a plurality of channels to a plurality of transmitters in a radio communication system, the method comprising the steps of: defining interference constraints for the plurality of transmitters; measuring a channel capacity required to handle traffic for each of the plurality of transmitters; applying a linear programming technique to minimize a total number of channels assigned in the system, consistent with the interference constraints and the channel capacity required, which can result in a fractional solution of channel-to-transmitter assignment values; and generating an integer solution based upon values of the fractional solution by performing a process selected from a group of processes consisting of process (a), process (b), and process (c), wherein process (a) comprises the step of time-sharing the channel-to-transmitter assignment values in proportion to values of the fractional solution, and wherein process (b) comprises the step of randomly rounding the fractional solution periodically, wherein a probability of rounding a channel-to-transmitter assignment value to unity is equal to a fractional solution value corresponding to the channel-to-transmitter assignment value before rounding, and wherein process (c) comprises the steps of: sorting by transmitter the traffic queued for the plurality of transmitters during a predetermined period; selecting a transmitter having a highest channel capacity required that is not yet processed; sorting the channel-to-transmitter assignment values associated with the transmitter selected; choosing a highest non-zero one of the channel-to-transmitter assignment values that has not yet been processed; rounding up the highest non-zero one to unity when no interference constraint is violated as a result; rounding down the highest non-zero one to zero when an interference constraint would be violated by rounding to unity; checking how much accumulated channel capacity has been accumulated for the transmitter by the rounding up and rounding down steps; repeating the choosing, rounding up and rounding down steps when the accumulated channel capacity is less than the channel capacity required for the transmitter; and otherwise, returning to the selecting step to select another transmitter for processing until all transmitters have been processed.
Claim 3
Dependent Claim 45 words
The method of claim 1, wherein the defining step comprises the steps of: determining values for co-channel and adjacent-channel transmitter exclusion tables based upon interference levels between each pair of transmitters; and selecting an exclusion value threshold beyond which a transmitter interference constraint is violated.
Claim 4
Dependent Claim 32 words
The method of claim 1, wherein the measuring step comprises the step of dynamically determining the channel capacity required in response to the traffic queued for each of the plurality of transmitters.
Claim 5
Dependent Claim 31 words
The method of claim 1, wherein the measuring step comprises the step of estimating the channel capacity required from demographic data available for an area served by the radio communication system.
Claim 6
Dependent Claim 379 words
A controller for assigning a plurality of channels to a plurality of transmitters in a radio communication system, the controller comprising: a processing system for directing operations of the controller; a network interface coupled to the processing system for receiving messages from message originators; and a transmitter interface coupled to the processing system for controlling the plurality of transmitters to send the messages, wherein the processing system is programmed to: define interference constraints for the plurality of transmitters; measure a channel capacity required to handle traffic for each of the plurality of transmitters; apply a linear programming technique to minimize a total number of channels assigned in the system, consistent with the interference constraints and the channel capacity required, which can result in a fractional solution of channel-to-transmitter assignment values; and generate an integer solution based upon values of the fractional solution by performing a process selected from a group of processes consisting of process (a), process (b), and process (c), wherein process (a) programs the processing system to time-share the channel-to-transmitter assignment values in proportion to values of the fractional solution, and wherein process (b) programs the processing system to randomly round the fractional solution periodically, wherein a probability of rounding a channel-to-transmitter assignment value to unity is equal to a fractional solution value corresponding to the channel-to-transmitter assignment value before rounding, and wherein process (c) programs the processing system to: sort by transmitter the traffic queued for the plurality of transmitters during a predetermined period; select a transmitter having a highest channel capacity required that is not yet processed; sort the channel-to-transmitter assignment values associated with the transmitter selected; choose a highest non-zero one of the channel-to-transmitter assignment values that has not yet been processed; round up the highest non-zero one to unity when no interference constraint is violated as a result; round down the highest non-zero one to zero when an interference constraint would be violated by rounding to unity; check how much accumulated channel capacity has been accumulated for the transmitter by the rounding up and rounding down steps; continue to choose, round up and round down when the accumulated channel capacity is less than the channel capacity required for the transmitter; and otherwise, select another transmitter for processing until all transmitters have been processed.
Claim 7
Dependent Claim 379 words
A controller for assigning a plurality of channels to a plurality of transmitters in a radio communication system, the controller comprising: a processing system for directing operations of the controller; a network interface coupled to the processing system for receiving messages from message originators; and a transmitter interface coupled to the processing system for controlling the plurality of transmitters to send the messages, wherein the processing system is programmed to: define interference constraints for the plurality of transmitters; measure a channel capacity required to handle traffic for each of the plurality of transmitters; apply a linear programming technique to minimize a total number of channels assigned in the system, consistent with the interference constraints and the channel capacity required, which can result in a fractional solution of channel-to-transmitter assignment values; and generate an integer solution based upon values of the fractional solution by performing a process selected from a group of processes consisting of process (a), process (b), and process (c), wherein process (a) programs the processing system to time-share the channel-to-transmitter assignment values in proportion to values of the fractional solution, and wherein process (b) programs the processing system to randomly round the fractional solution periodically, wherein a probability of rounding a channel-to-transmitter assignment value to unity is equal to a fractional solution value corresponding to the channel-to-transmitter assignment value before rounding, and wherein process (c) programs the processing system to: sort by transmitter the traffic queued for the plurality of transmitters during a predetermined period; select a transmitter having a highest channel capacity required that is not yet processed; sort the channel-to-transmitter assignment values associated with the transmitter selected; choose a highest non-zero one of the channel-to-transmitter assignment values that has not yet been processed; round up the highest non-zero one to unity when no interference constraint is violated as a result; round down the highest non-zero one to zero when an interference constraint would be violated by rounding to unity; check how much accumulated channel capacity has been accumulated for the transmitter by the rounding up and rounding down steps; continue to choose, round up and round down when the accumulated channel capacity is less than the channel capacity required for the transmitter; and otherwise, select another transmitter for processing until all transmitters have been processed.
Claim 8
Dependent Claim 45 words
The controller of claim 5, wherein the processing system is further programmed to: determine values for co-channel and adjacent-channel transmitter exclusion tables based upon interference levels between each pair of transmitters; and select an exclusion value threshold beyond which a transmitter interference constraint is violated.
Claim 9
Dependent Claim 32 words
The controller of claim 5, wherein the processing system is further programmed to dynamically determine the channel capacity required in response to the traffic queued for each of the plurality of transmitters.
Claim 10
Dependent Claim 31 words
The controller of claim 5, wherein the processing system is further programmed to estimate the channel capacity required from demographic data available for an area served by the radio communication system.

References Cited (Backward Citations)

US4875038A Cited
US4887265A Cited
US5345597A Cited
US5404574A Cited
US5594940A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-05-11 2001-11-10 2002-05-12 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-05-11 2005-11-10 2006-05-12 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-05-11 2009-11-10 2010-05-12 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag