Enumeration reduction algorithm for the characterization of multi-primary LED systems

Multi-primary tunable LED lighting systems can generate a vast number of spectral outputs, with the exact number depending on the resolution of the control signal and number of LED primaries. Computing all combinations to identify optimal spectral power distributions (SPDs) with a specified chromaticity would require a tremendous amount of time and computational power. Here, an enumeration reduction (ER) algorithm is described to reduce the computation time by defining a bounding pyramid in the three-dimensional tristimulus space that maps to the circumscribed square of the target region in the chromaticity diagram. This method enables computing only the necessary amount of tristimulus values (and resulting chromaticity coordinates) for SPDs that fall into a user-defined target chromaticity area, reducing computation time by avoiding the need to generate each combination and calculate its chromaticity coordinates. The results show that the proposed ER algorithm can greatly reduce the time - up to 922 times in a series of tests - to determine a set of metamers compared to a full enumeration computation.