123

COMPLEX FUZZY SETS WITH APPLICATIONS IN SIGNALS
Xueling Ma1 , Jianming Zhan1 , Madad Khan2 , Muhammad Zeeshan2 ,

Saima Anis2 and Abdul Sami Awan2
1
Department of Mathematics, Hubei Minzu University, Enshi,
Hubei Province 445000, China
2
Department of Mathematics, COMSATS University Islamabad, Abbottabad
Campus Pakistan
zjmhbmy@126.com, zhanjianming@hotmail.com, madadmath@yahoo.com,

zeeshan.msc08@gmail.com, saimaanispk@gmail.com,
abdulsamiawan@cuiatd.edu.pk
Abstract. In this paper we introduced some new operations and laws of a

complex fuzzy set such as disjunctive sum, simple di¤erence, bounded di¤erence,
distributive law of union over intersection and intersection over union, equivalence
formula, symmetrical di¤erence formula, involution law, absorption law, idempo-
tent law. We introduced some basic results on complex fuzzy sets with respect
to standard complex fuzzy intersection, union, and complement functions corre-
sponding to same functions for determining the phase term and we gave particular
examples of these operations. We used complex fuzzy sets in signals and systems,
because its behavior is similar to a Fourier transform in certain cases. Moreover
we developed a new algorithm using complex fuzzy sets for applications in signals
and systems by which we identi…ed a reference signal out of large number of signals
detected by a digital receiver. We used the inverse discrete Fourier transform of a
complex fuzzy set for incoming signals and a reference signal. Thus a method for
measuring the exact values of two signals is provided by which we can identity the
reference signal.
Keyword. Discrete Fourier transform matrix; signal processing, complex fuzzy

sets, complex fuzzy operations, complex fuzzy intersections, complex fuzzy union,
complex valued grades of memberships, complex fuzzy complement.
1. Introduction
Models representing real life phenomenon with only choices of truth and false-
hood are insu¢ cient to represent the actual reality of the problems. The reason for
this, is that there are several complexities exist in the models, that is, why a system
is needed to be developed to handle such ill-de…ned situations of the models. Now
there are two ways to handle these types of situations, one is to …nd the numerical
solutions of the problems and second is to develop a model which is numerical. In
both cases we get numerical solutions of the problems. The second one is dealt with
fuzzy set theory which includes probability theory, fuzzy soft set theory, intuition-
istic fuzzy sets theory and most importantly neutrosophic set theory. The later one
Correspoding author email address zhanjianming@hotmail.com .

1
2 COM PLEX FUZZY SETS W ITH APPLICATIONS IN SIGNALS
is more generalized theory for handling problems involving complexities. One of

the suitable examples of these theories is the theory of fuzzy di¤erential equations
which is more general than the di¤erential equations to solve daily life problems
with more accuracy.
In 1965, Zadeh [28] gave the concept of a fuzzy set (FS) which is similar to a
probability function. A fuzzy set plays a vital role in models of real world problems
in various branches of sciences. Fuzzy set theory has a lot of applications in opera-
tion research, medicine, psychology, engineering design, decision making, quantum
physics, mathematical chemistry, non–equilibrium thermodynamics image process-
ing, biological classi…cation, economics ( see [2], [5],[8], [10], [11], [13], [14] and [15]
): For basic and resent work one can refer to [7], [17], [19] and [27], [21], [22], [23],
[24], [25], [26], [9], [12] and [20].
The idea of a complex fuzzy set (CFS) was …rst given by Ramot et, al., in [16].
As complex numbers set is the generalization of a real numbers set introduced by
Gauss in 1795. Accordingly, a CFS is the extension of a fuzzy set, whose range
set is extended from closed interval [0; 1] to a disc of radius one in a complex
plane. The membership function of CFS S is denoted as S (x) and de…ned on
the universal U as: for any x 2 U a complex value in the disc of radius one in a
complex plane. Thus all values of S (x) lie inside
p a circle of radius one in complex
plane and S (x) = rS (x)ei!S (x) ; where i = 1. The term rS (x) is said to be
amplitude term, ! S (x) is said to be phase term. Both these terms are real valued
with rS (x) 2 [0; 1]: The CFS S is represented as f(x; S (x))jx 2 U g:
Fuzzy sets and intuitionistic fuzzy sets cannot handle imprecise, in-consistent,
and incomplete information of periodic nature. These theories are applicable to
di¤erent areas of science, but there is one major de…ciency in both sets, that is,
a lack of capability to model two-dimensional phenomena. To overcome this dif-
…culty, Ramot introduce a complex fuzzy set. The phase term of CFS plays a
vital role in de…ning the feature of the complex fuzzy set model. This term distin-
guish a CFS model from all other models available in literature. The potential of
a complex fuzzy set for representing two-dimensional phenomena makes it superior
to handle ambiguous and intuitive information that are prevalent in time-periodic
phenomena. Complex fuzzy sets, their classes, and logic have an important role in
applications, such as prediction of periodic events and advanced control systems.
A complex fuzzy set is quite similar to a Fourier transform, in fact it is the spe-
ci…c form of the Fourier transform by restricting the range of Fourier transform to
a complex unit disc. Since Fourier transform has a lot of applications in various
…elds such as in signals and systems, communication, astronomy, geology, optics
etc. Therefore a complex fuzzy set can be used in certain models like Fourier trans-
form. Several other real life phenomena are ambiguous and cannot be modeled
using one-dimensional variables. For example, items can be expressed by a set of
measurements in pattern recognition and are seen as vectors in a multidimensional
space. These multidimensional variables can not be expressed via a simple combi-
nation of variables, especially by consideration of fuzzy sets. These types of sets can
be expressed via complex classes. A complex fuzzy set is very useful for periodic
phenomena. Ramot et, al., recommended that the periodic problems or recurring
problems phenomena can be modeled more accurately by using the phase compo-
nent of a complex fuzzy set memberships, such as expressing the e¤ect of …nancial
indicators of two countries on each other with the passage of time. He proposed
COM PLEX FUZZY SETS W ITH APPLICATIONS IN SIGNALS 3
that signal processing is another …eld of desirable application for a complex fuzzy
set. Moreover it is used for expressing solar activity (solar maximum and solar
minimum) through the average number of sunspot [16]. Dick proposed that one
of the desirable application of the complex fuzzy sets is to use it for representing
phenomena with relatively periodic behavior [4]. The tra¢ c congestions in a big
city is the periodic phenomena that never repeat themselves. Thus complex fuzzy
logic can be used to solve certain classes of problems more e¢ ciently and accurately
rather than a fuzzy logic.
The set theoretic operations on a CFS such as intersection, union, complement,
rotation and re‡ection was …rst introduced by Ramot in [16]. Also De Morgan Laws
for a CFS and CF relation were presented in [16].
Now in this paper we de…ne some new operations and laws for a complex fuzzy
set such as distributive property, idempotent property, absorption law, equivalence
formula, simple di¤erence, symmetric di¤erence formula, etc. with respect to stan-
dard complex fuzzy union, intersection and complement function. We present some
basic results of complex fuzzy set regarding CF union, CF intersection and CF
complement and also discuss particular examples of these operations. Moreover we
developed an algorithm using the discrete Fourier transform matrix introduced in
[18]. Then we apply it to a problem in signals and systems.
2. Preliminaries
We will discuss here the basic set theoretic operations and laws of CFS and also
discuss particular examples of these operations and laws.
De…nition 1. [6] A review of traditional fuzzy simple di¤ erence: For any two fuzzy
sets R and S, the simple di¤ erence is de…ned as RrS = R\S c , where “c”represents
the standard complement.
De…nition 2. Consider two CFSs R and S, R (x); S (x) denote the membership
functions R and S: The simple di¤ erence RrS of these two CFS R and S is de…ned
as
R r S = R \ S c = R (x) ? S c (x)
where ? represents the t-norm [5] and S c (x) denotes the membership function
and x belongs to S c :
Example 1. Let
3
0:5ei 0:8ei 2 0:4ei 2
R= + +
u v w
and
5
0:6ei2 1ei 2 0:3ei2
S= + +
u v w
be two CFSs. By using standard intersection and standard complement function
with max function for determining the phase term, the simple di¤ erence is
3 5
0:5ei 0:8ei 2 0:4ei 2 0:4ei2 0ei 2 0:7ei2
RrS = R \ Sc = [ + + ]?[ + + ]
u v w u v w
i 52
0:4ei2 0e 0:4ei2
= + + :
u v w
De…nition 3. [6] For any two fuzzy sets R and S, the bounded di¤ erence is de…ned
as
R S (x) = M ax[0; R (x) r S (x)]
where R (x) and S (x) denotes the membership function to which x is a member
of R and S:
De…nition 4. Let R and S be two CFSs, and let R ; S denote the membership
functions of R and S. The bounded di¤ erence of these two CFSs R and S is de…ned
as
R S (x) = M ax[0; R (x) r S (x)] = M ax[0; (rR (x) r rS (x))ei!RrS (x) ]:

Here [ R (x) r S (x)] is same as the bounded di¤erence of traditional fuzzy set.
But, the main problem is to …nd the phase term. As the functions de…ned in
“complex fuzzy set” [16] for determining the phase term of complex fuzzy union
and complex fuzzy intersection, here these functions are also applicable for …nding
the phase term, so for calculating the phase term, we use the following functions.
(i) Sum. ! RrS = ! R + ! S
(ii) Max. ! RrS = max(! R ; ! S )
(iii) Min. ! RrS = min(! R ; ! S )
! R ; rR > rS
(iv) “Winner take all”. ! RrS =
! S ; rS > rR
The following are also acceptable possibilities for …nding the phase term.
(i) Di¤erence. ! RrS = ! R ! S
(ii) Average. ! RrS = !R +!
2
S
(iii) Weighted Average. ! RrS = rR !rRR+r

+rS ! S
S
Example 2. Let
3
0ei 0:5ei 2 0:8ei 2
R= + +
u v w
and
3 5
1ei2 0:6ei 2 0:2ei 2
S= + +
u v w
be two CFSs. The bounded di¤ erence of these two CFSs is
3 5
0ei2 0ei 2 0:6ei 2
R S (x) = + + :
u v w
De…nition 5. [6] Let R and S be any two fuzzy sets, the disjoint sum is de…ned as
R S (x) =j R (x) r S (x) j

