An Approach for Simplifying Switching Functions by Utilizing the Cover Table Representation

Das, Shantanu

doi:10.1109/t-c.1971.223244

Cited by 16 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Selection of the smallest number of prime implicants is done by using 'Prime Implicants Chart' proposed by Quine-McCluskey or 'Cover Table' proposed by S.R. Das [17]. Lastly variable assignment to each simplified product terms as 1 replaced with proper variable according to position without complemented form, 0 replaced with complemented form and X eliminated from the expression.…”

Section: Simplification Rulementioning

confidence: 99%

Switching Circuits Simplifications Using Binary Coded Octal Minterms

Roy

2017

ijoaem

View full text Add to dashboard Cite

In this paper, a simple approach for detection of adjacent minterms and minimization technique is proposed. The proposed method factorized each minterms and 'don't-care' conditions into a group of maximum three inputs variables and these groups of minterms further coupled as per laws of simplification. The entire detection procedure is described here by mix binary-octal representations. A chart proposed in this paper for easy detection of adjacent minterms with fewer numbers of comparisons and can use for any number of variables. Logic adjacency property is played a significant role for logic circuit simplification. This novel method reduces the complexity of two-level simplification procedure. This paper also represents the performance of octal minterms based combinational circuit minimization technique in comparison with other traditional methods. The paper deals with a method based on representing minterms in the octal system that can be better suited for the manual method of logic minimization and hence may be worth considering.

show abstract

Section: Simplification Rulementioning

confidence: 99%

Switching Circuits Simplifications Using Binary Coded Octal Minterms

Roy

2017

ijoaem

View full text Add to dashboard Cite

show abstract

“…Suppose a cost vector c = (2, 1, 3, 4, 1, 3) is associated with the columns of the cover table given in Figure 1. The corresponding cost-ordered r is (2,5,1,3,6,4). With this value of r, the basic algorithm yields the irredundant cover x' = (0, 1, 1, 0, 1, 0) of cost cx = 5.…”

Section: Reduced-cost Algorithmmentioning

confidence: 99%

“…Clearly, a reduced-cost irredundant cover is prefferable to a reducedcost redundant cover. Further, in some instances [4] an irredundant cover is required, while in other instances [7] it can be used as an initial solution. Bubenik [3] and Das [4] have proposed methods for finding an irredundant cover.…”

Section: Introductionmentioning

confidence: 99%

“…Further, in some instances [4] an irredundant cover is required, while in other instances [7] it can be used as an initial solution. Bubenik [3] and Das [4] have proposed methods for finding an irredundant cover. In this paper, a simpler and more efficient algorithm for finding an irredundant cover which is based on an entirely different approach is presented.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An Efficient Algorithm for Finding an Irredundant Set Cover

Kime

Batni

Russell

1974

J. ACM

View full text Add to dashboard Cite

The set covering problem is considered and an efficient procedure for finding an irredundant cover is presented. For an m X n cover table, the execution time of the procedure is, in the worst case, proportional to m~. Methods are suggested for obtaining alternate irredundant covers based on an initially obtained irredundant cover. The basic cost-independent algorithm is heuristically extended to consider costs so t h a t a re4uced-cost irredundant cover can be obtained. A s u m m a r y of some computational experience is presented, which indicates that the procedure is fast and applicable to large problems.KEY "WORDS AND PHRASES: set covering problem, cover table, irredundant cover CR CATEGORIES; 5.39, 5.49, 6.1 1. Assign a weight to each column Ei of E (usually a function of the cost ci). 2. Determine the column Ej of E having the lowest weight and set xj = 1.

show abstract

A simple way to near minimization of microprogram control memory

Srimani

Sinha

1983

International Journal of Computer and Information Sciences

View full text Add to dashboard Cite

An Approach for Simplifying Switching Functions by Utilizing the Cover Table Representation

Cited by 16 publications

References 15 publications

Switching Circuits Simplifications Using Binary Coded Octal Minterms

Switching Circuits Simplifications Using Binary Coded Octal Minterms

An Efficient Algorithm for Finding an Irredundant Set Cover

A simple way to near minimization of microprogram control memory

Contact Info

Product

Resources

About