阅读说明：本技术 时间计算 (Time calculation ) 是由 乔纳森·大卫·爱德华兹 于 2019-08-07 设计创作，主要内容包括：一种用于对乘法和加法表达式求值的系统。该系统包括用于在被分成多个时隙并且包括在第一时隙和第二时隙上的第一脉冲和第二脉冲的时域信号上对乘法和加法表达式的变量编码的编码器。该系统还包括可操作来在逐个时隙基础上接收时域信号的积分器单元。积分器单元可操作来在逐个时隙基础上累加与接收到的脉冲信号的振幅的总和的累计总计对应的振幅值,并且在逐个时隙基础上累加所累加的振幅值。积分器单元从而可操作来在接收到时域信号之后生成与乘法和加法表达式的结果对应的值。(A system for evaluating multiply and add expressions. The system includes an encoder for encoding variables of the multiplication and addition expressions on a time domain signal divided into a plurality of time slots and including a first pulse and a second pulse over a first time slot and a second time slot. The system also includes an integrator unit operable to receive the time domain signal on a slot-by-slot basis. The integrator unit is operable to accumulate amplitude values corresponding to a cumulative total of sums of amplitudes of the received pulse signals on a slot-by-slot basis, and accumulate the accumulated amplitude values on a slot-by-slot basis. The integrator unit is thereby operable to generate, upon receipt of the time domain signal, a value corresponding to the result of the multiplication and addition expression.)

1. A system for evaluating a multiply and add expression, the system comprising:

an encoder for encoding variables of the multiplication and addition expressions on a time domain signal divided into a plurality of time slots and comprising a first pulse and a second pulse over a first time slot and a second time slot, an integrator unit operable to receive the time domain signal on a time slot by time slot basis, wherein the integrator unit is operable to:

accumulating an amplitude value corresponding to a cumulative total of a sum of amplitudes of the received pulse signals on a slot-by-slot basis, an

Accumulating the accumulated amplitude values on a slot-by-slot basis and thereby generating a value corresponding to a result of the multiplication and addition expression after receiving the time domain signal.

2. The system of claim 1, wherein the multiply and add expressions include a first multiply expression (a.b) and a second multiply expression (c.d), and have the form (a.b) + (c.d).

3. The system of claim 1, wherein the encoder is operable to encode the variables of the multiply and add operations by:

using a first variable (a) of the first multiplication expression (a.b) to determine a time slot of the time domain signal for which there is a pulse signal having an amplitude determined by a second variable (b) of the first multiplication expression; and

using a first variable (c) of the second multiplication expression (c.d) to determine a time slot of the time domain signal for which there is a pulse signal having an amplitude determined by a second variable (d) of the second multiplication expression.

4. A system according to any preceding claim, wherein the integrator unit comprises a pulse accumulator unit to accumulate the amplitude values corresponding to a running total of the sums of the amplitudes of the received pulse signals on a time slot by time slot basis.

5. A system according to any preceding claim, wherein the integrator unit comprises a result accumulator unit to accumulate the accumulated amplitude values on a time slot by time slot basis and thereby generate a value corresponding to the result of the multiplication and addition expression after receiving the time domain signal.

6. A computational unit for evaluating a multiply and add expression, the unit being arranged to receive a time domain signal divided into a plurality of time slots and comprising first and second pulses over first and second time slots, and a variable of the multiply and add expression being encoded on the time domain signal, the computational unit being operable to:

accumulating an amplitude value corresponding to an accumulated sum of sums of amplitudes of the received pulse signals on a slot-by-slot basis, an

Accumulating the accumulated amplitude values on a slot-by-slot basis and thereby generating a value corresponding to a result of the multiplication and addition expression after receiving the time domain signal.

7. The calculation unit of claim 6, further comprising a pulse accumulator unit to accumulate amplitude values corresponding to a running total of a sum of amplitudes of the received pulse signals on a slot-by-slot basis.

8. The calculation unit of claim 7, further comprising a result accumulator unit to accumulate the accumulated amplitude values on a slot-by-slot basis and thereby generate a value corresponding to a result of the multiplication and addition expression after receiving the time domain signal.

9. A computer processor comprising a computing unit according to any of claims 6 to 8.

10. A method of evaluating a multiply and add expression, the method comprising:

