Next Article in Journal
Energetic and Exergetic Analysis of a Transcritical N2O Refrigeration Cycle with an Expander
Next Article in Special Issue
Symbolic Entropy Analysis and Its Applications
Previous Article in Journal
The Fractality of Polar and Reed–Muller Codes
Previous Article in Special Issue
A General Symbolic Approach to Kolmogorov-Sinai Entropy
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Operation Reduction Using Fast Computation of an Iteration-Based Simulation Method with Microsimulation-Semi-Symbolic Analysis †

1
Faculty of Technical Sciences Cacak, University of Kragujevac, 32000 Cacak, Serbia
2
The School of Electrical Engineering and Computer Science of Applied Studies Belgrade, 11000 Belgrade, Serbia
3
School of Computer and Information Technology, Beijing Jiaotong University, 100044 Beijing, China
4
The Faculty of Electrical Engineering and Computer Science, University of Maribor, 2000 Maribor, Slovenia
*
Author to whom correspondence should be addressed.
This paper is an extended version of our paper published in Studies in Informatics and Control 2016, 25, 303–312, complemented by new results.
Submission received: 24 October 2017 / Revised: 26 December 2017 / Accepted: 11 January 2018 / Published: 18 January 2018
(This article belongs to the Special Issue Symbolic Entropy Analysis and Its Applications)

Abstract

:
This paper presents a method for shortening the computation time and reducing the number of math operations required in complex calculations for the analysis, simulation, and design of processes and systems. The method is suitable for education and engineering applications. The efficacy of the method is illustrated with a case study of a complex wireless communication system. The computer algebra system (CAS) was applied to formulate hypotheses and define the joint probability density function of a certain modulation technique. This innovative method was used to prepare microsimulation-semi-symbolic analyses to fully specify the wireless system. The development of an iteration-based simulation method that provides closed form solutions is presented. Previously, expressions were solved using time-consuming numerical methods. Students can apply this method for performance analysis and to understand data transfer processes. Engineers and researchers may use the method to gain insight into the impact of the parameters necessary to properly transmit and detect information, unlike traditional numerical methods. This research contributes to this field by improving the ability to obtain closed form solutions of the probability density function, outage probability, and considerably improves time efficiency with shortened computation time and reducing the number of calculation operations.

1. Introduction

In general, theoretical, experimental, and computational approaches are the basis for the study of observed phenomena. Every scientific and experimental result is expected to be placed into a function for its use, so the commercial use of products and services, and many engineering uses, emanate from a scientific approach that has been translated into an engineering approach.
Emerging developments are posing challenges in information technology [1,2,3] that include searching large databases [1,2], solving complex processes described by mathematical models, analyzing phenomena in communications in the information space, such as the transmission of wireless signals in urban environments [4,5,6], and the continuous high speed delivery of information without stagnation in software engineering [7]. The common feature among all these issues is how to directly obtain results for further processing or exploitation. To address this challenge, complex mathematical tools are used to perform analyses and simulations of the performance of the observed processes and systems. Most often, a classical mathematical analysis does not provide final answers in closed form for complex phenomena, so special functions are used to obtain a solution. When results cannot be obtained with mathematical models, we use numerical methods. Most numerical tools include complex calculations, such as differential and integral equations and algebraic structures, using numerical mathematics algorithms such as Newton-Cotes, Romberg integration, Gauss-Christoffel, trapezium rule, Gauss formulas, etc. [8,9]. Due to this complexity, students may not understand the complete process or system, or cannot perform the method performance analysis to the end within the bounds of the classroom. Engineers and researchers may not have appropriate insight into the impact of the parameters necessary for the effective investigation or design. Additionally, the numerical computation generates a large amount of data, which may sometimes lead to erroneous results [10,11]. These incorrect results may be due to the finite word length in the records, or errors occurring during the shortening of numbers in fractions, for example. These methods do not provide the ability to manipulate with analytic expressions. These issues have been overcome by introducing a new method that treats variables and parameters as symbols. The method is called the iteration-based simulation method (IBSM) [11,12]. In addition to the IBSM that provides symbolic analysis, we allow the analysis to be partially observed through the concept of microsimulation analysis, which additionally enhances the ability to influence the parameters and variables. Also, we created an effective method with fast computation time that, together with the operation reduction, provides accurate results quickly. Computer algebra systems are important tools for these analyses, developments, and research, as they provide a completely new approach for understanding and solving complex cases. In this paper, we present the above methods directly applied to two examples. Both examples require complex analysis and use symbolic closed form expressions, and their numerical analysis is time-consuming.
The paper is organized as follows: in Section 2, the problem statement is described. Section 3 illustrates the complete methodology and procedure for applying the method, as well as examples with results in details. In Section 4, the collected results are discussed in detail.

2. Problem Statement

