US5517677A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Adaptive weighting of a scanning sequence
Assignee: Uniden America Corp
•
Filing: 1993-05-13
•
Granted: 1996-05-14
•
Expires: 2013-05-13
Abstract
Abstract A scanning technique that is preferential as to communication channels actually utilized in the past. A programmable queue is written with a communication channel identity code based on a predefined criteria, such as each time the channel is actually used. The preferential queue is scanned in association with all the remaining communication channel identity codes, thereby providing a weighting factor that is skewed toward the selection of channels that have experienced actual use. System identification codes utilized in a mobile radio complex are stored in the queue in accordance with a roaming function, and group identity codes are stored in the queue when scanning home channels of mobile radio systems to determine incoming calls.
Inventors
- 👤 Billy G. Moon
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 20:05
CPC Classifications
H; H04; H04W; H04W8/00; H04W8/26; H04W24/00
Claims Analysis
Total Claims: 40
Claim 1
Independent Claim
157 words
A method for arranging plural elements of an array of elements to facilitate determining if an element has an attribute, comprising the steps of: receiving the element in a process a first time and using the element in completing the process the first time, and in response to the use of the element in the process, storing an identity of the element in a queue; identifying each said element of the array and storing respective identities of all said elements in a table; and carrying out the process a second time by accessing the identities of the elements in the queue and accessing the identities of the elements in the table to determine if any said accessed element has said attribute, wherein an overall sequence is carried out when each said element is accessed at least once, whereby the identities of the elements as stored in the queue are accessed at least twice in the overall sequence.
Claim 2
Independent Claim
157 words
A method for arranging plural elements of an array of elements to facilitate determining if an element has an attribute, comprising the steps of: receiving the element in a process a first time and using the element in completing the process the first time, and in response to the use of the element in the process, storing an identity of the element in a queue; identifying each said element of the array and storing respective identities of all said elements in a table; and carrying out the process a second time by accessing the identities of the elements in the queue and accessing the identities of the elements in the table to determine if any said accessed element has said attribute, wherein an overall sequence is carried out when each said element is accessed at least once, whereby the identities of the elements as stored in the queue are accessed at least twice in the overall sequence.
Claim 3
Dependent Claim
25 words
The method of claim 1, further including accessing the queue before accessing the table to facilitate finding an element in the queue having said attribute.
Claim 4
Dependent Claim
20 words
The method of claim 2, further including alternately accessing element identities in the queue and element identities in the table.
Claim 5
Dependent Claim
18 words
The method of claim 2, further including storing fewer element identities in the queue than in the table.
Claim 6
Dependent Claim
27 words
The method of claim 1, further including storing in said queue identities of elements that have been found prior to said accessing to have had said attribute.
Claim 7
Dependent Claim
22 words
The method of claim 5, further including deleting an element from the queue each time a new element identity is stored therein.
Claim 8
Dependent Claim
60 words
Scanning apparatus for carrying out the steps of claim 1; comprising: an addressable memory defining said queue for storing the identity of the element; and a processor coupled by one or more buses to said addressable memory and programmed to carry out said receiving step and said identifying step and the step of carrying out the process the second time.
Claim 9
Independent Claim
130 words
A method of scanning plural communication channels to identify an attribute of one or more said channels, comprising the steps of: storing in a programmable queue an identity associated with at least one communication channel determined previously to have said attribute; storing in a universal table an identity associated with each said communication channel available for carrying out a communication, whereby the identities stored in the programmable queue are also stored in the universal table; and in response to an access of the communication channel having the attribute, accessing said programmable queue and said universal table in an overall sequence where each said communication channel is accessed at least once, whereby each said communication channel identity stored in said programmable queue is accessed at least twice in said overall sequence.
Claim 10
Independent Claim
130 words
A method of scanning plural communication channels to identify an attribute of one or more said channels, comprising the steps of: storing in a programmable queue an identity associated with at least one communication channel determined previously to have said attribute; storing in a universal table an identity associated with each said communication channel available for carrying out a communication, whereby the identities stored in the programmable queue are also stored in the universal table; and in response to an access of the communication channel having the attribute, accessing said programmable queue and said universal table in an overall sequence where each said communication channel is accessed at least once, whereby each said communication channel identity stored in said programmable queue is accessed at least twice in said overall sequence.
Claim 11
Dependent Claim
30 words
The method of claim 8, further including carrying out said overall sequence to determine if the attribute defined in an incoming message is associated with one or more communication channels.
Claim 12
Dependent Claim
21 words
The method of claim 8, further including alternately scanning communication channel identities in the programmable queue and in the universal table.
Claim 13
Dependent Claim
39 words
The method of claim 8, further including storing in a priority table identities of communication channels with which a priority is associated, and scanning the priority table in the overall sequence with said programmable queue and said universal table.
Claim 14
Dependent Claim
55 words
The method of claim 10, further including scanning the communication channel identity in the programmable queue for each time a single communication channel identity is scanned in the universal table, and scanning each said communication channel identity of the universal table for each time the single communication channel identity is scanned in the priority table.
Claim 15
Dependent Claim
31 words
The method of claim 8, wherein said programmable queue is of a predefined size, and further including writing identities of the communication channels in the queue in a first-in, first-out manner.
Claim 16
Dependent Claim
27 words
The method of claim 13, further including changing the size of the programmable queue by changing the number of entries that can be written with channel identities.
Claim 17
Dependent Claim
64 words
Scanning apparatus for carrying out the steps of claim 8; comprising: an addressable memory defining said programmable queue in which said identity of at least one said communication channel is stored; said addressable memory for storing said universal table; and a processor coupled by one or more buses to said addressable memory and programmed for accessing said addressable memory according to said accessing step.
Claim 18
Dependent Claim
127 words
In a communication radio, a method of scanning plural communication channels, comprising the steps of: storing in a programmable queue only identity codes associated with the communication channels that have experienced actual use by the communication radio during an established voice communication to provide a preferential list of the identity codes, said queue having a size that is insufficient to store the identity codes of all said communication channels usable with said communication radio; and programming a processor to scan all the identity codes of the programmable queue and to scan remaining usable channel identities to complete an overall scan sequence, where each said communication channel identity is scanned at least once in the overall scan sequence of the programmable queue and the remaining usable channel identities.
Claim 19
Dependent Claim
127 words
In a communication radio, a method of scanning plural communication channels, comprising the steps of: storing in a programmable queue only identity codes associated with the communication channels that have experienced actual use by the communication radio during an established voice communication to provide a preferential list of the identity codes, said queue having a size that is insufficient to store the identity codes of all said communication channels usable with said communication radio; and programming a processor to scan all the identity codes of the programmable queue and to scan remaining usable channel identities to complete an overall scan sequence, where each said communication channel identity is scanned at least once in the overall scan sequence of the programmable queue and the remaining usable channel identities.
Claim 20
Dependent Claim
14 words
The method of claim 16, wherein system identification codes are stored in said queue.
Claim 21
Dependent Claim
14 words
The method of claim 16, wherein group identity codes are stored in said queue.
Claim 22
Dependent Claim
31 words
The method of claim 16, further including scanning the identity codes that are stored in the queue at least twice to complete an overall scan of all said usable identity codes.
Claim 23
Dependent Claim
55 words
The communication radio for carrying out the steps of claim 16 comprising: an addressable memory defining said programmable quene in which the identity codes of the communication channels are stored; and said processor coupled by one or more buses to said addressable memory and programmed for accessing said addressable memory according to said programming step.
Claim 24
Independent Claim
144 words
A method of scanning mobile radio channels, comprising the steps of: providing in a mobile radio a programmable history queue operable in conjunction with a channel scanner in said mobile radio: programming said history queue with information each time the mobile radio is associated with a different geographical area of operation, said information programmed in said history queue relating to communications in said different geographical area of operation; if the history queue is full during programming thereof with new information, deleting oldest information previously written therein; accessing the history queue in a sequential order starting with the newest information written therein and proceeding toward an oldest programmed information; and using the information read from the history queue during accessing by said channel scanner to provide a higher probability of selecting new channels associated with the programmed geographical location information read from the history queue.
Claim 25
Independent Claim
144 words
A method of scanning mobile radio channels, comprising the steps of: providing in a mobile radio a programmable history queue operable in conjunction with a channel scanner in said mobile radio: programming said history queue with information each time the mobile radio is associated with a different geographical area of operation, said information programmed in said history queue relating to communications in said different geographical area of operation; if the history queue is full during programming thereof with new information, deleting oldest information previously written therein; accessing the history queue in a sequential order starting with the newest information written therein and proceeding toward an oldest programmed information; and using the information read from the history queue during accessing by said channel scanner to provide a higher probability of selecting new channels associated with the programmed geographical location information read from the history queue.
Claim 26
Dependent Claim
16 words
The method of claim 21, further including writing the history queue in a first-in, first-out manner.
Claim 27
Dependent Claim
28 words
The method of claim 21, further including automatically programming the history queue of the mobile radio each time the mobile radio enters the different geographical area of operation.
Claim 28
Dependent Claim
26 words
The method of claim 21, further including measuring a signal strength of a carrier to determine which geographical location information should be written into the queue.
Claim 29
Dependent Claim
15 words
The method of claim 21, further including programming communication system identity codes in the queue.
Claim 30
Dependent Claim
68 words
The method of claim 21, further including communicating with a communication system in a new area of operation by transmitting an identity code of the mobile radio to the communication system and receiving by the mobile radio an acknowledgement, whereby when the communication system receives a message directed to the mobile radio, the communication system transmits the identity code of the mobile radio in association with said message.
Claim 31
Dependent Claim
129 words
A mobile communication unit, comprising: transceiver equipment for receiving and transmitting communication information with a plurality of destinations, each destination associated with an identity code; a memory for storing programmed instructions; a processor for carrying out said programmed instructions; a memory queue for storing preferred identification codes based on prior actual use thereof by the mobile communication unit in establishing voice communications and said memory queue being scanned by said processor in establishing communications with selected ones of said plurality of destinations, said memory queue storing fewer than all the identity codes associated with the respective destinations; and said processor is programmed to scan the memory queue in a scanning sequence and is programmed to scan a remainder of the identity codes, whereby expedited establishment of communications is realized.
Claim 32
Dependent Claim
129 words
A mobile communication unit, comprising: transceiver equipment for receiving and transmitting communication information with a plurality of destinations, each destination associated with an identity code; a memory for storing programmed instructions; a processor for carrying out said programmed instructions; a memory queue for storing preferred identification codes based on prior actual use thereof by the mobile communication unit in establishing voice communications and said memory queue being scanned by said processor in establishing communications with selected ones of said plurality of destinations, said memory queue storing fewer than all the identity codes associated with the respective destinations; and said processor is programmed to scan the memory queue in a scanning sequence and is programmed to scan a remainder of the identity codes, whereby expedited establishment of communications is realized.
Claim 33
Dependent Claim
22 words
The mobile communication unit of claim 27, wherein said processor is programmed to automatically update said memory queue with new identification codes.
Claim 34
Dependent Claim
21 words
The mobile communication unit of claim 28, further including updating the memory queue by entering an identity code multiple times therein.
Claim 35
Dependent Claim
26 words
The mobile communication unit of claim 27, wherein said memory queue is programmed with identity codes of radio systems with which the communication unit is operable.
Claim 36
Dependent Claim
17 words
The mobile communication unit of claim 27, wherein said memory queue is programmed with group identity codes.
Claim 37
Dependent Claim
22 words
The mobile communication unit of claim 27, further including a universal memory table for storing all identity codes of a set therein.
Claim 38
Dependent Claim
36 words
The mobile communication unit of claim 27, further including storing in the memory an identification code manually selectable by a manual switch of the communication unit, and scanning the identification code selected by the manual switch.
Claim 39
Dependent Claim
27 words
The mobile communication unit of claim 27, further including an adjacent system table in said memory, said adjacent system table storing identification codes related to geographical data.
Claim 40
Dependent Claim
91 words
The mobile communication unit of claim 27, further including: at least one memory location in said memory for storing an identity code of a destination selected by a user selectable switch of the mobile communication unit; at least one memory location in said memory for storing an identity code of a destination that is adjacent a system with which the communication unit frequently operates; and a plurality of memory locations in said memory for storing substantially all the identity codes of all the destinations with which the communication unit is operable.
References Cited (Backward Citations)
USRE32789E
Cited
US4144409A
Cited
US4114104A
Cited
US4179661A
Cited
US4276651A
Cited
US4347626A
Cited
US4352955A
Cited
US4347625A
Cited
US4466125A
Cited
US4550443A
Cited
US4597105A
Cited
US4742560A
Cited
US4654879A
Cited
US4649567A
Cited
US4747101A
Cited
US5189413A
Cited
US4744101A
Cited
US4759051A
Cited
US4907290A
Cited
US4939746A
Cited
US4723264A
Cited
US4905301A
Cited
US4914651A
Cited
US5214789A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-05-14 | 1999-11-13 | 2000-05-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-05-14 | 2003-11-13 | 2004-05-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-05-14 | 2007-11-13 | 2008-05-14 | $7700.00 | Window Closed / Lapsed |