Next Article in Journal
Towards Integration of a Dedicated Memory Controller and Its Instruction Set to Improve Performance of Systems Containing Computational SRAM
Next Article in Special Issue
Real-Time Embedded Implementation of Improved Object Detector for Resource-Constrained Devices
Previous Article in Journal
A 0.5 V Sub-Threshold CMOS Current-Controlled Ring Oscillator for IoT and Implantable Devices
Previous Article in Special Issue
CondenseNeXtV2: Light-Weight Modern Image Classifier Utilizing Self-Querying Augmentation Policies
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:

Implementation of a Fuel Estimation Algorithm Using Approximated Computing

Department of Computer Science, Hekma School of Engineering, Computing, and Informatics, Dar Al-Hekma University, Jeddah 22246-4872, Saudi Arabia
Department of Computing, University of Turku, FI-20014 Turku, Finland
Department of Technology, Higher Institute of Computer Sciences and Mathematics, University of Monastir, Monastir 5000, Tunisia
J. Low Power Electron. Appl. 2022, 12(1), 17;
Original submission received: 15 February 2022 / Revised: 9 March 2022 / Accepted: 9 March 2022 / Published: 16 March 2022
(This article belongs to the Special Issue Advanced Researches in Embedded Systems)


The rising concerns about global warming have motivated the international community to take remedial actions to lower greenhouse gas emissions. The transportation sector is believed to be one of the largest air polluters. The quantity of greenhouse gas emissions is directly linked to the fuel consumption of vehicles. Eco-driving is an emergent driving style that aims at improving gas mileage. Real-time fuel estimation is a critical feature of eco-driving and eco-routing. There are numerous approaches to fuel estimation. The first approach uses instantaneous values of speed and acceleration. This can be accomplished using either GPS data or direct reading through the OBDII interface. The second approach uses the average value of the speed and acceleration that can be measured using historical data or through web mapping. The former cannot be used for route planning. The latter can be used for eco-routing. This paper elaborates on a highly pipelined VLSI architecture for the fuel estimation algorithm. Several high-level transformation techniques have been exercised to reduce the complexity of the algorithm. Three competing architectures have been implemented on FPGA and compared. The first one uses a binary search algorithm, the second architecture employs a direct address table, and the last one uses approximation techniques. The complexity of the algorithm is further reduced by combining both approximated computing and precalculation. This approach helped reduce the floating-point operations by 30% compared with the state-of-the-art implementation.

1. Introduction

The transportation sector is experiencing a paradigm shift thanks to the fast development in information and communication technologies (ICT). Sustainability and a multitude of other factors have contributed to the establishment of transportation 4.0. It has been argued in many published reports that the legacy transportation system is inefficient, polluting, and unsafe [1,2,3]. To remedy the problems associated with road traffic, the intelligent transportation system based on dedicated short range communication (DSRC), has been proposed with the following chief aims [4]: reduce congestion, increase road safety, improve drive experience, lower greenhouse gas emission, and make the transportation more efficient. In [5], the authors proposed an eco-routing system based on vehicle-to-infrastructure (V2I). The energy consumption on a given road is transmitted to a road-side unit (RSU) and forwarded to the traffic management center (TMC). Drivers use this information to find fuel-efficient routes. This solution necessitates a strong ICT infrastructure, which can be prohibitive. The same design principle has been advocated in [6].
The revolution in communication, embedded systems, and the associated disruptive technologies have contributed to the realization of the fourth industrial revolution, commonly known as industry 4.0. The smart city is yet another concept that emerged with the development of the Internet of Things, as well as machine learning techniques. As pictured in Figure 1, smart mobility is one of the pillars in the smart city [7]. In the EU model for the smart city, the smart mobility indicator includes safety, sustainability, and innovation.
In academia, reducing car emissions has been the focus of intensive work. Many parameters impact car fuel consumption (load, tire pressure, road, weather, vehicle age, etc.). It has been demonstrated through intensive experiments that driving style substantially impacts fuel consumption. Three driving styles have been investigated in [8]. It was found that economic driving style reduces fuel consumption by 21% compared to dynamic driving.
In the literature, several algorithms have been devised for the estimation of fuel consumption [9,10,11,12]. Real-time implementation of fuel estimation algorithms has received scant attention. This work is an extension of previously published work [9,13]. The contributions reported in this work are the following:
  • Reducing the computational complexity by 66% using high-level transformation techniques;
  • Devising two techniques for computing the RPM: binary searching based on a direct-addressable table and approximation algorithm;
  • Implementation of the devised architecture using both an IP method and a high-level synthesis tool (GAUT).
