Smart Card Formula Conversion Pruning Dead Branches

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing methods cannot efficiently implement complex calculation formulas with many parameters in smart cards due to memory and instruction set limitations, making it difficult to calculate service costs in real-time, especially without a network connection.

Innovation Solution

A method to convert calculation formulas from a tree structure into executable code for smart cards by removing dead branches, reducing parameter and operation complexity, allowing for flexible definition of tariff offers while fitting within smart card constraints.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If complex calculation formulas with many parameters are implemented in smart cards, then the flexibility and functionality of tariff offers are improved, but the device complexity and resource consumption exceed smart card limitations

Engineering Contradiction:
Improveflexibility of tariff offersVSAvoidcomplexity of calculation formula
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The calculation formula is segmented into a hierarchical tree structure with root nodes, intermediate nodes, and terminal nodes. Each node represents a specific calculation operation or parameter group, allowing complex formulas to be broken down into manageable, independently executable units that fit within smart card memory constraints

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent transitions from linear calculation sequences to a multi-dimensional tree structure, enabling parallel evaluation paths and hierarchical parameter organization. This dimensional transformation allows complex formulas to be represented in a compact format that optimizes smart card resource utilization

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

2Adaptability or versatility

If complete calculation formulas with all possible branches are stored in smart cards, then all tariff scenarios can be handled, but the memory requirements exceed smart card capacity

Engineering Contradiction:
Improvecoverage of tariff scenariosVSAvoidmemory size required
Core Design Contradiction:
Adaptability or versatilityVSQuantity of substance

Solution Approach 1:

Dead branches representing impossible or irrelevant calculation paths are extracted and removed from the tree structure. This pruning process eliminates unnecessary memory consumption while preserving all valid tariff calculation scenarios that can actually occur in practice

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent dynamically adjusts parameter values and calculation paths based on actual tariff requirements. By changing parameters such as conditional thresholds and evaluation criteria, the system adapts the calculation formula to match specific tariff scenarios, reducing memory requirements by only storing necessary calculation paths

Inventive Principle:
Principle #35Parameter changes

3Adaptability or versatility

If the instruction set is expanded to support complex calculations, then more functionality is available, but the smart card cannot accommodate the increased instruction complexity

Engineering Contradiction:
Improvefunctionality of calculation operationsVSAvoidinstruction set complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent introduces an intermediary processing layer that translates complex calculation requirements into a standardized, simplified instruction set executable by smart cards. This intermediary layer handles complex logic through structured data organization and sequential operations, allowing high-level functionality without expanding the underlying instruction set

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentEP2340521B1Method of conversion and converter for converting a formula into executable code, program and recording medium for this method, method of implementing this formula
Publication Date: 2016.03.30 SAP SE
  • EP2340521B1 patent drawingFigure 1
  • EP2340521B1 patent drawingFigure 2
  • EP2340521B1 patent drawingFigure 3~5

AI summary

This method of converting a computational formula having been acquired in the form of a tree structure containing at least one node associated with a parameterized conditional branching operation and connected to at least a first and a second child node, the child node which is associated with the operation which is not executed and the set of nodes which have this child node as parent node being called "dead branch", this method comprising: - the identification and the deletion (198) of the dead branch corresponding to the acquired value of a conditional parameter so as to obtain a computational formula pruned of this dead branch, and - the compilation (208) of the computational formula pruned of the dead branch so as to obtain the code executable by a chip card.