CN104363576A - Systems and methods for incremental update of a preferred roaming list - Google Patents

Abstract

A system and method of incrementally updating a preferred roaming list (PRL) are disclosed. The systems and methods include modifying a removable user identity module (RUIM) card on the mobile device to accept data structures that include incremental update information for a PRL. The systems and methods also include modifying a removable user identity module (RUIM) card on the mobile device to execute operators that allow for a PRL to be incrementally updated.

Description

For the system and method increasing progressively renewal of optimum roaming list

Related application

The divisional application that the application is the applying date is on 03 02nd, 2011, application number is 201180011478.9, name is called the Chinese patent application of " system and method increasing progressively renewal for optimum roaming list ".

Require priority

The priority of the Chinese patent application No.201010126141.X that patent application claims was submitted on March 2nd, 2010, therefore with way of reference, above-mentioned application is incorporated to herein clearly.

Technical field

Put it briefly, the application relates to radio communication, and specifically, the application relates to the system and method for incrementally upgrading optimum roaming list (PRL).

Background technology

Wireless communication system is widely deployed to provide various types of communication (such as, voice, data, multimedia service etc.) to multiple user.Increase fast along with to the demand of high speed and multimedia data service, realizing having the efficient and sane communication system of strengthening the property becomes challenging problem.

In a wireless communication system, mobile device is associated with specific cellular carrier (home-operator) usually.This home-operator can provide access node to make mobile device to communicate in a communication network in attributed region.But in some instances, this mobile device may move to this home-operator and provide outside the attributed region of wireless access.In such region, another operator can provide wireless access by the access node controlled by other operator.Correspondingly, mobile device can " be roamed " or attempt to be connected to the access node controlled by other operator.The access point finding these to help mobile device and controlled by other operator, wireless device can access optimum roaming list (PRL).This PRL is positioned at the database on removable Subscriber Identity Module (RUIM) card of mobile device.This PRL instruction will scan which frequency band, subband and Service Provider Identifier, and which kind of priority orders search the access node controlled by the operator except this home-operator according to.

Such as according to the change of the region at mobile device place and the wireless network of different operators, PRL can be upgraded regularly.Therefore, people expect to have the system and method that permission efficiently upgrades PRL on the mobile apparatus.

Summary of the invention

System of the present invention, method and apparatus have several aspect separately, without any single aspect individually for it expects that attribute is responsible for.By when the protection scope of the present invention do not stated appended claims limits, some features are discussed briefly now.After this discussion of investigation, especially, after having read the part being entitled as " embodiment ", one will understand that how feature of the present invention provides the advantage comprising and allow on the mobile apparatus optimum roaming list (PRL) to be increased progressively to renewal.

An embodiment provides a kind of communicator for upgrading the optimum roaming list in mobile device.Described device comprises processor.Described processor is for identifying the Data Position in described optimum roaming list.Described processor is also for identifying the action type that will perform about identified Data Position.Described processor is also for generating the data of the renewal part indicating described optimum roaming list.Described device also comprises transmitter, and this transmitter is used for the message sending instruction described Data Position, described action type and described data to mobile device.

An alternative embodiment of the invention provides a kind of communicator for upgrading the optimum roaming list in mobile device.Described device comprises the receiver for receiving data structure.Described data structure comprises the designator of Data Position to revise described optimum roaming list.Described data structure also comprises the designator of the action type that will perform.Described data structure also comprises the renewal part of described optimum roaming list.Described device also comprises processor, and this processor is used for revising described optimum roaming list according to described data structure.

An alternative embodiment of the invention provides a kind of communicator for upgrading the optimum roaming list in mobile device.Described device comprises processor, this processor is used for generation and comprises the message can being blocked one or more designators of the one or more operators performed by removable Subscriber Identity Module (RUIM), wherein, described one or more operator is for revising optimum roaming list.Described device also comprises the transmitter for sending described message to mobile device.

An alternative embodiment of the invention provides a kind of communicator for upgrading the optimum roaming list in mobile device.Described device comprises receiver, this receiver is used for reception and comprises the message can being blocked one or more designators of the one or more operators performed by removable Subscriber Identity Module (RUIM), wherein, described one or more operator is for revising optimum roaming list.Described device also comprises processor, and this processor is used for revising described optimum roaming list according to described one or more operator.

An alternative embodiment of the invention provides a kind of method for upgrading the optimum roaming list in mobile device.Described method comprises the Data Position identified in described optimum roaming list.Described method also comprises the action type identifying and will perform about identified Data Position.Described method also comprises the data of the renewal part generating the described optimum roaming list of instruction.Described method also comprises the message sending instruction described Data Position, described action type and described data to mobile device.

An alternative embodiment of the invention provides a kind of method for upgrading the optimum roaming list in mobile device.Described method comprises reception data structure.Described data structure comprises the designator of Data Position to revise described optimum roaming list.Described data structure also comprises the designator of the action type that will perform.Described data structure also comprises the renewal part of described optimum roaming list.Described method also comprises revises described optimum roaming list according to described data structure.

An alternative embodiment of the invention provides a kind of method for upgrading the optimum roaming list in mobile device.Described method comprises generation and comprises the message can being blocked one or more designators of the one or more operators performed by removable Subscriber Identity Module (RUIM), and wherein, described one or more operator is for revising optimum roaming list.Described method also comprises and sends described message to mobile device.

An alternative embodiment of the invention provides a kind of method for upgrading the optimum roaming list in mobile device.Described method comprises reception and comprises the message can being blocked one or more designators of the one or more operators performed by removable Subscriber Identity Module (RUIM), and wherein, described one or more operator is for revising optimum roaming list.Described method also comprises revises described optimum roaming list according to described one or more operator.

An alternative embodiment of the invention provides a kind of communicator for upgrading the optimum roaming list in mobile device.Described device comprises the module for identifying the Data Position in described optimum roaming list.Described device also comprises the module for identifying the action type that will perform about identified Data Position.Described device also comprises the module of the data for generating the renewal part indicating described optimum roaming list.Described device also comprises the module of the message for sending instruction described Data Position, described action type and described data to mobile device.

An alternative embodiment of the invention provides a kind of communicator for upgrading the optimum roaming list in mobile device.Described device comprises the module for receiving data structure.Described data structure comprises the designator of Data Position to revise described optimum roaming list.Described data structure also comprises the designator of the action type that will perform.Described data structure also comprises the renewal part of described optimum roaming list.Described device also comprises the module for revising described optimum roaming list according to described data structure.

An alternative embodiment of the invention provides a kind of communicator for upgrading the optimum roaming list in mobile device.Described device comprises for generating the module comprising and can be blocked the message of one or more designators of the one or more operators performed by removable Subscriber Identity Module (RUIM), wherein, described one or more operator is for revising optimum roaming list.Described device also comprises the module for sending described message to mobile device.

An alternative embodiment of the invention provides a kind of communicator for upgrading the optimum roaming list in mobile device.Described device comprises for receiving the module comprising and can be blocked the message of one or more designators of the one or more operators performed by removable Subscriber Identity Module (RUIM), wherein, described one or more operator is for revising optimum roaming list.Described device also comprises the module for revising described optimum roaming list according to described one or more operator.

An alternative embodiment of the invention provides a kind of non-transitory computer program product comprising computer-readable medium.Described computer-readable medium comprises the code for making the Data Position in computer recognizing optimum roaming list.Described computer-readable medium also comprises the code for the action type making computer recognizing will perform about identified Data Position.Described computer-readable medium also comprises the code for making Practical computer teaching indicate the data of the renewal part of described optimum roaming list.Described computer-readable medium also comprises for making computer to the code of the message of mobile device transmission instruction described Data Position, described action type and described data.

An alternative embodiment of the invention provides a kind of non-transitory computer program product comprising computer-readable medium.Described computer-readable medium comprises the code for making computer receiving data structure.Described data structure comprises the designator of Data Position to revise described optimum roaming list.Described data structure also comprises the designator of the action type that will perform.Described data structure also comprises the renewal part of described optimum roaming list.Described computer-readable medium also comprises for making computer revise the code of described optimum roaming list according to described data structure.

An alternative embodiment of the invention provides a kind of non-transitory computer program product comprising computer-readable medium.Described computer-readable medium comprises for making Practical computer teaching comprise the code that can be blocked the message of one or more designators of the one or more operators performed by removable Subscriber Identity Module (RUIM), wherein, described one or more operator is for revising optimum roaming list.Described computer-readable medium also comprises for making computer send the code of described message to mobile device.

An alternative embodiment of the invention provides a kind of non-transitory computer program product comprising computer-readable medium.Described computer-readable medium comprises and comprises the code that can be blocked the message of one or more designators of the one or more operators performed by removable Subscriber Identity Module (RUIM) for making computer receive, wherein, described one or more operator is for revising optimum roaming list.Described computer-readable medium also comprises for making computer revise the code of described optimum roaming list according to described one or more operator.

Accompanying drawing explanation

Fig. 1 shows exemplary wireless communications network.

Fig. 2 shows the functional block diagram of the exemplary nodes shown in Fig. 1 and example access terminal.

Fig. 3 shows the table representing data structure, and this data structure can be sent to by node and access terminal, to upgrade the optimum roaming list that the place of accessing terminal shown in Fig. 1 stores.