The rest of the paper is organized as follows. Section 2 compares our work with existing techniques. Section 3 reviews the fuel estimation algorithm described in [9]. Section 4 describes techniques to reduce the computational complexity of the fuel estimation algorithm and elaborates three hardware architectures. Section 5 reports the implementation results. Section 6 concludes the paper.

2. Related Work

In the last decade, numerous fuel estimation algorithms have been proposed. The authors of [14] elaborated an algorithm using a power-based model. The algorithm requires instantaneous values for the acceleration and speed; consequently, it cannot be used for eco-routing.
An Android application was devised in [15]. The app reads vehicle parameters through on-board diagnostics parameter ID (OBDII) interface. The system uses artificial intelligence techniques to provide the driver with eco-driving tips.
Using the Willan’s internal combustion engine, the author of [9] devised a non-iterative fuel estimation model. The technique devised in [16] for the vehicle routing problem (VRP) is determined by the comprehensive modal emission model (CMEM). CMEM requires both speed and acceleration to estimate the fuel consumption. The engine RPM was fixed to 2800 for a passenger vehicle and 2400 for a truck. The authors of [13] envisioned an RPM algorithm and designed a hardware architecture using floating point arithmetic for the implementation of the fuel estimation algorithm.
Approximated computing is a new design technique that has been conceived to reduce the power consumption or increase the speed of VLSI circuits. Floating-point arithmetic consumes more area, is slower, and is more power-hungry compared with fixed-point arithmetic. Fortunately, approximated computing have also been shown to substantially reduce delay and power consumption [17].

3. Real-Time Fuel Estimation Algorithm

3.1. Preliminaries

Table 1 lists the parameters along with their typical values used to elaborated on the architecture.
Subsequently, we review the equations used to elaborate the macroscopic fuel estimation algorithm described in [9,18,19].
Figure 2 summarizes the forces exerted on a vehicle in an acceleration mode. Those forces are: the traction force ( F t ( t ) ), the aerodynamic friction ( F a ( t ) ), the rolling friction ( F r ( t ) ), the gravity force ( F g ( t ) ), and the disturbance force ( F d ( t ) ). The relation between those forces is described in (1) [19].
m v a = F t ( t ) F a ( t ) + F r ( t ) + F g ( t ) + F d ( t ) ,
where is m v denotes the mass of the vehicle’s body, and  a represents the acceleration of the vehicle.
In traction mode, the distance traveled by the vehicle is determined using (2).
x t o t a l = t t r a c v ( t ) d t .
Equations (3) and (4) are, respectively, used to estimate the average value of the speed and the acceleration.
v ¯ i = v i + v i 1 2 .
a ¯ i = v i v i 1 h .
Given the air density ( ρ a ), the vehicle frontal area ( A f ), the aerodynamic drag coefficient ( c d ), and  the rolling friction coefficient ( c r ), (5)–(8) are used to calculate the average value of the traction force.
F ¯ t = F ¯ a + F ¯ r + F ¯ m ,
where F ¯ m is the acceleration force.
F ¯ a = 1 x t o t 1 2 ρ a A f c d i t r a c v ¯ i 3 h .
F ¯ r = 1 x t o t m v g c r i t r a c v ¯ i h .
F ¯ m = m v 1 x t o t i t r a c a ¯ i v ¯ i h .
The mechanical power is determined from the traction as shown in (9).
P ¯ t r a c = F ¯ t v ¯ t t r a c .
The gearbox input power is calculated from (10).
P i , g b = 1 e g b P ¯ t r a c + P 0 , g b ,
where e g b is the efficiency of the gearbox, and  P 0 , g b the idle power of the gearbox at a given engine speed.
The additional energy consumed after each stop is approximated using (11).
E s t a r t 1 2 v 0 2 m v ,
where v 0 is the attained speed from the standing mode.
The mean value of the fuel power consumption given by (12).
P ¯ f u e l = t t r a c P s t a r t + P ¯ t r a c p m e + p m e 0 ( c m ) ζ e p m e ,
where ζ e = the engine efficiency parameter, p m e = fuel mean pressure, p m e o = pressure losses inside the engine, and  P s t a r t = power consumed when the vehicle is accelerating from a standstill to a given speed. Both p m e o and ζ e can be obtained from the engine map.
The fuel flow is estimated using (13).
V f = P ¯ f u e l / H l · ρ f ,
where H l (J/kg) is the fuel’s lower heating value, and  ρ f (kg/L) is the fuel density.