encoding a variable of the multiplication and addition expression on a time domain signal divided into a plurality of slots and including a first pulse and a second pulse on a first slot and a second slot;

receiving the time domain signal on a slot-by-slot basis;

accumulating an amplitude value corresponding to a cumulative total of a sum of amplitudes of the received pulse signals on a slot-by-slot basis;

accumulating the accumulated amplitude values on a time slot by time slot basis; and

generating a value corresponding to a result of the multiplication and addition expression after receiving the time domain signal.

11. The method of claim 10, wherein the multiply and add expressions include a first multiply expression (a.b) and a second multiply expression (c.d), and have the form (a.b) + (c.d).

12. The method of claim 10 or 11, wherein encoding the variables of the multiply and add operations on a time domain signal comprises:

using a first variable (a) of the first multiplication expression (a.b) to determine a time slot of the time domain signal for which there is a pulse signal having an amplitude determined by a second variable (b) of the first multiplication expression; and

using a first variable (c) of the second multiplication expression (c.d) to determine a time slot of the time domain signal for which there is a pulse signal having an amplitude determined by a second variable (d) of the second multiplication expression.

Technical Field

The present invention relates to a time calculation technique.

Background

Conventional computing techniques rely on data storage techniques in which data is stored in physical memory. Time calculation is an alternative method for implementing calculations in which the medium for storage is the time interval between signaling pulses, known as Pulse Interval Modulation (PIM).

Temporal computational techniques are believed to more closely match the neural activity of the brain. In certain cases, time encoding may be performed in hardware using a real time delay, which may be more efficient and require less infrastructure than traditional binary digital encoding and logic schemes.

Summary of The Invention

According to a first aspect of the invention, a system for evaluating multiplication and addition expressions is provided. The system includes an encoder for encoding variables of the multiplication and addition expressions on a time domain signal divided into a plurality of time slots and including a first pulse and a second pulse over a first time slot and a second time slot. The system also includes an integrator unit operable to receive the time domain signal on a slot-by-slot basis. The integrator unit is operable to accumulate amplitude values corresponding to a cumulative total of sums of amplitudes of the received pulse signals on a slot-by-slot basis, and accumulate the accumulated amplitude values on a slot-by-slot basis. The integrator unit is thereby operable to generate, upon receipt of the time domain signal, a value corresponding to the result of the multiplication and addition expression.

Optionally, the multiplication and addition expressions include a first multiplication expression (a.b) and a second multiplication expression (c.d), and have the form (a.b) + (c.d).

Optionally, the encoder is operable to encode the variables of the multiply and add operations by: using a first variable (a) of the first multiplication expression (a.b) to determine a time slot for the time domain signal to exist for a pulse signal having an amplitude determined by a second variable (b) of the first multiplication expression; and using the first variable (c) of the second multiplication expression (c.d) to determine a time slot for the time domain signal in which a pulse signal having an amplitude determined by the second variable (d) of the second multiplication expression is present.

Optionally, the integrator unit includes a pulse accumulator unit to accumulate amplitude values corresponding to a running total of the sums of the amplitudes of the received pulse signals on a slot-by-slot basis.

Optionally, the integrator unit comprises a result accumulator unit to accumulate the accumulated amplitude values on a slot-by-slot basis and thereby generate a value corresponding to the result of the multiplication and addition expression after receiving the time domain signal.

According to a second aspect of the present invention there is provided a computational unit for evaluating a multiplication and addition expression, the unit being arranged to receive a time domain signal divided into a plurality of time slots and comprising first and second pulses over first and second time slots, and a variable of the multiplication and addition expression being encoded on the time domain signal. The calculation unit is operable to accumulate amplitude values corresponding to a cumulative total of sums of amplitudes of the received pulse signals on a slot-by-slot basis, and accumulate the accumulated amplitude values on a slot-by-slot basis, and thereby generate a value corresponding to a result of the multiplication and addition expression after receiving the time-domain signal.

Optionally, the calculation unit further includes a pulse accumulator unit to accumulate amplitude values corresponding to a cumulative total of the sums of the amplitudes of the received pulse signals on a slot-by-slot basis.

Optionally, the calculation unit further comprises a result accumulator unit to accumulate the accumulated amplitude values on a slot-by-slot basis and thereby generate a value corresponding to the result of the multiplication and addition expression after receiving the time domain signal.