Fig. 4 shows the table of a part for the data structure represented represented by the table of Fig. 3.

Fig. 5 shows the table of a part for the data structure represented represented by the table of Fig. 3.

Fig. 6 shows the table of a part for the data structure represented represented by the table of Fig. 3.

Fig. 7 shows and represents the table of data structure, and this data structure can be sent to by node and access terminal, with upgrade the place of the accessing terminal storage shown in Fig. 1 the optimum roaming list of expansion.

Fig. 8 shows the table of a part for the data structure represented represented by the table of Fig. 7.

Fig. 9 shows the table of a part for the data structure represented represented by the table of Fig. 7.

Figure 10 shows the table representing and send in single short message service message and increase progressively the data that series winding (concatenated) optimum roaming list upgrades for execution.

Figure 11 shows the table representing another data structure, and this table can be sent to by node and access terminal, to upgrade the optimum roaming list that the place of accessing terminal shown in Fig. 1 stores.

Figure 12 shows the table of a part for the data structure represented represented by the table of Figure 11.

Figure 13 shows the table representing another data structure, and this table can be sent to by node and access terminal, to upgrade the optimum roaming list of the expansion that the place of accessing terminal shown in Fig. 1 stores.

Figure 14 shows the table representing another data structure, and this table can be sent to by node and access terminal, to upgrade the optimum roaming list that the place of accessing terminal shown in Fig. 1 stores.

Figure 15 shows the table of a part for the data structure represented represented by the table of Figure 14.

Figure 16 is the flow chart of the exemplary process for upgrading the optimum roaming list accessed terminal shown in Fig. 1.

Figure 17 shows the table representing the store operator that can be performed by removable Subscriber Identity Module card.

Figure 18 shows the table representing that the memory move operation that can be performed by removable Subscriber Identity Module card accords with.

Figure 19 shows the table representing that the bit-shifting operation that can be performed by removable Subscriber Identity Module card accords with.

Figure 20 shows the table representing that the submit operation that can be performed by removable Subscriber Identity Module card accords with.

Figure 21 shows the table representing that the long move operation that can be performed by removable Subscriber Identity Module card accords with.

Figure 22 is the flow chart of the exemplary process for upgrading the optimum roaming list accessed terminal shown in Fig. 1.

Figure 23 shows the functional block diagram of another example access terminal shown in Fig. 1.

Figure 24 shows the functional block diagram of home-operator server.

Figure 25 shows the functional block diagram of Another Place To Fall carrier server.

Embodiment

In the application, use " exemplary " word represents " as example, illustration or explanation ".Any embodiment being described to " exemplary " in the application should not be interpreted as than other embodiment more preferably or have more advantage.Technology described in the invention may be used for various cordless communication network, such as code division multiple access (CDMA) network, time division multiple access (TDMA) network, frequency division multiple access (FDMA) network, orthogonal FDMA (OFDMA) network, Single Carrier Frequency Division Multiple Access (SC-FDMA) network etc.Term " network " and " system " are used interchangeably usually.Cdma network can realize the wireless technology of such as general land wireless access (UTRA), cdma2000 etc.UTRA comprises broadband-CDMA (W-CDMA) and low spreading rate (LCR).Cdma2000 contains IS-2000, IS-95 and IS-856 standard.TDMA network can realize the wireless technology of such as global system for mobile communications (GSM) and so on.OFDMA system can realize such as evolved UTRA (E-UTRA), IEEE 802.11, IEEE 802.16, IEEE 802.20, deng wireless technology.UTRA, E-UTRA and GSM are parts of global system for mobile communications (UMTS).Long Term Evolution (LTE) be use E-UTRA UMTS forthcome version.UTRA, E-UTRA, GSM, UMTS and LTE are described in the document of the tissue from " third generation partner program " (3GPP) by name.Cdma2000 is described in the document of the tissue from " third generation partner program 2 " (3GPP2) by name.These various wireless technologys and standard are well known in the art.