3.2. Algorithm for Fast Fuel Estimation

To simplify the calculations, the author of [9] used the driving cycle to estimate the fuel consumption. The known driving modes are MVEG-95 (Motor Vehicle Emissions Group), ECE (European Cycle Emission), and EUDC (Extra-Urban Driving Cycle) [19]. The steps are described in Algorithm  1.
Algorithm 1 Fuel estimation algorithm elaborated in [9].
procedurefuel estimation (d, t, RPM, m v , B, S, z, A f , c d , c r , t t r a c , ρ a , e g b , P 0 , g b , N s t o p s , H l , ρ f , g, m l )
     v ¯ d t
     ω e R P M ( v ¯ )
     M m v + m l
     h 1 1 x t o t i t r a c v ¯ i 3 h
     h 2 1 x t o t i t r a c v ¯ i h
     h 3 1 x t o t i t r a c a ¯ i v ¯ i h .
     F t r a c h 1 1 2 ρ a A f c d + h 2 · M · g · c r + h 3 M
     P t r a c F t r a c · v ¯ t t r a c
     P i , g b P t r a c + P 0 , g b e g b
     P s t a r t 4.5 · M N s t o p s · v ¯
     c m 2 · S · ω e 60
     p m e 16 · P i , g b z π B 2 c m
     ζ e 0.4 · p m e · 10 5 p m e · 10 5 + 1.6
     P f u e l = t t r a c · P i , g b + P s t a r t ζ e
     V f P f u e l H l · ρ f
     f c ^ V f · 10 5 v ¯
end procedure

4. Optimized Hardware Architecture

