Classifications

• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F8/00—Arrangements for software engineering
  • G06F8/60—Software deployment
  • G06F8/65—Updates
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F8/00—Arrangements for software engineering
  • G06F8/60—Software deployment
  • G06F8/65—Updates
  • G06F8/654—Updates using techniques specially adapted for alterable solid state memories, e.g. for EEPROM or flash memories
• • G—PHYSICS
  • G06—COMPUTING; CALCULATING OR COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F9/00—Arrangements for program control, e.g. control units
  • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
  • G06F9/44—Arrangements for executing specific programs
  • G06F9/445—Program loading or initiating
  • G06F9/44521—Dynamic linking or loading; Link editing at or after load time, e.g. Java class loading
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
  • H04W12/08—Access security
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
  • H04W12/30—Security of mobile devices; Security of mobile applications
  • H04W12/35—Protecting application or service provisioning, e.g. securing SIM application provisioning
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W8/00—Network data management
  • H04W8/22—Processing or transfer of terminal data, e.g. status or physical capabilities
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W8/00—Network data management
  • H04W8/22—Processing or transfer of terminal data, e.g. status or physical capabilities
  • H04W8/24—Transfer of terminal data
  • H04W8/245—Transfer of terminal data from a network towards a terminal
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W8/00—Network data management
  • H04W8/18—Processing of user or subscriber data, e.g. subscribed services, user preferences or user profiles; Transfer of user or subscriber data
  • H04W8/20—Transfer of user or subscriber data
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04W—WIRELESS COMMUNICATION NETWORKS
  • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
  • H04W88/02—Terminal devices

Definitions

