It is a regular way of constructing quantum error-correcting codes via codes with self-orthogonal property, and whether a classical Bose-Chaudhuri-Hocquenghem (BCH) code is self-orthogonal can be determined by its des...It is a regular way of constructing quantum error-correcting codes via codes with self-orthogonal property, and whether a classical Bose-Chaudhuri-Hocquenghem (BCH) code is self-orthogonal can be determined by its designed distance. In this paper, we give the sufficient and necessary condition for arbitrary classical BCH codes with self-orthogonal property through algorithms. We also give a better upper bound of the designed distance of a classical narrow-sense BCH code which contains its Euclidean dual. Besides these, we also give one algorithm to compute the dimension of these codes. The complexity of all algorithms is analyzed. Then the results can be applied to construct a series of quantum BCH codes via the famous CSS constructions.展开更多
In the bit-interleaved coded modulation with iterative decoding,it is desired that any two Hamming neighbors,i.e..signal constellation points whose binary labels are at unit Hamming distance,be separated by a large Eu...In the bit-interleaved coded modulation with iterative decoding,it is desired that any two Hamming neighbors,i.e..signal constellation points whose binary labels are at unit Hamming distance,be separated by a large Euclidean distance.This paper determines the mappings for the 32-ary fourdimensional generalized cross constellation（32-4D-GCC） so that the minimum squared Euclidean distance d_（min）~2 between Hamming neighbors is maximized.Among such mappings,those with minimum multiplicity N（d_（min）~2） are selected.To reduce the large search space,a set of ＂mapping templates,＂ each producing a collection of mappings with the same set partitions of binary labels,is introduced.Via enumeration of mapping templates,it is shown that the optimum d_（min）~2=16and the optimum N（d_（min）~2）=16.Among thousands optimum mappings found by computer search,two of the best performance are presented.展开更多
In many electrical grids worldwide, the rising amount of installed PV （photovoltaic） power entails a considerable influence of PV systems on grid quality and stability. Consequently, in the wake of the revised Germa...In many electrical grids worldwide, the rising amount of installed PV （photovoltaic） power entails a considerable influence of PV systems on grid quality and stability. Consequently, in the wake of the revised German medium voltage directives issued in 2009, new requirements for PV inverters have been established internationally. At Fraunhofer ISE＇s Inverter Laboratory, approximately 25 large PV inverters with a nominal power of up to 880 kVA have been characterized in the past three years. In this period, the focus of many inverter manufacturers has begun to shift from traditional European markets towards an international perspective. Therefore, experiences with numerous different grid codes have been gained by our team. This work summarizes the similarities and differences between these grid codes. Additionally, several requirements that have proved to be critical will be examined. Finally, the adequacy of these grid codes to guarantee the safe and reliable operation of electrical grids is discussed.展开更多
基金Supported by the National Natural Science Foundation of China (No.60403004)the Outstanding Youth Foundation of China (No.0612000500)
文摘It is a regular way of constructing quantum error-correcting codes via codes with self-orthogonal property, and whether a classical Bose-Chaudhuri-Hocquenghem (BCH) code is self-orthogonal can be determined by its designed distance. In this paper, we give the sufficient and necessary condition for arbitrary classical BCH codes with self-orthogonal property through algorithms. We also give a better upper bound of the designed distance of a classical narrow-sense BCH code which contains its Euclidean dual. Besides these, we also give one algorithm to compute the dimension of these codes. The complexity of all algorithms is analyzed. Then the results can be applied to construct a series of quantum BCH codes via the famous CSS constructions.
基金supported by the National Key Basic Research Program of China(973 program) under grant No.2010CB328206NSFC under grants No.60837002+3 种基金60807003and 61102048the Fundamental Research Funds for the Central Universities under grant No.2011JBM208NSF under grant CCF-0952711
文摘In the bit-interleaved coded modulation with iterative decoding,it is desired that any two Hamming neighbors,i.e..signal constellation points whose binary labels are at unit Hamming distance,be separated by a large Euclidean distance.This paper determines the mappings for the 32-ary fourdimensional generalized cross constellation（32-4D-GCC） so that the minimum squared Euclidean distance d_（min）~2 between Hamming neighbors is maximized.Among such mappings,those with minimum multiplicity N（d_（min）~2） are selected.To reduce the large search space,a set of ＂mapping templates,＂ each producing a collection of mappings with the same set partitions of binary labels,is introduced.Via enumeration of mapping templates,it is shown that the optimum d_（min）~2=16and the optimum N（d_（min）~2）=16.Among thousands optimum mappings found by computer search,two of the best performance are presented.
文摘In many electrical grids worldwide, the rising amount of installed PV （photovoltaic） power entails a considerable influence of PV systems on grid quality and stability. Consequently, in the wake of the revised German medium voltage directives issued in 2009, new requirements for PV inverters have been established internationally. At Fraunhofer ISE＇s Inverter Laboratory, approximately 25 large PV inverters with a nominal power of up to 880 kVA have been characterized in the past three years. In this period, the focus of many inverter manufacturers has begun to shift from traditional European markets towards an international perspective. Therefore, experiences with numerous different grid codes have been gained by our team. This work summarizes the similarities and differences between these grid codes. Additionally, several requirements that have proved to be critical will be examined. Finally, the adequacy of these grid codes to guarantee the safe and reliable operation of electrical grids is discussed.