The hardware architecture for implementing the fuel estimation algorithm needs to have the following features: (1) an RPM unit that determines the engine rotation per minute given the driving speed; (2) a functional unit for computing h 1 , h 2 , and  h 3 ; (3) a hardware module for calculating F t r a c , P t r a c , P i , g b , P s t a r t , P f u e l , V f , f c ^ ; and (3) a memory unit for storing the constants used by the precedent unit.
To reduce the computational complexity of the fuel estimation algorithm, the following techniques can be used efficiently. A predefined driving mode can be utilized to estimate h 1 , h 2 , and  h 3 . Table 2, lists the values of h 1 , 2 , 3 for the three driving cycles.
The computational complexity can be further reduced by precomputing the first term of P t r a c , that is, the quantity h 1 1 2 ρ a A f c d . Table 3 reports the precomputed values for the three driving cycles for air density ρ a = 1.293 kg/m 3 , c d = 0.312 , A f = 2.06 m 3 .
It is further possible to reduce the computational cost of tractive force, F t r a c , by the transformation shown in (14):
F t r a c = K 1 + M ( h 2 · g · c r + h 3 ) = K 1 + K 2 · M ,
where K 1 and K 2 are constants that depend on the driving cycle. Table 2 and Table 4 show the value of, respectively, K 1 and K 2 for the three driving cycle modes.
Having performed the rearrangements, the number of multiplications is reduced from 3 to 1. The required number of arithmetic operations before and after optimization is summarized in Table 5. The control data-flow graph of the original and refined algorithm is shown in Figure 3. The control data-flow graph can be further improved by inserting pipeline latches, which reduce the critical path delay to one arithmetic unit, that is τ = max ( t a d d , t d i v i d e r , t m u l t i p l i e r ) , where t a d d , t d i v i d e r , t m u l t i p l i e r are, respectively, the critical path delay of a floating point adder, divider, and multiplier.
The fuel estimation algorithm requires as input the RPM value ( ω e ). The closed-form expression to compute ω e is shown in (15).
ω e = v ¯ γ A γ G π D ,
where D is the diameter of the wheel expressed in meters, γ A is the axle ratio, and γ G is the gearbox ratio.
In [19], the author proposed an approximation formula to compute the engine RPM, which is described in (16):
ω e = 2 · v ¯ γ i D ,
where γ i is the gear ratio. The RPM unit can be implement in one of the following ways: a look-up table that stores a pre-calculated value or a datapath unit that computes ω e using (16). To verify the accuracy of (16), the RPM and speed have been measured using a sedan vehicle. Table 6 compares the measured RPM to the approximated one using (16). The results shows that the approximation error has an acceptable accuracy.
The RPM unit designed using a look-up table requires the implementation of a searching algorithm. The algorithm takes as input the average speed and returns the engine RPM ( ω e ). The known searching algorithms are: linear, binary, hash table, and direct-table. The complexity of those algorithms is summarized in Table 7. Hardware implementation of the search algorithm. For the fuel estimation algorithm, the direct address table is the most appropriate way for searching the engine RPM, as the size of the table is small. The Algorithm 2 computes the engine RPM using the direct address table.
Algorithm 2 Pseudo-code for the RPM calculation unit.
procedureRPM-2 ( v ¯ , TRPM, Tspeed)
    I ( 0.1 · v ¯ ) 1
     ω e  TRPM(I)
    return  ω e
end procedure
The data-flow graph of the RPM unit using the approximating equation, the search algorithm using the direct address table, and the binary search algorithm are pictured in Figure 4.

5. Implementation Results

Three types of architecture have been implemented using FPGA technology. Those architectures are summarized in Table 8. The architecture ArchApproxRM uses an approximation formula to compute ω e . The binary search algorithm is used by the architecture ArchBinaryRPM. The last one uses a direct address table.
For automated architecture synthesis of the RPM unit, the academic high-level synthesis tool (GAUT) has been used [20]. The design flow using GAUT is shown in Figure 5. Comparison between three architectures for the implementation of the RPM calculator is presented in Table 9. From the presented results, it is clear the the approximation method consumes fewer resources as compared with the two others.
The data path of the fuel estimation algorithm necessitates the implementation of floating-point arithmetic. This is due to the high-dynamic range of the coefficients used in the fuel estimation algorithm. Floating-point arithmetic is supported in VHDL 2008 operations [21]. Furthermore, a number of vendors offer IP for floating point operations. To select the suitable method for the realization of the data path, both the floating-point package and the IP provided by Xilinx ISE tool were implemented and tested using Virtex-6 FPGA. The core is reconfigurable and can be used to design adder, multiplier, absolute value, exponential function, square-root, conversion between fixed and floating-point, natural logarithm, and accumulator [22].
The comparison presented in Table 10 favors the IP over the floating-point package. The critical delay for the data path is 4 ns, which is nearly 17.8 times less than the one proposed in [13]. The proposed architecture can be used for eco-routing. The circuit can be further optimized by fine-tuning the floating-point arithmetic. Furthermore, the fuel estimation model does not consider factors such as driving comfort and weather conditions. A more detailed investigation will be conducted from both an algorithm standpoint as well as a hardware implementation standpoint.

6. Conclusions

Approximation computing is a very attractive design techniques for reducing the implementation complexity of DSP algorithms. In this paper, high-level transformation techniques were used to implement a fuel estimation algorithm for a passenger car. Three architectures were devised and implemented on FPGA technology. High-level synthesis using GAUT was employed to design the RPM calculation unit. Pre-calculation combined with approximated computing was exercised to further reduce the floating-point operations. The results show that the architecture that uses approximated multiplication for the computation of the engine RPM consumes fewer hardware resources compared with the binary-based searching method. Furthermore, the control data-flow graph was pipelined to reduce the critical path delay. The synthesis results were determined using a commercial IP. The maximum operating frequency of the data path is 236 MHz, which is dictated by the floating-point adder.