According to a third aspect of the invention there is provided a computer processor comprising a computational unit according to the second aspect of the invention.

According to a fourth aspect of the invention, a method of evaluating a multiply and add expression is provided. The method comprises the following steps: encoding a variable of a multiplication and addition expression on a time domain signal divided into a plurality of slots and including a first pulse and a second pulse on a first slot and a second slot; receiving a time domain signal on a slot-by-slot basis; accumulating an amplitude value corresponding to a cumulative total of a sum of amplitudes of the received pulse signals on a slot-by-slot basis; the accumulated amplitude values are accumulated on a slot-by-slot basis, and a value corresponding to the result of the multiplication and addition expression is generated after the time-domain signal is received.

Optionally, the multiplication and addition expressions include a first multiplication expression (a.b) and a second multiplication expression (c.d), and have the form (a.b) + (c.d).

Optionally, encoding the variables of the multiplication and addition expressions on the time domain signal comprises: using a first variable (a) of the first multiplication expression (a.b) to determine a time slot for the time domain signal to exist for a pulse signal having an amplitude determined by a second variable (b) of the first multiplication expression; and using the first variable (c) of the second multiplication expression (c.d) to determine a time slot for the time domain signal in which a pulse signal having an amplitude determined by the second variable (d) of the second multiplication expression is present.

Various additional features and aspects of the invention are defined in the claims.

Brief Description of Drawings

Embodiments of the invention will now be described, by way of example only, with reference to the accompanying schematic drawings in which similar elements are provided with corresponding reference symbols, and in which:

FIGS. 1a, 1b, and 1c provide diagrams illustrating a technique for populating an indexed array for evaluating multiply and add expressions having the form (a × b) + (c × d);

FIG. 2 provides a schematic diagram providing a graphical depiction of a process for performing add and accumulate operations for evaluating multiply and add expressions having the form (a × b) + (c × d);

FIG. 3 provides a schematic diagram depicting a hardware implementation for performing addition and accumulation operations for evaluating multiply and add expressions described with reference to FIG. 2;

FIG. 4 provides a schematic diagram of a time domain signal on which is stored in time an indexed array for performing addition and accumulation operations for evaluating multiplication and addition expressions;

FIG. 5 provides a schematic diagram of a computational unit for performing multiplication and addition operations using the time domain signals depicted in FIG. 4; and

FIG. 6 provides a flow diagram of a process for performing add and accumulate operations for evaluating multiply and add expressions.

Detailed Description

FIG. 1a provides a diagram illustrating a technique for populating an indexed array for undertaking operations for evaluating expressions having the form (a × b) + (c × d). This is an expression that adds the results of two multiplication expressions. Such expressions are also referred to as "dot product" expressions.

The operation involves applying addition and accumulation operations to an indexed array of values generated from the variables of each multiplication expression to evaluate the multiplication expression.

An indexed array is created by using one variable from each multiplication expression to specify an array index for an array element and using another variable from the multiplication expression to specify an array value for the array element at the array index.

The indexed array thus formed is subjected to an accumulation operation in which, starting with the array element having the highest array index, the values of each array element are sequentially accumulated to provide an evaluation result. The evaluation result is the result of the expression.

FIG. 1a provides a diagram depicting a technique for generating an indexed array in a generic form.

Multiplication and addition operations having the form (a × b) + (c × d) are shown.

The first variable (a) from the first multiplication expression is used to specify an array index (array index a) for the first array element (as will be understood, the array index specifies a particular array element within the array).

The second variable (b) from the first multiplication expression is used to specify the value of the array element at the array index specified by the first variable. Thus, array element (a) has an array value of (b).

The second variable (c) from the second multiplication expression is used to specify an array index (array index c) for the second array element. The second variable (d) from the second multiplication expression is used to specify the value of the array element at the array index specified by the first variable. Thus, array element (c) has an array value of (d).

As will be appreciated, a larger value of each variable from each multiplication expression used to specify the array index will determine the total length of the indexed array. Thus, if a is greater than c, the indexed array will be a array elements long. Alternatively, if c is greater than a, the indexed array will be c array element long. In the example shown in FIG. 1a, a is shown to be greater than c.