A large number of simulations do not guarantee that tolerances will not be exceeded. This is one of the numerous drawbacks of numerical-based tools. Our study had three goals. The first was to solve any analysis in closed form to allow further simplification and manipulation by using an iteration-based simulation method. The second goal was to develop an algorithm to quickly compute the method. Finally, we wanted to reduce the number of operations in the algorithm prior to its implementation. All phases of development and testing were observed by microsimulation-semi-symbolic analysis.
The IBSM was developed using the computer algebra system (CAS) to simplify complex algebraic expressions that offers an acceptable reduced analytic form for further manipulation or simulation as a closed form solution as previously published [12]. As integrals are present in the majority of the analyses, we approached the analyses with elementary calculating when the integrals are presented using Riemann sum. The method converts low-complexity implementation into a high-complexity structure. This approach allows implementation in the hardware environment.
The CAS performs symbolic mathematical operations and is used in the fields of mathematics and computer science. The CAS is based on algebraic calculations and manipulations performed using the same process as manual derivations. The CAS exclusively includes working with symbols, and numerical calculation is a special case for a CAS. Since symbols are used as variables, CAS deals with symbolic processing. Symbolic processing (SP) involves the development, implementation, and application of algorithms that manipulate and analyze mathematical expressions. CAS provides a deeper understanding and helps students to learn and engineers to simulate and design. The Wolfram language (WL) is the programming language suitable for CAS. WL has the ability to manipulate symbolic expressions using a method similar to traditional manual derivation [13]. The WL is characterized by high-performance computing and the generation of compact and short program codes.
The goal of IBSM is to introduce a new parameter to obtain a closed form expression. Since the iteration is a new parameter, we used a transformation to change the integral into a sum, i.e., a series. For this purpose, we used Riemann sum transformation for the features of the improper integrals. Using this method, we obtained closed form expressions that can be manipulated and simplified, with a short computation time, while reducing the operations. The results were tested and verified. The general form of the Riemann integral transformation into a series is given as follows [14,15]:
a b f ( x ) d x = lim Δ x 0 i = 1 n f ( x i ) Δ x i
By observing the integrals in the previous session, we defined two types of Riemann sums: a single sum and a double sum. We first solved the single sum, then solved the double integrals. So, given Equation (1), the Wolfram language code is shown in Figure 1, where q is the value of the iteration in the defined transformation.
Microsimulation mimics a complex phenomenon by describing its micro-components. Essentially, the system is left free to develop without too many constraints and simplifying assumptions [16]. However, when microsimulation is used with only symbolic content, and the particular numerical values are changed in the final stage, it is called microsimulation semi-symbolic analysis (MSSA). We observed each element of the symbolic calculation through MSSA, which provides faster and better testing and verification as well as a reduction in the operations [17,18]. MSSA also directly calculates in the first run without requiring more simulation attempts.
The next step was the development of an algorithm to allow fast computation. To achieve this, we treated the expression as a series. As a reminder, a short explanation of the concept of fast computation follows. A series is said to converge slowly if a large number of members of the series need to be added to determine a sum with the required accuracy. During the addition of series members using the member-by-member technique, the process automatically occurs and is interrupted when a selected criterion for error evaluation is fulfilled. Given the ultimate summation, the absolute value of the relationship between the last member and the calculated sum is most often used. This criterion is not always reliable, especially for the addition of a trigonometric series. An error caused by an interrupted summing is always higher than estimated. Conversely, contemporary computing machines can quickly add a large number of members in the series. However, due to the limitation on the format of the records in the registers, a certain number of decimal places are eliminated, which leads to the accumulation of errors and to completely absurd results in the process of summing. Therefore, procedures exist for accelerating the convergence of a series, such as Kummer, Aitken, Cesar, and Euler. This paper presents an effective method for accelerating the convergence of a series based on Kummer’s transformation.
We adhered to two theorems. The first states that if k = 1 n a k convergences, then lim k a k = 0 . The second states that if k = 1 n a k and k = 1 n b k are positive series, and if lim k a k b k = ρ ,   ( b k 0 ) , then convergence or divergence occur simultaneously. Kummer’s transformation, better known as Kummer’s acceleration method, accelerates the convergence of many series. The method subtracts from a given convergent series a k , and another equivalent series b k , whose sum C = k 0 b k is well known and finite. Kummer’s transformation is described as:
k = 0 a k = ρ k = 0 b k + k = 0 ( 1 ρ b k a k ) a k = ρ C + k = 0 ( 1 ρ b k a k ) a k
The convergence of the right hand side of Equation (2) is faster because 1 − ρ·bk/ak tends to 0 as k tends to infinity [19]. The complete procedure is shown in Figure 2.
The reduction in operations was performed by counting all math operations and functions contained in the final expressions. Wolfram language allows the performance of direct counting. Mathematical operations and functions in WL can be viewed both symbolically and as commands. Operations are recognized using the FullForm command, and the counting is performed using the StringPosition command. Since we had sums where the numbers are repeated q times, the WL code for completely counting the operations is:
InnerOperations=q*FullForm[aK[z,q];]
StringPosition[InnerOperations,{"Times","Power","Plus","Rational", "BesselI","Log","Exp"}];
The orders of Times, Plus, BesselI, Log, and Exp are functions used in close form expressions. Similarly, substituting s for ak[z,q], we obtained the number of operations in the accelerated algorithm.

3. Applications of the Accelerating Procedure and Operation Reduction with Microsimulation Semi-Symbolic Analysis

In this section, the operation reduction using fast computation of an iteration-based simulation method with microsimulation-semi-symbolic analysis was applied to two processing problems to illustrate the shorter computation time of the algorithm, and to demonstrate the variety of applications for which the operation may be used. A case with complex calculation is illustrated in the example with non-coherent Amplitude-Shift Keying (ASK) with shadowing, interference, and correlated noise. The second example treats second-order statistics in the SC macrodiversity system operating over Gamma shadowed Nakagami-m fading channels [20].

3.1. Non-Coherent Amplitude Shift Keying (ASK) with Shadowing, Interference, and Correlated Noise