This research/project was funded by the Vice Presidency for Graduate Studies, Business, and Scientific Research (GBR) at Dar Al Hekma University, Jeddah, under grant no. (RFC/21-22/006). The author, therefore, acknowledges with thanks GBR for technical and financial support.

Institutional Review Board Statement

The study was conducted according to the guidelines of the Declaration of Helsinki, and approved by the Institutional Review Board (or Ethics Committee) of Dar Al-Hekma University.

Conflicts of Interest

The authors declare no conflict of interest.


The following abbreviations are used in this manuscript:
MVEGMoving Vehicle Emission Group
NEDCThe New European Driving Cycle
ECEEuropean Cycle Emission
EUDCExtra-Urban Driving Cycle
CMEMComprehensive Modal Emission Model
IPIntellectual Property
DFGData-Flow Graph


  1. Dimitrakopoulos, G.; Demestichas, P. Intelligent Transportation Systems. IEEE Veh. Technol. Mag. 2010, 5, 77–84. [Google Scholar] [CrossRef]
  2. An, S.h.; Lee, B.H.; Shin, D.R. A Survey of Intelligent Transportation Systems. In Proceedings of the 2011 Third International Conference on Computational Intelligence, Communication Systems and Networks, Bali, Indonesia, 26–28 July 2011; pp. 332–337. [Google Scholar] [CrossRef]
  3. Lin, Y.; Wang, P.; Ma, M. Intelligent Transportation System(ITS): Concept, Challenge and Opportunity. In Proceedings of the 2017 IEEE 3rd International Conference on Big Data Security on Cloud (Bigdatasecurity), IEEE International Conference on High Performance and Smart Computing (HPSC), and IEEE International Conference on Intelligent Data and Security (IDS), Beijing, China, 26–28 May 2017; pp. 167–172. [Google Scholar] [CrossRef]
  4. Kenney, J.B. Dedicated Short-Range Communications (DSRC) Standards in the United States. Proc. IEEE 2011, 99, 1162–1182. [Google Scholar] [CrossRef]
  5. Elbery, A.; Rakha, H.; Elnainay, M.; Drira, W.; Filali, F. Eco-Routing Using V2I Communication: System Evaluation. In Proceedings of the 2015 IEEE 18th International Conference on Intelligent Transportation Systems, Gran Canaria, Spain, 15–18 September 2015; pp. 71–76. [Google Scholar] [CrossRef]
  6. Ko, B.; Park, B.; Lee, H.; Son, S.H. Eco-Driving System Using Dedicated Short Range Communication. In Proceedings of the 2016 IEEE 22nd International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA), Daegu, Korea, 17–19 August 2016; p. 260. [Google Scholar] [CrossRef]
  7. Mohanty, S.P.; Choppali, U.; Kougianos, E. Everything you wanted to know about smart cities: The Internet of things is the backbone. IEEE Consum. Electron. Mag. 2016, 5, 60–70. [Google Scholar] [CrossRef]
  8. Loman, M.; Šarkan, B.; Skrucaný, T. Comparison of fuel consumption of a passenger car depending on the driving style of the driver. Transp. Res. Procedia 2021, 55, 458–465. [Google Scholar] [CrossRef]
  9. Ben Dhaou, I. Fuel estimation model for ECO-driving and ECO-routing. In Proceedings of the 2011 IEEE Intelligent Vehicles Symposium (IV), Baden-Baden, Germany, 5–9 June 2011; pp. 37–42. [Google Scholar] [CrossRef]
  10. Jiménez, F.; Cabrera-Montiel, W. System for Road Vehicle Energy Optimization Using Real Time Road and Traffic Information. Energies 2014, 7, 3576–3598. [Google Scholar] [CrossRef]
  11. Chen, Y.; Zhu, L.; Gonder, J.; Young, S.; Walkowicz, K. Data-driven fuel consumption estimation: A multivariate adaptive regression spline approach. Transp. Res. Part C Emerg. Technol. 2017, 83, 134–145. [Google Scholar] [CrossRef]
  12. Kan, Z.; Tang, L.; Kwan, M.P.; Zhang, X. Estimating Vehicle Fuel Consumption and Emissions Using GPS Big Data. Int. J. Environ. Res. Public Health 2018, 15, 566. [Google Scholar] [CrossRef] [PubMed][Green Version]
  13. Dhaou, I.B.; Mahroogi, F.; Tenhunen, H. Implementation of a Fuel Estimation Algorithm on SoC FPGA. In Proceedings of the 2019 IEEE International Symposium on Circuits and Systems (ISCAS), Sapporo, Japan, 26–29 May 2019; pp. 1–5. [Google Scholar] [CrossRef]
  14. Akcelik, R.; Besley, M. Operating cost, fuel consumption and emission models in aaSIDRA and aaMOTION. In Proceedings of the 25th Conference of Australian Institutes of Transport Research (CAITR 2003), Adelaide, Australia, 3–5 December 2003. [Google Scholar]
  15. Magaña, V.C.; Muñoz-Organero, M. Artemisa: A Personal Driving Assistant for Fuel Saving. IEEE Trans. Mob. Comput. 2016, 15, 2437–2451. [Google Scholar] [CrossRef][Green Version]
  16. Kancharla, S.R.; Ramadurai, G. Incorporating driving cycle based fuel consumption estimation in green vehicle routing problems. Sustain. Cities Soc. 2018, 40, 214–221. [Google Scholar] [CrossRef]
  17. Omidi, R.; Sharifzadeh, S. Design of low power approximate floating-point adders. Int. J. Circuit Theory Appl. 2021, 49, 185–195. [Google Scholar] [CrossRef]
  18. Gillespie, T.D. Fundamentals of Vehicle Dynamics, 2nd ed.; SAE International: Warrendale, PA, USA, 2019. [Google Scholar]
  19. Guzzella, L.; Sciarretta, A. Vehicle Propulsion Systems, 1st ed.; Springer: Berlin/Heidelberg, Germany, 2007. [Google Scholar]
  20. Coussy, P.; Chavet, C.; Bomel, P.; Heller, D.; Senn, E.; Martin, E. GAUT: A High-Level Synthesis Tool for DSP Applications. In High-Level Synthesis: From Algorithm to Digital Circuit; Coussy, P., Morawiec, A., Eds.; Springer: Dordrecht, The Netherlands, 2008; pp. 147–169. [Google Scholar] [CrossRef]
  21. Bishop, D.W. Floating Point Package User Guide. 2016. Available online: (accessed on 15 February 2021).
  22. Xilinx Inc. Floating-Point Operator v7.1: LogiCORE IP Product Guide; Xilinx Inc.: San Jose, CA, USA, 2020. [Google Scholar]