If the variables defining the array index are the same (e.g., if a ═ c), the array value at the array element at array index a ═ c is the sum of the other variables (e.g., b + d). This is shown in fig. 1 b.

The technique for array generation is further illustrated with reference to FIG. 1 c.

Referring to fig. 1c, consider the expression (5 × 1) + (3 × 2) (i.e., a ═ 5; b ═ 1; c ═ 3, and d ═ 2).

This expression includes two multiplicative expressions: the first multiplication expression: 5 × 1, and a second multiplication expression: 3X 2.

Each multiplication expression has two variables. For clarity, these are referred to as left and right variables.

The left variable of the first multiplication expression is 5, and the left variable of the second multiplication expression is 3. The largest of these variables (5 in this case) determines the total length of the array.

FIG. 1c depicts five array elements (a first array element at array index 1, a second array element at array index 2, a third array element at array index 3, a fourth array element at array index 4, and a fifth array element at array index 5).

The array indices are numbered from left to right, i.e., the leftmost array element corresponds to array index 1 and the rightmost array element corresponds to array index 5.

One of the array indices corresponds to the left variable (5 in this case) of the first multiplication expression, i.e., array index 5. One of the other array indices corresponds to the right variable (3 in this case) of the second multiplication expression, i.e., array index 3. These array indices (i.e., array index 5 and array index 3) each have a value associated with them. More specifically, they are associated with values corresponding to another number of their respective multiplication expressions. Thus, the array element at array index 5 is associated with a value of 1 (since the first multiplication expression is 5 × 1), and the array element at array index 3 is associated with a value of 2 (since the second multiplication expression is 3 × 2). Each of the other array elements at the other array indices (i.e., the array elements at array indices 1, 2, and 4) is associated with a zero value.

In this way, an indexed array of values, namely 0, 0, 2, 0, 1, is formed.

As shown in FIG. 1c, for clarity, the array elements are referred to as array element 1, array element 2, array element 3, array element 4, and array element 5, from left to right.

The addition and accumulation operations are performed using an indexed array that produces the evaluation result of the expression.

A graphical depiction of this operation is shown in fig. 2.

In a first step (a), array element 5 (corresponding to array index 5) is evaluated. This evaluation includes obtaining the integer value associated with array element 5. In the example explained from fig. 1c, this is the integer 1. This gives a first evaluation result 1.

In a second step (B), array element 4 (corresponding to array index 4) is evaluated. The evaluation includes adding the integer value of the array element to the evaluation result of array element 5. Thus, the evaluation includes the addition 0+1 ═ 1.

In a third step (C), array element 3 (corresponding to array index 3) is evaluated. The evaluation includes adding the integer value of the array element to the evaluation result of array element 4. Thus, the evaluation includes the addition 1+2 ═ 3.

In a fourth step (D), array element 2 (corresponding to array index 2) is evaluated. The evaluation includes adding the integer value of the array element to the evaluation result of array element 3. Thus, the evaluation includes the addition 3+0 ═ 3.

In a fifth step (E), array element 1 (corresponding to array index 1) is evaluated. The evaluation includes adding the integer value of the array element to the evaluation result of array element 2. Thus, the evaluation includes the addition 3+0 ═ 3.

Finally, in a sixth step, the evaluation results for each array element are accumulated (i.e., 1+1+3+3+3), giving the result of the multiply and add expression, which is 11.

Fig. 3 provides a schematic diagram depicting a hardware implementation for implementing the addition and accumulation operations described above.

A memory array 301 is provided comprising a plurality of memory cells, each memory cell corresponding to an array element as described above. Each memory cell holds a value corresponding to the integer value of the array element to which it corresponds. Thus, the fifth memory unit 302 holds the value 1 and the third memory unit 303 holds the value 3. The remaining memory cells hold the value zero.

The hardware implementation includes a first array of sequential adder units 304 and a second array of sequential adder units 305. The adder units of the first array of sequential adder units 304 generate the evaluations (i.e., 3, 1, and 1) corresponding to each array element, and the second array of sequential adder units 305 sequentially adds the evaluations to provide the result of the multiply and add expression. To illustrate this process, the integer values input to and output from the adder unit are shown in fig. 3.

When performing multiplication and addition operations of the form (a × b) + (c × d) using the hardware implementation shown in fig. 3 using the technique described above with reference to fig. 1 and 2, the indexed array must be read into memory array 301 prior to the addition and accumulation operations undertaken by the first and second arrays of sequential adders.

