APBT

Post-hoc analyses indicated significant improvements in 10-m sprint time from pre- to post- (p < 0.001), and mid- to post-training (p < 0.001) with group APBT. Group ABPT additionally achieved significant improvements in 30-m sprint time from pre- to post- (p = 0.013) and from mid- to post-training (p < 0.001).

Group APBT Group BBPT Age 13.9 (.27) 13.8 (.32) Body Mass (kg) 50.8 (10.7) 51.1 (7.6) Height (m) 1.61 (.06) 1.64 (.09) Sitting Height (cm) 79.4 (3.9) 79.8 (5.0) Leg Length (cm) 84.1 (3.7) 85.0 (5.4) Predicted PHV (years from PHV) -.66 (.63) -.66 (.73) % Body Fat 14.3 (2.2) 15.4 (3.7) Body Mass Index 19.3 (2.7) 18.8 (1.6) PHV = Peak Height Velocity Table 2a.

In this section, the derivation processes of integer DCT and integer DST will be introduced [9], which can lay the foundation for the derivation of integer APBT in Section 3.

In [27], the APBT based on DST was deduced which is called the all phase discrete sine biorthogonal transform (APDSBT).

Based on this analysis, we use APBT to replace DCT to further improve the HEVC coding performance.

One is that the DCT and DST are replaced by APBT, and the other is the quantization table in HEVC is replaced by the uniform quantization.

With the development of APDF theory, some further works were proposed recently, like APBT [7] and WAPBT [8].

13, we know the efficiency of parallel APDSBT algorithm is much higher than that of serial APBT algorithm.

On the basis of all phase digital filtering , three kinds of all phase biorthogonal transforms based on the WHT, DCT and IDCT were proposed and the matrices of APBT were deduced in [8].

Taking all phase discrete cosine biorthogonal transform (APDCBT) for example, the process of two-dimensional APBT is introduced as follows.

The algorithm of APBT is similar to the conventional DCT.

The essence of DCT, APBT and their inverse transform is the matrix multiplication, as shown in Eqs.