Figure 1. Pillars of the smart city framework.
Figure 1. Pillars of the smart city framework.
Jlpea 12 00017 g001
Figure 2. Major forces acting on an accelerated vehicle along a ramp.
Figure 2. Major forces acting on an accelerated vehicle along a ramp.
Jlpea 12 00017 g002
Figure 3. Two methods for the calculation of the RPM: (a) CDFG for the unoptimized fuel estimation algorithm; (b) pipelined and optimized CDFG for the refined fuel estimation algorithm.
Figure 3. Two methods for the calculation of the RPM: (a) CDFG for the unoptimized fuel estimation algorithm; (b) pipelined and optimized CDFG for the refined fuel estimation algorithm.
Jlpea 12 00017 g003
Figure 4. Three methods for the calculation of the RPM: (a) DFG for the RPM calculation unit using approximated equation; (b) RPM unit calculation using a binary search algorithm; (c) RPM unit calculation using a direct address table.
Figure 4. Three methods for the calculation of the RPM: (a) DFG for the RPM calculation unit using approximated equation; (b) RPM unit calculation using a binary search algorithm; (c) RPM unit calculation using a direct address table.
Jlpea 12 00017 g004
Figure 5. High-level synthesis using GAUT.
Figure 5. High-level synthesis using GAUT.
Jlpea 12 00017 g005
Table 1. Parameters list with their their typical values.
Table 1. Parameters list with their their typical values.
ParameterExplanationUnitTypical Value/Range
ttrip timesecondNA
RPMRotations per minutedimensionless0–7000
m v Vehicle’s masskg750
m l Vehicle’s loadkg600
BDiameter of the cylinder (in piston)m0.067
SEngine strokem0.067
znumber of cylindersdimensionless4–8
A f Frontal area of a vehiclem 2 1.97–3.2
c d drag coefficientdimensionless0.29–0.32
c r A rolling friction coefficientdimensionlessNA
t t r a c percentage of traction timedimensionless60%
ρ a Ambient air densitykg/m 3 1–1.3
e g b efficiency index of the gearboxdimensionless0.92–0.95
P 0 , g b the gearbox power lossW3% of the rated power of the gear box
N s t o p s Frequency of stoppingdimensionlessNA
H l the fuel’s lower heating valueJ/kg 43 . 510 6 (for RON—95 gasoline)
ρ f Density of the fuelkg/L0.75 (for RON—95 gasoline)
gearth accelerationm/s 2 9.83
F t r a c attractive forceNNA
ζ e engine efficiencydimensionlessNA
Table 2. Statistical values of h 1 , h 2 , and h 3 .
Table 2. Statistical values of h 1 , h 2 , and h 3 .
Driving Cycle h 1 h 2 h 3
Table 3. Precomputed value of K 1 = h 1 1 2 ρ a A f c d in N.
Table 3. Precomputed value of K 1 = h 1 1 2 ρ a A f c d in N.
Table 4. Precomputed value of K 2 = h 2 · g · c r + h 3 for c r = 8.63 × 10 3 .
Table 4. Precomputed value of K 2 = h 2 · g · c r + h 3 for c r = 8.63 × 10 3 .
Table 5. Arithmetic cost of the fuel estimation algorithm.
Table 5. Arithmetic cost of the fuel estimation algorithm.
OperationBefore TransformationAfter TransformationSavings in (%)
Table 6. Comparison between measured and estimated RPM.
Table 6. Comparison between measured and estimated RPM.
Speed (kmph)Gear PositionGear RatioMeasured ω e (tr/min)Estimated ω e Error in %
Table 7. Complexity-based search techniques.
Table 7. Complexity-based search techniques.
AlgorithmLinear SearchBinary SearchHash TableDirect Address Table
Complexity O ( n ) O ( log n ) O ( 1 ) O ( 1 )
Table 8. Features of the hardware architectures.
Table 8. Features of the hardware architectures.
FeatureApproximationBinary SearchDirect
Table 9. Synthesis results for the RPM calculator.
Table 9. Synthesis results for the RPM calculator.
Block NameSizeNumberSizeNumberSizeNumber
Single-port ROM 32 × 12 1 32 × 12 100
Multiplier00 10 × 10 1 10 × 10 1
Table 10. Comparison between a commercial IP and the floating point package.
Table 10. Comparison between a commercial IP and the floating point package.
Operator F max (IP) F max  (fp Package)
Divide237 MHz13.6 MHz
Multiplier245 MHz38.2 MHz
Adder236 MHz22.8 MHz
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Dhaou, I.B. Implementation of a Fuel Estimation Algorithm Using Approximated Computing. J. Low Power Electron. Appl. 2022, 12, 17.

AMA Style

Dhaou IB. Implementation of a Fuel Estimation Algorithm Using Approximated Computing. Journal of Low Power Electronics and Applications. 2022; 12(1):17.

Chicago/Turabian Style

Dhaou, Imed Ben. 2022. "Implementation of a Fuel Estimation Algorithm Using Approximated Computing" Journal of Low Power Electronics and Applications 12, no. 1: 17.

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop