• Journal of the Korean Solar Energy Society
• /
• v.37 no.4
• /
• pp.1-11
• /
• 2017

Most PV modules are fabricated by 6 cell-strings with solar cells connected in series. Moreover, bypass diodes are generally installed every 2 cell-strings to prevent PV modules from a damage induced by current mismatch or partial shading. But, in the case of special purpose PV module, like as BIPV (Building Integrated Photovoltaic), the number of cell-strings per module varies according to its size. Differ from a module employing even cell-strings, the configuration of bypass diode should be optimized in the PV module with odd strings because of oppositely facing electrodes. Hence, in this study, electrical characteristics of special purposed PV module with odd string was empirically and theoretically studied depending on arrangement of bypass diode. Here, we assumed that PV module has 3 strings and the number of bypass diodes in the system varies from 2 to 6. In case of 2 bypass diodes, shading on a center string increases short circuit current of the module, because of a parallel circuit induced by 2 bypass diodes connected to center string. Also, the loss is larger, as the shading area in the center string is enlarged. Thus, maximum power of the PV module with 2 bypass diode decreases by up to 59 (%) when shading area varies from 50 to 90 (%). On the other hand, In case of 3 and 6 bypass diodes, the maximum power reduction was within about 3 (W), even the shading area changes from 50 to 90 (%). As a result, It is an alternative to arrange the bypass diode by each string or one bypass diode in the PV module in order to completely bypass current in case of shading, when PV module with odd string are fabricated.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.6
• /
• pp.268-278
• /
• 2005

We consider constructing the generalized suffix way of strings A and B when the suffix arrays of A and B are given, j.e., merging two suffix arrays of A and B. There are efficient algorithms to merge some special suffix arrays such as the odd array and the even array. However, for the general case that A and B are arbitrary strings, no efficient merging algorithms have been developed. Thus, one had to construct the generalized suffix arrays of A and B by constructing the suffix array of A$\#$B$\$$ from scratch, even though the suffix ways of A and B are given. In this paper, we Present efficient merging algorithms for the suffix arrays of two arbitrary strings A and B drawn from constant and integer alphabets. The experimental results show that merging two suffix ways of A and B are about 5 times faster than constructing the suffix way of A$\#$B$\$$ from scratch for constant alphabets. Our algorithms include searching all suffixes of string B in the suffix array of A. To do this, we use suffix links in suffix ways and we developed efficient algorithms for computing the suffix links. Efficient computation of suffix links is another contribution of this paper because it can be used to solve other problems occurred in bioinformatics that should search all suffixes of a given string in the suffix array of another string such as computing matching statistics, finding longest common substrings, and so on. The experimental results show that our methods for computing suffix links is about 3-4 times faster than the previous fastest methods.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.2
• /
• pp.87-93
• /
• 2002

A new approach of constructing a suffix tree $T_s$for the given string S is to construct recursively a suffix tree $ T_0$ for odd positions construct a suffix tree $T_e$ for even positions from $ T_o$ and then merge $ T_o$ and $T_e$ into $T_s$ To construct suffix trees for integer alphabets in linear time had been a major open problem on index data structures. Farach used this approach and gave the first linear-time algorithm for integer alphabets The hardest part of Farachs algorithm is the merging step. In this paper we present a new and simpler merging algorithm based on a coupled BFS (breadth-first search) Our merging algorithm is more intuitive than Farachs coupled DFS (depth-first search ) merging and thus it can be easily extended to other applications.