In some respects, instruction of the present invention may be used for comprising grand scale and covers (such as, the such as large regions cellular network of the third generation (3G) network, be commonly referred to macrocellular network) and small-scale cover (such as, based on shelter or the network environment based on building) network in.When access terminal (AT) moves in the network, in ad-hoc location, this accesses terminal and can serve by providing the access point of grand covering, and in other position, this accesses terminal and can be served by the access point providing small-scale to cover.In some respects, less overlay node can be used provide that the capacity that increases progressively increases, cover and different service (such as, for more sane Consumer's Experience) in building.In the discussion of the application, relatively large region provide the node of covering can be called grand node.Relative small area (such as, residence) provide the node of covering to be called femto nodes.The region being greater than femto region being less than grand region provide the node of covering can be called pico node (such as, providing covering in commercial building).

The community be associated with grand node, femto nodes or pico node can be called macrocell, Femto cell or picocell.In certain embodiments, each community can also be associated with (such as, being divided into) one or more sector.

In the respective applications, other term can be used to refer to for grand node, femto nodes, pico node.For example, grand node can be configured to or be called access node, base station, access point, eNodeB (e Node B), macrocell etc.Further, femto nodes can be configured to or be called home node-b, family eNodeB, access point base station, Femto cell etc.

Fig. 1 shows exemplary wireless communications network 100.This cordless communication network 100 is configured to support the communication between some users.Cordless communication network 100 can be divided into one or more community 102, such as community 102a-102g.Communication overlay in the 102a-102g of community can be provided by one or more nodes 104 (such as, base station, access point etc.) of such as node 104a-104g.Each node 104 can provide communication overlay for corresponding community 102.Node 104 can be mutual with multiple access terminal (AT) of (AT) 106a-106l that such as accesses terminal.

Each AT 106 above can communicate with one or more node 104 at forward link (FL) and/or reverse link (RL) at given time.FL is the communication link from node to AT.RL is the communication link from AT to node.FL also can be called down link.In addition, RL also can be called up link.Node 104 can be such as interconnected by suitable wired or wireless interface, and can intercom mutually.Correspondingly, each AT 106 can be communicated with another AT 106 by one or more node 104.For example, AT 106j can communicate with AT 106h as described below.AT 106j can communicate with node 104d.Node 104d can communicate with node 104b subsequently.Node 104b can communicate with AT 106h subsequently.Correspondingly, between AT 106j and AT 106h, communication is established.

Cordless communication network 100 can be managed on region significantly and provide service.For example, community 102a-102g can only cover the some blocks in adjacent area or the some sq. mi in suburban environment.In one embodiment, each community can Further Division be one or more sectors (not shown).

As mentioned above, node 104 can provide the access to communication network (such as internet or cellular network) to (AT) 106 that access terminal in its overlay area.Each node 104 can be controlled by given cellular carrier.AT 106 can be associated with specific cellular carrier (such as, home-operator), and the node 104 that this home-operator is controlled by this home-operator provides wireless coverage for AT 106.For example, the user of AT 106 can sign an agreement with home-operator, and this home-operator and then the node 104 that AT 106 can be allowed to control via this home-operator access its wireless network.In some instances, AT 106 can enter the region that this home-operator does not provide covering, because this home-operator does not have the node 104 for providing service for AT 106 in this this region.But, the node 104 controlled by other operator can be there is.This home-operator and other operator have agreement, to allow AT 106 " roaming " or to access the node 104 controlled by other operator.AT 106 can utilize PRL to locate and be connected to these access nodes 104 controlled by other operator.As used in this application, PRL can refer to PRL (ePRL), the PRL of expansion and/or the PRL (CPRL) of series winding.Home-operator can also send renewal via node 104 to AT 106 termly, to upgrade PRL as described below.

AT 106 can be the Wireless Telecom Equipment (such as, mobile phone, router, personal computer, server etc.) being used for being sent by communication network and being received voice or data by user.Access terminal (AT) also can be called subscriber equipment (UE), mobile radio station (MS) or terminal equipment in this application.As shown in the figure, AT 106a, 106h and 106j comprises router.AT 106b-106g, 106i, 106k and 106l comprise mobile phone.But each in AT 106a-106l can comprise any suitable communication equipment.

Wireless multiple-access communication system can support the communication of multiple wireless access terminal simultaneously.As mentioned above, each accessing terminal can by the transmission on forward link and reverse link and one or more node communication.Forward link (or down link) refers to from node to the communication link accessed terminal, and reverse link (or up link) refers to the communication link from the node that accesses terminal.This communication link can be set up by the system of single-input single-output system, multiple input single output (MIMO) system or certain other type.

Mimo system adopts multiple (NT) transmitting antenna and multiple (NR) reception antenna to carry out transfer of data.The mimo channel be made up of NT transmitting antenna and NR reception antenna can comprise NS independent channel, also referred to as space channel, wherein, and NS≤min{NT, NR}.Each in NS independent channel corresponds to a dimension.If utilize the other dimension created by multiple transmitting antenna and reception antenna, then mimo system can provide the performance of improvement (such as, higher throughput and/or better reliability).

Mimo system can support time division duplex (TDD) and Frequency Division Duplexing (FDD) (FDD).In a tdd system, forward link transmissions and rl transmission are carried out on same frequency field, and reciprocity principle is allowed according to reverse link channel estimation forward link channel.This makes when equipment (such as, node, access terminal) place has multiple antenna available, and this equipment can extract transmit beam-forming gain on the forward link.

Instruction in the application can be incorporated to the equipment (such as, node, access terminal) adopting various assembly and at least one miscellaneous equipment to carry out communicating.

Fig. 2 shows the functional block diagram of the exemplary nodes 104a shown in Fig. 1 and example access terminal 106a.In mimo system 200, node 104a and one or more AT (such as, AT106a) communicates.At node 104a place, provide the business datum of some data flow from data source 212 to launching (TX) data processor 214.

In one embodiment, each data flow is sent by corresponding transmitting antenna.TX data processor 214, according to the specific coding scheme selected by each data flow, formats the business datum of this data flow, encode and interweaves, to provide coded data.

The coded data of each data flow and pilot data can be carried out multiplexing by OFDM technology.Pilot data is generally the known data patterns carrying out in a known way processing, and can at receiver system place for estimating channel response.Subsequently, according to the certain modulation schemes (such as, BPSK, QPSK, M-PSK or M-QAM) selected for each data flow, to this data flow multiplexing after pilot tone and coded data modulate (such as, sign map), to provide modulation symbol.The instruction performed by processor 230 can be utilized, determine the data rate of each data flow, coding and modulation.Data storage 232 can store the program code, data and the out of Memory that are used by other assembly of processor 230 or node 104a.

The modulation symbol of all data flow is provided to TX MIMO processor 220, TX MIMO processor 220 and can processes modulation symbol (such as, for OFDM) further.Then, TX MIMO processor 220 provides NT stream of modulation symbols to NT transceiver (XCVR) 222A to 222T.In some respects, TX MIMO processor 220 pairs of data flow symbol and launching the antenna applications beam-forming weights of this symbol.

Each transceiver 222 receives and processes corresponding symbol stream to provide one or more analog signal, and step joint (such as, amplification, filtering and up-conversion) this analog signal of going forward side by side is to provide the modulation signal being adapted to pass through mimo channel transmission.NT the modulation signal from transceiver 222A to 222T is sent respectively from NT antenna 224A to 224T.

At AT 106a place, the modulation signal sent is received by NR antenna 252A to 252R, and is supplied to respective transceiver (XCVR) 254A to 254R from the signal that each antenna 252 receives.Each transceiver 254 regulates (such as, filtering, amplification and down-conversion) corresponding Received signal strength, carries out digitlization to provide sampling by the signal after regulating, and further these samplings of process to provide corresponding " reception " symbol stream.

Then, receive (RX) data processor 260 and receive NR receiving symbol stream from NR transceiver 254, and according to specific receiver treatment technology, row relax is flow to these receiving symbols, to provide NT " detection " symbol stream.RX data processor 260 carries out demodulation, deinterleaving and decoding to each detected symbol stream subsequently, to recover the business datum of each data flow.The TX MIMO processor 220 at the processing procedure performed by RX data processor 260 and node 104a place and the processing procedure performed by TX data processor 214 are complementary.

Processor 270 determines to use which pre-coding matrix (as discussed below) termly.Processor 270 forms the reverse link message comprising matrix index portion and order value part.Data storage 272 can store the program code, data and the out of Memory that are performed by other assembly of processor 270 or AT 106a.

AT 106a can also comprise removable Subscriber Identity Module (RUIM) and block 273.RUIM card 273 can carry out data communication with processor 270.As known in the art, RUIM card 273 can be used as the memory of customizing messages, and can comprise processor, to perform the order for revising or utilize the information that this RUIM card 273 stores.For example, RUIM card 273 stores the optimum roaming list (PRL) of AT 106a.In addition, RUIM card 273 is configured to perform instruction with the information of read/write/upgrade/delete storage on this RUIM card 273, such as PRL data.

Reverse link message can comprise about communication link and/or various types of information of data flow of receiving.This reverse link message is processed by TX data processor 238 subsequently.This TX data processor 238 also receives the business datum of some data flow from data source 236.This data flow modulated by modulator 280.In addition, transceiver 254A to 254R regulates this data flow, and is sent it back node 104a.

At node 104a place, the modulation signal from AT 106a is received by antenna 224.In addition, transceiver 222 regulates this modulation signal.This modulation signal of demodulator (DEMOD) 240 demodulation.RX data processor 242 processes the signal after demodulation, and extracts the reverse link message (such as, information) sent by AT 106a.Then, which pre-coding matrix processor 230 determines be used for determining beam-forming weights.In addition, the message that extracts of processor 23-process.It is to be understood that for each node 104a and AT 106a, the function of the one or more assemblies in described assembly can be provided by single component.

It should be understood that Fig. 2 is an example of AT 106a and node 104.AT 106a and node 104 can also comprise any suitable communication equipment, and can comprise: for storing the memory of data and/or instruction, for performing instruction and performing the processor of method described in the application, and for the transceiver (or Receiver And Transmitter) that transmits data and/or certain other communication interface.

As above with reference to Fig. 2 discuss, AT 106a stores PRL.This PRL comprises acquisition tables, and this acquisition tables lists and can be used for the frequency of search node 104 and frequency band when roaming by AT 106a.PRL also comprises system table, and this system table comprises the identifying information of preferred network, and wherein, AT 106a should be preferably connected to this preferred network by the node 104 controlled by the operator of this preferred network.This system table also comprises other information.

AT 106a such as can store PRL on RUIM card 273 and/or memory 272.AT 106a can also upgrade PRL according to the message received from home-operator.Generally speaking, the size of PRL can be 1 kilobytes (KB).Correspondingly, in one embodiment, home-operator can transmit 4 Short Message Service (SMS) message via node 104a to AT 106a, to upgrade the whole PRL that AT 106a place stores.This SMS message can comprise whole PRL, and correspondingly, AT 106a can substitute previously stored PRL with the PRL received.

In other embodiments, PRL can be greater than 1 KB.For example, PRL can be 8 KB even 16 KB or longer.For this larger PRL, transmitting whole PRL via SMS may have problem.This is because although the probability successfully receiving single SMS message is relatively high, the probability receiving the some SMS message required by renewal exponentially declines about the quantity of required SMS message.For example, required by 1KB PRL, the success rate receiving the SMS message that 4 send is 90%-95%.But, for larger PRL, other SMS message can be sent to send whole PRL.For example, required by 8KB PRL, the success rate receiving the SMS message that 32 send is 43%-66%.Required by 16KB PRL, the success rate receiving the SMS message that 64 send is 18.5%-44%.

In a lot of example, whole PRL can not change in each renewal, but only has a part of PRL to change.Correspondingly, all have sent redundant data each requirement in the renewal of the whole PRL of transmission.By eliminating the transmission of these redundant datas and only sending the incremental variations part of this PRL, less SMS message can be used to send PRL, and this causes higher success rate.

Some methods for increasing progressively renewal PRL that can be performed by AT 106a are described below.It should be noted, these methods are also applicable to the PRL (ePRL) upgrading expansion.In one embodiment, these methods are performed by the RUIM card 273 of amendment AT 106a.In other embodiments, other assembly of AT 106a can be revised according to the understanding of those skilled in the art.Therefore, although example is below specifically described about amendment RUIM card 273, it should be noted, these methods are also applicable to the amendment of other assembly of AT 106a.But an advantage of amendment RUIM card 273 is user's replaceable components of the RUIM card 273 normally cheapness of AT 106a.By replacing RUIM card 273, method described below can realize in existing mobile device, and without the need to revising existing mobile device further.This mode for a change upgrading PRL there is provided cost-saving solution.

A kind of increasing progressively upgrades the method for PRL and comprises and send modified PRL data structure via node 104 to AT 106a.RUIM card 273 is designed to identify modified data structure, and correspondingly changes PRL.Whether this data structure instruction RUIM card 273 should replace data in PRL, to PRL interpolation data or remove data from PRL.In one embodiment, modified structure also comprises: which of acquisition tables and system message list records the mark that will upgrade; And lastest imformation self.In another embodiment, modified structure designation data skew, this data-bias indicates with the form of amount of bits: from the beginning of these PRL data, where starts Update Table; The size of Data Update; And more new data self.In certain embodiments, this data structure comprises standard P RL head.Referring to Fig. 3-15, these methods are described in further detail.With reference to Fig. 3-10, a kind of method is described.With reference to Figure 11-13, another kind of method is described.With reference to Figure 14-15, another method is described.

In another embodiment, RUIM card 273 is modified to understand one or more operator, such as, add data, delete data, more new data, loop command, bit shift order, movement directive etc.Then, home-operator sends these operators and the data that will upgrade via node 104 to AT 106a.RUIM card 273 performs these operators.By performing these operators, use the data of transmission to upgrade PRL according to the order of operator, and this operation can incrementally complete.These methods are described in further detail below.

Fig. 3 shows the table 300 representing data structure, the PRL that this data structure can send to AT 106a to store to upgrade AT 106a by node 104.By changing the data that RUIM card 273 stores according to the instruction comprised in this data structure, AT 106a can use this data structure incrementally to upgrade PRL.This data structure can be the bit of variable number.Represented by bit in table 300 designation data structure is what.For example, front 64 bits of this data structure comprise the header information of this data structure represented by Part I 302.This header information comprises the different field as shown in Part I 302.For example, the first Field Definition of this header information size of PRL, and can refer to by field name PR_LIST_SIZE field 310.In addition, as shown in table 300, PR_LIST_SIZE field 310 is made up of 16 bits.Residue field (as shown in the Part I 302) definition of header information: identifier (PRL_LIST_ID) field 315 of the PRL that upgrade; Designator (PREF_ONLY) field 320 whether only roamed on preferred operator; Acquiescence roaming instruction (DEF_ROAM_IND) field 325; Quantity (NUM_ACQ_RECS) field 330 of the acquisition and recording that the acquisition tables of PRL comprises; And quantity (NUM_SYS_RECS) field 335 of system log (SYSLOG) that the system table of PRL comprises.

This data structure also comprises Part II 304, and what this part comprised PRL increases progressively lastest imformation.First field (NUM_INCRE_ACQ_RECS) field 340 of this Part II 304 identifies the quantity of the acquisition and recording of the acquisition tables that will upgrade according to this data structure.Second field (NUM_INCRE_SYS_RECS) field 345 of this Part II 304 identifies the quantity of the system log (SYSLOG) of the system table that will upgrade according to this data structure.3rd field (INCRE_ACQ_TABLE) field 350 comprises the real data of the acquisition tables for upgrading PRL, and how to upgrade PRL instruction (as with reference to Fig. 4 discuss).4th field (INCRE_SYS_TABLE) field 355 comprises the real data of the system table for upgrading PRL, and how to upgrade PRL instruction (as with reference to Fig. 5 discuss).

This data structure also comprises Part III 306, and this part comprises: the first field (RESERVED (for new PRL)) field 360, and it comprises for the reserved bit of byte-aligned; And second field (PR_LIST_CRC) field 365, it comprises the data for performing cyclic redundancy check (CRC) (CRC).This Part III 306 also comprises the 3rd field (RESERVED (for increasing progressively PRL)) field 370, and this field comprises second group of reserved bit, to make whole data structure equal the eight bit byte (octet) of integer amount.

Fig. 4 shows the table 400 of a part for the data structure represented represented by the table 300 of Fig. 3.As discussed with respect to FIG. 3, the INCRE_ACQ_TABLE field 350 of this data structure comprises the real data of the acquisition tables for upgrading PRL, and how to upgrade the instruction of PRL.INCRE_ACQ_TABLE field 350 comprises the quantity (being indicated by NUM_INCRE_ACQ_RECS field 340) increasing progressively acquisition and recording, and each acquisition and recording that increases progressively is represented by table 400.Each data increasing progressively acquisition and recording and comprise the single acquisition and recording for upgrading PRL.As shown in table 400, in an exemplary realization, each acquisition and recording that increases progressively is made up of 3 fields.First field " reference record number " field 405 indicates recording mechanism or the sequence number of the acquisition and recording will revised in PRL.Which kind of operation the instruction of second field " increment operation designator " field 410 will perform on indicated record.For example, ' 00 ' deletion record can be indicated; ' 01 ' can indicate inserted new record (such as, being included in " incremental data " field 415) before indicated record; ' 10 ' can indicate record is replaced with new record (such as, being included in " incremental data " field 415); ' 11 ' can use for certain other and reserve.3rd field " incremental data " field 415 comprise to add or for replace existing record new record (when the operation be associated be insert or replace time).Or if the operation be associated is deleted or certain other operation of data of not looking for novelty, then the data in this incremental data field 415 can be NULL (as do not comprised data).AT106a can utilize the value be stored in NUM_INCRE_ACQ_RECS field 340, determines that this data structure comprises and how much increases progressively acquisition and recording.In addition, increase progressively acquisition and recording for each, AT106a utilizes reference record field 405 to locate the record that will revise in memory.Then, AT 106a determines to perform which kind of operation in located enrollment according to increment operation indicator field 410, and utilizes the data in incremental data field 415 to perform indicated operation.Correspondingly, AT 106a upgrades the acquisition tables of PRL.

Fig. 5 shows the table 500 of a part for the data structure represented represented by the table 300 of Fig. 3.As discussed with respect to FIG. 3, the INCRE_SYS_TABLE field 355 of this data structure comprises the real data of the system table for upgrading PRL, and how to upgrade the instruction of PRL.INCRE_SYS_TABLE field 355 comprises the quantity (being indicated by NUM_INCRE_SYS_RECS field 345) increasing progressively system log (SYSLOG), and each system log (SYSLOG) that increases progressively is represented by table 500.Each data increasing progressively system log (SYSLOG) and comprise the individual system record for upgrading PRL.As shown in table 500, in an exemplary realization, each system log (SYSLOG) that increases progressively is made up of 3 fields.First field " reference record number " field 505 indicates recording mechanism or the sequence number of the system log (SYSLOG) will revised in PRL.Which kind of operation the instruction of second field " increment operation designator " field 510 will perform on indicated record.For example, ' 00 ' deletion record can be indicated; ' 01 ' can indicate inserted new record (such as, being included in " incremental data " field) before indicated record; ' 10 ' can indicate and will be recorded as new record (such as, being included in " incremental data " field 515); ' 11 ' can for certain other use and reserve, or can as reference Fig. 6 discuss, indicating section replaces this record (only upgrading some field in this record).3rd field " incremental data " field 515 comprise to add or for replace existing record new record (when the operation be associated be insert or replace time).Or if the operation be associated is deleted or certain other operation of data of not looking for novelty, then the data in this incremental data field 515 can be NULL (as do not comprised data).AT106a can utilize the value be stored in NUM_INCRE_SYS_RECS field 345, determines that this data structure comprises and how much increases progressively system log (SYSLOG).In addition, increase progressively system log (SYSLOG) for each, AT 106a utilizes reference record field 505 to locate the record that will revise in memory.Then, AT 106a determines to perform which kind of operation in located enrollment according to the data in increment operation indicator field 510, and utilizes the data in incremental data field 515 to perform indicated operation.Correspondingly, AT 106a upgrades the system table of PRL.

Fig. 6 shows the table 600 of a part for the data structure represented represented by the table 300 of Fig. 3.As discussed with respect to FIG. 5, the incremental data field 515 increasing progressively system log (SYSLOG) comprises the data of the record for upgrading PRL.Table 600 shows an embodiment for the only more incremental data field 515 of a part for new record.This embodiment of incremental data field 515 can use together with the value ' 11 ' in increment operation indicator field 510, and wherein, ' 11 ' represents part amendment record.Incremental data field 515 represented by table 600 only includes some field (PRE_NEG field 605, GEO field 610, PRI field 615, ACQ_INEX field 620, ROAM_IND field 625) of the record in PRL.Correspondingly, when designator is ' 11 ', those fields in the system log (SYSLOG) of only locating to some extent are that the data using incremental data field 515 to comprise upgrade.

Fig. 7 shows the table 700 representing data structure, and this data structure can send to AT 106a for the ePRL updating stored in AT 106a by node 104.By changing the data that RUIM card 273 stores according to the instruction comprised in this data structure, AT 106a can use this data structure incrementally to upgrade ePRL (being similar to the mode be described about Fig. 3-6 pairs of data structures).Therefore, below different information included in the data structure of ePRL are only described, and how to use these information.Data structure for upgrading ePRL comprises the field identical with the data structure described by composition graphs 3-6, also comprises the common subnet table that other field comprises for renewal ePRL.For example, in the Part I 702 comprising header information of this data structure, this data structure comprises following other field: CUR_SSPR_P_REV field 720, NUM_COMMON_SUBNET_RECS field 740 and RESERVED field 750.This NUM_COMMON_SUBNET_RECS field 740 is used to indicate the quantity of common subnet record included in the common subnet table of ePRL.In addition, in the Part II 704 comprising incremental data, this data structure comprises NUM_INCRE_COMMON_SUBNET_RECS field 760, the quantity of the common subnet record of the common subnet table that this field identification will upgrade according to this data structure.Part II 704 also comprises INCRE_COMMON_SUBNET_TABLE field 775, and this field comprises the real data of the common subnet table for upgrading ePRL, and how to upgrade ePRL instruction (as with reference to Fig. 8 discuss).

Fig. 8 shows the table 800 of a part for the data structure represented represented by the table 700 of Fig. 7.As discussed with respect to FIG. 7, the INCRE_COMMON_SUBNET_TABLE field 775 of this data structure comprises the real data of the common subnet table for upgrading ePRL, and how to upgrade the instruction of ePRL.This INCRE_COMMON_SUBNET_TABLE field 775 comprises the quantity (being indicated by NUM_INCRE_COMMON_SUBNET_RECS field 760) increasing progressively common subnet record, and each common subnet record that increases progressively is represented by table 800.Each data increasing progressively common subnet record and comprise the single common subnet record for upgrading ePRL.As shown in table 800, in an exemplary realization, each increase progressively catch record be made up of 3 fields.First field " reference record number " field 805 indicates recording mechanism or the sequence number of the common subnet record will revised in ePRL.Which kind of operation the instruction of second field " increment operation designator " field 810 will perform on indicated record.For example, ' 00 ' deletion record can be indicated; ' 01 ' can indicate inserted new record (such as, being included in " incremental data " field) before indicated record; ' 10 ' can indicate record is replaced with new record (such as, being included in " incremental data " field 815); ' 11 ' can replace record (only having some field to be updated in this record) or can use for certain other and reserve by indicating section.3rd field " incremental data " field 815 comprise to add or for replace existing record new record (when the operation be associated be insert or replace time).Or if the operation be associated is deleted or certain other operation of data of not looking for novelty, then the data in incremental data field 815 can be NULL (as do not comprised data).AT 106a can utilize the data in NUM_INCRE_COMMON_SUBNET_RECS field 760, determines that this data structure comprises and how much increases progressively common subnet record.In addition, increase progressively common subnet record for each, AT 106a utilizes reference record field 805 to locate the record that will revise in memory.Then, AT 106a determines to perform which kind of operation in located enrollment according to increment operation indicator field 810, and utilizes the data in incremental data field 815 to perform indicated operation.Correspondingly, AT 106a upgrades the common subnet table of ePRL.

Fig. 9 shows the table 900 of a part for the data structure represented represented by the table 800 of Fig. 8.As discussed with respect to FIG. 5, the incremental data field 515 increasing progressively system log (SYSLOG) comprises the data of the record for upgrading PRL.According to reference to the data structure described by Fig. 8, the structure of identical type can be used to upgrade ePRL.Table 900 shows an embodiment for the only more incremental data field 815 of a part for new record.This embodiment of incremental data field 815 can use together with the value ' 11 ' of increment operation indicator field 810, and wherein, ' 11 ' represents part amendment record.Incremental data field 815 represented by table 900 only includes some field (PRE_NEG field 905, GEO field 910, PRI field 915, ACQ_INEX field 920) of the record in PRL.Correspondingly, when designator is ' 11 ', those fields in the system log (SYSLOG) of only locating to some extent are that the data using incremental data field 815 to comprise upgrade.

In some instances, AT 106a can store PRL and ePRL.Correspondingly, AT 106a can store the PRL of to contact with ePRL (concatenate) to form the PRL (CPRL) that contacts.In order to upgrade PRL and ePRL, operator can send data structure to AT 106a, increase progressively CPRL (structure being used for upgrading PRL and the structure being used for upgrading ePRL are contacted by it) and the one group of bit (such as, for performing 16 bits of CRC) for performing CRC.In addition, home-operator may need to be distributed to increasing progressively PRL, ePRL or CPRL in multiple SMS message, to be transferred to AT 106a via node 104.

Figure 10 shows the table 1000 representing and send in single SMS message for performing the data increasing progressively CPRL renewal.Increase progressively CPRL data structure to be dispersed in a series of data sectional.Each segmentation is sent in SMS.As shown in the figure, each SMS message comprises 6 data fields.The type of the data structure that the first field " UTK PRL format indicator (0xF1) " field 1001 indicates SMS message to comprise (such as, with reference to increasing progressively more format described by Fig. 3-9), thus AT 106a knows how these data of decipher.Second field " sequence number of the current CPRL of increasing progressively segmentation " field 1005 indicates the segmentation received in SMS, and relative to composition, this increases progressively the order of other segmentation of CPRL data structure, thus AT 106a can arrange segmentation and determine whether any fragment loss.3rd field " sum of all CPRL of increasing progressively segmentations " field 1010 indicates for forming the sum that this increases progressively the segmentation of CPRL incremental data structure, thus AT 106a can arrange segmentation and determine whether any fragment loss.4th field " data-bias " field 1015 for: by indicating the data in this segmentation where to be stored in relative to the original position that this increases progressively the data structure of CPRL, helping to recombinate, this increases progressively CPRL.The length (according to byte) of the data sectional that the 5th field " data length of the current CPRL of increasing progressively segmentation " field 1020 indicates SMS to comprise.6th field " increasing progressively CPRL data in current fragment " field 1025 comprises the real data segmentation that this increases progressively CPRL data structure.AT 106a utilizes these fields to determine all data sectionals that have received for increasing progressively CPRL, and utilizes these fields to form CPRL data structure.

Figure 11 shows the table 1100 representing another data structure, and this another data structure can send to AT 106a for the PRL updating stored in AT 106a by node 104.By changing the data that RUIM card 273 stores according to the instruction comprised in this data structure, AT 106a can use this data structure incrementally to upgrade PRL.This data structure can be the bit of variable number.It represented by the bit in this data structure is what that table 1100 indicates.For example, front 64 bits of this data structure comprise the new header information of this data structure represented by Part I 1102.This header information comprises the different field as shown in Part I 1102.For example, the first Field Definition of this header information size of PRL, and can refer to by field name PR_LIST_SIZE field 1110.In addition, as shown in table 1100, PR_LIST_SIZE field 1110 is made up of 16 bits.The residue field (as shown in Part I 1102) of header information defines: identifier (PRL_LIST_ID) field 1115 of the PRL that upgrade; Designator (PREF_ONLY) field 1120 whether only roamed on preferred operator; Acquiescence roaming instruction (DEF_ROAM_IND) field 1125; Quantity (NUM_ACQ_RECS) field 1130 of the acquisition and recording that the acquisition tables of PRL comprises; And quantity (NUM_SYS_RECS) field 1135 of system log (SYSLOG) that the system table of PRL comprises.

This data structure also comprises Part II 1104, and what this part comprised PRL increases progressively lastest imformation.First field (NUM_INCRE_RECS) field 1140 of this Part II 1104 identifies the quantity of (any type) record that will upgrade according to this data structure of PRL.Second field (INCRE_TABLE) field 1145 comprises the real data of the record for upgrading PRL, and how to upgrade PRL instruction (as with reference to Figure 12 discuss).

This data structure also comprises Part III 1106, and this part comprises: the first field (RESERVED (for new PRL)) field 1150, and it comprises for the reserved bit of byte-aligned; And second field (PR_LIST_CRC) field 1155, it comprises the data for performing cyclic redundancy check (CRC) (CRC).This Part III 1106 also comprises: the 3rd field (RESERVED (for increasing progressively PRL)) field 1160, it comprises second group of reserved bit, to make whole data structure equal the eight bit byte of integer amount.

Figure 12 shows the table 1200 of a part for the data structure represented represented by the table 1100 of Figure 11.As discussed with respect to FIG. 11, the INCRE_TABLE field 1145 of this data structure comprises the real data for upgrading PRL, and how to upgrade the instruction of PRL.INCRE_TABLE field 1145 comprises the quantity (being indicated by NUM_INCRE_RECS field 1140) of incremental record, and each incremental record is represented by table 1200.Each incremental record comprises the data for upgrading the data slice in stored PRL.As shown in table 1200, in an exemplary realization, each incremental record is made up of 4 fields.First field " reference data skew " field 1205 bitwise indicate for start Update Table, the position that starts relative to PRL data (it is stored in RUIM card 273) or skew.Second field " grouped data size " field 1210 bitwise indicates and comprises this amount of bits of starting position for revising.3rd field " increment operation designator " field 1215 indicates the operation that will perform on indicated Data Position.For example, ' 00 ' deletion data slice can be indicated; ' 01 ' can indicate inserted new data sheet (such as, being included in " incremental data " field 1220) before indicated position; ' 10 ' can indicate data slice is replaced with new data (such as, being included in " incremental data " field 1220); ' 11 ' can use for certain other and reserve.4th field " incremental data " field 1220 comprise to add or for replace available data new data sheet (when the operation be associated be insert or replace time).If add or replace new data, then the length of this incremental data field 1220 is specified by segment data size field 1210.Or if the operation be associated is deleted or certain other operation of data of not looking for novelty, then the data in this incremental data field 1220 can be NULL (as do not comprised data).AT 106a can utilize the data in NUM_INCRE_RECS field 1140, determines data structure comprises how many incremental records.In addition, for each incremental record, AT 106a utilizes reference data offset field 1205 to locate the Data Position that will modify in memory, and utilizes segment data size field 1210 to determine to want Update Table to which point.Then, AT 106a determines to perform which kind of operation in located enrollment according to the data in increment operation indicator field 1215, and utilizes the data in incremental data field 1220 to perform indicated operation.Correspondingly, AT 106a upgrades PRL.

Figure 13 shows the table 1300 representing another data structure, and this another data structure can send to AT 106a for the ePRL updating stored in AT 106a by node 104.By changing the data that RUIM card 273 stores according to the instruction comprised in this data structure, AT 106 can use this data structure incrementally to upgrade ePRL (being similar to the mode be described about Figure 11-12 pairs of data structures).Therefore, only describe the different information included by the data structure of ePRL below and how to use these information.Data structure for upgrading ePRL comprise with about the identical field of the data structure described by Figure 11-12, also comprise other field.For example, in the Part I 1302 comprising header information of this data structure, this data structure comprises following other field: CUR_SSPR_P_REV field 1320, NUM_COMMON_SUBNET_RECS field 1340 and RESERVED field 1350.NUM_COMMON_SUBNET_RECS field 1340 is used to indicate the quantity of common subnet record included in the common subnet table of ePRL.

In some instances, AT 106a can store PRL and ePRL.Correspondingly, AT 106a can store the PRL that contacts with ePRL to form the PRL (CPRL) that contacts.In order to upgrade PRL and ePRL, operator can send data structure to AT 106a, increase progressively CPRL (structure being used for upgrading PRL and the structure being used for upgrading ePRL are contacted by it) and the one group of bit (such as, for performing 16 bits of CRC) for performing CRC.In addition, home-operator may need to be distributed to increasing progressively PRL, ePRL or CPRL in multiple SMS message, to be transferred to AT 106a via node 104.Can be similar to above with reference to the mode described by Figure 10 send increase progressively CPRL and AT 106a place use this increase progressively CPRL.But UTK PRL format indicator can have different values (such as, 0xF2), has for upgrading the dissimilar of CPRL to indicate this data structure.

Figure 14 shows the table 1400 representing another data structure, and this another data structure can send to AT 106a for PRL, ePRL or CPRL of updating stored in AT 106a by node 104.AT 106a can, by changing the data that RUIM card 273 stores according to the instruction comprised in this data structure, use this data structure incrementally to upgrade PRL, ePRL or CPRL.This data structure can be the bit of variable number.It represented by the bit in this data structure is what that table 1400 indicates.

This data structure comprises Part I 1404, and what this part comprised PRL, ePRL or CPRL increases progressively lastest imformation.First field (NUM_INCRE_RECS) field 1410 of this Part I 1404 identifies the quantity of the incremental record in INCRE_TABLE field 1415, wherein, this incremental record will be used for the data upgraded according to this data structure in PRL, ePRL or CPRL.Second field (INCRE_TABLE) field 1415 comprises the real data of the record for upgrading PRL, ePRL or CPRL, and how to upgrade PRL, ePRL or CPRL instruction (as with reference to Figure 15 discuss).

This data structure also comprises Part II 1406, and this part comprises: the first field (RESERVED) field 1420, and it comprises reserved bit, with the eight bit byte making whole data structure equal integer amount; And second field (PR_LIST_CRC) field 1425, it comprises for performing cyclic redundancy check (CRC) (CRC) to guarantee that it corresponds to the data of PRL, ePRL or CPRL of storage on PRL, ePRL or CPRL of generating.This Part II 1406 also comprises: the 3rd field (CRC) field 1430, and it comprises for performing cyclic redundancy check (CRC) (CRC) to guarantee its data correctly received in the data structure received.

Figure 15 shows the table 1500 of a part for the data structure represented represented by the table 1400 of Figure 14.As discussed with respect to FIG. 14, the INCRE_TABLE field 1415 of this data structure comprises the real data for upgrading PRL, ePRL or CPRL, and how to upgrade the instruction of this PRL, ePRL or CPRL.INCRE_TABLE field 1415 comprises the quantity (being indicated by NUM_INCRE_RECS field 1410) of incremental record, and each incremental record is represented by table 1500.Each incremental record comprises the data for upgrading the data slice in PRL, ePRL or CPRL.As shown in table 1500, in an exemplary realization, each incremental record is made up of 4 fields.First field " reference data skew " field 1505 bitwise indicate for start Update Table, the position that starts relative to PRL, ePRL or CPRL (being stored in RUIM card 273) or skew.Second field " grouped data size " 1510 bitwise indicates and comprises this amount of bits of starting position for revising.Which kind of operation the instruction of 3rd field " increment operation designator " field 1515 will perform in indicated data.For example, ' 00 ' deletion data slice can be indicated; ' 01 ' can indicate inserted new data sheet (such as, being included in " incremental data " field 1520) before indicated Data Position; ' 10 ' can indicate data slice is replaced with new record (such as, being included in " incremental data " field 1520); ' 11 ' can use for certain other and reserve.4th field " incremental data " field 1520 comprise to add or for replace available data new data sheet (when the operation be associated be insert or replace time).If add or replace new data, then the length of this incremental data field 1520 is specified by segment data size field 1510.Or if the operation be associated is deleted or certain other operation of data of not looking for novelty, then the data in this incremental data field 1520 can be NULL (as do not comprised data).AT 106a can utilize the data in NUM_INCRE_RECS field 1410, determines data structure comprises how many incremental records.In addition, for each incremental record, AT 106a utilizes reference data offset field 1505 to locate the Data Position that will modify in memory, and utilizes segment data size field 1510 to determine to want Update Table to which point.Then, AT 106a determines to perform which kind of operation at located data place according to increment operation indicator field 1515, and utilizes the data in incremental data field 1520 to perform indicated operation.Correspondingly, AT 106a upgrades PRL, ePRL or CPRL.

Home-operator may need to be distributed to increasing progressively PRL, ePRL or CPRL in multiple SMS message, to be transferred to AT 106a via node 104.Can be similar to above with reference to the mode described by Figure 10 send increase progressively PRL, ePRL or CPRL and AT 106a place use this increase progressively PRL, ePRL or CPRL.But UTK PRL format indicator can have different values (such as, 0xF3), has for upgrading the dissimilar of PRL, ePRL or CPRL to indicate this data structure.In addition, with reference in the method described by Figure 14-15, the head of new PRL, ePRL or CPRL can be sent together with first new data (such as, by using the data structure described by reference Figure 11-13) in an only incremental record.Correspondingly, header data can be upgraded together with other data, thus reduces expense and volume of transmitted data.

Compared to the method described by reference Fig. 3-10, the method of Figure 11-13 and Figure 14-15 allows locating more new record at an arbitrary position, and allow only to utilize single incremental record to upgrade multiple continuous print record, because the length of lastest imformation can cross over some records.In addition, the server (PRL server) that home-operator can be required to control above with reference to each method described by Fig. 3-15 is configured to send suitable information via node 104 to AT 106a as described above.This server can be any computing equipment.In addition, this server can comprise the general processor, digital signal processor (DSP), application-specific integrated circuit (ASIC) (ASIC), field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, the discrete nextport hardware component NextPort that are designed to perform function described in the application or it is appropriately combined arbitrarily.Also this server can be embodied as the combination of computing equipment, such as, the combination that the combination of DSP and microprocessor, multi-microprocessor, one or more microprocessor communicate with DSP or any other this type of configure.

Figure 16 is the flow chart of the exemplary process of PRL, ePRL and/or CPRL for upgrading AT 106a.In step 1603, home-operator server receives the information about PRL, ePRL and/or the CPRL being stored in AT 106a place.In one embodiment, home-operator server receives PRL, ePRL and/or CPRL from AT 106a.Or home-operator server can obtain PRL, ePRL and/or CPRL from database.In step 1605, there are in the identification of home-operator server PRL, ePRL and/or CPRL one or more Data Positions of the data that will upgrade.For example, PRL, ePRL and/or CPRL of receiving and new PRL, ePRL and/or CPRL compare by home-operator server.Proceed to step 1610, one or more action types (interpolation, deletion, renewal etc.) that the identification of home-operator server will perform at one or more Data Position place identified.Arrive step 1615 further, home-operator server generates the data of the renewal part of instruction PRL, ePRL and/or CPRL, and this renewal part is with the Data Position identified and operate corresponding.For example, home-operator server can generate data structure (such as, above with reference to those data structures described by Fig. 3-15) according to the data that will revise of PRL, ePRL and/or CPRL.Next in step 1620, generated data are transferred to AT 106a via node 104 by home-operator server.

Proceed to step 1625, AT 106a receives the data generated.Further, in step 1630, AT 106a revises PRL, ePRL and/or CPRL according to the data generated received.For example, AT 106a can use the data structure that receives and revise PRL, ePRL and/or CPRL (as above with reference to Fig. 3-15 discuss).

As discussed above, can by configuration RUIM card 273 to understand one or more operator (such as, store operator, move operation symbol, bit-shifting operation symbol, submit operation symbol, cycling symbol etc.), realize for increasing progressively another embodiment upgrading PRL, ePRL and/or CPRL.By using these operators, (such as, interpolation, deletion, renewal etc.) can be modified at RUIM Ka273Chu to data.

Operator can be sent to AT 106a via node 104 by home-operator.Data AND operator can also send by home-operator together, such as, when this operator is the store operator storing the data sent with this operator.RUIM card 273 executable operations accords with.Being accorded with by executable operations, upgrade the memory for storing PRL, ePRL and/or CPRL in RUIM card 273 according to the order of operator, and this operation incrementally can be carried out.

Figure 17 shows expression can by the table 1700 of the store operator of RUIM card 273 execution.Store operator is used for storing data in RUIM card 273.Store operator is made up of " label " field 1705, " length " field 1710, " position " field 1715 and " data " field 1720.Label field 1705 can have the length of 1 byte, and length field 1710 can have the length of 1 byte, and location field 1715 can have the length of 2 bytes, and the value that the length of data field 1720 can equal length field 1710 deducts 2 bytes.RUIM card 273 can have according to label field 1705 value (such as, 0x01) be associated with store operator, and operator is identified as store operator.The length of the data that RUIM card 273 can also will store is identified as the value equaling length field 1710.RUIM card 273 according to location field 1715, can also come the position that identification data will be stored in the memory of RUIM card 273.Finally, the data that will write RUIM card 273 in given position can be found in the data field 1720 of store operator.For example, if RUIM card 273 receives bit stream 0103000125, then RUIM card 273 can fill order with storing value 0x25 (starting from byte location 0001 place of PRL).

Figure 18 shows the table 1800 representing and can be accorded with by the memory move operation of RUIM card 273 execution.This memory move operation symbol is used for copying data to another position from the position of RUIM card 273 in byte rank.This memory move operation symbol is made up of " label " field 1805, " source address " field 1810, " length " field 1815 and " destination " field 1820.Label field 1805 can have the length of 1 byte, and source address field 1810 can have the length of 2 bytes, and length field 1815 can have the length of 2 bytes, and destination address field 1820 can have the length of 2 bytes.RUIM card 273 can have according to label field 1805 value (such as, 0x02) according with memory move operation and being associated, and operator is identified as memory move operation symbol.RUIM card 273 according to source address field 1810, can also identify the original position that the data that will copy are positioned in the memory of RUIM card 273.The length of the data that RUIM card 273 can also will copy is identified as the value equaling length field 1815.Finally, RUIM card 273 according to destination address field 1820, can also identify position data copy will arrived in the memory of RUIM card 273.For example, if RUIM card 273 receives bit stream 021E4F181025, then RUIM 273 can fill order, sets to 0 x1025 the data copy of the byte of the 0x18 from the 0x1E4F of position to be put in place.

Figure 19 shows the table 1900 representing and can be accorded with by the bit-shifting operation of RUIM card 273 execution.This bit-shifting operation symbol is used for copying data to another position from the position of RUIM card 273 in bit levels.This bit-shifting operation symbol is made up of " label " field 1905, " source address " field 1910, " length " field 1915 and " destination " field 1920.Label field 1905 can have the length of 1 byte, and source address field 1910 can have the length of 3 bytes, and length field 1915 can have the length of 3 bytes, and destination address field 1920 can have the length of 3 bytes.RUIM card 273 can have according to label field 1905 value (such as, 0x03) according with bit-shifting operation and being associated, and operator is identified as bit-shifting operation symbol.RUIM card 273, also according to source address field 1910, identifies the original position that the data that will copy are positioned in the memory of RUIM card 273.The length of the data that RUIM card 273 can also will copy is identified as the value equaling length field 1915.Finally, RUIM card 273 according to destination address field 1920, can also identify position data copy will arrived in the memory of RUIM card 273.For example, if RUIM card 273 receives bit stream 03001902000010001901, then RUIM 273 can fill order, sets to 0 first bit of x0019 the data copy of 0x10 bit from second bit of position 0x0019 to be put in place.

Figure 20 shows the table 2000 representing and can be accorded with by the submit operation of RUIM card 273 execution.This submit operation symbol is used for memory data from buffer being moved to RUIM card 273.Submit operation symbol is made up of " label " field 2005 and " length " field 2010.Label field 2005 can have the length of 1 byte, and length field 2010 can have the length of 2 bytes.RUIM card 273 can have according to label field 2005 value (such as, 0x04) according with submit operation and being associated, and this operator is identified as submit operation symbol.RUIM card 273 according to length field 2010, can also identify the length that will move to the data of the file system of RUIM card 273 from the buffer RUIM card 273.For example, if RUIM card 273 receives bit stream 040025, then RUIM card 273 can fill order, 0x25 byte to be copied to the memory of RUIM card 273 from buffer.

Figure 21 shows the table 2100 representing and can be accorded with by the long move operation of RUIM card 273 execution.This long move operation symbol is used for copying data to some different position from the some positions RUIM card 273.This long move operation symbol is made up of " label " field 2105, " source address is initial " field 2110, " source address terminates " field 2115, " source address step-length " field 2120, " destination-address is initial " field 2125, " destination-address terminates " field 2130, " destination-address step-length " field 2135 and " length " field 2140.Label field 2105 can have the length of 1 byte, source address start field 2110 can have the length of 2 bytes, source address trailer field 2115 can have the length of 2 bytes, source address step-length field 2120 can have the length of 1 byte, destination-address start field 2125 can have the length of 2 bytes, destination-address trailer field 2130 can have the length of 2 bytes, destination-address step-length field 2135 can have the length of 1 byte, and length field 2149 can have the length of 2 bytes.RUIM card 273 can have according to label field 2105 value (such as, 0x82) according with long move operation and being associated, and this operator is identified as long move operation symbol.In addition, RUIM card 273 is configured to: for the position of the position from the position indicated by source address start field 2110 until indicated by source address trailer field 2115, the mobile data (it has the length indicated by length field 2140) from each position in these positions, wherein, these positions are separated by the amount indicated by source address step-length field 2120.RUIM card 273 is configured to: for the position of the position from the position indicated by destination-address start field 2125 until indicated by destination-address trailer field 2130, by the data mobile of each corresponding position to each position in these positions, wherein, these positions are separated by the amount indicated by destination-address step-length field 2135.For example, if RUIM card 273 receives bit stream 82196119730619711987080004, then this RUIM card 273 copies the byte of 4 from 0x1961 to 0x1971, copy 4 bytes from 0x (1961+6) to 0x (1971+8), copy 4 bytes from 0x (1961+6*2) to 0x (1971+8*2).

Figure 22 is the flow chart of the exemplary process of PRL, ePRL and/or CPRL for upgrading AT 106a.In step 2205, AT 106a can send message to ask PRL, ePRL and/or CPRL of upgrading via node 104 to home-operator server.As a part for message, AT106a can comprise " fingerprint ", should " fingerprint " for which PRL, ePRL and/or the CPRL being stored in this home-operator server place for the identification of home-operator server be associated with this AT 106.Home-operator server can store PRL, ePRL and/or CPRL information for some AT.Correspondingly, arrive step 2210 further, home-operator server can by PRL, ePRL and/or CPRL data utilizing this fingerprint to identify storage.This fingerprint can comprise a part (such as, last 4 bytes of CRC) for the CRC information be associated with PRL, ePRL and/or CPRL of being stored in AT 106a place.Then, home-operator server by using identical fingerprint location PRL, ePRL and/or CPRL, can find PRL, ePRL and/or CPRL of being associated of being stored in this home-operator server place.As the replacement to step 2205-2210, home-operator server can initiate the renewal of PRL, ePRL and/or CPRL to AT 106a.

Further, in step 2215, home-operator server can use differential, merging and/or compare tool (such as subsequently, Araxis Merge, IDM UltaCompare etc.), old PRL, ePRL and/or CPRL of the AT 106a be stored in this server and new PRL, ePRL and/or CPRL are compared.Proceed to step 2220, home-operator server determines one group of operator, and wherein, this group operator is used for old PRL, ePRL and/or CPRL being revised as when performing to have the information identical with new PRL, ePRL and/or CPRL.For example, home-operator server can form the sequence (those operator sequences such as, discussed) of operator herein.Home-operator server can the selection of Optimum Operation symbol, to reduce the quantity of the operator of PRL, ePRL and/or CPRL for upgrading AT 106a place sent.For example, home-operator server can comprise PRL analyzer.This PRL analyzer can identify the source address of data at old PRL, ePRL and/or CPRL of the new destination-address being arranged in new PRL, ePRL and/or CPRL.This PRL analyzer can also generating run symbol (such as, memory moves, bit shift, long mobile etc.), with from source address to destination-address copies data.In addition, this PRL analyzer can also accord with (such as, storing), to be inserted in old PRL, ePRL and/or CPRL by the new data from new PRL, ePRL and/or CPRL by generating run.This PRL analyzer can also calculate the size of new PRL, and the size indicated by using generates submit operation symbol.

Further, in step 2225 place, generated operator can be distributed in a series of SMS message by home-operator server, and each SMS message comprises one or more operator.For example, each SMS message can comprise the head of 7 bytes, followed by one or more operator in order thereafter.This head can comprise the first byte, and the latter indicates the sequence number of SMS message.This head can comprise the second byte, and the latter indicates the protocol version of operator.This head can also comprise the 3rd byte, and the latter indicates the length of operator.This head can also comprise nybble, and the latter comprises the fingerprint of PRL, ePRL and/or CPRL that will upgrade of this AT 106a.

Proceed to step 2230, SMS message is sent to AT 106a via node 104 by home-operator server.This AT 106a receives SMS message in step 2235.In step 2240, AT 106a determine fingerprint in each SMS message whether with the fingerprint matches of PRL, ePRL and/or CPRL being stored in AT 106a place.If in step 2240, AT 106a determines that fingerprint does not mate, then processing procedure terminates.If in step 2240, AT 106a determines fingerprint matching, then processing procedure proceeds to step 2245.

In step 2245 place, AT 106a arranges operator in order according to the sequence number of each SMS message.Further in step 2250, the RUIM card 237 on AT 106a is executable operations symbol in order, thus upgrades PRL, ePRL and/or CPRL.

One skilled in the art would recognize that and can add different steps to the processing procedure described with reference to Figure 16 and 22, or from wherein ignoring different steps.In addition, each step of these processing procedures can perform according to the order different from order as described above.

Figure 23 shows the functional block diagram of another example access terminal 106a shown in Fig. 1.Equipment 2300 comprises the module 2305 and 2310 for performing each action discussed with reference to Fig. 3-22.

Figure 24 shows the functional block diagram of home-operator server.Equipment 2400 comprises the module 2405,2410,2415 and 2420 for performing each action discussed with reference to Fig. 3-22.

Figure 25 shows the functional block diagram of another home-operator server.Equipment 2500 comprises the module 2505 and 2510 for performing each action discussed with reference to Fig. 3-22.

It should be understood that any mention of the use such as title such as " first ", " second " to this paper key element is not generally the quantity or the order that limit these key elements.Exactly, these titles can be used as to distinguish two or more key elements in this article, or the short-cut method of two or more examples of differentiation key element.Therefore, the first element and mentioning of the second key element are not meant that here only to use two key elements, does not mean that the first element must in some way prior to the second key element yet.Further, unless separately stated, otherwise one group of key element can comprise one or more key element.In addition, the term of " in A, B or C at least one " form used in specification or claims represents " A or B or C, or the combination in any of these key elements ".

Any one that it will be appreciated by those skilled in the art that information and signal can use in multiple different techniques and methods represents.Such as, the data mentioned in the description on run through, instruction, order, information, signal, bit, symbol and chip can represent with voltage, electric current, electromagnetic wave, magnetic field or magnetic particle, light field or light particle or its combination in any.

Those skilled in the art be to be further appreciated that, in conjunction with disclosed in example and each illustrative box, module, circuit, method and algorithm of describing all can be embodied as electronic hardware, computer software or its combination.In order to clearly represent this interchangeability between hardware and software, all around its function, describe, in general terms is carried out to each illustrative assembly, frame, module, circuit, method and algorithm above.Be embodied as hardware as this function or be embodied as software, the design constraint depending on specific application and whole system is applied.Those skilled in the art for each application-specific, can realize described function in the mode of accommodation, but, thisly realize decision-making and should not be construed as and deviate from protection scope of the present invention.

By being designed to perform the general processor of function described herein, digital signal processor (DSP), application-specific integrated circuit (ASIC) (ASIC), field programmable gate array (FPGA) or other programmable logic device (PLD), discrete gate or transistor logic, discrete hardware components or its combination in any, can realize or perform each illustrative logic diagram, module and circuit of describing in conjunction with example disclosed herein.General processor can be microprocessor, or this processor also can be the processor of any routine, controller, microcontroller or state machine.Processor also can be implemented as the combination of computing equipment, and such as, the combination of DSP and microprocessor, multi-microprocessor, one or more microprocessor communicate with DSP and combine, or other this kind of configuration any.

In the method described in conjunction with aspect disclosed herein or the step of algorithm can be embodied directly in hardware, processor performs software module or in both combination.Software module (such as, comprise executable instruction and related data) and other data can be arranged in data storage, such as, the computer-readable recording medium of RAM memory, flash memory, ROM memory, eprom memory, eeprom memory, register, hard disk, portable hard drive, CD-ROM or other form any known in the art.Exemplary storage medium can be coupled to machine, such as computer/processor (conveniently can be called in this application " processor); thus this processor can from this read information (such as, code) and written information wherein.Exemplary storage medium can be the part of processor.Processor and storage medium can be arranged in ASIC.ASIC can be arranged in subscriber equipment.Or processor and storage medium can be arranged in subscriber equipment as discrete assembly.In addition, in some respects, any suitable computer program can comprise computer-readable medium, and this computer-readable medium comprises the code (code that such as, can by least one computer be performed) relevant to one or more aspect of the present invention.In some respects, computer program can comprise packaging material.

In one or more exemplary embodiment, function described herein can realize in hardware, software, firmware or its combination in any.If realized in software, then function can be stored on a computer-readable medium with the form of one or more instruction or code or be transmitted by it.Computer-readable medium comprises computer-readable storage medium and communication media, and wherein, communication media comprises and contributing to computer program from a position transfer to any medium of another location.Storage medium can be can by any usable medium of computer access.For example unrestricted, this computer-readable medium can comprise RAM, ROM, EEPROM, CD-ROM or other optical disc memory apparatus, magnetic disc store or other magnetic storage apparatus or may be used for carrying or storing the expectation with instruction or data structure form program code and can by other medium any of computer access.In addition, any connection suitably can be called computer-readable medium.Such as, if use coaxial cable, optical fiber cable, twisted-pair feeder, Digital Subscriber Line (DSL) or wireless technology (such as infrared ray, radio and microwave) from website, server or other remote source software, then this coaxial cable, optical fiber cable, twisted-pair feeder, DSL or wireless technology (such as infrared ray, radio and microwave) are included in the definition of medium.The disk that the application uses and CD comprise compact disk (CD), laser disk, CD, digital versatile disc (DVD), floppy disk and Blu-ray Disc, wherein, disk is usually with the mode rendering data of magnetic, and cd-rom using laser is with the mode rendering data of light.Therefore, in some respects, computer-readable medium can comprise non-transitory computer-readable medium (such as, tangible medium).In addition, in some respects, computer-readable medium can comprise temporary computer readable medium (such as, signal).Above-mentioned combination also should be included in the scope of computer-readable medium.

Realize for enabling those skilled in the art or use the present invention, above disclosed example being described.To those skilled in the art, the various alter modes of these examples are all apparent, and application-defined general principles also can be applicable to other example on the basis not departing from spirit of the present invention and protection range.Therefore, the present invention is not limited to the example that the application provides, but consistent with the widest scope of principle disclosed in the present application and novel feature.

Claims (30)

1., for upgrading a communicator for the optimum roaming list in mobile device, described device comprises:

Processor, for generating the message comprising and can be blocked one or more designators of the one or more operators performed by removable Subscriber Identity Module (RUIM), wherein, described one or more operator is for revising optimum roaming list; And

Transmitter, for sending described message to mobile device.

2. device as claimed in claim 1, wherein, described action type be following at least one item: movement, storage, bit shift, submission and copy.

3. device as claimed in claim 1, wherein, described message comprises multiple short message service message.

4. device as claimed in claim 1, wherein, described optimum roaming list is the optimum roaming list of series winding.

5. device as claimed in claim 1, wherein, described optimum roaming list is the optimum roaming list of expansion.

6., for upgrading a communicator for the optimum roaming list in mobile device, described device comprises:

Receiver, for receiving the message comprising and can be blocked one or more designators of the one or more operators performed by removable Subscriber Identity Module (RUIM), wherein, described one or more operator is for revising optimum roaming list; And

Processor, for revising described optimum roaming list according to described one or more operator.

7. device as claimed in claim 6, wherein, described action type be following at least one item: movement, storage, bit shift, submission and copy.

8. device as claimed in claim 6, wherein, described message comprises multiple short message service message.

9. device as claimed in claim 6, wherein, described optimum roaming list is the optimum roaming list of series winding.

10. device as claimed in claim 6, wherein, described optimum roaming list is the optimum roaming list of expansion.

11. 1 kinds for upgrading the method for the optimum roaming list in mobile device, described method comprises:

Generation comprises the message can being blocked one or more designators of the one or more operators performed by removable Subscriber Identity Module (RUIM), and wherein, described one or more operator is for revising optimum roaming list; And

Described message is sent to mobile device.

12. methods as claimed in claim 11, wherein, described action type be following at least one item: movement, storage, bit shift, submission and copy.

13. methods as claimed in claim 11, wherein, described message comprises multiple short message service message.

14. methods as claimed in claim 11, wherein, described optimum roaming list is the optimum roaming list of series winding.

15. methods as claimed in claim 11, wherein, described optimum roaming list is the optimum roaming list of expansion.

16. 1 kinds for upgrading the method for the optimum roaming list in mobile device, described method comprises:

Reception comprises the message can being blocked one or more designators of the one or more operators performed by removable Subscriber Identity Module (RUIM), and wherein, described one or more operator is for revising optimum roaming list; And

Described optimum roaming list is revised according to described one or more operator.

17. methods as claimed in claim 16, wherein, described action type be following at least one item: movement, storage, bit shift, submission and copy.

18. methods as claimed in claim 16, wherein, described message comprises multiple short message service message.

19. methods as claimed in claim 16, wherein, described optimum roaming list is the optimum roaming list of series winding.

20. methods as claimed in claim 16, wherein, described optimum roaming list is the optimum roaming list of expansion.

21. 1 kinds for upgrading the communicator of the optimum roaming list in mobile device, described device comprises:

For generating the module comprising and can be blocked the message of one or more designators of the one or more operators performed by removable Subscriber Identity Module (RUIM), wherein, described one or more operator is for revising optimum roaming list; And

For sending the module of described message to mobile device.

22. devices as claimed in claim 21, wherein, described action type be following at least one item: movement, storage, bit shift, submission and copy.

23. devices as claimed in claim 21, wherein, described message comprises multiple short message service message.

24. devices as claimed in claim 21, wherein, described optimum roaming list is the optimum roaming list of series winding.

25. devices as claimed in claim 21, wherein, described optimum roaming list is the optimum roaming list of expansion.

26. 1 kinds for upgrading the communicator of the optimum roaming list in mobile device, described device comprises:

For receiving the module comprising and can be blocked the message of one or more designators of the one or more operators performed by removable Subscriber Identity Module (RUIM), wherein, described one or more operator is for revising optimum roaming list; And

For revising the module of described optimum roaming list according to described one or more operator.

27. devices as claimed in claim 26, wherein, described action type be following at least one item: movement, storage, bit shift, submission and copy.

28. devices as claimed in claim 26, wherein, described message comprises multiple short message service message.

29. devices as claimed in claim 26, wherein, described optimum roaming list is the optimum roaming list of series winding.

30. devices as claimed in claim 26, wherein, described optimum roaming list is the optimum roaming list of expansion.