By Topic

Algorithms for Constructing Ideal Gradings for Nonhoming Selectors (An Application of the Theory of Block Designs)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Pedersen, O. ; Automatic Elec. Labs.,Inc.,Northlake,IL

Algorithms are presented for designing high-efficiency gradings for nonhoming selectors and for expanding an existing grading by the addition of trunks or selectors with minimal rearrangement of the grading while maintaining its efficiency. The grading design problem is formulated as a problem in constructing block designs. The block design problem is shown to be equivalent to a nonlinear programming problem. The solution to the problem is a (partially) balanced incomplete block design that is a representation of a cyclic homogeneous grading. Flowcharts of algorithms and examples are given for solutions of variants of the programming problem corresponding to 1) the expansion of a grading by the addition of a selector, 2) the expan sion of a grading by the addition of a trunk, and 3) the optimization of a homogeneous grading.

Published in:

Communication Technology, IEEE Transactions on  (Volume:19 ,  Issue: 2 )