Context: In contrast to the speed of compression, which is proportional to the number of operations required by the algorithm, here latency refers to the number of samples that must be analysed before a block of audio is processed. In the minimum case, latency is zero samples (e.g., if the coder/decoder simply reduces the number of bits used to quantize the signal). Time domain algorithms such as LPC also often have low latencies, hence their popularity in speech coding for telephony. In algorithms such as MP3, however, a large number of samples have to be analyzed to implement a psychoacoustic model in the frequency domain, and latency is on the order of 23 ms (46 ms for two-way communication)).

Question: What refers to the number of samples that must be analysed before a block of audio is processed?
Answer: latency

Question: What has zero samples in a minimum case?
Answer: latency

Question: What often has low latencies?
Answer: LPC

Question: What refers to the number of samples that must be analyzed before a coding is processed?
Answer: Unanswerable

Question: What has zero samples in a minimum audio?
Answer: Unanswerable

Question: What  requires large number of speech coding to be analyzed?
Answer: Unanswerable

Question: What is the latency for algorithms such as LPC on the order of?
Answer: Unanswerable

Question: What reduces the number of bits used to quantize a block of audio?
Answer: Unanswerable