Multidimensional Logarithmic Number System:Binary to MDLNS Conversion

By -
Binary to MDLNS Conversion

A logarithmic representation, a, of the number, x, is given by the relationship in the following equation, where s is the sign of the number and the base is r (usually 2):

Multidimensional Logarithmic Number System-0169

The MDLNS provides more degrees of freedom than the LNS by use of the orthogonal bases and the ability to use multiple digits. However, these extra features introduce new complexities in the binary conversion process. The binary-to-LNS conversion process is simplified owing to the monotonic relationship between x and a. Unfortunately, this solution is not applicable to the MDLNS since there is no monotonic relationship between x and the multiple digits/bases.

The technique initially proposed for binary-to-MDLNS conversion used simple LUTs [14]; however, the input data range for the target application area of video processing was only 8 bits. Although an LUT offers a simple and fast binary-to-MDLNS conversion scheme, the size of the LUTs required is exponentially dependent on the input binary dynamic range. The LUT sizes further depend on the number of digits and bases in the MDLNS representation. For example, an error-free (where the absolute representation error is <0.5) 12-bit unsigned range with 3-digits and 2-bases [2] would require a direct mapping LUT of the size 4096 X 33 or 136 kbit, a reasonably sized VLSI component. However, if an error-free 23-bit unsigned range were needed, the mapping LUT would be 8388608 X 48 or 403 Mbit, which is not reasonable at all for VLSI fabrication.

In this section we will describe several hardware implementation techniques for converting a binary representation into a 2DLNS representation. The techniques are based on the reversal of a previously published MDLNS-to-binary converter [14] with the aid of a new memory device [29].

To simplify the presentation of the binary-to-MDLNS process we will restrict ourselves to a subset of the MDLNS with only two bases (an n-digit 2DLNS representation) and we will assume that the exponent of the second (or nonbinary) base has a predefined finite precision (equivalent to limiting the number of bits of precision in a classical LNS). The simplified representation of an input, x, as an n-digit 2DLNS is shown in the following equation:

Multidimensional Logarithmic Number System-0170

The second base, D, is a suitably chosen number (relatively prime to 2), si Î {-1, 0, + 1}, and the exponents are integers. R is the number of bits of the second base exponent (i.e., bi Î {–2R–1,…, 2R–1 – 1}) and it directly affects the complexity of the MDLNS system. The precision of the binary exponent is B bits (i.e., ai Î {–2B–1,…, 2B–1 – 1}). Unlike R, B does not directly affect the complexity of the system.

Comments

Post a Comment

Popular posts from this blog

Square wave oscillators and Op-amp square wave oscillator.

By -
Image
Square wave oscillators If Fourier analysis is performed on a square wave it is found that the waveform is composed of many harmonics of the fundamental frequency. This rich harmonic content makes the square wave particularly useful as a quick test of amplifier performance. Examples of possible results are shown. The simplest way to produce a square wave is to make a sine wave oscillator in one of the ways described earlier, then feed the output to some form of squaring circuit such as a Schmitt trigger. This is the method adopted in most commercial sine/square wave generators. There are, however, several circuits for square wave oscillators and a description of the most common follows. Multivibrator Technically the multivibrator is a relaxation oscillator, working on the charging of a capacitor through a resistor. If a negative edge is applied to the circuit in (a), transistor TR 1 turns off the for time taken for the base voltage to return to 0 V. If the voltage step is
Read more

Adders:Carry Look-Ahead Adder.

By -
Image
Carry Look-Ahead Adder As previously stated, the carry, c i +1, produced at the i -th position is calculated as c i +1 = x i · y i ∨ c i ·( x i ⊕ y i ). This means that a carry is generated if both x i and y i are 1, or an incoming carry is propagated if one of x i and y i is 1 and the other is 0. Therefore, letting g i denote x i y i , we have c i +1 = g i ∨ c i p i , where p i = x i ⊕ y i . Here, g i is the formula for the carry generation condition at the i -th position, i.e., when g i is 1, a carry is generated at this position. Substituting g i –1 ∨ p i –1 c i –1 for c i , we get A carry look-ahead adder can be realized according to this expression, as illustrated in Figure 41.10 for the case of four bits [21]. According to this expression, c i +1’s are calculated at all positions in parallel. It is hard to realize an n -bit carry look-ahead adder precisely according to this expression, unless n is small, because maximum fan-in and fan-out restriction is violated at higher
Read more

Timing Description Languages:SDF

By -
Image
SDF Standard Delay Format (SDF) is an ASCII format used to convey timing information between EDA tools. SDF was first developed by Cadence in 1990. Open Verilog International (OVI) approved SDF version 2 in 1993 and SDF version 2.1 and 3 in the following years. Improving SDF version 3 features, resulted in IEEE Standard 1497 [1]. Role of SDF in Design Process SDF can be used in different levels of a design process to annotate timing specifications, including timing data and constraints. Timing constraints are used during the forward-annotation process while timing data are applied during the back-annotation process. Forward-annotation process deals with porting timing constraints to synthesis, floorplanner, layout, and routing tools to meet the required constraints. During the design process, timing data can be back-annotated to analysis tools (including simulators, static timing analysis tools, etc.) to provide more accurate timing representations. SDF Structure An SDF f
Read more