 Topic: Princen Bradley condition (Read 5622 times)
0 Members and 1 Guest are viewing this topic. ##### 2011-01-27 06:59:48
Can any1 explain me the Princen Bradley condition required for windows in MDCT
1.  h(k)^2 + h(k+N)^2 = 1

2. h(k) = h(2N-1-k) ##### Reply #1 – 2011-01-27 11:54:17
Can any1 explain me the Princen Bradley condition required for windows in MDCT
1.  h(k)^2 + h(k+N)^2 = 1
2.  h(k) = h(2N-1-k)

Try implementing the MDCT in terms of the Type-IV DCT. This may help you understand the necessary window conditions to make the "whole" transform (many blocks) reversible and optionally orthogonal. ##### Reply #2 – 2011-01-27 13:50:12
One more MDCT related question. MDCT is a lapped transform and psychoacoustic models rather use FFT (both 'even' and 'odd' components included). Wouldn't it be right to adjust masking thresholds using prior knowledge of quantization errors in previous frame? ##### Reply #3 – 2011-01-28 19:41:29
Any ideas? I believe either Sebastian or Chris Helmrich should have thought about it.. ##### Reply #4 – 2011-01-28 20:14:10
Can any1 explain me the Princen Bradley condition required for windows in MDCT
1.  h(k)^2 + h(k+N)^2 = 1

2. h(k) = h(2N-1-k)

http://guru.multimedia.cx/mdct/ ##### Reply #5 – 2015-01-04 14:05:36
Can any1 explain me the Princen Bradley condition required for windows in MDCT
1.  h(k)^2 + h(k+N)^2 = 1

2. h(k) = h(2N-1-k)

and not
h(k) = h(2N-k) instead of h(2N-1-k) ? 