Non-coherent ASK is a modulation scheme used to send digital information between digital equipment and it is shown on Figure 3. Similar part of the system, where real-time estimation is needed, can be found in [21]. The data is transmitted by the non-coherent system without a carrier in a binary manner.
Shadowing with interference is one of the most common models used in wireless communications to describe the phenomenon of multiple scattering [21,22,23,24]. The basic components of the system are shown in Figure 1. Both shadowing and interference cause strong fluctuations in the amplitude of the useful signal. This occurs in urban areas and is described as a log-normal distribution. In our analysis, we performed an outage probability. Transmitting signals using two symbols were observed in the non-coherent ASK system [25,26]. The noise, as a narrow-band stochastic process, is correlated and the coefficient of correlation is denoted by R (R ≠ 1). Mathematically, the noise can be described as ni(t) = xi(t)·cos(ωt) − yi(t)·sin(ωt). The receiver is sheltered, and no optical visibility exists toward the transmitter, but interference i1(t) = A1·cos(ωt) is present. If the system sends logical zero, then the signal s0(t) = a0·cos(ωt) has been sent, but if the system sends a logical unit, then the signal s1(t) = a1·cos(ωt) has been sent. The parameters a0 and a1 are the signal elements from which the code words are formed. The receiver detects information signal b0·cos(ωt) and b1·cos(ωt) with envelops z0 and z1 after passing through a transmitting channel. The bm (m = 0, 1) are the elements of the detected signals. The receiver system includes a filter and detector envelope. In the receiver input, the signal is:
rm(t) = bm·cos(ωt) + A1·cos(ωt) + xm·cos(ωt) − ym·sin(ωt) = zm·cos(ωt + φm), m = 0, 1
with envelopes z0 and z1, and phases φ0 and φ1, respectively.
The general form of the condition joint probability density function is:
p ( x 0 , x 1 , y 0 , y 1 ) = 1 4 π 2 σ 4 1 R 2 exp { x 0 2 + x 1 2 + y 0 2 + y 1 2 2 R ( x 0 x 1 + y 0 y 1 ) 2 σ 2 ( 1 R 2 ) }
where R is the coefficient of correlation and σ is variance. To ensure the set of expressions is solved continuously, using the polar coordinates is necessary, as follows:
x 0 = z 0 cos φ 0 b 0 A 1 y 0 = z 0 sin φ 0 x 1 = z 1 cos φ 1 b 1 A 1 y 1 = z 1 sin φ 1
The next step was determining the condition joint probability density function (JPDF). Substituting Equation (5) into Equation (4), we obtained:
p(r0, r1/b0, b1, φ0, φ1, A1) = p(x0, y0, x1, y1)·|J|
where |J| is Jacobian. A joint probability density function has a log-normal distribution described as [22]:
p i j ( b 0 , b 1 / A 1 ) = 1 2 π σ 2 ( b 0 + A 1 ) ( b 1 + A 1 ) 1 R 2 × × exp { ( 10 log ( b 0 + A 1 ) a i ) 2 + ( 10 log ( b 1 + A 1 ) a j ) 2 2 σ 2 ( 1 R 2 ) } × exp { 2 R ( 10 log ( b 0 + A 1 ) a i ) ( 10 log ( b 1 + A 1 ) a j ) 2 σ 2 ( 1 R 2 ) }
For i = j = 0, the code word 00 was sent; for i = 1 and j = 0, the code word 01 was sent; for i = 0 and j = 1, the code word 10 was sent; and for i = 1 and j = 1, the code word 11 was sent. So:
p ( z 0 , z 1 / b 0 , b 1 , φ 0 , φ 1 , A 1 ) = z 0 z 1 ( 2 π ) 2 σ 4 1 R 2 × × exp { z 0 2 + z 1 2 2 R ( b 0 + A 1 ) ( b 1 + A 1 ) 2 R z 0 z 1 cos ( φ 0 φ 1 ) 2 σ 2 ( 1 R 2 ) } × × exp { 2 ( 1 + R ) ( b 0 + b 1 + 2 A 1 ) ( z 0 cos φ 0 + z 1 cos φ 1 ) 2 σ 2 ( 1 R 2 ) }
The last expression can be transformed using a modified Bessel function [27] before derivation of the closed form expression:
e x cos α = n = I n ( x ) cos n α
and applying trigonometric transformation:
cos α cos β cos γ = 1 4 [ cos ( α + β + γ ) + cos ( α β + γ ) + cos ( α + β γ ) + cos ( α β γ ) ]
Equation (8) becomes:
p ( z 0 , z 1 / b 0 , b 1 , φ 0 , φ 1 , A 1 ) = = C e C 0 n = m = k = I n ( C 1 ) I m ( C 2 ) I k ( C 3 ) × cos [ n φ 0 ] cos [ m φ 1 ] cos [ k ( φ 0 φ 1 ) ]
where:
C = z 0 z 1 ( 2 π ) 2 σ 4 1 R 2 C 0 = z 0 2 + z 1 2 2 R ( b 0 + A 1 ) ( b 1 + A 1 ) 2 σ 2 ( 1 R 2 ) C 1 = ( b 0 + A 1 ) ( b 1 + A 1 ) σ 2 ( 1 R ) z 0 C 2 = ( b 0 + A 1 ) ( b 1 + A 1 ) σ 2 ( 1 R ) z 1 C 3 = R z 0 z 1 σ 2 ( 1 R 2 )
Using the Bessel identity In(x) = I-n(x), it follows that:
p ( z 0 , z 1 / b 0 , b 1 , A 1 ) = 2 π 2 C e C 0 ( b 0 , b 1 , A 1 ) × n = 0 I n [ C 1 ( b 0 , b 1 , A 1 ) ] I n [ C 2 ( b 0 , b 1 , A 1 ) ] I n [ C 3 ]
The present interference is described with the Rayleigh distribution over the probability density function (PDF) [23,24] as:
p ( A 1 ) = A 1 σ 2 exp { A 1 2 2 σ 2 } ;   0 A 1
To eliminate the interference, performing averaging is necessary for all values of interference A1.
p i j ( z 0 , z 1 / b 0 , b 1 ) = 0 p ( z 0 , z 1 / b 0 , b 1 , A 1 ) p ( A 1 ) d A 1
The integral in Equation (15) is solved using integral:
π π π π cos n φ 0 cos m φ 1 cos k ( φ 0 φ 1 ) d φ 0 d φ 1 = { π 2 ,   | n | = | m | = | k | 0 ,   n m k
The distribution is obtained by averaging φ0 and φ1 for all values between −π and π.
p ( z 0 , z 1 / b 0 , b 1 ) = π π π π p ( z 0 , z 1 / b 0 , b 1 , φ 0 , φ 1 ) d φ 0 d φ 1
For all code word combinations, distributions of envelopes are obtained by integrating all values between b0 and b1. So, when the code word |ij| (i = 0, 1; j = 0, 1) has been sent, marked with HiHj in Equation (18), and when the same is detected in the input of the receiver marked with DiDj, the detection of the signals is described as:
P ( D i D j / H i H j ) = p i j ( z 0 , z 1 ) = 0 0 p ( z 0 , z 1 / b 0 , b 1 ) p i j ( b 0 , b 1 ) d b 0 d b 1
The outage probability is:
P o u t a g e = 1 i = 0 1 j = 0 1 P ( H i H j ) P ( D i D j / H i H j )
where P ( H i H j ) = P ( H i ) P ( H j ) = 1 2 1 2 = 1 4 , i = 0, 1, and j = 0, 1. For the outage probability, Equation (19) represents closed form expression and is often not present in the closed form solution. Closed form expression represents an implicit solution that is contained in a mathematical expression [12]. A closed form solution provides a solved problem in terms of functions and mathematical operations from a given and generally-accepted set [28]. In other words, a closed form solution provides an explicit solution to an observed problem, whereas closed form expression shows an implicit or insufficient solution.
From Equation (7), the joint probability density function is shown in Figure 4.
Figure 5 shows the manipulating of Equation (8) and substituting into Equation (12) for the changing of coefficients for simplification.
Interference A1 is present per Equation (14) and described by Wolfram language code in Figure 6,
Averaging all A1 values is necessary, according to Equation (15). The general form of the condition joint probability density function is defined in Equation (14), and is described in Figure 7.
s is marked variance σ, R is the correlation coefficient, and v is the order of the iterations. The finalization of IBSM obtains closed form expressions of the probability density function, and outage probability in term of iterations (Figure 8).
The closed form of PDFoutage in Figure 8 provides the next parameters: iteration q, h0, and h1 are the resolution of the iteration, z0 and z1 are envelopes, R is the coefficient of correlation, and σ is variance. This expression cannot be manually obtained by using numerical tools. The resultant closed form solution of Poutage is an expression that is ready for further processing. Accordingly, the viewpoint is an insight into the parameters and variables that participate in obtaining all the features of this case study. Drawing the characteristics is now possible, but this calculation would take too long, regardless of the chosen accuracy. On the other hand, for greater accuracy, a number of iterations is required, which is not beneficial for this form of expression.
Finally, the closed form solution of Poutage is shown in Figure 9.
In our case, a member ak represents a general member of the series in Poutage, from the closed form solution in Figure 9.
Convergence testing of the ak verified that:
lim k q q a k = 0
Convergence testing was performed with assumptions that 0 ≤ R < 1, σ > 0, z ≥ 0, and q ≥ 1.
The selection of the auxiliary function is one of the most important aspects of the MSSA [29]. In testing many series, the authors of this paper highlighted the series that shows the best performance to accelerate convergence, meaning a shorter computation time with the optimum number of iteration. Comparative analysis of different auxiliary series can be the subject of particular surveys, and the reader(s) are encouraged to do so. Therefore, in our case, the auxiliary series is:
C = k = 1 1 k 5 2 k 1
The series converges to 2log2. To fully use Equation (2), we made a minor modification to the member bk, with respect to the convergence theorems that have been mentioned above. The new member becomes bkak + ck, so:
s = k = 0 a k = ρ k = 0 a k + k = 0 ( 1 ρ a k + c k a k ) a k = ρ C + k = 0 ( 1 ρ a k + c k a k ) a k
where ck is general term in Equation (21). We obtain the general member of Poutage marked as ak in Figure 10, separating it from Figure 9. Following the next step in MSSA, we derived the term ρ (Figure 11).
We checked that the value ρ tends to 1 after convergence testing. The quicker computation was performed by assuming how much iteration is required to calculate the outage probability Poutage obtained by the IBSM. Otherwise, a large number of iterations are required to calculate the closest exact values of Poutage, but the computation is time consuming. Then, the resulting Poutage equalizes with a new series obtained by the Kummer's transformation, and performs point matching for the various values of the envelopes, followed by a new reduced number of iterations. After that, the verification of the obtained results was performed by checking the relative error, which determined the degree of adjustability of the algorithm [29]. Finally, we checked the number of operations of calculations in the expression in Figure 9, and then obtained a reduced number of operations with a new decreased number of iterations.
After all symbolic derivations, we used closed form solutions to directly obtain results in the first attempt. To obtain concrete numerical results, we needed to set the initial parameters. We supposed that the closest exact value was obtained after 500 iterations by using the outage probability Poutage in Figure 9, and the resolution of the iteration was h0 = 0 and h1 = 1. We also used z0 = z1 = z to simplify the analysis. The next step was calculating the new numbers of iterations that are reduced for various values of the envelope z. This was performed using the command FindRoot[s==Poutage,{q,1}]. s is a new expression obtained by Kummer’s transformation in Equation (22), and Poutage is a closed form solution in Figure 8. We took the range of values z = {1, 15} for a concrete case [29]. Experiments were performed for various values of the coefficient of correlation R (R = 7/10,8/10) and the variance σ (σ = 2, 3). All calculations were performed with a precision of 10−6. All tests were performed on a PC with: Intel® Core™ i5-6500 CPU@ 3.2 GHz, 8 GB RAM, 64-bit Operating System, Windows 10, and Mathematica Wolfram 11.1. The reduced number of iterations are shown in Table 1.
In Figure 12, the changing iteration values in terms of the envelope z are shown for the accelerated algorithm. Notably, the reduced number of iterations is not the same for each envelope value. The minimum number of iterations is z = 10, where the value provides a true detection. However, the number of iterations is in range of 9 to 35 if we observe the total range of the envelope, which is a significant reduction compared to the original 500 iterations.
Since the absolute error is not precisely characterized by accuracy, the relative error is used as:
δ = s P o u t a g e P o u t a g e
Relative errors do not exceed more than 10% of the value as it is shown in Figure 13. This indicates that the algorithm is quite accurate. In Figure 14, the comparative characteristics of Poutage and s are shown. The accelerated algorithm s is marked as Pe,approx.
The total calculation of formula Poutage required 1193.97 s, or 19 min and 54 s, so the average time per iteration was 70.2335 s. The sped up algorithm’s total calculation time for the accelerated formula was 1.25 s, so the average time per iteration was 0.0735294 s. Wolfram language code for time consumed is: Table[Timing[N[Poutage]],{z,15}] // Total. Command Table provides a calculation for any value of envelope z, and command Timing provides the exact time of calculation. Command Total summarizes total time per envelope. Similarly, changing the parameter Poutage with s for the accelerated algorithm in the previous WL command line provides the time consumed for fast computation. Our algorithm is accelerated as:
R a t i o = t i m e ( P o u t a g e ) t i m e ( s ) = 1193.97 1.25 955 t i m e s
Figure 15 shows the number of operations in terms of the number of iterations q for fast computation. The number of iterations is fixed at q = 500 for Poutage because we initially assumed that this number of iterations was satisfied for the closest exact value of Poutage. The number of operations for fast computation of IBSM is less than Poutage. For 500 iterations, we counted 120,000 math operations for Poutage. The number of math operations changes in the range of 9000 to 34,000, which is the result of variety in the number of iterations for fast computation.

3.2. Second-Order Statistics in Wireless Channels

The level crossing rate (LCR) and the average duration of fade (ADF) are important second-order statistical characteristics describing the fading channel in mobile communications. These values are suitable for designing mobile radio communication systems and for analyzing their performance. In digital telecommunications, a sudden drop in the value of the received signal directly leads to a drastic increase in the probability of error. For optimizing the coding system required to correct errors, the number of times the received signal passes through the given level in time and how long, on average, the signal is below the specified level must be known. The LCR and ADF are the appropriate measures closely related to the quality of the received signal [24].
The LCR of signal Z(t), marked as NZ(z), is defined as the signal speed crossing through level z with a positive derivative at the intersection point z. The ADF, marked as TZ(z), represents the mean time for which the signal overlay is below the specified z level.
The LCR at envelope z is mathematically defined by [22]:
N Z ( z ) = 0 z p z Z ( z , z ) d z
where z is the envelope of the received signal, z is its derivative in time, and p z Z ( z , z ) is the joined probability density function. The average fade duration (AFD) is determined as [22]:
T Z ( z ) = F Z ( z Z ) N Z ( z )
where FZ(zZ) represents the probability that the signal level Z(t) is less than the level z. Evaluation and calculation of LCR and ADF are trivial in an environment where no large reflections exists with a large number of transmission channels and shadowing, which simplifies the mathematical description of the distribution of the signal. However, in complex environments, obtaining LCR and ADF characteristics is time-consuming. An example of a complex environment is described in Stefanovic et al. [20]. In this example, the LCR and ADF expressions were obtained. Their analytical shapes are closed forms, but the complexity shows a long computation time. Thus, the LCR value is normalized by the Doppler shift frequency fd [20] through Equation (15):
N Z ( z ) f d = z M 1 1 Γ ( M 1 ) Γ ( c 1 ) Γ ( c 2 ) ( N 1 m 1 r 1 ) M 1 1 2 π m 1 × × k = 0 ( N 1 m 1 z / r 1 ( ( 1 / Ω 01 ) + ( 1 / Ω 02 ) ) ) M 1 c 1 c 2 + k 1 / 2 2 c 2 ( 1 + c 2 ) k Ω 01 c 1 Ω 02 k + c 2 K ( M 1 + c 1 + c 2 + k 1 / 2 ) ( 2 N 1 m 1 z ( Ω 01 + Ω 02 ) r 1 Ω 01 Ω 02 ) + + z M 2 1 Γ ( M 2 ) Γ ( c 1 ) Γ ( c 2 ) ( N 2 m 2 r 2 ) M 2 2 π m 2 × × k = 0 ( N 2 m 2 z / r 2 ( ( 1 / Ω 01 ) + ( 1 / Ω 02 ) ) ) M 2 c 1 c 2 + k 1 / 2 2 c 2 ( 1 + c 2 ) k Ω 01 c 1 Ω 02 k + c 2 K ( M 2 + c 1 + c 2 + k 1 / 2 ) ( 2 N 2 m 2 z ( Ω 01 + Ω 02 ) r 2 Ω 01 Ω 02 )
where Γ(x) denotes the Gamma function, Mi is ( m i N i 2 ) / r i , mi is the Nakagami-m fading severity parameter, Ni denotes the number of identically assumed channels at each microlevel, ri is related to the exponential correlation ρi, ci denotes the order of Gamma distribution, Ώ0i is related to the average powers of the Gamma long-term fading distributions, and Kv(x) is the modified Bessel function of the second order. Similarly, the AFD is obtained as [20] per Equation (16):
T Z ( z ) = F Z ( z Z ) N Z ( z ) P z ( Z ) = 2 ( N 1 m 1 / r 1 ) M 1 Γ ( M 1 ) Γ ( c 1 ) Γ ( c 2 ) M 1 × k = 0 l = 0 ( N 1 m 1 r 1 ) k ( N 1 m 1 z / r 1 ( ( 1 / Ω 01 ) + ( 1 / Ω 02 ) ) ) c 1 + c 2 + + l k M 1 2 c 2 ( 1 + c 2 ) k Ω 01 c 1 Ω 02 l + c 2 K ( c 1 + c 2 + l k M 1 ) ( 2 N 1 m 1 z ( Ω 01 + Ω 02 ) r 1 Ω 01 Ω 02 ) + 2 ( N 2 m 2 / r 2 ) M 2 Γ ( M 2 ) Γ ( c 1 ) Γ ( c 2 ) M 2 × k = 0 l = 0 ( N 2 m 2 r 2 ) k ( N 1 m 1 z / r 1 ( ( 1 / Ω 01 ) + ( 1 / Ω 02 ) ) ) c 1 + c 2 + l k M 2 2 c 2 ( 1 + c 2 ) k Ω 01 c 1 Ω 02 l + c 2 K ( c 1 + c 2 + l k M 2 ) ( 2 N 1 m 1 z ( Ω 01 + Ω 02 ) r 1 Ω 01 Ω 02 ) +
As in the previous example, we defined a general term ak from Equation (27), shown in Figure 16.
Using the expression in Figure 17, we derived the term ρ that tends to 1 when q → ∞.
In this case, Equations (27) and (28) have already been provided in advance in a closed form where the iteration parameter q is present, so applying the IBSM would be excessive. To compute the closest exact values of LCR and AFD, 100 iterations were required in Stefanovic et al. [20]. Using Kummer’s transformation, both LCR and AFD were calculated in the first iteration. All computations were performed using the values of m = 1, L = 2, Ώ = 1, c = 2, and R = 1/5. An auxiliary series was used:
C = k = 1 e k 2
The series C converges to (1/2)·(ϑ3(0, e−1)–1), where ϑa(u, x), (a = 1,…,4) is the theta function, defined as [30]:
ϑ 3 ( u , x ) = 1 + 2 k = 1 x k 2 cos ( 2 k u )
Figure 18 shows the comparative characteristics of LCR and accelerated LCR. The deviation of the accelerated series is small in relation to the original series, and the relative error is shown in Figure 19, in the specified range of envelope –35 ≤ z ≤ 30.
The total calculation of the LCR formula required 30.6563 s, so the average time per iteration was 0.437946 s. The total calculation time with the sped up algorithm in the accelerated formula was 1.53125 s, so the average time per iteration was 0.021875 s. Our algorithm is accelerated as:
R a t i o = t i m e ( L C R o r i g ) t i m e ( L C R a c c e l e r a t e d ) = 30.6563 1.53125 20 t i m e s
Figure 18 shows the number of operations of LCR (NZ) in terms of the number of iterations q for fast computation. The number of iterations was fixed at q = 100 for LCRorig because we initially assumed that this number of iterations satisfied the closest exact value of LCRorig. For 100 iterations, we counted 20,200 math operations for LCRorig. The number of math operations was 1184 for LCRaccelerated calculated in the first iteration using fast computation. Using the same method, the AFD was obtained by applying Equation (22). Figure 20 shows the comparative characteristics of AFD and accelerated AFD. A small deviation in the range of −35 ≤ z ≤ −28 was observed, perceived through the relative error in Figure 21.
The total calculation of formula AFDorig required 19,553.1 s, or 5 h and 25 min, so, the average time per iteration was 279.33 s, or 4 min and 19.33 s. The sped up algorithm total calculation time with the accelerated formula was 1.29688 s, so, the average time per iteration was 0.0185268 s. An obvious difference in the time calculation exists because the number of sums for AFD increased in Equation (27), where we have sums for k, l, and q. In this case, our algorithm is accelerated as:
R a t i o = t i m e ( A F D o r i g ) t i m e ( A F D a c c e l e r a t e d ) = 19 , 553.1 1.29688 15 10 3 t i m e s
For 100 iterations, we counted the 344 × 106 math operations for AFDorig. The number of math operations was 5619 for LCRaccelerated calculated in the first iteration for fast computation.

4. Conclusions

This paper presents a new method to accelerate the computation and reduce the number of calculation operations in the iteration-based simulation method. The method was developed to simulate the systems and processes when obtaining mathematical formulas in the final closed form is not possible. Often, many phenomena show that closed form expressions and simulations are executed with numerical based tools. In these cases, the users do not have insight into the phenomena that affect the flow of processes, which can lead to incorrect assumptions and results. The method provides insight into processes and systems using symbolic processing, with significant acceleration and reduction in the number of computation operations required. For symbolic derivation, the computer algebra system was used, and Kummer’s transformation was used to shorten the computation time. The complete method to reduce the number of operations and shorten the computation time was illustrated in two examples. Both cases require complex and time-consuming calculations. Due to the large number of operations, the memory resources can also play a significant role in the speed of the calculation. The acceleration of the algorithm and the reduction of the number of operations significantly affected efficiency in terms of time savings and the rapid production of results. The method can be used in many fields where fast computation in one-step simulation runs is required.

Acknowledgments

This paper is partially funded by Serbian Ministry of Education, Science and Technological Development within the project No. TR 32023.

Author Contributions

Vladimir Mladenovic developed algorithms and performed testing; Yigang Cen and Vladimir Mladenovic proposed the field of application and microsimulation concept; Miroslav Lutovac wrote Wolfram language code involving by the symbolic processing; Danijela Milosevic and Matjaz Debevc introduced the semi-symbolic concept combining symbolic and numerical data, analyzed data, and performed their verifications; Vladimir Mladenovic and Matjaz Debevc wrote the paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Kan, S.C.; Cen, Y.G.; Wang, Y.H.; Mladenovic, V.M.; Voronin, V. SURF Binarization and Fast Codebook Construction for Image Retrieval. J. Vis. Commun. Image Represent. 2017, 49, 104–114. [Google Scholar] [CrossRef]
  2. Zhanga, F.; Cen, Y.G.; Zhaoa, R.; Hua, S.; Mladenovic, V. Multi-separable dictionary learning. Signal Process. 2017. [Google Scholar] [CrossRef]
  3. Voronin, V.; Marchuk, V.; Makov, S.; Mladenovic, V.; Cen, Y.G. Spatio-Temporal Image Inpainting for Video Applications. Serbian J. Electr. Eng. 2017, 14, 229–244. [Google Scholar]
  4. Lin, L.; Ma, X.; Liang, C.; Huang, X.; Bai, B. An Information-Spectrum Approach to the Capacity Region of the Interference Channel. Entropy 2017, 19, 270. [Google Scholar] [CrossRef]
  5. Lin, P.H.; Jorswieck, E.A. Multiuser Channels with Statistical CSI at the Transmitter: Fading Channel Alignments and Stochastic Orders, an Overview. Entropy 2017, 19, 515. [Google Scholar] [CrossRef]
  6. Kakar, J.; Sezgin, A. A Survey on Robust Interference Management in Wireless Networks. Entropy 2017, 19, 362. [Google Scholar] [CrossRef]
  7. Chen, L. Continuous Delivery: Overcoming adoption challenges. J. Syst. Softw. 2017, 128, 72–86. [Google Scholar] [CrossRef]
  8. Ferrari, G.; Colavolpe, G.; Raheli, R. Detection Algorithms for Wireless Communications; John Wiley & Sons Ltd.: Chichester, UK, 2004; ISBN 978-0-470-85828-8. [Google Scholar]
  9. Glover, I.A.; Grant, P.M. Digital Communications, 3th ed.; Prentice Hall: Upper Saddle River, NJ, USA, 2010. [Google Scholar]
  10. Pavlovic, V.; Mladenovic, V.; Lutovac, M.D. Computer Algebra and Symbolic Processing in Modern Telecommunication Applications: A New Kind of Survey. In Telecommunications: Applications, Modern Technologies and Economic Impact; Barringer, J.P., Ed.; Nova Science Publishers: New York, NY, USA, 2014; pp. 29–116. ISBN 978-1-63117-141-3. [Google Scholar]
  11. Mladenovic, V.; Makov, S.; Voronin, V.; Lutovac, M. An Iteration-Based Simulation Method for Getting Semi-Symbolic Solution of Non-coherent FSK/ASK System by Using Computer Algebra Systems. Stud. Inform. Control 2016, 25, 303–312. [Google Scholar]
  12. Mladenovic, V.; Milosevic, D. A novel-iterative simulation method for performance analysis of non-coherent FSK/ASK systems over Rice/Rayleigh channels using the Wolfram language. Serbian J. Electr. Eng. 2016, 13, 157–174. [Google Scholar] [CrossRef]
  13. Wolfram, S. An Elementary Introduction to the Wolfram Language; Wolfram Media, Inc.: Campaign, TN, USA, 2017; ISBN 9781944183059. [Google Scholar]
  14. Anton, H. Calculus: A New Horizon, 6th ed.; Wiley: New York, NY, USA, 1999; pp. 324–327. ISBN 978-0471243496. [Google Scholar]
  15. Weisstein, E.W. Riemann Sum, Wolfram Web Resource. Available online: http://mathworld.wolfram.com/RiemannSum.html (accessed on 1 September 2017).
  16. Castiglione, F. Microsimulation of Complex System Dynamics: Automata Models in Biology and Finance. Ph.D. Thesis, Universität zu Köln, Koln, Germany, 2001. [Google Scholar]
  17. Grabowski, D.; Grimm, C.; Barke, E. Semi-symbolic modeling and simulation of circuits and systems. In Proceedings of the IEEE International Symposium on Circuits and Systems, Kos, Greece, 21–24 May 2006; pp. 983–986. [Google Scholar] [CrossRef]
  18. Gil, L.; Radetzki, M. Semi-symbolic operational computation for robust control system design. In Proceedings of the 22nd International Conference on Methods and Models in Automation and Robotics (MMAR), Miedzyzdroje, Poland, 28–31 August 2017; pp. 779–784. [Google Scholar] [CrossRef]
  19. Abramowitz, M.; Stegun, I. Handbook of Mathematical Functions; National Bureau of Standards: Dover, NY, USA, 1964. [Google Scholar]
  20. Stefanovic, D.; Panic, S.; Spalevic, P. Second-order statistics of SC macrodiversity system operating over Gamma shadowed Nakagami-m fading channels. Int. J. Electron. Commun. (AEÜ) 2010. [Google Scholar] [CrossRef]
  21. Radwan, A.; Rodriguez, J. Energy Efficient Smart Phones for 5G Networks; Springer: Berlin, Germany, 2015; ISBN 978-3-319-10313-6. [Google Scholar]
  22. Borhani, A.; Patzold, M. Modeling of Vehicle-to-Vehicle Channels in the Presence of Moving Scatterers. In Proceedings of the 2012 IEEE Vehicular Technology Conference (VTC Fall), Quebec City, QC, Canada, 3–6 September 2012; pp. 1–5. [Google Scholar] [CrossRef]
  23. Patzold, M. Mobile Radio Channels, 2nd ed.; John Wiley & Sons: Hoboken, NJ, USA, 2011; ISBN 978-0-470-51747-5. [Google Scholar]
  24. Patzold, M. Mobile Fading Channels; John Wiley & Sons, Ltd.: New York, NY, USA, 2003; ISBN 978-0471495499. [Google Scholar]
  25. Lutovac, M.; Mladenovic, V.; Lutovac, M. Development of Aeronautical Communication System for Air Traffic Control Using OFDM and Computer Algebra Systems. Stud. Inform. Control 2013, 22, 205–212. [Google Scholar] [CrossRef]
  26. Martinez, W.; Martinez, A. Computational Statistics Handbook with MATLAB; Chapman & Hall/CRC: London, UK, 2015; ISBN 9781466592735. [Google Scholar]
  27. Andrews, G.; Askey, R.; Roy, R. Special Functions (Encyclopedia of Mathematics and its Applications); Cambridge University Press: Cambridge, UK, 2001; pp. 212–222. ISBN 978-0521789882. [Google Scholar]
  28. Borwein, J.M.; Crandall, R.E. Closed forms: What they are and why we care. Not. Am. Math. Soc. 2013, 60, 55. [Google Scholar] [CrossRef] [Green Version]
  29. Mladenovic, V.; Makov, S.; Cen, Y.G.; Lutovac, M. Fast Computation of the Iteration-Based Simulation Method—Case Study of Non-coherent ASK with Shadowing. Serbian J. Electr. Eng. 2017, 14, 415–431. [Google Scholar] [CrossRef]
  30. Available online: http://reference.wolfram.com/language/ref/EllipticTheta.html (accessed on 19 December 2017).
Figure 1. Wolfram language code for a Riemann sum.
Figure 1. Wolfram language code for a Riemann sum.
Entropy 20 00062 g001
Figure 2. Steps of the speeding up and operation reduction process.
Figure 2. Steps of the speeding up and operation reduction process.
Entropy 20 00062 g002
Figure 3. Non-coherent amplitude shift keying (ASK) system with interference i1(t).
Figure 3. Non-coherent amplitude shift keying (ASK) system with interference i1(t).
Entropy 20 00062 g003
Figure 4. Condition joint probability density function using Wolfram language for shadowing and interference.
Figure 4. Condition joint probability density function using Wolfram language for shadowing and interference.
Entropy 20 00062 g004
Figure 5. Changing of coefficients for simplification.
Figure 5. Changing of coefficients for simplification.
Entropy 20 00062 g005
Figure 6. Rayleigh distribution for interference coded by Wolfram language.
Figure 6. Rayleigh distribution for interference coded by Wolfram language.
Entropy 20 00062 g006
Figure 7. Log-normal distribution for non-coherent ASK in the presence of shadowing and interference.
Figure 7. Log-normal distribution for non-coherent ASK in the presence of shadowing and interference.
Entropy 20 00062 g007
Figure 8. Closed form solution of probability density function (PDFoutage) of a non-coherent ASK system.
Figure 8. Closed form solution of probability density function (PDFoutage) of a non-coherent ASK system.
Entropy 20 00062 g008
Figure 9. Closed form solution of outage probability Poutage of a non-coherent ASK system with shadowing and interference.
Figure 9. Closed form solution of outage probability Poutage of a non-coherent ASK system with shadowing and interference.
Entropy 20 00062 g009
Figure 10. General term in a series of Poutage marked as ak.
Figure 10. General term in a series of Poutage marked as ak.
Entropy 20 00062 g010
Figure 11. The element Kummer’s transformation ρ.
Figure 11. The element Kummer’s transformation ρ.
Entropy 20 00062 g011
Figure 12. The number of iterations in term of envelope z.
Figure 12. The number of iterations in term of envelope z.
Entropy 20 00062 g012
Figure 13. Relative error functions in term of the envelope z.
Figure 13. Relative error functions in term of the envelope z.
Entropy 20 00062 g013
Figure 14. Comparative characteristics of Poutage and accelerated outage probability s.
Figure 14. Comparative characteristics of Poutage and accelerated outage probability s.
Entropy 20 00062 g014
Figure 15. Number of operations in terms of number of iterations q for fast computation. The number of iterations is fixed with q = 500 for Poutage.
Figure 15. Number of operations in terms of number of iterations q for fast computation. The number of iterations is fixed with q = 500 for Poutage.
Entropy 20 00062 g015
Figure 16. General term of the level crossing rate (LCR) marked as ak.
Figure 16. General term of the level crossing rate (LCR) marked as ak.
Entropy 20 00062 g016
Figure 17. The element Kummer’s transformation ρ.
Figure 17. The element Kummer’s transformation ρ.
Entropy 20 00062 g017
Figure 18. Comparative characteristics of LCR and accelerated LCR.
Figure 18. Comparative characteristics of LCR and accelerated LCR.
Entropy 20 00062 g018
Figure 19. Relative error function of LCR in term of the envelope z.
Figure 19. Relative error function of LCR in term of the envelope z.
Entropy 20 00062 g019
Figure 20. Comparative characteristics of the average fade duration (AFD) and accelerated AFD.
Figure 20. Comparative characteristics of the average fade duration (AFD) and accelerated AFD.
Entropy 20 00062 g020
Figure 21. Relative error function of AFD in terms of envelope z.
Figure 21. Relative error function of AFD in terms of envelope z.
Entropy 20 00062 g021
Table 1. Reduced number of iterations.
Table 1. Reduced number of iterations.
zq1
R = 7/10; σ = 2
q2
R = 7/10; σ = 3
q3
R = 8/10; σ = 2
q4
R= 8/10; σ = 3
125322130
220271625
319251422
418241221
517231120
617231020
71823919
81823919
92024920
102125919
1123261020
1227271121
1329281221
1432301422
1536311623

Share and Cite

MDPI and ACS Style

Mladenovic, V.; Milosevic, D.; Lutovac, M.; Cen, Y.; Debevc, M. An Operation Reduction Using Fast Computation of an Iteration-Based Simulation Method with Microsimulation-Semi-Symbolic Analysis. Entropy 2018, 20, 62. https://0-doi-org.brum.beds.ac.uk/10.3390/e20010062

AMA Style

Mladenovic V, Milosevic D, Lutovac M, Cen Y, Debevc M. An Operation Reduction Using Fast Computation of an Iteration-Based Simulation Method with Microsimulation-Semi-Symbolic Analysis. Entropy. 2018; 20(1):62. https://0-doi-org.brum.beds.ac.uk/10.3390/e20010062

Chicago/Turabian Style

Mladenovic, Vladimir, Danijela Milosevic, Miroslav Lutovac, Yigang Cen, and Matjaz Debevc. 2018. "An Operation Reduction Using Fast Computation of an Iteration-Based Simulation Method with Microsimulation-Semi-Symbolic Analysis" Entropy 20, no. 1: 62. https://0-doi-org.brum.beds.ac.uk/10.3390/e20010062

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