• This invention generally relates to wireless communications devices and, more particularly, to a system and method for executing dynamic instructions sets with the system software of a wireless communication device in the field.
• the traditional approach to such updates has been to recall the wireless communications device, also referred to herein as a wireless device, phone, telephone, or handset, to the nearest carrier retail/service outlet, or to the manufacturer to process the changes.
• the costs involved in such updates are extensive and eat into the bottom line.
• the wireless devices are used in a number of environments, with different subscriber services, for a number of different customer applications. Therefore, even if the software of a wireless device can be upgraded to improve service, it is unlikely that the upgrade will provide a uniform improvement for all users.
• wireless communications device software could be upgraded cheaply, and without inconvenience to the customer. It would be advantageous if wireless communications device software could be upgraded without the customer losing the use of their phones for a significant period of time.
• wireless communications device software could be updated with a minimum of technician service time, or without the need to send the device into a service facility.
• the wireless device system software could be differentiated into code sections, so that only specific code sections of system software would need to be replaced, to update the system software. It would be advantageous if these code sections could be communicated to the wireless device via the airlink.
• the wireless device could monitor the performance of the wireless device system software, collect performance data, and transmits the data to a system central collection depot for analysis.
• Wireless communications device software updates give customers the best possible product and user experience. An expensive component of the business involves the recall of handsets to update the software. These updates may be necessary to offer the user additional services or to address problems discovered in the use of the phone after it has been manufactured.
• the present invention makes it possible to practically upgrade handset software in the field, via the airlink interface. More specifically, the present invention permits the wireless communication device to execute dynamic instruction sets. These dynamic instruction sets permit the wireless device to "intelligently", or conditionally upgrade the system software and system data. Further, the dynamic instruction sets permit the wireless device to monitor system software performance, and transmit the performance data for analysis. Accordingly, a method is provided for executing dynamic instruction sets in a wireless communications device.
• the method comprises: forming the system software into symbol libraries, each symbol library comprising symbols having related functionality; arranging the symbol libraries into code sections in a code storage section nonvolatile memory; executing system software; receiving a patch manager run time instruction (PMRTI) or dynamic instruction sets, including conditional operation code and data items, in a file system section nonvolatile memory; calling a run-time library from a first code section; processing the patch manager run time instruction operation code; operating on system data and system software; and, in response to operating on the system data and system software, controlling the execution of the system software.
• PMRTI patch manager run time instruction
• dynamic instruction sets including conditional operation code and data items
• FIG. 1 is a schematic block diagram of the overall wireless device software maintenance system.
• Fig. 2 is a schematic block diagram of the software maintenance system, highlighting the installation of instruction sets via the airlink interface.
• Fig. 3 is a schematic block diagram illustrating the present invention system for executing dynamic instruction sets in a wireless communications device.
• Fig. 4 is a schematic block diagram of the wireless device memory.
• Fig. 5 is a table representing the code section address table of Fig. 3.
• Fig. 6 is a detailed depiction of symbol library one of Fig. 3, with symbols.
• Fig. 7 is a table representing the symbol offset address table of Fig, 3.
• Fig. 8 is a depiction of the operation code (op-code) being accessed by the run-time engine.
• Fig. 9 is a more detailed depiction of the first operation code of Fig. 8.
• Figs. 10a and 10b are flowcharts illustrating the present invention method for executing dynamic instruction sets in a wireless communications device.
• Fig. 11 is a flowchart illustrating an exemplary dynamic instruction set operation.
• Fig. 12 is a flowchart illustrating another exemplary dynamic instruction set operation.
• Fig. 13 is a flowchart illustrating a third exemplary dynamic instruction set operation.
• Fig. 14 is a flowchart illustrating a fourth exemplary dynamic" instruction set operation.
• Fig. 15 is a flowchart illustrating a fifth exemplary dynamic instruction set operation.
• these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated in a microprocessor based wireless device. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.
• physical devices such as a memory are mentioned, they are connected to other physical devices through a bus or other electrical connection. These physical devices can be considered to interact with logical processes or applications and, therefore, are "connected" to logical operations.
• a memory can store or access code to further a logical operation, or an application can call a code section from memory for execution.
• Fig. 1 is a schematic block diagram of the overall wireless device software maintenance system 100.
• the present invention system software organization is presented in detail below, following a general overview of the software maintenance system 100.
• the general system 100 describes a process of delivering system software updates and instruction sets (programs), and installing the delivered software in a wireless device.
• System software updates and patch manager run time instructions (PMRTI) that are more generally known as instruction sets or dynamic instruction sets, are created by the manufacturer of the handsets.
• the system software is organized into symbol libraries.
• the symbol libraries are arranged into code sections. When symbol libraries are to be updated, the software update 102 is transported as one or more code sections.
• the software update is broadcast to wireless devices in the field, of which wireless communications device 104 is representative, or transmitted in separate communications from a base station 106 using well known, conventional air, data or message transport protocols.
• the invention is not limited to any particular transportation format, as the wireless communications device can be easily modified to process any available over-the-air transport protocol for the purpose of receiving system software and PMRTI updates.
• the system software can be viewed as a collection of different subsystems. Code objects can be tightly coupled into one of these abstract subsystems and the resulting collection can be labeled as a symbol library. This provides a logical breakdown of the code base and software patches and fixes can be associated with one of these symbol libraries. In most cases, a single update is associated with one, or at most two, symbol libraries. The rest of the code base, the other symbol libraries, remains unchanged.
• symbol libraries provides a mechanism to deal with code and constants.
• the read-write (RW) data fits into a unique individual RW library that contains RAM based data for all libraries.
• the nonvolatile memory 108 includes a file system section (FSS) 110 and a code storage section 112.
• FSS file system section
• the code section is typically compressed before transport in order to minimize occupancy in the FSS 110.
• RW data is another kind of symbol library that contains all the RW data for each symbol library.
• RW data is loaded into random access volatile read-write memory.
• the RW data is typically arranged with a patch manager code section.
• the system 100 includes the concept of virtual tables. Using such tables, symbol libraries in one code section can be patched (replaced), without breaking (replacing) other parts of the system software (other code sections). Virtual tables execute from random access volatile read-write memory 114 for efficiency purposes.
• a code section address table and symbol offset address table are virtual tables.
• the updated code sections are received by the wireless device 104 and stored in the FSS 110.
• a wireless device user interface (Ul) will typically notify the user that new software is available. In response to UI prompts the user acknowledges the notification and signals the patching or updating operation. Alternately, the updating operation is performed automatically. The wireless device may be unable to perform standard communication tasks as the updating process is performed.
• the patch manager code section includes a non-volatile read-write driver symbol library that is also loaded into random access volatile read-write memory 114. The non-volatile read-write driver symbol library causes code sections to be overwritten with updated code sections.
• the patch manager code section includes the read- write data, code section address table, and symbol offset address table, as well a symbol accessor code and the symbol accessor code address (discussed below). Portions of this data are invalid when updated code sections are introduced, and an updated patch manager code sections includes read-write data, a code section address table, and a symbol offset address table valid for the updated code sections.
• the wireless device is reset. Following the reset operation, the wireless device can execute the updated system software.
• the patch manager code section may include other symbol libraries that have not been discussed above. These other symbol libraries need not be loaded into read-write volatile memory 114.
• Fig. 2 is a schematic block diagram of the software maintenance system 100, highlighting the installation of instruction sets via the airlink interface.
• the maintenance system 100 can download and install dynamic instructions sets, programs, or patch manager instruction sets (PMIS), referred to herein as patch manager run time instructions (PMRTI).
• PMRTI code section 200 is transported to the wireless device 104 in the same manner as the above-described system software code sections.
• PMRTI code sections are initially stored in the FSS 110.
• a PMRTI code section is typically a binary file that may be visualized as compiled instructions to the handset.
• a PMRTI code section is comprehensive enough to provide for the performance of basic mathematical operations and the performance of conditionally executed operations. For example, an RF calibration PMRTI could perform the following operations: IF RF CAL ITEM IS LESS THAN X
• a PMRTI can support basic mathematical operations, such as: addition, subtraction, multiplication, and division.
• the PMRTI code section may be loaded in response to UI prompts, and the wireless device must be reset after the PMRTI is loaded into code storage section 112. Then the PMRTI section can be executed. If the PMRTI code section is associated with any virtual tables or read- write data, an updated patch manager code section will be transported with the PMRTI for installation in the code storage section 112. Alternately, the PMRTI can be kept and processed from the FSS 110. After the handset 104 has executed all the instructions in the PMRTI section, the PMRTI section can be deleted from the FSS 110. Alternately, the PMRTI is maintained for future operations.
• the PMRTI may be executed every time the wireless device is energized.
• PMRTI is a very powerful runtime instruction engine.
• the handset can execute any instruction delivered to it through the PMRTI environment. This mechanism may be used to support RF calibrations.
• PMRTI can be used to remote debug wireless device software when software problems are recognized by the manufacturer or service provider, typically as the result of user complaints.
• PMRTI can also record data needed to diagnose software problems.
• PMRTI can launch newly downloaded system applications for data analysis, debugging, and fixes.
• PMRTI can provide RW data based updates for analysis and possible short term fix to a problem in lieu of an updated system software code section.
• PMRTI can provide memory compaction algorithms for use by the wireless device.
• the organization of the system software into symbol libraries may impact the size of the volatile memory 114 and nonvolatile memory 108 required for execution. This is due to the fact that the code sections are typically larger than the symbol libraries arranged in the code sections. These larger code sections exist to accommodate updated code sections. Organizing the system software as a collection of libraries impacts the nonvolatile memory size requirement. For the same code size, the amount of nonvolatile memory used will be higher due to the fact that code sections can be sized to be larger than the symbol libraries arranged within.
• the software maintenance system 100 supports memory compaction.
• Memory compaction is similar to disk de-fragmentation applications in desktop computers.
• the compaction mechanism ensures that memory is optimally used and is well balanced for future code section updates, where the size of the updated code sections are unpredictable.
• the system 100 analyzes the code storage section as it is being patched (updated). The system 100 attempts to fit updated code sections into the memory space occupied by the code section being replaced. If the updated code section is larger than the code section being replaced, the system 100 compacts the code sections in memory 112. Alternately, the compaction can be calculated by the manufacturer or service provider, and compaction instructions can be transported to the wireless device 104. Compaction can be a time consuming process owing to the complexity of the algorithm and also the vast volume of data movement. The compaction algorithm predicts feasibility before it begins any processing. UI prompts can be used to apply for permission from the user before the compaction is attempted.
• all the system software code sections can be updated simultaneously. A complete system software upgrade, however, would require a larger FSS 110.
• Fig. 3 is a schematic block diagram illustrating the present invention dynamic instruction set execution in a wireless communications device.
• the system 300 comprises a code storage section 112 in memory 108 including executable wireless device system software differentiated into a plurality of current code sections. Code section one (302), code section two (304), code section n (306), and a patch manager code section 308 are shown. However, the invention is not limited to any particular number of code sections. Further, the system 300 further comprises a first plurality of symbol libraries arranged into the second plurality of code sections. Shown are symbol library one (310) arranged in code section one (302), symbol libraries two (312) and three (314) arranged in code section two (304), and symbol library m (316) arranged in code section n (306).
• Each library comprises symbols having related functionality.
• symbol library one (310) may be involved in the operation of the wireless device liquid crystal display (LCD). Then, the symbols would be associated with display functions.
• additional symbol libraries are arranged in the patch manger code section 308.
• Fig. 4 is a schematic block diagram of the wireless device memory.
• the memory is the code storage section 112 of Fig. 1.
• the memory is a writeable, nonvolatile memory, such as Flash memory.
• the code sections need not necessarily be stored in the same memory as the FSS 110.
• the code storage section 112 includes a second plurality of contiguously addressed memory blocks, where each memory block stores a corresponding code section from the second plurality of code sections.
• code section one (302) is stored in a first memory block 400
• code section n (306) in the «th memory block 404
• the patch manager code section (308) in the j?th memory block 406.
• each symbol library begins at a first address and runs through a range of addresses in sequence from the first address.
• code section one starts-at the first start address 408 (marked with "S") in code storage section memory 112.
• symbol library one starts at the start 318 of the first code section.
• code section two starts at a second start address 410 (Fig. 4)
• symbol library two starts at the start 320 of code section two (Fig. 3).
• Code section n (306) starts at a third start address 412 in code storage section memory 112 (Fig.
• symbol library m (316) starts at the start of code section n 322 (Fig. 3).
• the patch manager code section starts at 7th start address 414 in code storage section memory 112, and the first symbol library in the patch manager code section 308 starts at the start 324 of the patch manager code section.
• symbol library one (10) is ultimately stored in the first memory block 400.
• a code section includes a plurality of symbol libraries, such as code section two (304), the plurality of symbol libraries are stored in the corresponding memory block, in this case the second memory block 402.
• the system 300 further comprises a code section address table 326 as a type of symbol included in a symbol library arranged in the patch manager code section 308.
• the code section address table cross-references code section identifiers with corresponding code section start addresses in memory.
• Fig. 5 is a table representing the code section address table 326 of Fig. 3.
• the code section address table 326 is consulted to find the code section start address for a symbol library. For example, the system 300 seeks code section one when a symbol in symbol library one is required for execution. To find the start address of code section one, and therefore locate the symbol in symbol library one, the code section address table 326 is consulted.
• the arrangement of symbol libraries in code sections, and the tracking of code sections with a table permits the code sections to be moved or expanded. The expansion or movement operations may be needed to install upgraded code sections (with upgraded symbol libraries).
• Fig. 3 it should be noted that not every symbol library necessarily starts at the start of a code section.
• symbol library three is arranged in code section two (304), but does not start of the code section start address 320.
• the system 300 consults the code section address table 326 for the start address of code section two (304).
• a symbol offset address table permits the symbols in symbol library three (314) to be located. It does not matter that the symbols are spread across multiple libraries, as long as they are retained with the same code section.
• each symbol library includes functionally related symbols.
• a symbol is a programmer-defined name for locating and using a routine body, variable, or data structure.
• a symbol can be an address or a value.
• Symbols can be internal or external. Internal symbols are not visible beyond the scope of the current code section. More specifically, they are not sought by other symbol libraries, in other code sections. External symbols are used and invoked across code sections and are sought by libraries in different code sections.
• the symbol offset address table typically includes a list of all external symbols.
• symbol library one may generate characters on a wireless device display. Symbols in this library would, in turn, generate telephone numbers, names, the time, or other display features. Each feature is generated with routines, referred to herein as a symbol. For example, one symbol in symbol library one (310) generates telephone numbers on the display. This symbol is represented by an "X", and is external. When the wireless device receives a phone call and the caller ID service is activated, the system must execute the "X" symbol to generate the number on the display. Therefore, the system must locate the "X" symbol.
• Fig. 6 is a detailed depiction of symbol library one (310) of Fig. 3, with symbols. Symbols are arranged to be offset from respective code section start addresses. In many circumstances, the start of the symbol library is the start of a code section, but this is not true if a code section includes more than one symbol library.
• Symbol library one (310) starts at the start of code section one (see Fig. 3). As shown in Fig. 6; the "X" symbol is located at an offset of (03) from the start of the symbol library and the "Y" symbol is located at an offset of (15).
• the symbol offset addresses are stored in a symbol offset address table 328 in-the patch manager code section (see Fig. 3).
• Fig. 7 is a table representing the symbol offset address table 328 of Fig. 3.
• the symbol offset address table 328 cross-references symbol identifiers with corresponding offset addresses, and with corresponding code section identifiers in memory. Thus, when the system seeks to execute the "X" symbol in symbol library one, the symbol offset address table 328 is consulted to locate the exact address of the symbol, with respect to the code section in which it is arranged.
• the first plurality of symbol libraries typically all include read-write data that must be consulted or set in the execution of these symbol libraries.
• a symbol library may include an operation dependent upon a conditional statement.
• the read-write data section is consulted to determine the status required to complete the conditional statement.
• the present invention groups the read-write data from all the symbol libraries into a shared read-write section.
• the read-write data 330 is arranged in the patch manager code section 308. Alternately (not shown), the read-write data can be arranged in a different code section, code section n (306), for example.
• the first plurality of symbol libraries also includes symbol accessor code arranged in a code section to calculate the address of a sought symbol.
• the symbol accessor code can be arranged and stored at an address in a separate code section, code section two (304), for example. However, as shown, the symbol accessor code 332 is arranged and stored at an address in the patch manager code section 308.
• the system 300 further comprises a first location for storage of the symbol accessor code address.
• the first location can be a code section in the code storage section 112, or in a separate memory section of the wireless device (not shown).
• the first location can also be arranged in the same code section as the read- write data.
• the first location 334 is stored in the patch manager code section 308 with the read-write data 330, the symbol offset address table 328, the code section address table 326, and the symbol accessor code 332, and the patch library (patch symbol library) 336.
• the symbol accessor code accesses the code section address table and symbol offset address tables to calculate, or find the address of a sought symbol in memory. That is, the symbol accessor code calculates the address of the sought symbol using a corresponding symbol identifier and a corresponding code section identifier. For example, if the "X" symbol in symbol library one is sought, the symbol accessor is invoked to seek the symbol identifier (symbol LD) "X_ l", corresponding to the "X” symbol (see Fig. 7). The symbol accessor code consults the symbol offset address table to determine that the "X_l" symbol identifier has an offset of (03) from the start of code section one (see Fig. 6).
• the symbol accessor code is invoked to seek the code section identifier "CS_1", corresponding to code section one.
• the symbol accessor code consults the code section address table to determine the start address associated with code section identifier (code section ID) "CS_1". In this manner, the symbol accessor code determines that the symbol identifier "X_l" is offset (03) from the address of (00100), or is located at address (00103).
• the symbol "X" is a reserved name since it is a part of the actual code. In other words, it has an absolute data associated with it. The data may be an address or a value.
• the symbol identifier is an alias created to track the symbol.
• the symbol offset address table and the code section address table both work with identifiers to avoid confusion with reserved symbol and code section names. It is also possible that the same symbol name is used across many symbol libraries. The use of identifiers prevents confusion between these symbols.
• the system 300 further comprises a read-write volatile memory 114, typically random access memory (RAM).
• RAM random access memory
• the read-write data 330, code section address table 326, the symbol offset address table 328, the symbol accessor code 332, and the symbol accessor code address 334 are loaded into the read-write volatile memory 114 from the patch manager code section for access during execution of the system software.
• the access times for code stored in RAM is significantly less than the access to a nonvolatile memory such as Flash.
• the symbol libraries need not necessarily fill the code sections into which they are arranged, although the memory blocks are sized to exactly accommodate the corresponding code sections stored within.
• each of the second plurality of code sections has a size in bytes that accommodates the arranged symbol libraries
• each of the contiguously addressed memory blocks have a size in bytes that accommodates corresponding code sections.
• code section one (302) may be a 100 byte section to accommodate a symbol library having a length of 100 bytes.
• the first memory block would be 100 bytes to match the byte size of code section one.
• the symbol library loaded into code section 1 may be smaller than 100 bytes.
• code section one (302) has an unused section 340, as symbol library one (310) is less than 100 bytes.
• each of the second plurality of code sections may have a size larger than the size needed to accommodate the arranged symbol libraries.
• Contiguously addressed memory blocks refers to partitioning the physical memory space into logical blocks of variable size. Code sections and memory blocks are terms that are essentially interchangeable when the code section is stored in memory. The concept of a code section is used to identify a section of code that is perhaps larger than the symbol library, or the collection of symbol libraries in the code section as it is moved and manipulated.
• the system 300 includes a patch symbol library, which will be referred to herein as patch library 336, to arrange new code sections in the code storage section with the current code sections.
• patch library 336 to arrange new code sections in the code storage section with the current code sections.
• the arrangement of new code sections with current code sections in the code storage section forms updated executable system software.
• the patch manager 336 not only arranges new code sections in with the current code sections, it also replaces code sections with updated code sections.
• the file system section 110 of memory 108 receives new code sections, such as new code section 450 and updated patch manager code section 452.
• the file system section also receives a first patch manager run time instruction (PMRTI) 454 including instructions for arranging the new code sections with the current code sections.
• PMRTI patch manager run time instruction
• an airlink interface 150 receives new, or updated code sections, as well as the first PMRTI.
• the airlink interface 150 is being represented by an antenna, it should be understood that the airlink interface would also include an RF transceiver, baseband circuitry, and demodulation circuitry (not shown).
• the file system section 110 stores the new code sections received via the airlink interface 150.
• the patch library 336 executing from read-write volatile memory 114, replaces a first code section in the code storage section, code section n (306) for example, with the new, or updated code section 450, in response to the first PMRTI 454.
• the patch manager code section 308 is replaced with the updated patch manager code section 452.
• the patch library 336 over-writes the first code section, code section n (306) for example, in the code storage section 112 with the updated code sections, code section 450 for example, in the file system section 110. In the extreme case, all the code sections in code storage section 112 are replaced with updated code sections.
• the FSS 110 receives a second plurality of updated code sections (not shown), and the patch library 336 replaces the second plurality of code sections in the code storage section 112 with the second plurality of updated code sections.
• the FSS 110 must be large enough to accommodate the second plurality of updated code sections received via the airlink interface.
• the updated code sections being received may include read- write data code sections, code section address table code sections, symbol libraries, symbol offset address table code sections, symbol accessor code sections, or a code section with a new patch library. All these code sections, with their associated symbol libraries and symbols, may be stored as distinct and independent code sections. Then each of these code sections would be replaced with a unique updated code section.
• an updated read- write code section would be received and would replace the read-write code section in the code storage section.
• An updated code section address table code section would be received and would replace the code section address table code section in the code storage section.
• An updated symbol offset address table code section would be received and would replace the symbol offset address table code section in the code storage section.
• An updated symbol accessor code section would be received and would replace the symbol accessor code section in the code storage section.
• an updated patch manager code section (with a patch library) would be received and would replace the patch manager code section in the code storage section.
• the above-mentioned code sections are typically bundled together in the patch manager code section.
• the read-write code section in the code storage section is replaced with the updated read-write code section from the file system section 110 when the patch manager code section 308 is replaced with the updated patch manger code section 450.
• the code section address table, the symbol offset address table, the symbol accessor code sections, as well as the patch library are replaced when the updated patch manager code section 450 is installed.
• the arrangement of the new read-write data, the new code section address table, the new symbol offset address table, the new symbol accessor code, and the new patch library as the updated patch manager code section 450, together with the current code sections in the code storage section forms updated executable system software.
• the patch manager When the file system section 110 receives an updated symbol accessor code address, the patch manager replaces the symbol accessor code address in the first location in memory with updated symbol accessor code address.
• the first location in memory 334 is typically in the patch manager code section (see Fig. 3).
• the patch library 308 is also includes a compactor, or a compactor symbol library 342.
• the compactor 342 can also be enabled as a distinct and independent code section, however as noted above, it is useful and efficient to bundle the functions associated with system software upgrades into a single patch manager code section.
• the compactor 342 can be said to resize code sections, so that new sections can be arranged with current code sections in the code storage section 112.
• the system 300 comprises executable system software and system data differentiated into code sections, as discussed in great detail, above.
• the system 300 comprises dynamic instruction sets for operating on the system data and the system software, and controlling the execution of the system software.
• a dynamic instruction set 470 is organized into the first PMRTI 454.
• the system also comprises a run-time engine for processing the dynamic instruction sets, enabled as run-time library 370.
• the run-time library 370 is typically located in the patch manager code section 308. However, the run-time library 370 could alternately be located in another code section, for example the first code section 304.
• the dynamic instruction sets are a single, or multiple sets of instructions that include conditional operation code, and generally include data items.
• the run-time engine reads the operation code and determines what operations need to be performed.
• Operation code can be conditional, mathematical, procedural, or logical.
• the run-time engine, or runtime library 370 processes the dynamic instruction sets to perform operations such as mathematical or logical operations. That is, the run-time engine reads the dynamic instruction set 470 and performs a sequence of operations in response to the operation code.
• the dynamic instruction sets are not limited to any particular language, the operation code is typically a form of machine code, as the wireless device memory is limited and execution speed is important.
• the operation code is considered conditional in that it analyzes a data item and makes a decision as a result of the analysis.
• the run-time engine may also determine that an operation be performed on data before it is analyzed.
• the operation code may specify that a data item from a wireless device memory be compared to a predetermined value. If the data item is less than the predetermined value, the data item is left alone, and if the data item is greater than the predetermined value, it is replaced with the predetermined value. Alternately, the operation code may add a second predetermined value to a data item from the wireless device memory, before the above-mentioned comparison operation is performed.
• the file system section nonvolatile memory 110 receives the dynamic instruction sets through an interface such as the airlink 150.
• the interface can also be radio frequency (RF) hardline 160.
• RF radio frequency
• the PMRTI can be received by the FSS 110 without the system software being operational, such as in a factory calibration environment.
• the PMRTI can also be received via a logic port interface 162 or an installable memory module 164.
• the memory module 164 can be installed in the wireless device 104 at initial calibration, installed in the field, or installed during factory recalibration.
• the PMRTI can be received via an infrared or Bluetooth interfaces.
• Fig. 8 is a depiction of instructions being accessed by the run-time engine 370. Shown is a first instruction 800, a second instruction 802, and ajth. instruction 804, however, the dynamic instruction set is not limited to any particular number of instructions.
• the length of the operation code in each instruction is fixed.
• the run-time engine 370 captures the length of the instruction, as a measure of bytes or bits, determine if the instruction includes data items. The remaining length of the instruction, after the operation code is subtracted, includes the data items.
• the run-time engine extracts the data items from the instruction. As shown, the length 806 of the first instruction 800 is measured and data items 808 are extracted. Note that not all instructions necessary include data items to be extracted.
• the run-time engine 370 uses the extracted data 808 in performing the sequence of operations responsive to the operation code 810 in instruction 800.
• Fig. 9 is a more detailed depiction of the first instruction 800 of Fig. 8.
• the instruction includes operation code 810 and data 808.
• the instruction, and more specifically, the data item section 808 includes symbol identifiers, which act as a link to symbols in the wireless device code sections.
• the symbol identifiers are used with the code section address table 326 (see Fig. 5) and the symbol offset address table 328 (see Fig. 7) to locate the symbol corresponding to the symbol identifier.
• a symbol identifier "X_l" is shown in the first instruction 800.
• the symbol offset address table 328 locates the corresponding symbol in a code section with the "CS_1" identifier and an offset of "3".
• the code section address table 326 gives the start address of code section one (302). In this manner, the symbol "X" is found- (see Fig. 6).
• the run-time engine locates symbols corresponding to the received symbol identifiers using the code section address table and symbol offset address table, it extracts data when the located symbols are data items. For example, if the symbol "X" is a data item in symbol library one (310), the run-time engine extracts it. Alternately, the "X" symbol can be operation code, and the run-time engine executes the symbol "X" when it is located.
• PMRTI can be used to update system data, or system data items.
• system data is stored in a code section in the file system section 110, code section 472 for example, see Fig. 4.
• the run-time engine accesses system data from code section 472 and analyzes the system data.
• the run-time engine processes the operation code of the dynamic instruction sets to perform mathematical or logical operation on data items, as described above. After the operation, the run-time engine processes the instructions to create updated system data. Note that the updated system data may include unchanged data items in some circumstances.
• the system data in the second code section 472 is replaced with the updated system data in response to the operation code.
• the system software is controlled to execute using the updated system data in code section 472.
• the system data can be replaced in a code section in the code storage section 112.
• the system data can be stored in the third code section 344, and the run-time engine can replace the system data in the third code section with updated system data in response to the operation code.
• PMRTI can also be used to update data items in volatile memory 114.
• the volatile memory 114 accept read-write data 330, see Fig. 1.
• the read-write data can be from one, or from a plurality of code sections in the code storage section 112 and/or the FSS 110.
• the run-time engine accesses the read-write data, analyzes the read-write data 330, creates updated read-write data, and replaces the read-write data 330 in the volatile memory 114 with the updated read-write data in response to the operation code. Then, the system software is controlled to execute using the updated read-write data in volatile memory 114.
• the run-time engine monitors the execution of the system software.
• Performance monitoring is broadly defined to include a great number of wireless device activities. For example, data such as channel parameters, channel characteristics, system stack, error conditions, or a record of data items in RAM through a sequence of operations leading to a specific failure condition or reduced performance condition can be collected. It is also possible to use dynamic instructions sets to analyze collected performance data, provide updated data variants, and recapture- data to study possible solutions to the problem. Temporary fixes can also be provisioned using PMRTI processes.
• the run-time engine collects performance data, and stores the performance data in the file system section in response to the operation code. Then, the system software is controlled to execute by collecting the performance data for evaluation of the system software. Evaluation can occur as a form of analysis performed by dynamic instruction set operation code, or it can be performed outside the wireless device. In some aspects of the invention, the run-time engine accesses the performance data that has been collected from the file system section and transmits the performance data via an airlink interface in response to the operation code. Collecting performance data from wireless devices in the field permits a manufacturer to thoroughly analyze problems, either locally or globally, without recalling the devices.
• file system section 110 receives a patch manager run time instruction including a new code section.
• a new code section 474 is shown in Fig. 4.
• the new code section can be independent of the PMRTI, such as new code section n (450).
• the new code section n (450) may have been received in earlier airlink communications, or have been installed during factory calibration.
• the run-time engine adds the new code section 474 (450) to the code storage section in response to the operation code.
• the new code section is added to an unused block in the code storage section 112. Alternately, a compaction operation is required. Then, the system software is controlled to execute using the new code section 474 (450).
• the PMRTI 454 includes an updated code section 474.
• the new code section 450 is an updated code section independent of the PMRTI.
• the run-time engine replaces a code section in the code storage section, code section two (304) for an example, with the updated code section 474 (450) in response to the operation code.
• the system software is controlled to execute using the updated code section 474 (450).
• a compaction operation is required to accommodate the updated code section.
• the updated code section is added to an unused or vacant section of the code storage section.
• a compaction operation also requires a new code section address table.
• the compaction operations may be a result of the operation of the compactor 342, explained above, or the result of PMRTI instructions that supply details as to how the compaction is to occur.
• the PMRTI typically also includes a new code section address table that becomes valid after the downloading and compaction operations have been completed.
• Figs. 10a and 10b are flowcharts illustrating the present invention method for executing dynamic instruction sets in a wireless communications device.
• Step 1000 The method starts at Step 1000.
• Step 1001a forms the system software into symbol libraries, each symbol library comprising symbols having related functionality.
• Step 1001b arranges the symbol libraries into code sections.
• Step 1002 executes system software.
• Step 1003 receives the dynamic instruction sets. Receiving the dynamic instruction sets in Step 1003 includes receiving the dynamic instruction sets through an interface selected from the group including airlink, radio frequency (RF) hardline, installable memory module, infrared, and logic port interfaces.
• RF radio frequency
• receiving the dynamic instruction set in Step 1003 includes receiving a patch manager run time instruction (PMRTI) in a file system section nonvolatile memory.
• Step 1004 launches a run-time engine.
• launching a run-time engine includes invoking a run-time library from a first code section.
• the run-time engine can be launched from either volatile or nonvolatile memory.
• Step 1006 processes dynamic instruction sets. Processing dynamic instruction sets includes processing instructions in response to mathematical and logical operations.
• Step 1007 (not shown), following the processing of the dynamic instruction sets, deletes dynamic instruction sets.
• Step 1008 operates on system data and system software.
• Step 1010 in response to operating on the system data and system software, controls the execution of the system software.
• receiving the patch manager run time instructions in Step 1003 includes receiving conditional operation code and data items.
• processing dynamic instruction sets in Step 1006 includes substeps.
• Step 1006al uses the run-time engine to read the patch manager run time instruction operation code.
• Step 1006b performs a sequence of operations in response to the operation code.
• arranging the symbol libraries into code sections in Step 1001b includes starting symbol libraries at the start of code sections and arranging symbols to be offset from their respective code section start addresses. Then the method comprises further steps.
• Step 1001c stores the start of code sections at corresponding start addresses.
• Step 100 Id maintains a code section address table (CSAT) cross-referencing code section identifiers with corresponding start addresses.
• Step lOOle maintains a symbol offset address table (SOAT) cross-referencing symbol identifiers with corresponding offset addresses, and corresponding code section identifiers.
• CSAT code section address table
• SOAT symbol offset address table
• receiving, the patch manager run time instruction in Step 1003 includes receiving symbol identifiers. Then, the method comprises a further step. Step 1006a2 locates symbols corresponding to the received symbol identifiers by using the code section address table and symbol offset address table. Performing a sequence of operations in response to the operation code in Step 1006b includes substeps. Step 1006M extracts the data when the located symbols are data items. Step 1006b2 executes the symbols when the located symbols are instructions.
• processing dynamic instruction sets in Step 1006bl includes additional substeps.
• Step 1006bla uses the run-time engine to capture the length of the patch manager run time instruction.
• Step 1006b lb extracts the data items from the patch manager run time instruction, in response to the operation code.
• Step 1006blc uses the extracted data in performing the sequence of operations responsive to the operation code.
• Fig. 11 is a flowchart illustrating an exemplary dynamic instruction set operation. Several of the Steps in Fig. 11 are the same as in Fig. 10, and are not repeated here in the interest of brevity. Processing dynamic instruction sets in Step 1106 includes substeps.
• Step 1106a accesses system data stored in a second code section in the file system section.
• Step 1106b analyzes the system data.
• Step 1106c creates updated system data.
• operating on system data and system software in Step 1108 includes replacing the system data in the second section with the updated system data
• controlling the execution of the system software in Step 1010 includes using the updated system data in the execution of the system software.
• Fig. 12 is a flowchart illustrating another exemplary dynamic instruction set operation. Several of the Steps in Fig. 12 are the same as in Fig. 10, and are not repeated here in the interest of brevity.
• Step 1201c stores a plurality of code sections in a code storage section nonvolatile memory. Processing dynamic instruction sets in Step 1206 includes substeps.
• Step 1206a accesses system data stored in a third code section in the code storage section (CSS).
• Step 1206b analyzes the system data.
• Step 1206c creates updated system data.
• Operating on the system data and system software in Step 1208 includes replacing the system data in the third code section with the updated system data.
• Controlling the execution of the system software in Step 1210 includes using the updated system data in the execution of the system software.
• Fig. 13 is a flowchart illustrating a third exemplary dynamic instruction set operation.
• Step 1301c stores a plurality of code sections in a code storage section nonvolatile memory.
• Step 130 Id loads read-write data into volatile memory.
• Processing dynamic instruction sets in Step 1306 includes substeps.
• Step 1306a accesses the read-write data in volatile memory.
• Step 1306b analyzes the read-write data.
• Step 1306c creates updated read-write data.
• Operating on the system data and system software in Step 1308 includes replacing the read-write data in volatile memory with the updated read-write data. Controlling the execution of the system software includes using the updated read-write data in the execution of the system software.
• Fig. 14 is a flowchart illustrating a fourth exemplary dynamic instruction set operation. Several of the Steps in Fig. 14 are the same as in Fig. 10, and are not repeated here in the interest of brevity.
• Processing dynamic instruction sets includes substeps. Step 1406a, in response to the operation code, monitors the execution of the system software. Step 1406b collects performance data. Step 1406c stores the performance data. Step 1406d transmits the stored data via an airlink interface. Operating on the system data and system software in Step 1408 includes using the performance data in the evaluation of system software.
• Fig. 15 is a flowchart illustrating a fifth exemplary dynamic instruction set operation. Several of the Steps in Fig. 15 are the same as in Fig.
• Step 1501c stores a plurality of code sections in a code storage section nonvolatile memory.
• Receiving patch manager run time instructions in Step 1503 includes receiving a new code section.
• Operating on the system data and system software in Step 1508 includes adding the new code section to the code storage section, and controlling the execution of the system software in Step 1510 includes using the new code section in the execution of the system software.
• receiving a new code section in Step 1503 includes receiving an updated code section.
• operating on the system data and system software in Step 1508 includes replacing a fourth code section in the code storage section with the updated code section.
• a system and method have been provided for executing dynamic instruction sets in a wireless communications device, so as to aid in the process of updating the software and monitoring the performance of the software.
• the system is easily updateable because of the arrangement of symbol libraries in code sections, with tables to access the start addresses of the code sections in memory and the offset addresses of symbols in the symbol libraries.
• the use on dynamic instruction sets permits custom modifications to be performed to each wireless device, based upon specific characteristics of that device.
• a few general examples have been given illustrating possible uses for the dynamic instructions sets. However, the present invention is not limited to just these examples. Other variations and embodiments of the invention will occur to those skilled in the art.

Landscapes

• Engineering & Computer Science (AREA)
• Software Systems (AREA)
• Theoretical Computer Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• Computer Security & Cryptography (AREA)
• General Engineering & Computer Science (AREA)
• Databases & Information Systems (AREA)
• Physics & Mathematics (AREA)
• General Physics & Mathematics (AREA)
• Mobile Radio Communication Systems (AREA)
• Stored Programmes (AREA)
• Transceivers (AREA)
• Telephonic Communication Services (AREA)
• Communication Control (AREA)
• Sub-Exchange Stations And Push- Button Telephones (AREA)
• Test And Diagnosis Of Digital Computers (AREA)
• Information Transfer Between Computers (AREA)
• Circuits Of Receivers In General (AREA)
• Debugging And Monitoring (AREA)
• Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
• Selective Calling Equipment (AREA)

Applications Claiming Priority (11)

Publications (1)

Family

ID=27542295

Family Applications (12)

Family Applications Before (2)

Family Applications After (9)

Country Status (9)

Families Citing this family (39)

Family Cites Families (33)

• 2002
  • 2002-07-22 EP EP02749161A patent/EP1410191A2/de not_active Withdrawn
  • 2002-07-22 KR KR1020047000719A patent/KR100940178B1/ko not_active IP Right Cessation
  • 2002-07-22 ES ES02749158T patent/ES2300454T3/es not_active Expired - Lifetime
  • 2002-07-22 KR KR1020047000721A patent/KR100940180B1/ko not_active IP Right Cessation
  • 2002-07-22 JP JP2003515966A patent/JP4104546B2/ja not_active Expired - Fee Related
  • 2002-07-22 EP EP02749158A patent/EP1410189B1/de not_active Expired - Lifetime
  • 2002-07-22 CN CNB028148320A patent/CN1288553C/zh not_active Expired - Fee Related
  • 2002-07-22 EP EP02749157A patent/EP1410188A2/de not_active Withdrawn
  • 2002-07-22 WO PCT/IB2002/002875 patent/WO2003010663A2/en not_active Application Discontinuation
  • 2002-07-22 AT AT02749158T patent/ATE387658T1/de not_active IP Right Cessation
  • 2002-07-22 KR KR1020047000723A patent/KR100911604B1/ko not_active IP Right Cessation
  • 2002-07-22 JP JP2003515964A patent/JP2004537120A/ja not_active Withdrawn
  • 2002-07-22 CN CNB028148312A patent/CN1275149C/zh not_active Expired - Fee Related
  • 2002-07-22 WO PCT/IB2002/002866 patent/WO2003010656A2/en active Application Filing
  • 2002-07-22 AU AU2002319572A patent/AU2002319572A1/en not_active Abandoned
  • 2002-07-22 JP JP2003515971A patent/JP2005505813A/ja not_active Withdrawn
  • 2002-07-22 AU AU2002319568A patent/AU2002319568A1/en not_active Abandoned
  • 2002-07-22 CN CNB028148339A patent/CN1275150C/zh not_active Expired - Fee Related
  • 2002-07-22 WO PCT/IB2002/002867 patent/WO2003010658A2/en active IP Right Grant
  • 2002-07-22 AU AU2002319569A patent/AU2002319569A1/en not_active Abandoned
  • 2002-07-23 AT AT02749159T patent/ATE302972T1/de not_active IP Right Cessation
  • 2002-07-23 WO PCT/IB2002/002869 patent/WO2003010662A2/en active IP Right Grant
  • 2002-07-23 JP JP2003515976A patent/JP4176634B2/ja not_active Expired - Fee Related
  • 2002-07-23 CN CNB02814838XA patent/CN1288554C/zh not_active Expired - Fee Related
  • 2002-07-23 EP EP05021081A patent/EP1610222B1/de not_active Expired - Lifetime
  • 2002-07-23 DE DE60205755T patent/DE60205755T2/de not_active Expired - Lifetime
  • 2002-07-23 KR KR1020047000718A patent/KR100913658B1/ko not_active IP Right Cessation
  • 2002-07-23 WO PCT/IB2002/002890 patent/WO2003010664A2/en active IP Right Grant
  • 2002-07-23 ES ES02749159T patent/ES2247355T3/es not_active Expired - Lifetime
  • 2002-07-23 ES ES02749167T patent/ES2249602T3/es not_active Expired - Lifetime
  • 2002-07-23 AT AT02749167T patent/ATE305632T1/de not_active IP Right Cessation
  • 2002-07-23 CN CNB028148347A patent/CN1235137C/zh not_active Expired - Fee Related
  • 2002-07-23 ES ES02749163T patent/ES2263796T3/es not_active Expired - Lifetime
  • 2002-07-23 AU AU2002319577A patent/AU2002319577A1/en not_active Abandoned
  • 2002-07-23 AT AT02749166T patent/ATE382159T1/de not_active IP Right Cessation
  • 2002-07-23 WO PCT/IB2002/002889 patent/WO2003012639A2/en active IP Right Grant
  • 2002-07-23 DE DE60211704T patent/DE60211704T2/de not_active Expired - Lifetime
  • 2002-07-23 WO PCT/IB2002/002877 patent/WO2003010668A2/en active IP Right Grant
  • 2002-07-23 DE DE60206389T patent/DE60206389T2/de not_active Expired - Lifetime
  • 2002-07-23 JP JP2003517749A patent/JP4310186B2/ja not_active Expired - Fee Related
  • 2002-07-23 JP JP2003515970A patent/JP4073399B2/ja not_active Expired - Fee Related
  • 2002-07-23 CN CNB028148371A patent/CN1279447C/zh not_active Expired - Fee Related
  • 2002-07-23 KR KR1020047000725A patent/KR100918162B1/ko not_active IP Right Cessation
  • 2002-07-23 EP EP02749163A patent/EP1410209B1/de not_active Expired - Lifetime
  • 2002-07-23 EP EP02749159A patent/EP1410190B1/de not_active Expired - Lifetime
  • 2002-07-23 AT AT02749163T patent/ATE327536T1/de not_active IP Right Cessation
  • 2002-07-23 AU AU2002319573A patent/AU2002319573A1/en not_active Abandoned
  • 2002-07-23 KR KR1020047000726A patent/KR100913659B1/ko not_active IP Right Cessation
  • 2002-07-23 ES ES02749166T patent/ES2299587T3/es not_active Expired - Lifetime
  • 2002-07-23 AU AU2002319570A patent/AU2002319570A1/en not_active Abandoned
  • 2002-07-23 KR KR1020047000716A patent/KR100940179B1/ko not_active IP Right Cessation
  • 2002-07-23 EP EP02749166A patent/EP1410192B1/de not_active Expired - Lifetime
  • 2002-07-23 CN CNB028148355A patent/CN1235138C/zh not_active Expired - Fee Related
  • 2002-07-23 EP EP02749167A patent/EP1410193B1/de not_active Expired - Lifetime
  • 2002-07-23 AU AU2002319576A patent/AU2002319576A1/en not_active Abandoned
  • 2002-07-23 JP JP2003515972A patent/JP4278513B2/ja not_active Expired - Fee Related
  • 2002-07-25 CN CNB028148401A patent/CN1310488C/zh not_active Expired - Fee Related
  • 2002-07-25 ES ES02762622T patent/ES2253553T3/es not_active Expired - Lifetime
  • 2002-07-25 ES ES05018919T patent/ES2284112T3/es not_active Expired - Lifetime
  • 2002-07-25 AT AT02762622T patent/ATE310354T1/de not_active IP Right Cessation
  • 2002-07-25 ES ES02751472T patent/ES2263799T3/es not_active Expired - Lifetime
  • 2002-07-25 EP EP05018919A patent/EP1601217B1/de not_active Expired - Lifetime
  • 2002-07-25 ES ES02741113T patent/ES2248568T3/es not_active Expired - Lifetime
  • 2002-07-25 WO PCT/IB2002/002905 patent/WO2003010932A2/en active IP Right Grant
  • 2002-07-25 AU AU2002328167A patent/AU2002328167A1/en not_active Abandoned
  • 2002-07-25 CN CNB028148398A patent/CN100378661C/zh not_active Expired - Fee Related
  • 2002-07-25 JP JP2003516189A patent/JP4077408B2/ja not_active Expired - Fee Related
  • 2002-07-25 JP JP2003518153A patent/JP4101752B2/ja not_active Expired - Fee Related
  • 2002-07-25 WO PCT/IB2002/002906 patent/WO2003010942A2/en active IP Right Grant
  • 2002-07-25 KR KR1020047001087A patent/KR100932058B1/ko not_active IP Right Cessation
  • 2002-07-25 AT AT02751472T patent/ATE327628T1/de not_active IP Right Cessation
  • 2002-07-25 AT AT05018919T patent/ATE359681T1/de not_active IP Right Cessation
  • 2002-07-25 EP EP02741113A patent/EP1410665B1/de not_active Expired - Lifetime
  • 2002-07-25 DE DE60219536T patent/DE60219536T2/de not_active Expired - Lifetime
  • 2002-07-25 AT AT02741113T patent/ATE304272T1/de not_active IP Right Cessation
  • 2002-07-25 KR KR1020047001088A patent/KR100984895B1/ko not_active IP Right Cessation
  • 2002-07-25 AU AU2002355308A patent/AU2002355308A1/en not_active Abandoned
  • 2002-07-25 DE DE60206055T patent/DE60206055T2/de not_active Expired - Lifetime
  • 2002-07-25 CN CNB02814841XA patent/CN1250035C/zh not_active Expired - Fee Related
  • 2002-07-25 EP EP02762622A patent/EP1425894B1/de not_active Expired - Lifetime
  • 2002-07-25 DE DE60211719T patent/DE60211719T2/de not_active Expired - Lifetime
  • 2002-07-25 KR KR1020047001086A patent/KR100817387B1/ko not_active IP Right Cessation
  • 2002-07-25 EP EP02751472A patent/EP1423959B1/de not_active Expired - Lifetime
  • 2002-07-25 DE DE60207429T patent/DE60207429T2/de not_active Expired - Lifetime
  • 2002-07-25 JP JP2003516197A patent/JP4106020B2/ja not_active Expired - Fee Related
  • 2002-07-25 WO PCT/IB2002/002912 patent/WO2003013103A2/en active IP Right Grant
• 2007
  • 2007-11-22 JP JP2007303740A patent/JP2008108268A/ja active Pending

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events