A more rigorous merging condition requires the FD and the BD to have more than one merged state (e.g., 5 merged states) as shown in the shaded box on the right.
We propose as a future work the improvement of merging condition without parameters.
The merging condition consists of a similarity measure between two blocks and defined as (6).
A simple merging condition requires the FD and the BD have one merged state as shown in the shaded box on the left.
In this article, the simple merging condition (NMS = 1) is adopted by the BFA. Figure 1 Illustration of the bidirectional Fano algorithm decoding, where L is the information length and K is the constraint length of the convolutional code, resulting in a total codeword length of L f = L + K - 1.
Then several consecutive sequential OPCs will form a new OPC with operation ⊗ if they meet merging condition.
Consequently, each region is anticipated to be as large as possible under the merge condition.
The solution of this problem can be derived by merging both conditions and related matrix operations, and results in the following vector of CCs, namely: s c = - P CC μ I + P CC 0 s d = W s d, (12).
Due to the fact that the algorithm is based on GAs, we use a hierarchical structure to merge the conditions of Hurwitz testing matrix technique and average performance constraint into a fitness function which is called Hierarchical Fitness Function Structure (HFFS).
Following Cable's decision, it is time to revisit the media pluralism amendments to the Enterprise Act, strengthen the public interest provisions, and impose on merging companies stringent conditions relating to investment in and guaranteed independence of quality journalism.