This requires the indexed array to be stored in a physical memory medium.

However, according to an example of a time calculation technique, the indexed array required to perform the multiply and add operations may be stored in time, i.e., in the time domain, using Pulse Interval Modulation (PIM). In other words, the variables of the expression are encoded on the time domain signal.

This is shown in fig. 4.

Fig. 4 shows a time domain signal 401 divided into a plurality of time slots. In a specific example, the signals will be multiplexed (multiplexed) on a carrier signal (not shown).

Each time slot of the time domain signal corresponds to an array element of the indexed array 402 and transmits a pulse signal corresponding to the integer value associated with the corresponding array element. The signal is shown propagating in time from left to right, thus, the first time slot (t)₁) A pulse corresponding to the fifth array element and having an amplitude of 1; the third time slot (t)₃) Corresponds to the third array element and has a pulse with an amplitude of 2, and the remaining time slot (t)₁、t₂And t₄) Has zero amplitude, i.e. carries no pulses.

As described above, the time domain signal "stores" (by encoding the variables of the expression in the time domain) an indexed array and can be input to appropriate hardware to implement the multiplication and addition operations. In other words, the indexed array is simulated by sequentially ordered media (i.e., time).

An example of such hardware is a calculation unit that starts an accumulator that performs two accumulation operations when a signal is received: a first accumulation operation that accumulates the amplitude of the pulse signal on a slot-by-slot basis, and a second accumulator that accumulates the accumulated amplitude from the first operation on a slot-by-slot basis to accumulate a final result.

Fig. 5 provides a schematic diagram of such a calculation unit 501 comprising a pulse amplitude accumulator 502 and a result accumulator 503. The calculation unit 501 receives a time domain signal from the encoder 504, and the encoder 504 encodes the expression to be evaluated into the time domain signal.

Referring to the time domain signal 401 shown in FIG. 4 and the table shown in FIG. 5, in the first time slot t₁During which the calculation unit receives a first pulse having an amplitude 1. Pulse accumulator 502 accumulates the value (i.e., stores the value 1) and passes the value to result accumulator 503. The result accumulator 503 stores a value of 1. As can be seen from the time domain signal 401 shown in fig. 4, in the second time slot t₂Meanwhile, the calculation unit 501 does not receive a pulse. Thus, pulse accumulator 502 holds the previous value (i.e., 1) and passes that value to result accumulator 503. The result accumulator 503 adds this to the previous value and thus stores the value 2. As can be seen from the time domain signal 401 shown in fig. 4, in the third time slot t₃Meanwhile, the calculation unit 501 receives a second pulse having an amplitude of 2. Pulse accumulator 502 adds this to the previously accumulated pulse value (i.e., 1+ 2-3) and passes this value of 3 to result accumulator 503. The result accumulator 503 adds this to the previous value and thus stores the value 5. As can be seen from the time domain signal 401 shown in fig. 4, in the fourth time slot t₄Meanwhile, the calculation unit 501 does not receive a pulse. Thus, pulse accumulator 502 holds the previous value (i.e., 3) and passes that value to result accumulator 503. The result accumulator 503 adds this to the previous value and thus stores the value 8. As can be seen from the time domain signal 401 shown in fig. 4, in the fifth time slot t₅Meanwhile, the calculation unit 501 does not receive a pulse. Thus, pulse accumulator 502 holds the previous value (i.e., 3) and passes that value to result accumulator 503. The result accumulator 503 adds this to the previous value and thus stores the value 11.

This final result can then be read from the result accumulator. As will be appreciated, using the hardware arrangement and the time domain signal on which the variables of the expression are encoded as depicted in fig. 5, the multiplication and addition expressions can be performed without the need to store the indexed array in physical memory.

Generally, the operation of the pulse amplitude accumulator 502 and the result accumulator 503 is governed by the operation of a common clock signal that maintains synchronization. Generally, the time domain signal input to the calculation unit is also generated in synchronization with the clock signal.

Pulse amplitude accumulator 502 and result accumulator 503 may be implemented using suitable electronics known in the art. The computing unit 501 may be implemented as part of a larger computing system.

According to a particular embodiment, a method of evaluating a multiplication and addition expression is provided, wherein the multiplication and addition expression is evaluated by encoding a variable of the expression on a time domain signal. More specifically, as described above, a time domain signal encoding the multiplication and addition expression of the form (a × b) + (c × d) is generated. The format of the time domain signal corresponds to the format of the indexed array described above, whereby each array element of the indexed array corresponds to a time slot of the time domain signal and the pulse is present on the time domain signal at a time slot position corresponding to a non-zero array element of the indexed array.

According to this method, time domain signals are received on a slot-by-slot basis. The amplitude value corresponds to a running total of the sum of the amplitudes of the received and accumulated pulse signals on a slot-by-slot basis. The accumulated amplitude values themselves are accumulated on a time slot by time slot basis. After receiving the time domain signal, the values correspond to the results of the multiplication and addition expressions.

FIG. 6 provides a schematic drawing referencing a flowchart of an example implementation of the method.

In a first step S601, a first time slot of a time domain signal is received. In a second step S602, the pulse values of all slots received by the present time are accumulated to generate an accumulated pulse value. In a third step S603, the accumulated pulse values are accumulated. In a fourth step S604, it is determined whether the last time slot has been received. If the last slot is not received, a fifth step S605 is performed, the next slot is received in the fifth step S605, and then the second step S602, the third step S603, and the fourth step S604 are repeated.

If it is determined in the fourth step that the last time slot has been received, a sixth step S606 is performed, whereby the values of all accumulated pulse values are output as the evaluation result of the expression.

In the system described with reference to fig. 5, this process is undertaken by a calculation unit comprising a pulse amplitude accumulator and a result accumulator. However, it is to be understood that the process may be undertaken by any suitable hardware arrangement designed and arranged using techniques known in the art.

In a particular example, the computational unit as described above may be provided as part of a larger processing unit (e.g., as part of an Arithmetic Logic Unit (ALU) or a floating point logic unit (FPU) of a Central Processing Unit (CPU) or a Graphics Processing Unit (GPU)).

All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and/or all of the steps of any method or process so disclosed, may be combined in any combination, except combinations where at least some of such features and/or steps are mutually exclusive. Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise. Thus, unless expressly stated otherwise, each feature disclosed is one example only of a generic series of equivalent or similar features. The invention is not restricted to the details of the foregoing embodiments. The invention extends to any novel one, or any novel combination, of the features disclosed in this specification (including any accompanying claims, abstract and drawings), or to any novel one, or any novel combination, of the steps of any method or process so disclosed.

In essence, with respect to the use of any plural and/or singular terms herein, those having skill in the art can translate from the plural to the singular and/or from the singular to the plural as is appropriate to the context and/or application. Various singular/plural permutations may be expressly set forth herein for the sake of clarity. It will be understood by those within the art that terms used herein, and especially in the appended claims (e.g., bodies of the appended claims) are generally intended as "open" terms (e.g., the term "including" should be interpreted as "including but not limited to," the term "having" should be interpreted as "having at least," the term "includes" should be interpreted as "includes but is not limited to," etc.). Furthermore, it will be further understood by those within the art that if a specific number of an introduced claim recitation is intended, such an intent will be explicitly recited in the claim, and in the absence of such recitation no such intent is present. For example, as an aid to understanding, the following appended claims may contain usage of the introductory phrases "at least one" and "one or more" to introduce claim recitations. However, the use of such phrases should not be construed to imply that the introduction of a claim recitation by the indefinite articles "a" or "an" limits any particular claim containing such introduced claim recitation to embodiments containing only one such recitation, even when the same claim includes the introductory phrases "one or more" or "at least one" and indefinite articles such as "a" or "an" (e.g., "a" and/or "an" should be interpreted to mean "at least one" or "one or more"); the same holds true for the use of definite articles used to introduce claim recitations. Furthermore, even if a specific number of an introduced claim recitation is explicitly recited, those skilled in the art will recognize that such recitation should be interpreted to mean at least the recited number (e.g., the bare recitation of "two recitations," without other modifiers, means at least two recitations, or two or more recitations).

It is to be understood that various embodiments of the present disclosure have been described herein for purposes of illustration, and that various modifications may be made without deviating from the scope of the present disclosure. Accordingly, the various embodiments disclosed herein are not intended to be limiting, with the true scope being indicated by the following claims.