where R (x) and S (x) denote the membership functions to which x is a member
of R and S:
De…nition 6. Let R and S be two CFSs, and let R ; S denote the membership
functions of R and S. The disjoint sum of these two CFSs R and S is de…ned as
R S (x) =j R (x) r S (x) j=j [rR (x) r rS (x)]ei!RrS (x) j :

The term j rR (x) r rS (x) j is same as traditional FS. To …nd the phase term for
disjoint sum, the functions de…ned in bounded di¤ erence are also applicable here.
Example 3. Let
5
1ei 2 0:5ei 2 0ei
R= + +
u v w
and 3
0:5ei 0:6ei 2 0:9ei 2
S= + +
u v w
be two CFSs. Using the max function for calculating the phase term, the disjoint
sum of these two fuzzy sets is
0:5 0:1 0:9
R S (x) = + + :
u v w
De…nition 7. [6] For any two fuzzy sets R and S, the disjunctive sum is de…ned
as
R S = (R \ S c ) [ (Rc \ S) = (R ? S c ) (Rc ? S)
where ?; and c represents the standard intersection, standard union and stan-
dard complement function.
De…nition 8. Let R and S; be any two CFSs and R (x); S (x) denote the mem-
bership functions of R and S: Let R S represents the disjunctive sum of CFSs R
and S; de…ned as R S = (R \ S c ) [ (Rc \ S). The membership function of R S is
R S (x) =[ R\S c (x) Rc \S (x)]

i! R\S c (x)
(3) R S (x) = [rR (x) ? rS c (x)]e [rRc (x) ? rS (x)]ei!Rc \S (x)
where ?; and c represents the standard intersection, standard union, and
standard complement function respectively of a CFS.
Example 4. Suppose
1ei0 0:4ei 0:8ei 2
R= + +
z1 z2 z3
and 3
0:2ei 2 0:3ei2 1ei 4
S= + +
z1 z2 z3
be two CFSs. Then the disjunctive sum of these two CFSs is de…ned as
R S (z) = [rR (z) ? rS c (z)]ei!R\Sc (z) [rRc (z) ? rS (z)]ei!Rc \S (z) :
Using standard intersection,standard union and standard complement function with
same function for determining the phase term, we have
3 3
0:8ei 2 0:4ei2 0ei 2 0ei 2 0:3ei2 0:2ei 2
R S (z) = [ + + ] [ + + ]
z1 z2 z3 z1 z2 z3
3
0:8ei 2 0:4ei2 0:2ei 2
R S (x) = + + :
z1 z2 z3
De…nition 9. For any two CFSs R and S; the equivalence formula is
(Rc [ S) \ (R [ S c ) = (Rc \ S c ) [ (R \ S):
Using the standard union and standard intersection function with the same func-
tion for determining the phase term along with standard complex fuzzy complement,
the equivalence formula is hold. The L:H:S and R:H:S of equivalence formula for
CFSs R and S are given by
Rc [S (y) \ R[S c (y) = [ Rc (y) S (y)] ?[ R (y) S c (y)]

i! Rc (y) i! S (y)
= [rRc (y)e rS (y)e ] ? [rR (y)ei!R (y) rS c (y)ei!Sc (y) ]
Rc \S c (y) [ R\S (y) = [ Rc (y) ? S c (y)] [ R (y) ? S (y)]
i! Rc (y) i! S c (y)
= [rRc (y)e ? rS c (y)e ] [rR (y)ei!R (y) ? rS (y)ei!S (y) ]
where ?, and c represents the standard intersection, standard union and stan-
dard complement functions respectively.
Example 5. Suppose
0:8ei 4 0:6ei 6 0:9ei 2 1ei2
R= + + +
u v w t
and
3 3
0:5ei 2 0:7ei 0:1ei0 0:3ei 4
S= + + +
y1 y2 y3 y4
be two complex fuzzy sets. The equivalence formula is hold by using standard union,
standard intersection and standard complement function with the same function for
determining the phase term. The equivalence formula is
(Rc [ S) \ (R [ S c ) = (Rc \ S c ) [ (R \ S)
3
0:5ei 2 0:7ei 0:1ei 2 0:3ei2
(Rc [ S) \ (R [ S c ) = [ + + + ]?
y1 y2 y3 y4
3
0:8ei 2 0:6ei 0:9ei 2 1ei2
[ + + + ]
y1 y2 y3 y4
3
0:5ei 2 0:6ei 0:1ei 2 0:3ei2
(1) (Rc [ S) \ (R [ S c ) = + + +
y1 y2 y3 y4
3
0:2ei 2 0:3ei 0:1ei 2 0ei2
(Rc \ S c ) [ (R \ S) = [ + + + ]
y1 y2 y3 y4
3
0:5ei 2 0:6ei 0:1ei 2 0:3ei2
[ + + + ]
y1 y2 y3 y4
3
0:5ei 2 0:6ei 0:1ei 2 0:3ei2
(2) (Rc \ S c ) [ (R \ S) = + + + :
y1 y2 y3 y4
From (1) and (2) we have
(Rc [ S) \ (R [ S c ) = (Rc \ S c ) [ (R \ S):
De…nition 10. Symmetrical di¤ erence formula for two CFSs R and S is given by
(Rc \ S) [ (R \ S c ) = (Rc [ S c ) \ (R [ S):
Using standard union, standard intersection function along with standard comple-
ment function with same function for determining the phase term, then the sym-
metrical di¤ erence formula hold for complex fuzzy sets. The L:H:S and r:H:S of
symmetrical di¤ erence formula for CFSs R and S are given by
[ Rc \S (x) [ R\S c (x)] = [ Rc (x) ? S (x)] [ R (x) ? S c (x)]

i! Rc (x)
= [rRc (x)e ? rS (x)ei!S (x) ] [rR (x)ei!R (x) ? rS c (x)ei!Sc (x) ]
[ Rc [S c (x) \ R[S (x)] = [ Rc (x) S c (x)] ? [ R (x) S (x)]
i! Rc (x) i! S c (x)
= [rRc (x)e rS c (x)e ] ? [rR (x)ei!R (x) rS (x)ei!S (x) ]
where ?; and c represents standard intersection, standard union and standard
complement function.
Example 6. Let
3
0:5ei 0:8ei 6 1ei 2
R= + +
u v w
, and
0:2ei2 0:6ei 0:4ei 4
+
S= +
u v w
be two complex fuzzy sets. Using standard union, standard intersection and standard
complement function with same function for determining the phase term, we have
3 3
0:2ei2 0:2ei 0ei 2 0:5ei2 0:4ei 0:6ei 2
(Rc \ S) [ (R \ S c ) = [ + + ] [ + + ]
u v w u v w
3
0:5ei2 0:4ei 0:6ei 2
(1) (Rc \ S) [ (R \ S c ) = + +
u v w
i2 i i 32 i2 3
0:8e 0:4e 0:6e 0:5e 0:8ei 1ei 2
(Rc [ S c ) \ (R [ S) = [ + + ]?[ + + ]
u v w u v w
3
0:5ei2 0:4ei 0:6ei 2
(Rc [ S c ) \ (R [ S) = + + :
u v w
(Rc \ S) [ (R \ S c ) = (Rc [ S c ) \ (R [ S):
De…nition 11. Complex fuzzy sets satisfy distributive laws by using standard union
and standard intersection function with same function for determining the phase
term.
Let R, S and T be three CFSs. Then the distributive laws are
R [ (S \ T ) = (R [ S) \ (R [ T )
and
R \ (S [ T ) = (R \ S) [ (R \ T ):
These two laws are called distributive law of union over intersection and distrib-
utive law of intersection over union.
If R = rR (x)ei!R (x) ; S = rS (x)ei!S (x) and T = rT (x)ei!T (x) ; then the L:H:S
and R:H:S distributive law of union over intersection becomes
[ R (x) ( S (x) ? T (x))] = [rR (x)ei!R (x) (rS (x)ei!S (x) ? rT (x)ei!T (x) )]
[ R (x) S (x)]?[ R (x) = [rR (x)ei!R (x) rS (x)ei!S (x) ]?[rR (x)ei!R (x) rT (x)ei!T (x) ]:
T (x)]
Also the L:H:S and R:H:S of distributive law of intersection over union is
[ R (x) ?( S (x) R (x))] = [rR (x)ei!R (x) ? (rS (x)ei!S (x) rT (x)ei!T (x) )]
[ R (x)? S (x)] [ R (x)? T (x)] = [rR (x)ei!R (x) ?rS (x)ei!S (x) ] [rR (x)ei!R (x) ?rT (x)ei!T (x) ]
where ? and represents the standard intersection and standard union function
respectively.
Example 7. Let
1ei0 0:4ei 0:8ei 2
R= + + ;
u v w
,
3
0:2ei 4 0:3ei2 1ei 6
S= + +
u v w
and 3
0:6ei 2 0:4ei 4 0:5ei 5
T = + +
u v w
be three CFSs. To satis…es the distributive law of union over intersection and
intersection over union, using standard union and standard intersection function
with same function for determining the phase term.
Now the distributive law of union over intersection is
3
1ei0 0:4ei 0:8ei 2 0:2ei 4 0:3ei2 1ei 6
R [ (S \ T ) = [ + + ] ([ + + ]?
u v w u v w
3
0:6ei 2 0:4ei 4 0:5ei 5
[ + + ])
u v w
3
1ei0 0:4ei 0:8ei 2 0:2ei 2 0:3ei2 0:5ei 5
= [ + + ] [ + + ]
u v w u v w
3
1ei 2 0:4ei2 0:8ei 2
(1) R [ (S \ T ) = + +
u v w
3
1ei0 0:4ei 0:8ei 2 0:2ei 4 0:3ei2 1ei 6
(R [ S) \ (R [ T ) = ([ + + ] [ + + ]) ?
u v w u v w
3
1ei0 0:4ei 0:8ei 2 0:6ei 2 0:4ei 4 0:5ei 5
([ + + ] [ + + ])
u v w u v w
3 3
1ei 4 0:4ei2 1ei 2 1ei 2 0:4ei 0:8ei 2
= [ + + ]?[ + + ]
u v w u v w
3
1ei 2 0:4ei2 0:8ei 2
(2) (R [ S) \ (R [ T ) = + + :
u v w
From (1) and (2), we have
R [ (S \ T ) = (R [ S) \ (R [ T ):
Now the distributive property of intersection over union is
3
1ei0 0:4ei 0:8ei 2 0:2ei 4 0:3ei2 1ei 6
R \ (S [ T ) = [ + + ] ? ([ + + ]
u v w u v w
3
0:6ei 2 0:4ei 4 0:5ei 5
[ + + ])
u v w
3
1ei0 0:4ei 0:8ei 2 0:6ei 2 0:4ei2 1ei 5
= [ + + ]?[ + + ]
u v w u v w
3
0:6ei 2 0:4ei2 0:8ei 2
(3) R \ (S [ T ) = + +
u v w
3
1ei0 0:4ei 0:8ei 2 0:2ei 4 0:3ei2 1ei 6
(R \ S) [ (R \ T ) = ([ + + ]?[ + + ])
u v w u v w
3
1ei0 0:4ei 0:8ei 2 0:6ei 2 0:4ei 4 0:5ei 5
([ + + ]?[ + + ])
u v w u v w
3 3
0:2ei 4 0:3ei2 0:8ei 2 0:6ei 2 0:4ei 0:5ei 2
= [ + + ] [ + + ]
u v w u v w
3
0:6ei 2 0:4ei 0:8ei 2
(4) (R \ S) [ (R \ T ) = + + :
u v w
R \ (S [ T ) = (R \ S) [ (R \ T ):
De…nition 12. For any CFS R, idempotent laws hold by using standard union and
standard intersection function.
The idempotent law of union for a CFS R is R [ R = R and the idempotent law
of intersection is R \ R = R:
If a grade value of R is R (x) = rR (x)ei!R (x) ;the idempotent law of union
becomes
R (x) = R[R (x):
To prove this, we have
R[R (x) =[ R (x) R (x)] = [rR (x)ei!R (x) rR (x)ei!R (x) ] = rR (x)ei!R (x) = R (x):
Also the idempotent law of intersection is
R (x) = R\R (x):

Now to prove this, we have
R\R (x) =[ R (x) ? R (x)] = [rR (x)ei!R (x) ? rR (x)ei!R (x) ] = rR (x)ei!R (x) = R (x):
Here ? and represents the standard intersection and standard union function.
Example 8. Let
1ei 0:5ei 2 0:8ei0
+
R= +
u v w
be a complex fuzzy set. Using standard union and standard intersection function,
the idempotent law of union is
1ei 0:5ei 2 0:8ei0 1ei 0:5ei 2 0:8ei0
R[R = +[ + ] [ + + ]
u v w u v w
1ei 0:5ei 2 0:8ei0
= + + = R:
u v w
The idempotent law of intersection is
1ei 0:5ei 2 0:8ei0 1ei 0:5ei 2 0:8ei0
R\R = +[ + ]?[ + + ]
u v w u v w
1ei 0:5ei 2 0:8ei0
= + + = R:
u v w
The idempotent law of union and intersection hold for a CFS R:
De…nition 13. CFS satis…ed the involution law by using standard complement
function.
The involution law for a CFS R is (Rc )c = R
If a grade value of a CFS R is R (x) = rR (x)ei!R (x) ;the involution law is
rR (x)ei!R (x) = rRcc (x)ei!Rcc (x)
where c represents standard complement function.
Example 9. Let
3
0:1ei0 0:5ei 1ei 2 0:8ei 2
R= + + +
u v w t
be a CFS. The involution law is satis…ed by using standard complement function.
Now 3
c 0:9ei0 0:5ei 0ei 2 0:2ei 2
R = Rc (x) = + + +
u v w t
3
i0 i i i
c 0:1e 0:5e 1e 2 0:8e 2
Rc = Rcc (x) = + + + = R:
u v w t
3. Main Results
Proposition 1. The bounded di¤ erence of two CFSs is always a fuzzy set.
Proof. Let R and S be two CFSs. The bounded di¤erence of these two CFSs are
R S (x) =j R (x)r S (x) j=j [rR (x)rrS (x)]ei!RrS (x) j=j rR (x)rrS (x) jj ei!RrS (x) j :
As j ei!RrS (x) j= 1. Thus
R S (x) =j rR (x) r rS (x) jj ei!RrS (x) j=j rR (x) r rS (x) j :
Proposition 2. For CFSs R and S over a crisp set U , the standard union, stan-
dard intersection, and standard complement function with the same function for
determining the phase term satisfy the symmetrical di¤ erence formula.
Proof. Suppose R and S be two CFSs. To prove the symmetrical di¤erence formula
(Rc \ S) [ (R \ S c ) = (Rc [ S c ) \ (R [ S); eight cases arise here. Using Max function
for determining the phase term.
Case 1.
rR (x) rS (x); ! R (x) ! S (x); rRc (x) rS (x); rS c (x) rR (x); rS c (x) rRc (x)
(Rc \ S) [ (R \ S c ) = [rRc (x)ei!Rc (x) ? rS (x)ei!S (x) ] [rR (x)ei!R (x) ? rS c (x)ei!Sc (x) ]
= rRc (x)ei!S (x) rS c (x)ei!Sc (x)
(1) (Rc \ S) [ (R \ S c ) = rRc (x)ei!Sc (x)
(Rc [ S c ) \ (R [ S) = [rRc (x)ei!Rc (x) rS c (x)ei!Sc (x) ] ? [rR (x)ei!R (x) rS (x)ei!S (x) ]
= rRc (x)ei!Sc (x) ? rS (x)ei!S (x)
(2) (Rc [ S c ) \ (R [ S) = rRc (x)ei!Sc (x) :


(Rc \ S) [ (R \ S c ) = (Rc [ S c ) \ (R [ S):
Case 2.
rR (x) rS (x); ! R (x) ! S (x); rS (x) rRc (x); rR (x) rS c (x); rS c (x) rRc (x)
= rS (x)ei!S (x) rR (x)ei!Sc (x)
(3) (Rc \ S) [ (R \ S c ) = rS (x)ei!S (x)
= rRc (x)ei!Sc (x) ? rS (x)ei!S (x)
(4) (Rc [ S c ) \ (R [ S) = rS (x)ei!S (x) :

(Rc \ S) [ (R \ S c ) = (Rc [ S c ) \ (R [ S):
Case 3.
rR (x) rS (x); ! S (x) ! R (x); rRc (x) rS (x); rS c (x) rR (x); rS c (x) rRc (x)
= rRc (x)ei!Rc (x) rS c (x)ei!R (x)
(5) (Rc \ S) [ (R \ S c ) = rRc (x)ei!Rc (x)
= rRc (x)ei!Rc (x) ? rS (x)ei!S (x)
(6) (Rc [ S c ) \ (R [ S) = rRc (x)ei!Rc (x) :

(Rc \ S) [ (R \ S c ) = (Rc [ S c ) \ (R [ S):
Case 4.
rR (x) rS (x); ! S (x) ! R (x); rS (x) rRc (x); rR (x) rS c (x); rS c (x) rRc (x)
= rS (x)ei!Rc (x) rR (x)ei!R (x)
(7) (Rc \ S) [ (R \ S c ) = rS (x)ei!R (x)
= rRc (x)ei!Rc (x) ? rS (x)ei!R (x)
(8) (Rc [ S c ) \ (R [ S) = rS (x)ei!R (x) :

(Rc \ S) [ (R \ S c ) = (Rc [ S c ) \ (R [ S):
Case 5.
rS (x) rR (x); ! S (x) ! R (x); rRc (x) rS (x); rS c (x) rR (x); rRc (x) rS c (x)
= rRc (x)ei!Rc (x) rS c (x)ei!R (x)
(9) (Rc \ S) [ (R \ S c ) = rS c (x)ei!R (x)
i! Rc (x) i! R (x)
= rS c (x)e ? rR (x)e
(10) (Rc [ S c ) \ (R [ S) = rS c (x)ei!R (x) :

(Rc \ S) [ (R \ S c ) = (Rc [ S c ) \ (R [ S):
Case 6.
rS (x) rR (x); ! S (x) ! R (x); rS (x) rRc (x); rR (x) rS c (x); rRc (x) rS c (x)
= rS (x)ei!Rc (x) rR (x)ei!R (x)
(11) (Rc \ S) [ (R \ S c ) = rR (x)ei!R (x)

c c i! c (x) i! c (x)
(R [ S) \ (R [ S) = [r c (x)e R r c (x)e S ] ? [rR (x)ei!R (x) rS (x)ei!S (x) ]
R S
i! c (x)
= r c (x)e R ? rR (x)ei!R (x)
S
(12) (Rc [ S c ) \ (R [ S) = rR (x)ei!R (x) :

(Rc \ S) [ (R \ S c ) = (Rc [ S c ) \ (R [ S):

Case 7.
rS (x) rR (x); ! R (x) ! S (x); rRc (x) rS (x); rS c (x) rR (x); rRc (x) rS c (x)
= rRc (x)ei!S (x) rS c (x)ei!Sc (x)
(13) (Rc \ S) [ (R \ S c ) = rS c (x)ei!Sc (x)

= rS c (x)ei!Sc (x) ? rR (x)ei!S (x)
(14) (Rc [ S c ) \ (R [ S) = rS c (x)ei!Sc (x) :

(Rc \ S) [ (R \ S c ) = (Rc [ S c ) \ (R [ S):
Case 8.
rS (x) rR (x); ! R (x) ! S (x); rS (x) rRc (x); rR (x) rS c (x); rRc (x) rS c (x)
= rS (x)ei!S (x) rR (x)ei!Sc (x)
(15) (Rc \ S) [ (R \ S c ) = rR (x)ei!S (x)
= rS c (x)ei!Sc (x) ? rR (x)ei!S (x)
(16) (Rc [ S c ) \ (R [ S) = rR (x)ei!S (x) :

(Rc \ S) [ (R \ S c ) = (Rc [ S c ) \ (R [ S):
Thus in all cases, the symmetrical di¤erence formula is hold.
Proposition 3. For CFSs R and S over a crisp set U , the standard union, stan-
dard intersection, and standard complement function with the same function for
determining the phase term satisfy the equivalence formula.
Proof. Suppose R and S be two CFSs. To prove the equivalence formula (Rc [
S) \ (R [ S c ) = (Rc \ S c ) [ (R \ S); eight cases arise here. Using Max function for
determining the phase term.
Case 1.
rR (x) rS (x); ! R (x) ! S (x); rRc (x) rS (x); rS c (x) rR (x); rS c (x) rRc (x)
(Rc [ S) \ (R [ S c ) = [rRc (x)ei!Rc (x) rS (x)ei!S (x) ] ? [rR (x)ei!R (x) rS c (x)ei!Sc (x) ]
= rS (x)ei!S (x) ? rR (x)ei!Sc (x)
(1) (Rc [ S) \ (R [ S c ) = rR (x)ei!S (x)
(Rc \ S c ) [ (R \ S) = [rRc (x)ei!Rc (x) ? rS c (x)ei!Sc (x) ] [rR (x)ei!R (x) ? rS (x)ei!S (x) ]
= rS c (x)ei!Sc (x) rR (x)ei!S (x)
(2) (Rc \ S c ) [ (R \ S) = rR (x)ei!S (x) :

(Rc [ S) \ (R [ S c ) = (Rc \ S c ) [ (R \ S):
Case 2.
rR (x) rS (x); ! R (x) ! S (x); rS (x) rRc (x); rR (x) rS c (x); rS c (x) rRc (x)
= rRc (x)ei!S (x) ? rS c (x)ei!Sc (x)
(3) (Rc [ S) \ (R [ S c ) = rS c (x)ei!Sc (x)
= rS c (x)ei!Sc (x) rR (x)ei!S (x)
(4) (Rc \ S c ) [ (R \ S) = rS c (x)ei!Sc (x) :

(Rc [ S) \ (R [ S c ) = (Rc \ S c ) [ (R \ S):
Case 3.
rR (x) rS (x); ! S (x) ! R (x); rRc (x) rS (x); rS c (x) rR (x); rS c (x) rRc (x)
= rS (x)ei!Rc (x) ? rR (x)ei!R (x)
(5) (Rc [ S) \ (R [ S c ) = rR (x)ei!R (x)
= rS c (x)ei!Rc (x) rR (x)ei!R (x)
(6) (Rc \ S c ) [ (R \ S) = rR (x)ei!R (x) :

(Rc [ S) \ (R [ S c ) = (Rc \ S c ) [ (R \ S):
Case 4.
rR (x) rS (x); ! S (x) ! R (x); rS (x) rRc (x); rR (x) rS c (x); rS c (x) rRc (x)
= rRc (x)ei!Rc (x) ? rS c (x)ei!R (x)
(7) (Rc [ S) \ (R [ S c ) = rS c (x)ei!R (x)
= rS c (x)ei!Rc (x) rR (x)ei!R (x)
(8) (Rc \ S c ) [ (R \ S) = rS c (x)ei!R (x) :

(Rc [ S) \ (R [ S c ) = (Rc \ S c ) [ (R \ S):
Case 5.
rS (x) rR (x); ! S (x) ! R (x); rRc (x) rS (x); rS c (x) rR (x); rRc (x) rS c (x)
i! S c (x)
= rS (x)e ? rR (x)ei!R (x)
(9) (Rc [ S) \ (R [ S c ) = rS (x)ei!Rc (x)
= rRc (x)ei!Rc (x) rS (x)ei!R (x)
(10) (Rc \ S c ) [ (R \ S) = rS (x)ei!Rc (x) :

(Rc [ S) \ (R [ S c ) = (Rc \ S c ) [ (R \ S):
Case 6.
rS (x) rR (x); ! S (x) ! R (x); rS (x) rRc (x); rR (x) rS c (x); rRc (x) rS c (x)
= rRc (x)ei!Rc (x) ? rS c (x)ei!R (x)
(11) (Rc [ S) \ (R [ S c ) = rRc (x)ei!R (x)
= rRc (x)ei!Rc (x) rS (x)ei!S (x)
(12) (Rc \ S c ) [ (R \ S) = rRc (x)ei!R (x) :

(Rc [ S) \ (R [ S c ) = (Rc \ S c ) [ (R \ S):
Case 7.
rS (x) rR (x); ! R (x) ! S (x); rRc (x) rS (x); rS c (x) rR (x); rRc (x) rS c (x)
= rS (x)ei!S (x) ? rR (x)ei!Sc (x)
(13) (Rc [ S) \ (R [ S c ) = rS (x)ei!S (x)
= rRc (x)ei!Sc (x) rS (x)ei!S (x)
(14) (Rc \ S c ) [ (R \ S) = rS (x)ei!S (x) :

(Rc [ S) \ (R [ S c ) = (Rc \ S c ) [ (R \ S):
Case 8.
rS (x) rR (x); ! R (x) ! S (x); rS (x) rRc (x); rR (x) rS c (x); rRc (x) rS c (x)
= rRc (x)ei!S (x) ? rS c (x)ei!Sc (x)
(15) (Rc [ S) \ (R [ S c ) = rRc (x)ei!S (x)
= rRc (x)ei!Sc (x) rS (x)ei!S (x)
(16) (Rc \ S c ) [ (R \ S) = rRc (x)ei!S (x) :

(Rc [ S) \ (R [ S c ) = (Rc \ S c ) [ (R \ S):
Thus in all cases, the equivalence formula is hold.
Proposition 4. The standard union and standard intersection of any …nite number
of CFSs is always a CFS.
Proof. (i): Let R1 ; R2 ; :::; RM be any M CFSs and rR1 (x)ei!R1 (x) ; rR2 (x)ei!R2 (x) ; :::; rRM (x)ei!RM (x)
denote the membership functions of these complex fuzzy sets respectively.
0
Suppose rR (x) = max[rR1 (x); rR2 (x); :::; rRM (x)] and ! 0R (x) = max[! R1 (x); ! R2 (x); :::; ! RM (x)]:
Now
R1 [ R2 [ ::: [ RM = rR1 (x)ei!R1 (x) rR2 (x)ei!R2 (x) ::: rRM (x)ei!RM (x)
= [rR1 (x) rR2 (x) ::: rRM (x)]ei[!R1 (x) ! R2 (x) ::: ! RM (x)]
0 i! 0R (x)
= rR (x)e = R0 :
Which is also a CFS.
(ii): Now we show that the …nite intersection of any CFSs is always a complex
fuzzy set. Let R1 ; R2 ; :::; RM be any M CFSs and rR1 (x)ei!R1 (x) ; rR2 (x)ei!R2 (x) ; :::; rRM (x)ei!RM (x)
denote the membership functions of these complex fuzzy sets respectively.
0
Suppose rR (x) = min[rR1 (x); rR2 (x); :::; rRM (x)] and ! 0R (x) = max[! R1 (x); ! R2 (x); :::; ! RM (x)]:
Now
R1 \ R2 \ ::: \ RM = rR1 (x)ei!R1 (x) ? rR2 (x)ei!R2 (x) ? ::: ? rRM (x)ei!RM (x)
= [rR1 (x) ? rR2 (x) ? ::: ? rRM (x)]ei[!R1 (x)?!R2 (x)?:::?!RM (x)]
0
0
= rR (x)ei!R (x) = R0 :
Which is also a CFS.
Proposition 5. For any two CFSs R and S, the standard union and standard
intersection function with the same function for determining the phase term satisfy
M
X M
X
j R\S (xi ) j j R[S (xi ) j:
i=1;xi 2U i=1;xi 2U
Proof. The standard union and intersection functions are de…ned by the respective
expressions
R[S (x) = max[ R (x); S (x)]
and
R\S (x) = min[ R (x); S (x)]:
As
j R\S (u) j j R[S (u) j
j R\S (v) j j R[S (v) j :
Continuing this process upto M we have
j R\S (xM ) j j R[S (xM ) j:
Adding all these inequalities, we get
M
X M
X
j R\S (xi ) j j R[S (xi ) j:
i=1;x2U i=1;x2U
Proposition 6. For any CFSs R; S and T , the standard intersection and standard
union functions with the same function for determining the phase term satisfy the
distributive law.
Proof. To prove the distributive laws for any CFSs R; S and T; six cases arise
here.
First we prove the distributive law of union over intersection.
Case 1.
rR (x) rS (x) rT (x); ! R (x) ! S (x) ! T (x)
R[(S\T ) = [rR (x)ei!R (x) (rS (x)ei!S (x) ?rT (x)ei!T (x) )] = rR (x)ei!R (x) rS (x)ei!T (x)
(1) R [ (S \ T ) = rS (x)ei!T (x)
(R [ S) \ (R [ T ) = [rR (x)ei!R (x) rS (x)ei!S (x) ] ? [rR (x)ei!R (x) rT (x)ei!T (x) ]
= rS (x)ei!S (x) ? rT (x)ei!T (x)
(2) (R [ S) \ (R [ T ) = rS (x)ei!T (x) :

R [ (S \ T ) = (R [ S) \ (R [ T ):
Case 2.
rS (x) rT (x) rR (x); ! S (x) ! T (x) ! R (x)
i! R (x) i! S (x) i! T (x)
R[(S\T ) = [rR (x)e (rS (x)e ?rT (x)e )] = rR (x)ei!R (x) rS (x)ei!T (x)
(3) R [ (S \ T ) = rR (x)ei!R (x)
= rR (x)ei!R (x) ? rR (x)ei!R (x)
(4) (R [ S) \ (R [ T ) = rR (x)ei!R (x) :

R [ (S \ T ) = (R [ S) \ (R [ T ):
Case 3.
rR (x) rT (x) rS (x) ; ! R (x) ! T (x) ! S (x)
i! R (x) i! S (x) i! T (x) i! R (x)
R[(S\T ) = [rR (x)e (rS (x)e ?rT (x)e )] = rR (x)e rT (x)ei!S (x)
(5) R [ (S \ T ) = rT (x)ei!S (x)
= rS (x)ei!S (x) ? rT (x)ei!T (x)
(6) (R [ S) \ (R [ T ) = rT (x)ei!S (x) :

R [ (S \ T ) = (R [ S) \ (R [ T ):
Case 4.
rT (x) rS (x) rR (x) ; ! T (x) ! S (x) ! R (x)
R[(S\T ) = [rR (x)ei!R (x) (rS (x)ei!S (x) ?rT (x)ei!T (x) )] = rR (x)ei!R (x) rT (x)ei!T (x)
(7) R [ (S \ T ) = rR (x)ei!R (x)
= rR (x)ei!R (x) ? rR (x)ei!R (x)
(8) (R [ S) \ (R [ r) = rR (x)ei!R (x) :

R [ (S \ T ) = (R [ S) \ (R [ T ):
Case 5.
rS (x) rR (x) rT (x) ; ! S (x) ! R (x) ! T (x)
i! R (x) i! S (x) i! T (x)
R[(S\r) = [rR (x)e (rS (x)e ?rT (x)e )] = rR (x)ei!R (x) rS (x)ei!T (x)
(9) R [ (S \ T ) = rR (x)ei!T (x)
= rR (x)ei!R (x) ? rT (x)ei!T (x)
(10) (R [ S) \ (R [ T ) = rR (x)ei!T (x) :

R [ (S \ T ) = (R [ S) \ (R [ T ):
Case 6.
rT (x) rR (x) rS (x) ; ! T (x) ! R (x) ! S (x)
R[(S\T ) = [rR (x)ei!R (x) (rS (x)ei!S (x) ?rT (x)ei!T (x) )] = rR (x)ei!R (x) rT (x)ei!S (x)
(11) R [ (S \ T ) = rR (x)ei!S (x)
= rS (x)ei!S (x) ? rR (x)ei!R (x)
(12) (R [ S) \ (R [ T ) = rR (x)ei!S (x) :


R [ (S \ T ) = (R [ S) \ (R [ T ):
Hence in all cases, this law is hold.
To prove the distributive law of intersection over union, there are also six cases.
Case 1.
rR (x) rS (x) rT (x) ; ! R (x) ! S (x) ! T (x)
R\(S[T ) = [rR (x)ei!R (x) ?(rS (x)ei!S (x) rT (x)ei!T (x) )] = rR (x)ei!R (x) ?rT (x)ei!T (x)
(1) R \ (S [ T ) = rR (x)ei!T (x)
(R \ S) [ (R \ T ) = [rR (x)ei!R (x) ? rS (x)ei!S (x) ] [rR (x)ei!R (x) ? rT (x)ei!T (x) ]
= rR (x)ei!S (x) rR (x)ei!T (x)
(2) (R \ S) [ (R \ T ) = rR (x)ei!T (x) :

R \ (S [ T ) = (R \ S) [ (R \ T ):
Case 2.
rS (x) rT (x) rR (x); ! S (x) ! T (x) ! R (x)
i! R (x) i! S (x) i! T (x)
R\(S[T ) = [rR (x)e ?(rS (x)e rT (x)e )] = rR (x)ei!R (x) ?rT (x)ei!T (x)
(3) R \ (S [ T ) = rT (x)ei!R (x)
= rS (x)ei!R (x) rT (x)ei!R (x)
(4) (R \ S) [ (R \ T ) = rT (x)ei!R (x) :

R \ (S [ T ) = (R \ S) [ (R \ T ):
Case 3.
rR (x) rT (x) rS (x) ; ! R (x) ! T (x) ! S (x)
i! R (x) i! S (x) i! T (x) i! R (x)
R\(S[T ) = [rR (x)e ?(rS (x)e rT (x)e )] = rR (x)e ?rS (x)ei!S (x)
(5) R \ (S [ T ) = rR (x)ei!S (x)
= rR (x)ei!S (x) rR (x)ei!T (x)
(6) (R \ S) [ (R \ T ) = rR (x)ei!S (x) :

R \ (S [ T ) = (R \ S) [ (R \ T ):
Case 4.
rT (x) rS (x) rR (x) ; ! T (x) ! S (x) ! R (x)
i! R (x) i! S (x) i! T (x)
R\(S[T ) = [rR (x)e ?(rS (x)e rT (x)e )] = rR (x)ei!R (x) ?rS (x)ei!S (x)
(7) R \ (S [ r) = rS (x)ei!R (x)
= rS (x)ei!R (x) rT (x)ei!R (x)
(8) (R \ S) [ (R \ T ) = rS (x)ei!R (x) :

R \ (S [ T ) = (R \ S) [ (R \ T ):
Case 5.
rS (x) rR (x) rT (x) ; ! S (x) ! R (x) ! T (x)
R\(S[T ) = [rR (x)ei!R (x) ?(rS (x)ei!S (x) rT (x)ei!r (x) )] = rR (x)ei!R (x) ?rT (x)ei!T (x)
(9) R \ (S [ T ) = rR (x)ei!T (x)
= rS (x)ei!R (x) rR (x)ei!T (x)
(10) (R \ S) [ (R \ T ) = rR (x)ei!T (x) :

R \ (S [ T ) = (R \ S) [ (R \ T ):
Case 6.
rT (x) rR (x) rS (x) ; ! T (x) ! R (x) ! S (x)
R\(S[T ) = [rR (x)ei!R (x) ?(rS (x)ei!S (x) rT (x)ei!T (x) )] = rR (x)ei!R (x) ?rS (x)ei!S (x)
(11) R \ (S [ T ) = rR (x)ei!S (x)
= rR (x)ei!S (x) rT (x)ei!R (x)
(12) (R \ S) [ (R \ T ) = rR (x)ei!S (x) :

R \ (S [ T ) = (R \ S) [ (R \ T ):
Hence in all cases, the distributive law of intersection over union is hold.
Proposition 7. For any complex fuzzy set R, the standard union, standard inter-
section and standard complement function with the same function for determining
the phase term satisfy the following
(i): R [ Rc = R or R [ Rc = Rc
(ii): R \ Rc = R or R \ Rc = Rc
Proof. To prove (1) and (2), two cases arise here.
(i):
Case 1.
rRc (x) rR (x)
c i! R (x)
R [ R = rR (x)e rRc (x)ei!Rc (x) = rR (x)ei!R (x) = R:
Case 2.
rR (x) rRc (x)
c i! R (x)
R [ R = rR (x)e rRc (x)ei!Rc (x) = rRc (x)ei!Rc (x) = Rc :
(ii):
Case 1.
rRc (x) rR (x)
c i! R (x) i! Rc (x)
R \ R = rR (x)e ? rRc (x)e = rRc (x)ei!Rc (x) = Rc :
Case 2.
rR (x) rRc (x)
c i! R (x)
R \ R = rR (x)e ? rRc (x)ei!Rc (x) = rR (x)ei!R (x) = R:
Proposition 8. For any complex fuzzy sets R and S over a crisp set U; the standard
union and standard intersection function with the max function for determining the
phase term does not satisfy the absorption law.
Proof. The absorption laws for crisp set is R\(R[S) = R and R[(R\S) = R:
Here we show that for any CFS R and S, the absorption laws do not hold. If
rR (x) rS (x); ! R (x) ! S (x)
R \ (R [ S) = [rR (x)ei!R (x) ? (rR (x)ei!R (x) rS (x)ei!S (x) )] = rR (x)ei!R (x) ? rS (x)ei!S (x)
= rR (x)ei!S (x) 6= R
R [ (R \ S) = [rR (x)ei!R (x) (rR (x)ei!R (x) ? rS (x)ei!S (x) )] = rR (x)ei!R (x) rR (x)ei!S (x)
= rR (x)ei!S (x) 6= R:
Also if
rS (x) rR (x) ; ! R (x) ! S (x)
R \ (R [ S) = [rR (x)ei!R (x) ? (rR (x)ei!R (x) rS (x)ei!S (x) )] = rR (x)ei!R (x) ? rR (x)ei!S (x)
= rR (x)ei!S (x) 6= R
R [ (R \ S) = [rR (x)ei!R (x) frR (x)ei!R (x) ? rS (x)ei!S (x) g] = rR (x)ei!R (x) rS (x)ei!S (x)
= rR (x)ei!S (x) 6= R:
Hence the absorption law does not hold for any complex fuzzy sets.
Proposition 9. For any CFSs R; S and T; the standard complement,standard in-
tersection and standard union function with di¤ erent function for determining the
phase term does not satisfy the distributive laws.
Proof. We use here“taqe wiM M er all” and “min” function for determining the
phase term. The distributive law of union over intersection is R [ (S \ T ) =
(R [ S) \ (R [ T ):For r:H:S; we use “take winner all”function and for L:H:S; we
use “min” function for determining the phase term.
If
rR (x) rS (x) rT (x); ! R (x) ! S (x) ! T (x)
R[(S\T ) = [rR (x)ei!R (x) (rS (x)ei!S (x) ?rT (x)ei!T (x) )] = rR (x)ei!R (x) rS (x)ei!T (x)
(1) R [ (S \ T ) = rS (x)ei!T (x)
= rS (x)ei!R (x) ? rT (x)ei!R (x)
(2) (R [ S) \ (R [ T ) = rS (x)ei!R (x) :

R [ (S \ T ) 6= (R [ S) \ (R [ T ):
Now distributive law of intersection over union.
R\(S[T ) = [rR (x)ei!R (x) ?(rS (x)ei!S (x) rT (x)ei!T (x) )] = rR (x)ei!R (x) ?rT (x)ei!T (x)
(3) R \ (S [ T ) = rR (x)ei!T (x)
= rR (x)ei!R (x) rR (x)ei!R (x)
(4) (R \ S) [ (R \ T ) = rR (x)ei!R (x) :

From (3) and (4); we have
R \ (S [ T ) 6= (R \ S) [ (R \ T ):
4. Applications
In this section, we will discuss the applications of CFS in signals and systems.
De…nition 14. The Mth inverse discrete Fourier transform (IDFT) coe¢ cient of
a length M sequence fx(M )g is de…ned as
M 1
1 X 0 2
x(q) = x (M )ei M M q , q 2 f0; 1; 2; :::; M 1g
M q=0
where x(M ) has di¤ erent values [18].
We take a particular case that is U [M ] = x0 (M ) is restricted to a closed interval
[0; 1] because in CFS, the amplitude term has all the values in the closed interval
[0; 1]:
De…nition 15. [18] The DFT for fx0 (M ) : 1 M M g given by as a matrix in
product form.
2 3 2 32 3
x0 (0) 1 1 1 : : : 1 x(0)
6 x0 (1) 7 61 i( 2M ) i( 2M 2) 2
1)) 7 6 7
6 7 6 e e : : : ei( M (M
7 6 x(1) 7
6 x0 (2) 7 61 2
ei( M 2)
2
ei( M 4) : ei(
2
2(M 1)) 7 6 7
6 7 6 : : M
7 6 x(2) 7
6 : 7 = 6: : : : : : : 76 : 7
6 7 6 76 7
6 : 7 6: : : : : : : 76 : 7
6 7 6 76 7
4 : 5 4: : : : : : : 54 : 5
x0 (M 1) 2 2
1 ei( M (M 1)) ei( M 2(M 1)) : : : ei(
2
M (M 2
1) ) x(M 1)
but the IDFT is given by
2 3 2 32 3
x(0) 1 1 1 : : : 1 x0 (0)
6 x(1) 7 61 i 2M i 2M 2
1) 7 6 7
6 7 6 e e 2 : : : ei M (M 0
7 6 x0 (1) 7
6 x(2) 7 61 2
ei M 2
2
ei M 4
2
: ei M 2(M 1) 7 6 7
6 7 1 6 : : 7 6 x (2) 7
6 : 7 6 76 : 7
6 7 = M 6: : : : : : : 76 7
6 : 7 6: : : : : : : 76 : 7
6 7 6 76 7
4 : 5 4: : : : : : : 54 : 5
2 2 2
1)2 0
x(M 1) 1 ei M (M 1)
ei M 2(M 1)
: : : ei M (M x (M 1)
In the following we develop an algorithm to use CFS in signals and systems for
identi…cation of a particular signal received by a particular receiver.
Let m be di¤erent electromagnetic signals, u1 (M ); u2 (M ); u3 (M ); :::; um (M ) have
been received by a particular receiver. Each of these signal is noted at M di¤erent
times. Let xm (M ) be the m th (1 m M ) signal. The discrete Fourier
transform of this m th signal is
M 1
1 X 2
(1) um (M ) = U [M ]ei M M q ; M; q = 0; 1; 2; :::; M 1
M q=0
We restrict the range of U [M ] as 0 U [M ] 1 (0 q M 1). Here,

U [M ] = 0s (q) is known as amplitude term and 2M M q = ! s (q) is known as phase
term and the …rst one having range as real numbers and U [M ] 2 [0; 1]:
M 1
1 X 2
(1 (a)) um (M ) = U [M ]ei M M q ; M; q = 0; 1; 2; :::; M 1
M q=0
Thus a general signal representing by equations (1) is model for signal represen-
tation using a CFS.
We use the CFS in signals and systems using a new kind of matrix to identi…es
a particular signal out of large signals detected by a digital receiver. For this, we
have a reference signal r:This reference signal r is noted M times. The DFT of this
reference signal r is
M 1
1 X 0 2
(2) r(M ) = [q]ei M M q ; M; q = 0; 1; 2; :::; M 1
M q=0
where 0 [q] 2 [0; 1] ; (0 q M 1)

To compare the similarity between two signals, we apply the following method.
Algorithm
Step 1.
1
MP1 2
Expand um (M ) = M U [M ]ei M M q for q = 0; 1; 2; :::; M 1; we get
q=0
1 2 2 2 2
um (M ) = [U [0]ei M M (0) +U [1]ei M M (1) +U [2]ei M M (2) +:::+U [M 1]ei M M (M 1)
]
M
1 2 2 2
(3) um (M ) = [U [0]:1+U [1]ei M M (1) +U [2]ei M M (2) +:::+U [M 1]ei M M (M 1) ]:
M
From equation (3) we get M samRles by putting M = 0; 1; 2; 3; :::; M 1:
For M = 0; we have
1 2 2 2
um (0) = [U [0]:1 + U [1]ei M (0)(1) + U [2]ei M (0)(2) + ::: + U [M 1]ei M (0)(M 1)
]
M
1
(3.1) um (0) = [U [0]:1 + U [1]:1 + U [2]:1 + ::: + U [M 1]:1]:
M
For M = 1 we have
1 2 2 2
]
M
1 2 2 2
(3.2) um (1) = [U [0]:1 + U [1]ei M (1) + U [2]ei M (2) + ::: + U [M 1]ei M (M 1)
]:
M
For M = 2 we have
1 2 2 2
]
M
1 2 2 2
(3.3) um (2) = [U [0]:1 + U [1]ei M (2) + U [2]ei M (4) + ::: + U [M 1]ei M 2(M 1)
]:
M
Continuing this process, for M = M 1; we have
1 2 2 2
um (M 1) = [U [0]:1+U [1]ei M (M 1)(1)
+U [2]ei M (M 1)(2)
+:::+U [M 1]ei M (M 1)(M 1)
]
M
(3.4)
1 2 2 2
1)2
um (M 1) = [U [0]:1+U [1]ei M (M 1)
+U [2]ei M 2(M 1)
+:::+U [M 1]ei M (M ]:
M
A similar argument repeat for the reference signal (M ); we get the M samRles
of the reference signal by putting M = 0; 1; 2; 3; :::; M 1:
Step 2.
Now we develop the matrix form for these M samples of the signal um (M )
and the reference signal 0 (M ) using de…nition 15; that is we have
2 3 2 32 3
um (0) 1 1 1 : : : 1 U [0]
6 um (1) 7 61 i 2M i 2M 2
1) 7 6 7
6 7 6 e e 2 : : : ei M (M 7 6 U [1] 7
6 um (2) 7 61 2
ei M 2
2
ei M 4
2
: ei M 2(M 1) 7 6 7
6 7 1 6 : : 7 6 U [2] 7
6 : 7 6 76 : 7
6 7 = M 6: : : : : : : 76 7
6 : 7 6: : : : : : : 76 : 7
6 7 6 76 7
4 : 5 4: : : : : : : 54 : 5
um (M 1) 2 2 2
1)2 U [M 1]
1 ei M (M 1)
ei M 2(M 1)
: : : ei M (M
and
(A)
2 3 2 32 3
(0) 1 1 1 : : : 1 0
[0]
6 i 2M 2 2
6 (1) 7
7
61
6 e ei M 2 : : : ei M (M 1) 76
76
0
[1] 7
7
6 (2) 7 61 2
ei M 2
2
ei M 4
2
: : : ei M 2(M 1) 7 6 0
[2] 7
6 7 1 6 76 7
6 : 7= 6 76 : 7
6 7 M 6: : : : : : : 76 7
6 : 7 6: : : : : : : 76 : 7
6 7 6 76 7
4 : 5 4: : : : : : : 54 : 5
i 2M (M 2
i 2M (M 1)2 0
(M 1) 1 e 1)
ei M 2(M 1)
: : : e [M 1]
In equation (A), the …rst matrix on the right hand side is formed from the values
of phase term called Rhase mat ix, while the second matrix is formed from the
values of amplitude term is called amplitude matrix and M denote the number of
samples of signal.
Step 3.
Multiply these two matrices and dividing by the number of samples M of signal.
We get all the values in the disc of radius one in a complex plane. As the order
does not hold for complex numbers, so we take absolute of these M samRles of
the signal xm (M ) and the reference signal (M ); that is
2 3 2 3
j um (0) j j (0) j
6 j um (1) j 7 6 j (1) j 7
6 7 6 7
6 j um (2) j 7 6 j (2) j 7
6 7 6 7
6 : 7 and 6 : 7:
6 7 6 7
6 : 7 6 : 7
6 7 6 7
4 : 5 4 : 5
j um (M 1) j j (M 1) j
These two matrices are called absolute value matrix.
Step 4.
Now we take the maximum value from the absolute value matrix of the signal
um (M ) and reference signal (M ): If these two values are nearly same, then the
signal um (M ) identi…es a reference signal.
Example 10. Assume that four di¤ erent electromagnetic signals, u1 (M ), u2 (M );
u3 (M ), and u4 (M ) have been received by a receiver. Each of these signals is sampled
four times. Let (M ) be the reference signal. The discrete Fourier transform of
the signal um (M ); m = 0; 1; 2; 3 and reference signal (M ) for M = 4 is
3
1X 2
(1) um (M ) = Um [M ]ei 4 Mq
; M; q = 0; 1; 2; 3
4 q=0
where
Um [M ] 2 [0; 1]:
Also
3
1X 0 2
(2) (M ) = [M ]ei 4 Mq
; M; q = 0; 1; 2; 3
4 q=0
where
0
[M ] 2 [0; 1]:
For M = 0; 1; 2; 3, equation (1) becomes

1 2 2 2 2
um (M ) = [Um [0]:ei 4 M (0)
+ Um [1]:ei 4 M (1)
+ Um [2]:ei 4 M (2)
+ Um [3]:ei 4 M (3)
]
4
1 2 2 2
(3) um (M ) = [Um [0]:1 + Um [1]:ei 4 M
+ Um [2]:ei 4 2M
+ Um [3]:ei 4 3M
]:
4
Now put M = 0 in (3); we have
1 2 2 2
um (0) = [Um [0]:1 + Um [1]:ei 4 (0)
+ Um [2]:ei 4 2(0)
+ Um [3]:ei 4 3(0)
]
4
1
(3.1) um (0) =[Um [0]:1 + Um [1]:1 + Um [2]:1 + Um [3]:1]:
4
Put M = 1 in (3); we have
1 2 2 2
um (1) = [Um [0]:1 + Um [1]:ei 4 (1)
+ Um [2]:ei 4 2(1)
+ Um [3]:ei 4 3(1)
]
4
1 2 2 2
(3.2) um (1) = [Um [0]:1 + Um [1]:ei 4 + Um [2]:ei 4 (2)
+ Um [3]:ei 4 (3)
]:
4
Put M = 2 in (3), we have
1 2 2 2
um (2) = [Um [0]:1 + Um [1]:ei 4 (2)
+ Um [2]:ei 4 2(2)
+ Um [3]:ei 4 3(2)
]
4
1 2 2 2
(3.3) um (2) = [Um [0]:1 + Um [1]:ei 4 (2)
+ Um [2]:ei 4 (4)
+ Um [3]:ei 4 (6)
]:
4
Put M = 3 in (3) we get
1 2 2 2
um (3) = [Um [0]:1 + Um [1]:ei 4 (3)
+ Um [2]:ei 4 2(3)
+ Um [3]:ei 4 3(3)
]
4
1 2 2 2
(3.4) um (3) = [Um [0]:1 + Um [1]:ei 4 (3) + Um [2]:ei 4 (6) + Um [3]:ei 4 (9)
]:
4
We can write (2:1); (2:2); (2:3) and (2:4) in matrices form as
2 3 2 32 3
um (0) 1 1 1 1 U1 [0]
6um (1)7 1 61 ei 24 (1) ei 24 (2)
ei 24 (3) 7 6 7
6 7 6 7 6U1 [1]7
4um (2)5 = 4 41 ei 24 (2) 2
ei 4 (4) 2
ei 4 (6) 5 4U [2]5 :
1
2 2 2
um (3) 1 ei 4 (3) ei 4 (6)
ei 4 (9) U1 [3]
A similar argument repeat for the reference signal (M ); we get
2 3 2 32 3
(0) 1 1 1 1 [0]
6 (1)7 1 61 ei 24 (1) ei 24 (2)
ei 24 (3) 7 6 7
6 7 6 7 6 [1]7
4 (2)5 = 4 41 ei 24 (2) 2
ei 4 (4) 2
ei 4 (6) 5 4 [2]5 :
2 2 2
(3) 1 ei 4 (3) ei 4 (6)
ei 4 (9) [3]
First of all, we …nd the values of the sample of reference signal (M ): For this,
we have
8
>
> 0 ;q = 0
<
0 0 ;q = 1
[q] =
>
> 0:2 ;q = 2
:
1 ;q = 3
2 3 2 32 3 2 3
(0) 1 1 1 1 0 0:3
6 (1)7 1 61 i 1 i7 6 7 6 7
6 7 6 7 6 0 7 = 6 0:2 i7 :
4 (2)5 = 4 41 1 1 1 5 4 0:25 4 0:8 5
(3) 1 i 1 i 1 0:2 + i
Now the absolute value matrix of the reference signal is
2 3 2 3
j (0) j 0:3
6j (1) j7 6 7
6 7 = 60:37 :
4j (2) j5 40:25
j (3) j 0:3
The maximum value is 0:3:
Now for the signal u1 (M ) ; M = 0; 1; 2; 3
8
>
> :5 ;q = 0
<
:7 ;q = 1
U1 [q] =
>
> :8 ;q = 2
:
1 ;q = 3
2 3 2 32 3
u1 (0) 1 1 1 1 :5
6u1 (1)7 1 61 i 1 i7 6:77
6 7 6 76 7
4u1 (2)5 = 4 41 1 1 15 4:85
u1 (3) 1 i 1 i 1
2 3 2 3 2 3
u1 (0) 3 0:75
6u1 (1)7 1 6 0:3 0:3i7 6 0:075 0:075i7
6 7 6 7=6 7:
4u1 (2)5 = 4 4 0:4 5 4 0:1 5
u1 (3) 0:3 + 0:3i 0:075 + 0:075i
Now the absolute value matrix of the signal u1 (M ) is
2 3 2 3
j u1 (0) j 0:8
6j u1 (1) j7 60:17
6 7 6 7
4j u1 (2) j5 = 40:15 :
j u1 (3) j 0:1
Here the maximum value is 0:8:
For u2 (M ) we have
8
>
> 0:4 ;q = 0
<
0:6 ;q = 1
U2 [q] =
>
> 0:8 ;q = 2
:
1 ;q = 3
Now
2 3 2 32 3
u2 (0) 1 1 1
1 U2 [0]
6u2 (1)7 16 i7 6 7
6 7 61 i 1 7 6U2 [1]7
4u2 (2)5 = 4 41 1 11 U2 [2]5
5 4
u2 (3) 1 i i1 U2 [3]
2 3 2 32 3
u2 (0) 1 1 1 1 0:4
6u2 (1)7 16 i7 60:67
6 7 61 i 1 76 7
4u2 (2)5 = 4 41 1 1 15 40:85
u2 (3) 1 i 1 i 1
2 3 2 3 2 3
u2 (0) 2:8 0:7
6u2 (1)7 16 7 6 7
6 7 6 0:4 0:4i7 = 6 0:1 0:1i7 :
4u2 (2)5 = 4 4 0:4 5 4 0:1 5
u2 (3) 0:4 + 0:4i 0:1 + 0:1i
2 3 2 3
j u2 (0) j 0:7
6j u2 (1) j7 60:17
6 7 = 6 7:
4j u2 (2) j5 40:15
j u2 (3) j 0:1
Here the maximum value is 0:7.
Now for signal u3 (M ) we have
8
>
> 0:6 ;q = 0
<
1 ;q = 1
U3 [q] =
>
> 0:9 ;q = 2
:
0:8 ;q = 3
2 3 2 32 3
u3 (0) 1 1 1 1 U3 [0]
2 2 2
6u3 (1)7 16 i (1) i (2)
e 4 7
i (3) 6 7
61 e 2 e 4 7 6U3 [1]7
4
6 7
4u3 (2)5 = 4
4 1 e i 4 (2)
ei 24 (4)
ei 24 (6) 5 4U [2]5
3
2 2 2
u3 (3) 1 ei 4 (3) ei 4 (6) ei 4 (9) U3 [3]
2 3 2 32 3
u3 (0) 1 1 1 1 0:6
6u3 (1)7 16 1 i 1 i 76 1 7
6 7 6 76 7
4u3 (2)5 = 4 41 1 1 15 40:95
u3 (3) 1 i 1 i 0:8
2 3 2 3 2 3
u3 (0) 3:3 0:825
6u3 (1)7 16 7 6 7
6 7 6 0:3 + 0:2i7 = 6 0:075 + 0:05i7 :
4u3 (2)5 = 4 4 0:3 5 4 0:075 5
u3 (3) 0:3 0:2i 0:075 0:05i
2 3 2 3
j u3 (0) j 0:8
6j u3 (1) j7 60:17
6 7 6 7
4j u3 (2) j5 = 40:15 :
j u3 (3) j 0:1
Now for u4 (M ) we have
8
>
> 0:8 ;q = 0
<
0:5 ;q = 1
U4 [q] =
> 0
> ;q = 2
:
0 ;q = 3
2 3 2 32 3
u4 (0) 1 1 1 1 U4 [0]
6u4 (1)7 16 i7 6 7
6 7 61 i 1 7 6U4 [1]7
4u4 (2)5 = 4 41 1 1 1 U4 [2]5
5 4
u4 (3) 1 i 1 i U4 [3]
2 3 2 32 3
u4 (0) 1 1 1 1 0:8
6u4 (1)7 1 61 i 1 i 7 60:57
6 7 6 76 7
4u4 (2)5 = 4 41 1 1 15 4 0 5
u4 (3) 1 i 1 i 0
2 3 2 3 2 3
u4 (0) 1:3 0:3
6u4 (1)7 16 7 6 7
6 7 60:8 + 0:5i7 60:2 + 0:125i7 :
4u4 (2)5 = 4 4 0:3 5 = 4 0:1 5
u4 (3) 0:8 0:5i 0:2 0:125i
2 3 2 3
j u4 (0) j 0:3
6j u4 (1) j7 60:27
6 7 6 7
4j u4 (2) j5 = 40:15
j u4 (3) j 0:2
Now from the following table of maximum values
(M ) 0:3
u1 (M ) 0:8
u2 (M ) 0:7
u3 (M ) 0:8
u4 (M ) 0:3
The signal u4 (M ) identi…es as a reference signal.
5. Comparison
The complex fuzzy set has many applications, particularly in signal processing
and image restoration as it represents the particular form of a Fourier series. Here
we presented the application of CFS in signals and systems. In this practical appli-
cation, one of the main issue is that, how to choose a suitable model. We examined
this idea in depth and used the CFS in signals and systems by introducing an algo-
rithm using the matrix already introduced in [18] and the CFS. In this application,
we identi…ed a reference signal out of large interest signals detected by a digital
receiver. Ramot et al., in [16] introduced an algorithm to identify the unknown
signal received by the digital receiver with reference signal R and in [29] the au-
thors modi…ed the method introduced in [16]. Further, Ali and Smarandache in [3]
work on the same algorithm for complex neutrosophic sets. In all these algorithms,
the authors actually tried to …nd the highest resemblance with the known signal
R while the method we developed gives the exact value of unknown signal among
the all unknown signals received by the digital receiver. We compared it with the
known signal R and observed that both the values are exactly equal. Thus we iden-
ti…ed one unknown signal as a reference signal R among the several signals detected
by the receiver. The model that presented in this paper for identifying a reference
signal is more e¤ective then the methods previously developed. Here we used a
discrete Fourier transform matrix (DFTM) to develop an algorithm for further use
in signals processing. Moreover through this model we determined the value of
each signal separately, that detected by a digital receiver. In fact we compared
the values of di¤erent signals with the reference signal and we easily identi…ed the
reference signal. Moreover it is seen clearly that how the detected signals matched
with the reference signal. However our designed model is not a perfect one, it stuck
with a de…ciency of theoretical support. The concept of matrix for CFSs may be
useful for applications. Therefore it will be signi…cant for future work.
6. Conclusion
In this paper, we have discussed some new set theoretic operations of a CFS, and
properties of a CFS with respect to standard CF union, standard CF intersection
and standard CF complement. We have presented some basic results and examples
of these operations and laws under the operations of complex fuzzy union, com-
plex fuzzy intersection and complex fuzzy complement. Moreover we have used a
complex fuzzy set in signals and systems. We have introduced a new method to
develop a new kind of matrix using a complex fuzzy set, through which we iden-
ti…ed a reference signal among several signals detected by the digital receiver. In
future the same method can be used for continuous data of signals using continuous
Fourier transform. This method can also be applied for identi…cation of signals in
geology. Moreover this work and further study of complex fuzzy sets will give a
new direction of applications in di¤erent …elds of science and engineering.
Con‡ict of Interests
The authors declare that they have no con‡ict of interests.
Acknowledgments: This research is partially supported by NNSFC (61866011;

11561023). The third author is thankful to Higher Education Commission of Pak-
istan for …nancial support.
References
[1] A. Alkouri and A. Salleh Complex intuitionistic fuzzy sets. In: International conference on
fundamental and applied sciences, AIP conference proceedings, vol. 1482 (2012), 464–470.
[2] A. El Allaoui, S. Melliani and L. S. Chadli, Representation of complex grades of membership
and non-membership for a complex intuitionistic fuzzy sets, Notes on Intuitionistic Fuzzy
Sets, Vol. 23, no. 5 (2017), 51–60.
[3] M. Ali, F. Smarandache, Complex neutrosophic set, Neural Computing & Applications, vol.
28 (2017), 1817–1834.
[4] S. Dick, Toward complex fuzzy logic, Fuzzy Systems, IEEE Transactions on, vol. 13 (2005),
405-414.
[5] D. Dubois and H. Prade, Fundamentals of fuzzy sets, Khuwer Academic Publisher, Boston,
2000.
[6] A. Garrido, Fuzzy Mathematical Analysis, Conference Paper, September 2007.
[7] B. Hu, L. Bi and S. Dai, The orthogonality between complex fuzzy sets and its application
to signal detection, Symmetry, vol. 9, no. 9 (2017), 175.
[8] H. X. Li and V. C. Yen, Fuzzy sets and fuzzy decision making, CRC Press, London, 1995.
[9] S. Naz, M. Akram, Novel decision-making approach based on hesitant fuzzy sets and graph
theory, Computational and Applied Mathematics, vol. 38, no. 1 (2019), 7.
[10] T. T. Ngan, L. T. H. Lan, M. Ali, D. Tamir, L. H. Son, T. M. Tuan, N. Rishe and A.
Kandel, Logic connectives of complex fuzzy sets, Romanian Journal of Information Science
and Techonolgy, , Vol. 21, no. 4 (2018), 344–357.
[11] H. T. Nguyen and E. A. Walker, Fuzzy logic, CRC Press, New York, 2006.
[12] H. T. Nguyen, V. Kreinovich, and V. Shekhter, On the possibility of using complex values in
fuzzy logic for representing inconsistencies, International Journal of Intelligent Systems, vol.
13, no. 8 (1998), 683-714.
[13] G. S. Nisren, A. Hafeed and A. R. Salleh, Complex fuzzy soft expert sets, AIP Conference
Proceedings, 1830, 070020 (2017), 1-8.
[14] W. Pedrycz and F. Gomide, An introduction to fuzzy sets, MIT Press, 1998.
[15] O. Y. Poodeh, Applications of complex fuzzy sets in time-series prediction, Ph.D Thesis,
University of Alberta, (2017).
[16] D. Ramot, R. Milo, M. Friedman, and A. Kandel, Complex fuzzy sets, IEEE Transactions
on fuzzy systems, vol. 10, no. 2 (2002), 171-186.
[17] D. Ramot, M. Friedman, G. Langholz, A. Kandel, Complex fuzzy logic, IEEE Transactions
on Fuzzy Systems, vol. 11, no. 4 (2003), 450–461.
[18] I. W. Selesnick and G. Schuller, The Discrete Fourier Transform, 2nd chapter of the book
The transform and data compression Handbook, editted by K.R. Rao and P. C. Yip, CRC
Press, Boca Raton, 2001.
[19] P. K. Singh, Complex vague set based concept lattice, Chaos, Solitons and Fractals, vol. 96
(2017), 145–153.
[20] D. E. Tamir, L. Jin and A. Kandel, A new interpretation of complex membership grade,
International Journal of Intelligent Systems, vol. 26 (2011), 285-312.
[21] P. Xindong, H. Yuan, and Y. Yang, Pythagorean fuzzy information measures and their ap-
plications, International Journal of Intelligent Systems, vol. 32, no. 10 (2017), 991-1029.
[22] P. Xindong, and J. Dai, Approaches to single-valued neutrosophic MADM based on MABAC,
TOPSIS and new similarity measure with score function, Neural Computing and Applications,
vol. 29, no. 10 (2018), 939-954.
[23] P. Xindong, and H. Garg, Algorithms for interval-valued fuzzy soft sets in emergency decision
making based on WDBA and CODAS with new information measure, Computers & Industrial
Engineering, vol. 119 (2018), 439-452.
[24] P. Xindong, J. Dai, and H. Garg, Exponential operation and aggregation operator for q-rung
orthopair fuzzy set and their decision-making method with a new score function, International
Journal of Intelligent Systems, vol. 33, no. 11 (2018), 2255-2282.
[25] P. Xindong and G. Selvachandran, Pythagorean fuzzy set: state of the art and future direc-
tions, Arti…cial Intelligence Review (2017), 1-55.
[26] P. Xindong and J. Dai, A bibliometric analysis of neutrosophic set: Two decades review from
1998 to 2017, Arti…cial Intelligence Review (2018), 1-57.
[27] O. Yazdanbakhsh and S. Dick, A systematic review of complex fuzzy sets and logic, Fuzzy
Sets and Systems, vol. 338 (2018), 1–22.
[28] L. A. Zadeh, Fuzzy sets, Inform. Control, vol. 8 (1965), 338-353.
[29] G. Zhang, ST, Dillon, YK, Cai, J., Ma, J. Lu, Operation properties and -equalities of complex
fuzzy sets, International journal of approximate reasoning, vol. 50 (2009), 1227–1249.
[30] Y. Zhou, W. Cao, L. Liu, S. Agaian and C.L. P. Chen, Fast Fourier transform using matrix
decomposition, Information Sciences, vol. 291 (2015), 172–183.

123

Uploaded by

Copyright:

Available Formats

123

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

123

Uploaded by

Copyright:

Available Formats

COMPLEX FUZZY SETS WITH APPLICATIONS IN SIGNALS

Xueling Ma1 , Jianming Zhan1 , Madad Khan2 , Muhammad Zeeshan2 ,

zjmhbmy@126.com, zhanjianming@hotmail.com, madadmath@yahoo.com,

Abstract. In this paper we introduced some new operations and laws of a

Keyword. Discrete Fourier transform matrix; signal processing, complex fuzzy

Correspoding author email address zhanjianming@hotmail.com .

is more generalized theory for handling problems involving complexities. One of

R S (x) = M ax[0; R (x) r S (x)] = M ax[0; (rR (x) r rS (x))ei!RrS (x) ]:

(iii) Weighted Average. ! RrS = rR !rRR+r

R S (x) =j R (x) r S (x) j

R S (x) =j R (x) r S (x) j=j [rR (x) r rS (x)]ei!RrS (x) j :

R S (x) =[ R\S c (x) Rc \S (x)]

Rc [S (y) \ R[S c (y) = [ Rc (y) S (y)] ?[ R (y) S c (y)]

[ Rc \S (x) [ R\S c (x)] = [ Rc (x) ? S (x)] [ R (x) ? S c (x)]

R (x) = R\R (x):

R S (x) =j rR (x) r rS (x) jj ei!RrS (x) j=j rR (x) r rS (x) j :

(1) (Rc \ S) [ (R \ S c ) = rRc (x)ei!Sc (x)

(2) (Rc [ S c ) \ (R [ S) = rRc (x)ei!Sc (x) :

From (1) and (2) we have

(3) (Rc \ S) [ (R \ S c ) = rS (x)ei!S (x)

(4) (Rc [ S c ) \ (R [ S) = rS (x)ei!S (x) :

(5) (Rc \ S) [ (R \ S c ) = rRc (x)ei!Rc (x)

(6) (Rc [ S c ) \ (R [ S) = rRc (x)ei!Rc (x) :

(7) (Rc \ S) [ (R \ S c ) = rS (x)ei!R (x)

(8) (Rc [ S c ) \ (R [ S) = rS (x)ei!R (x) :

(9) (Rc \ S) [ (R \ S c ) = rS c (x)ei!R (x)

(10) (Rc [ S c ) \ (R [ S) = rS c (x)ei!R (x) :

(11) (Rc \ S) [ (R \ S c ) = rR (x)ei!R (x)

(12) (Rc [ S c ) \ (R [ S) = rR (x)ei!R (x) :

(Rc \ S) [ (R \ S c ) = (Rc [ S c ) \ (R [ S):

(13) (Rc \ S) [ (R \ S c ) = rS c (x)ei!Sc (x)

(14) (Rc [ S c ) \ (R [ S) = rS c (x)ei!Sc (x) :

(15) (Rc \ S) [ (R \ S c ) = rR (x)ei!S (x)

(16) (Rc [ S c ) \ (R [ S) = rR (x)ei!S (x) :

(1) (Rc [ S) \ (R [ S c ) = rR (x)ei!S (x)

(2) (Rc \ S c ) [ (R \ S) = rR (x)ei!S (x) :

(3) (Rc [ S) \ (R [ S c ) = rS c (x)ei!Sc (x)

(4) (Rc \ S c ) [ (R \ S) = rS c (x)ei!Sc (x) :

(5) (Rc [ S) \ (R [ S c ) = rR (x)ei!R (x)

(6) (Rc \ S c ) [ (R \ S) = rR (x)ei!R (x) :

(7) (Rc [ S) \ (R [ S c ) = rS c (x)ei!R (x)

(8) (Rc \ S c ) [ (R \ S) = rS c (x)ei!R (x) :

(9) (Rc [ S) \ (R [ S c ) = rS (x)ei!Rc (x)

(10) (Rc \ S c ) [ (R \ S) = rS (x)ei!Rc (x) :

(11) (Rc [ S) \ (R [ S c ) = rRc (x)ei!R (x)

(12) (Rc \ S c ) [ (R \ S) = rRc (x)ei!R (x) :

(13) (Rc [ S) \ (R [ S c ) = rS (x)ei!S (x)

(14) (Rc \ S c ) [ (R \ S) = rS (x)ei!S (x) :

(15) (Rc [ S) \ (R [ S c ) = rRc (x)ei!S (x)

(16) (Rc \ S c ) [ (R \ S) = rRc (x)ei!S (x) :

(2) (R [ S) \ (R [ T ) = rS (x)ei!T (x) :

(4) (R [ S) \ (R [ T ) = rR (x)ei!R (x) :

(5) R [ (S \ T ) = rT (x)ei!S (x)

(6) (R [ S) \ (R [ T ) = rT (x)ei!S (x) :

(7) R [ (S \ T ) = rR (x)ei!R (x)

(8) (R [ S) \ (R [ r) = rR (x)ei!R (x) :

(9) R [ (S \ T ) = rR (x)ei!T (x)

(10) (R [ S) \ (R [ T ) = rR (x)ei!T (x) :

(11) R [ (S \ T ) = rR (x)ei!S (x)