| blob | 641c0e1559a535b05b1f05b20ff9f66b018d7a3a |
1 <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
2 <!-- Copyright (c) 2000,2001,2002,2003,2004,2005,2006,2007 Josh Coalson -->
3 <!-- Permission is granted to copy, distribute and/or modify this document -->
4 <!-- under the terms of the GNU Free Documentation License, Version 1.1 -->
5 <!-- or any later version published by the Free Software Foundation; -->
6 <!-- with no invariant sections. -->
7 <!-- A copy of the license can be found at http://www.gnu.org/copyleft/fdl.html -->
8 <html>
9 <head>
12 <meta name="description" content="A free, open source codec for lossless audio compression and decompression" />
13 <meta name="keywords" content="free,lossless,audio,codec,encoder,decoder,compression,compressor,archival,archive,archiving,backup,music" />
17 </head>
19 <body>
22 <a href="http://flac.sourceforge.net/"><img src="images/logo130.gif" alt="FLAC Logo" align="middle" border="0" hspace="0" /></a>
23 </div>
37 </div>
42 </div>
48 format
49 </div>
52 This is a detailed description of the FLAC format. There is also a companion document that describes <a href="ogg_mapping.html">FLAC-to-Ogg mapping</a>.<br />
53 <br />
54 For a user-oriented overview, see <a href="documentation_format_overview.html">About the FLAC Format</a>.<br />
55 <br />
57 <ul>
68 <li>Specification
69 <ul>
71 <ul>
73 <ul>
76 <ul>
81 <ul>
83 </ul>
84 </li>
87 <ul>
89 <ul>
91 </ul>
92 </li>
93 </ul>
94 </li>
96 </ul>
97 </li>
98 </ul>
99 </li>
100 </ul>
101 </li>
102 <li>
103 <ul>
105 <ul>
109 <ul>
115 <ul>
117 <ul>
119 <ul>
121 </ul>
122 </li>
124 <ul>
126 </ul>
127 </li>
128 </ul>
129 </li>
130 </ul>
131 </li>
132 </ul>
133 </li>
134 </ul>
135 </li>
136 </ul>
137 </li>
138 </ul>
139 </li>
140 </ul>
142 <br />
143 FLAC owes much to the many people who have advanced the audio compression field so freely. For instance:
144 <ul>
145 <li>
146 <a href="http://svr-www.eng.cam.ac.uk/~ajr/">A. J. Robinson</a> for his work on <a href="http://www-svr.eng.cam.ac.uk/reports/abstracts/robinson_tr156.html">Shorten</a>; his paper is a good starting point on some of the basic methods used by FLAC. FLAC trivially extends and improves the fixed predictors, LPC coefficient quantization, and Rice coding used in Shorten.
147 </li>
148 <li>
149 <a href="http://commsci.usc.edu/faculty/golomb.html">S. W. Golomb</a> and Robert F. Rice; their universal codes are used by FLAC's entropy coder.
150 </li>
151 <li>
152 N. Levinson and J. Durbin; the reference encoder uses an algorithm developed and refined by them for determining the LPC coefficients from the autocorrelation coefficients.
153 </li>
154 <li>
156 </li>
157 </ul>
159 <br />
160 It is a known fact that no algorithm can losslessly compress all possible input, so most compressors restrict themselves to a useful domain and try to work as well as possible within that domain. FLAC's domain is audio data. Though it can losslessly <b>code</b> any input, only certain kinds of input will get smaller. FLAC exploits the fact that audio data typically has a high degree of sample-to-sample correlation.<br />
161 <br />
162 Within the audio domain, there are many possible subdomains. For example: low bitrate speech, high-bitrate multi-channel music, etc. FLAC itself does not target a specific subdomain but many of the default parameters of the reference encoder are tuned to CD-quality music data (i.e. 44.1kHz, 2 channel, 16 bits per sample). The effect of the encoding parameters on different kinds of audio data will be examined later.<br />
163 <br />
165 <br />
166 Similar to many audio coders, a FLAC encoder has the following stages:
167 <ul>
168 <li>
169 <a href="#blocking">Blocking</a>. The input is broken up into many contiguous blocks. With FLAC, the blocks may vary in size. The optimal size of the block is usually affected by many factors, including the sample rate, spectral characteristics over time, etc. Though FLAC allows the block size to vary within a stream, the reference encoder uses a fixed block size.
170 </li>
171 <li>
172 <a href="#interchannel">Interchannel Decorrelation</a>. In the case of stereo streams, the encoder will create mid and side signals based on the average and difference (respectively) of the left and right channels. The encoder will then pass the best form of the signal to the next stage.
173 </li>
174 <li>
175 <a href="#prediction">Prediction</a>. The block is passed through a prediction stage where the encoder tries to find a mathematical description (usually an approximate one) of the signal. This description is typically much smaller than the raw signal itself. Since the methods of prediction are known to both the encoder and decoder, only the parameters of the predictor need be included in the compressed stream. FLAC currently uses four different classes of predictors (described in the <a href="#prediction">prediction</a> section), but the format has reserved space for additional methods. FLAC allows the class of predictor to change from block to block, or even within the channels of a block.
176 </li>
177 <li>
178 <a href="#residualcoding">Residual coding</a>. If the predictor does not describe the signal exactly, the difference between the original signal and the predicted signal (called the error or residual signal) must be coded losslessy. If the predictor is effective, the residual signal will require fewer bits per sample than the original signal. FLAC currently uses only one method for encoding the residual (see the <a href="#residualcoding">Residual coding</a> section), but the format has reserved space for additional methods. FLAC allows the residual coding method to change from block to block, or even within the channels of a block.
179 </li>
180 </ul>
181 In addition, FLAC specifies a metadata system, which allows arbitrary information about the stream to be included at the beginning of the stream.<br />
182 <br />
184 <br />
185 Many terms like "block" and "frame" are used to mean different things in differenct encoding schemes. For example, a frame in MP3 corresponds to many samples across several channels, whereas an S/PDIF frame represents just one sample for each channel. The definitions we use for FLAC follow. Note that when we talk about blocks and subblocks we are referring to the raw unencoded audio data that is the input to the encoder, and when we talk about frames and subframes, we are referring to the FLAC-encoded data.
186 <ul>
187 <li>
189 </li>
190 <li>
191 <b>Subblock</b>: One or more audio samples within a channel. So a block contains one subblock for each channel, and all subblocks contain the same number of samples.
192 </li>
193 <li>
194 <b>Blocksize</b>: The number of samples in any of a block's subblocks. For example, a one second block sampled at 44.1KHz has a blocksize of 44100, regardless of the number of channels.
195 </li>
196 <li>
198 </li>
199 <li>
200 <b>Subframe</b>: A subframe header plus one or more encoded samples from a given channel. All subframes within a frame will contain the same number of samples.
201 </li>
202 </ul>
204 <br />
205 The size used for blocking the audio data has a direct effect on the compression ratio. If the block size is too small, the resulting large number of frames mean that excess bits will be wasted on frame headers. If the block size is too large, the characteristics of the signal may vary so much that the encoder will be unable to find a good predictor. In order to simplify encoder/decoder design, FLAC imposes a minimum block size of 16 samples, and a maximum block size of 65535 samples. This range covers the optimal size for all of the audio data FLAC supports.<br />
206 <br />
207 Currently the reference encoder uses a fixed block size, optimized on the sample rate of the input. Future versions may vary the block size depending on the characteristics of the signal.<br />
208 <br />
209 Blocked data is passed to the predictor stage one subblock (channel) at a time. Each subblock is independently coded into a subframe, and the subframes are concatenated into a frame. Because each channel is coded separately, it means that one channel of a stereo frame may be encoded as a constant subframe, and the other an LPC subframe.<br />
210 <br />
211 <a name="interchannel"><font size="+1"><b><u>Interchannel Decorrelation</u></b></font></a><br />
212 <br />
213 In stereo streams, many times there is an exploitable amount of correlation between the left and right channels. FLAC allows the frames of stereo streams to have different channel assignments, and an encoder may choose to use the best representation on a frame-by-frame basis.
214 <ul>
215 <li>
217 </li>
218 <li>
219 <b>Mid-side</b>. The left and right channels are transformed into mid and side channels. The mid channel is the midpoint (average) of the left and right signals, and the side is the difference signal (left minus right).
220 </li>
221 <li>
223 </li>
224 <li>
226 </li>
227 </ul>
228 Surprisingly, the left-side and right-side forms can be the most efficient in many frames, even though the raw number of bits per sample needed for the original signal is slightly more than that needed for independent or mid-side coding.<br />
229 <br />
231 <br />
232 FLAC uses four methods for modeling the input signal:
233 <ul>
234 <li>
235 <b>Verbatim</b>. This is essentially a zero-order predictor of the signal. The predicted signal is zero, meaning the residual is the signal itself, and the compression is zero. This is the baseline against which the other predictors are measured. If you feed random data to the encoder, the verbatim predictor will probably be used for every subblock. Since the raw signal is not actually passed through the residual coding stage (it is added to the stream 'verbatim'), the encoding results will not be the same as a zero-order linear predictor.
236 </li>
237 <li>
238 <b>Constant</b>. This predictor is used whenever the subblock is pure DC ("digital silence"), i.e. a constant value throughout. The signal is run-length encoded and added to the stream.
239 </li>
240 <li>
241 <b>Fixed linear predictor</b>. FLAC uses a class of computationally-efficient fixed linear predictors (for a good description, see <a href="http://www.hpl.hp.com/techreports/1999/HPL-1999-144.pdf">audiopak</a> and <a href="http://svr-www.eng.cam.ac.uk/~ajr/GroupPubs/Robinson94-tr156/index.html">shorten</a>). FLAC adds a fourth-order predictor to the zero-to-third-order predictors used by Shorten. Since the predictors are fixed, the predictor order is the only parameter that needs to be stored in the compressed stream. The error signal is then passed to the residual coder.
242 </li>
243 <li>
244 <b>FIR Linear prediction</b>. For more accurate modeling (at a cost of slower encoding), FLAC supports up to 32nd order FIR linear prediction (again, for information on linear prediction, see <a href="http://www.hpl.hp.com/techreports/1999/HPL-1999-144.pdf">audiopak</a> and <a href="http://svr-www.eng.cam.ac.uk/~ajr/GroupPubs/Robinson94-tr156/index.html">shorten</a>). The reference encoder uses the Levinson-Durbin method for calculating the LPC coefficients from the autocorrelation coefficients, and the coefficients are quantized before computing the residual. Whereas encoders such as Shorten used a fixed quantization for the entire input, FLAC allows the quantized coefficient precision to vary from subframe to subframe. The FLAC reference encoder estimates the optimal precision to use based on the block size and dynamic range of the original signal.
245 </li>
246 </ul>
248 <br />
249 FLAC currently defines two similar methods for the coding of the error signal from the prediction stage. The error signal is coded using Rice codes in one of two ways: 1) the encoder estimates a single Rice parameter based on the variance of the residual and Rice codes the entire residual using this parameter; 2) the residual is partitioned into several equal-length regions of contiguous samples, and each region is coded with its own Rice parameter based on the region's mean. (Note that the first method is a special case of the second method with one partition, except the Rice parameter is based on the residual variance instead of the mean.)<br />
250 <br />
251 The FLAC format has reserved space for other coding methods. Some possiblities for volunteers would be to explore better context-modeling of the Rice parameter, or Huffman coding. See <a href="http://www.hpl.hp.com/techreports/98/HPL-98-193.html">LOCO-I</a> and <a href="http://www.cs.tut.fi/~albert/Dev/pucrunch/packing.html">pucrunch</a> for descriptions of several universal codes.<br />
252 <br />
254 <br />
255 This section specifies the FLAC bitstream format. FLAC has no format version information, but it does contain reserved space in several places. Future versions of the format may use this reserved space safely without breaking the format of older streams. Older decoders may choose to abort decoding or skip data encoded with newer methods. Apart from reserved patterns, in places the format specifies invalid patterns, meaning that the patterns may never appear in any valid bitstream, in any prior, present, or future versions of the format. These invalid patterns are usually used to make the synchronization mechanism more robust.<br />
256 <br />
257 All numbers used in a FLAC bitstream are integers; there are no floating-point representations. All numbers are big-endian coded. All numbers are unsigned unless otherwise specified.<br />
258 <br />
259 Before the formal description of the stream, an overview might be helpful.
260 <ul>
261 <li>
262 A FLAC bitstream consists of the "fLaC" marker at the beginning of the stream, followed by a mandatory metadata block (called the STREAMINFO block), any number of other metadata blocks, then the audio frames.
263 </li>
264 <li>
265 FLAC supports up to 128 kinds of metadata blocks; currently the following are defined:
266 <ul>
267 <li><a name="def_STREAMINFO"><b>STREAMINFO</b></a>: This block has information about the whole stream, like sample rate, number of channels, total number of samples, etc. It must be present as the first metadata block in the stream. Other metadata blocks may follow, and ones that the decoder doesn't understand, it will skip.</li>
268 <li><a name="def_APPLICATION"><b>APPLICATION</b></a>: This block is for use by third-party applications. The only mandatory field is a 32-bit identifier. This ID is granted upon request to an application by the FLAC maintainers. The remainder is of the block is defined by the registered application. Visit the <a href="id.html">registration page</a> if you would like to register an ID for your application with FLAC.</li>
269 <li><a name="def_PADDING"><b>PADDING</b></a>: This block allows for an arbitrary amount of padding. The contents of a PADDING block have no meaning. This block is useful when it is known that metadata will be edited after encoding; the user can instruct the encoder to reserve a PADDING block of sufficient size so that when metadata is added, it will simply overwrite the padding (which is relatively quick) instead of having to insert it into the right place in the existing file (which would normally require rewriting the entire file).</li>
270 <li><a name="def_SEEKTABLE"><b>SEEKTABLE</b></a>: This is an optional block for storing seek points. It is possible to seek to any given sample in a FLAC stream without a seek table, but the delay can be unpredictable since the bitrate may vary widely within a stream. By adding seek points to a stream, this delay can be significantly reduced. Each seek point takes 18 bytes, so 1% resolution within a stream adds less than 2k. There can be only one SEEKTABLE in a stream, but the table can have any number of seek points. There is also a special 'placeholder' seekpoint which will be ignored by decoders but which can be used to reserve space for future seek point insertion.</li>
271 <li><a name="def_VORBIS_COMMENT"><b>VORBIS_COMMENT</b></a>: This block is for storing a list of human-readable name/value pairs. Values are encoded using UTF-8. It is an implementation of the <a href="http://xiph.org/vorbis/doc/v-comment.html">Vorbis comment specification</a> (without the framing bit). This is the only officially supported tagging mechanism in FLAC. There may be only one VORBIS_COMMENT block in a stream. In some external documentation, Vorbis comments are called FLAC tags to lessen confusion.</li>
272 <li><a name="def_CUESHEET"><b>CUESHEET</b></a>: This block is for storing various information that can be used in a cue sheet. It supports track and index points, compatible with Red Book CD digital audio discs, as well as other CD-DA metadata such as media catalog number and track ISRCs. The CUESHEET block is especially useful for backing up CD-DA discs, but it can be used as a general purpose cueing mechanism for playback.</li>
273 <li><a name="def_PICTURE"><b>PICTURE</b></a>: This block is for storing pictures associated with the file, most commonly cover art from CDs. There may be more than one PICTURE block in a file. The picture format is similar to the <a href="http://www.id3.org/id3v2.4.0-frames.txt">APIC frame in ID3v2</a>. The PICTURE block has a type, MIME type, and UTF-8 description like ID3v2, and supports external linking via URL (though this is discouraged). The differences are that there is no uniqueness constraint on the description field, and the MIME type is mandatory. The FLAC PICTURE block also includes the resolution, color depth, and palette size so that the client can search for a suitable picture without having to scan them all.</li>
274 </ul>
275 </li>
276 <li>
277 The audio data is composed of one or more audio frames. Each frame consists of a frame header, which contains a sync code, information about the frame like the block size, sample rate, number of channels, et cetera, and an 8-bit CRC. The frame header also contains either the sample number of the first sample in the frame (for variable-blocksize streams), or the frame number (for fixed-blocksize streams). This allows for fast, sample-accurate seeking to be performed. Following the frame header are encoded subframes, one for each channel, and finally, the frame is zero-padded to a byte boundary. Each subframe has its own header that specifies how the subframe is encoded.
278 </li>
279 <li>
280 Since a decoder may start decoding in the middle of a stream, there must be a method to determine the start of a frame. A 14-bit sync code begins each frame. The sync code will not appear anywhere else in the frame header. However, since it may appear in the subframes, the decoder has two other ways of ensuring a correct sync. The first is to check that the rest of the frame header contains no invalid data. Even this is not foolproof since valid header patterns can still occur within the subframes. The decoder's final check is to generate an 8-bit CRC of the frame header and compare this to the CRC stored at the end of the frame header.
281 </li>
282 <li>
283 Again, since a decoder may start decoding at an arbitrary frame in the stream, each frame header must contain some basic information about the stream because the decoder may not have access to the STREAMINFO metadata block at the start of the stream. This information includes sample rate, bits per sample, number of channels, etc. Since the frame header is pure overhead, it has a direct effect on the compression ratio. To keep the frame header as small as possible, FLAC uses lookup tables for the most commonly used values for frame parameters. For instance, the sample rate part of the frame header is specified using 4 bits. Eight of the bit patterns correspond to the commonly used sample rates of 8/16/22.05/24/32/44.1/48/96 kHz. However, odd sample rates can be specified by using one of the 'hint' bit patterns, directing the decoder to find the exact sample rate at the end of the frame header. The same method is used for specifying the block size and bits per sample. In this way, the frame header size stays small for all of the most common forms of audio data.
284 </li>
285 <li>
286 Individual subframes (one for each channel) are coded separately within a frame, and appear serially in the stream. In other words, the encoded audio data is NOT channel-interleaved. This reduces decoder complexity at the cost of requiring larger decode buffers. Each subframe has its own header specifying the attributes of the subframe, like prediction method and order, residual coding parameters, etc. The header is followed by the encoded audio data for that channel.
287 </li>
288 <li>
289 <a name="subset">FLAC</a> specifies a subset of itself as the Subset format. The purpose of this is to ensure that any streams encoded according to the Subset are truly "streamable", meaning that a decoder that cannot seek within the stream can still pick up in the middle of the stream and start decoding. It also makes hardware decoder implementations more practical by limiting the encoding parameters such that decoder buffer sizes and other resource requirements can be easily determined. <span class="commandname">flac</span> generates Subset streams by default unless the "--lax" command-line option is used. The Subset makes the following limitations on what may be used in the stream:
290 <ul>
291 <li>
292 The blocksize bits in the <a href="#frame_header">frame header</a> must be 0001-1110. The blocksize must be <=16384; if the sample rate is <= 48000Hz, the blocksize must be <=4608.
293 </li>
294 <li>
296 </li>
297 <li>
299 </li>
300 <li>
301 If the sample rate is <= 48000Hz, the filter order in <a href="#subframe_lpc">LPC subframes</a> must be less than or equal to 12, i.e. the subframe type bits in the <a href="#subframe_header">subframe header</a> may not be 101100-111111.
302 </li>
303 <li>
304 The Rice partition order in a <a href="#partitioned_rice">Rice-coded residual section</a> must be less than or equal to 8.
305 </li>
306 </ul>
307 </li>
308 </ul>
310 The following tables constitute a formal description of the FLAC format. Numbers in angle brackets indicate how many bits are used for a given field.<br />
311 </div>
313 </div>
315 <br />
320 <tr>
323 </td>
324 </tr>
325 <tr>
328 </td>
329 <td>
330 "fLaC", the FLAC stream marker in ASCII, meaning byte 0 of the stream is 0x66, followed by 0x4C 0x61 0x43
331 </td>
332 </tr>
333 <tr>
336 </td>
337 <td>
338 This is the mandatory STREAMINFO metadata block that has the basic properties of the stream
339 </td>
340 </tr>
341 <tr>
344 </td>
345 <td>
346 Zero or more metadata blocks
347 </td>
348 </tr>
349 <tr>
352 </td>
353 <td>
354 One or more audio frames
355 </td>
356 </tr>
357 </table>
358 </td></tr></table>
359 </div>
361 <br />
366 <tr>
369 </td>
370 </tr>
371 <tr>
374 </td>
375 <td>
376 A block header that specifies the type and size of the metadata block data.
377 </td>
378 </tr>
379 <tr>
382 </td>
383 <td>
384
385 </td>
386 </tr>
387 </table>
388 </td></tr></table>
389 </div>
391 <br />
396 <tr>
399 </td>
400 </tr>
401 <tr>
404 </td>
405 <td>
406 Last-metadata-block flag: '1' if this block is the last metadata block before the audio blocks, '0' otherwise.
407 </td>
408 </tr>
409 <tr>
412 </td>
413 <td>
414 BLOCK_TYPE<br />
415 <ul>
416 <li>
418 </li>
419 <li>
421 </li>
422 <li>
424 </li>
425 <li>
427 </li>
428 <li>
430 </li>
431 <li>
433 </li>
434 <li>
436 </li>
437 <li>
439 </li>
440 <li>
442 </li>
443 </ul>
444 </td>
445 </tr>
446 <tr>
449 </td>
450 <td>
451 Length (in bytes) of metadata to follow (does not include the size of the METADATA_BLOCK_HEADER)
452 </td>
453 </tr>
454 </table>
455 </td></tr></table>
456 </div>
458 <br />
463 <tr>
466 </td>
467 </tr>
468 <tr>
477 </td>
478 <td>
479 The block data must match the block type in the block header.
480 </td>
481 </tr>
482 </table>
483 </td></tr></table>
484 </div>
486 <br />
491 <tr>
494 </td>
495 </tr>
496 <tr>
499 </td>
500 <td>
501 The minimum block size (in samples) used in the stream.
502 </td>
503 </tr>
504 <tr>
507 </td>
508 <td>
509 The maximum block size (in samples) used in the stream. (Minimum blocksize == maximum blocksize) implies a fixed-blocksize stream.
510 </td>
511 </tr>
512 <tr>
515 </td>
516 <td>
517 The minimum frame size (in bytes) used in the stream. May be 0 to imply the value is not known.
518 </td>
519 </tr>
520 <tr>
523 </td>
524 <td>
525 The maximum frame size (in bytes) used in the stream. May be 0 to imply the value is not known.
526 </td>
527 </tr>
528 <tr>
531 </td>
532 <td>
533 Sample rate in Hz. Though 20 bits are available, the maximum sample rate is limited by the structure of frame headers to 655350Hz. Also, a value of 0 is invalid.
534 </td>
535 </tr>
536 <tr>
539 </td>
540 <td>
542 </td>
543 </tr>
544 <tr>
547 </td>
548 <td>
549 (bits per sample)-1. FLAC supports from 4 to 32 bits per sample. Currently the reference encoder and decoders only support up to 24 bits per sample.
550 </td>
551 </tr>
552 <tr>
555 </td>
556 <td>
557 Total samples in stream. 'Samples' means inter-channel sample, i.e. one second of 44.1Khz audio will have 44100 samples regardless of the number of channels. A value of zero here means the number of total samples is unknown.
558 </td>
559 </tr>
560 <tr>
563 </td>
564 <td>
565 MD5 signature of the unencoded audio data. This allows the decoder to determine if an error exists in the audio data even when the error does not result in an invalid bitstream.
566 </td>
567 </tr>
568 <tr>
569 <td>
570 </td>
573 <ul>
574 <li>
575 FLAC specifies a minimum block size of 16 and a maximum block size of 65535, meaning the bit patterns corresponding to the numbers 0-15 in the minimum blocksize and maximum blocksize fields are invalid.
576 </li>
577 </ul>
578 </td>
579 </tr>
580 </table>
581 </td></tr></table>
582 </div>
584 <br />
589 <tr>
592 </td>
593 </tr>
594 <tr>
597 </td>
598 <td>
600 </td>
601 </tr>
602 </table>
603 </td></tr></table>
604 </div>
606 <br />
611 <tr>
613 <a name="metadata_block_application"><font size="+1"><b>METADATA_BLOCK_APPLICATION</b></font></a>
614 </td>
615 </tr>
616 <tr>
619 </td>
620 <td>
621 Registered application ID. (Visit the <a href="id.html">registration page</a> to register an ID with FLAC.)
622 </td>
623 </tr>
624 <tr>
627 </td>
628 <td>
629 Application data (n must be a multiple of 8)
630 </td>
631 </tr>
632 </table>
633 </td></tr></table>
634 </div>
636 <br />
641 <tr>
644 </td>
645 </tr>
646 <tr>
649 </td>
650 <td>
651 One or more seek points.
652 </td>
653 </tr>
654 <tr>
655 <td>
656 </td>
659 <ul>
660 <li>
661 The number of seek points is implied by the metadata header 'length' field, i.e. equal to length / 18.
662 </li>
663 </ul>
664 </td>
665 </tr>
666 </table>
667 </td></tr></table>
668 </div>
670 <br />
675 <tr>
678 </td>
679 </tr>
680 <tr>
683 </td>
684 <td>
685 Sample number of first sample in the target frame, or 0xFFFFFFFFFFFFFFFF for a placeholder point.
686 </td>
687 </tr>
688 <tr>
691 </td>
692 <td>
693 Offset (in bytes) from the first byte of the first frame header to the first byte of the target frame's header.
694 </td>
695 </tr>
696 <tr>
699 </td>
700 <td>
701 Number of samples in the target frame.
702 </td>
703 </tr>
704 <tr>
705 <td>
706 </td>
709 <ul>
710 <li>
711 For placeholder points, the second and third field values are undefined.
712 </li>
713 <li>
714 Seek points within a table must be sorted in ascending order by sample number.
715 </li>
716 <li>
717 Seek points within a table must be unique by sample number, with the exception of placeholder points.
718 </li>
719 <li>
720 The previous two notes imply that there may be any number of placeholder points, but they must all occur at the end of the table.
721 </li>
722 </ul>
723 </td>
724 </tr>
725 </table>
726 </td></tr></table>
727 </div>
729 <br />
734 <tr>
736 <a name="metadata_block_vorbis_comment"><font size="+1"><b>METADATA_BLOCK_VORBIS_COMMENT</b></font></a>
737 </td>
738 </tr>
739 <tr>
742 </td>
743 <td>
744 Also known as FLAC tags, the contents of a vorbis comment packet as specified <a href="http://www.xiph.org/vorbis/doc/v-comment.html">here</a> (without the framing bit). Note that the vorbis comment spec allows for on the order of 2 ^ 64 bytes of data where as the FLAC metadata block is limited to 2 ^ 24 bytes. Given the stated purpose of vorbis comments, i.e. human-readable textual information, this limit is unlikely to be restrictive. Also note that the 32-bit field lengths are little-endian coded according to the vorbis spec, as opposed to the usual big-endian coding of fixed-length integers in the rest of FLAC.
745 </td>
746 </tr>
747 </table>
748 </td></tr></table>
749 </div>
751 <br />
756 <tr>
759 </td>
760 </tr>
761 <tr>
764 </td>
765 <td>
766 Media catalog number, in ASCII printable characters 0x20-0x7e. In general, the media catalog number may be 0 to 128 bytes long; any unused characters should be right-padded with NUL characters. For CD-DA, this is a thirteen digit number, followed by 115 NUL bytes.
767 </td>
768 </tr>
769 <tr>
772 </td>
773 <td>
774 The number of lead-in samples. This field has meaning only for CD-DA cuesheets; for other uses it should be 0. For CD-DA, the lead-in is the TRACK 00 area where the table of contents is stored; more precisely, it is the number of samples from the first sample of the media to the first sample of the first index point of the first track. According to the Red Book, the lead-in must be silence and CD grabbing software does not usually store it; additionally, the lead-in must be at least two seconds but may be longer. For these reasons the lead-in length is stored here so that the absolute position of the first track can be computed. Note that the lead-in stored here is the number of samples up to the first index point of the first track, not necessarily to INDEX 01 of the first track; even the first track may have INDEX 00 data.
775 </td>
776 </tr>
777 <tr>
780 </td>
781 <td>
783 </td>
784 </tr>
785 <tr>
788 </td>
789 <td>
790 Reserved. All bits must be set to zero.
791 </td>
792 </tr>
793 <tr>
796 </td>
797 <td>
798 The number of tracks. Must be at least 1 (because of the requisite lead-out track). For CD-DA, this number must be no more than 100 (99 regular tracks and one lead-out track).
799 </td>
800 </tr>
801 <tr>
804 </td>
805 <td>
806 One or more tracks. A CUESHEET block is required to have a lead-out track; it is always the last track in the CUESHEET. For CD-DA, the lead-out track number must be 170 as specified by the Red Book, otherwise is must be 255.
807 </td>
808 </tr>
809 </table>
810 </td></tr></table>
811 </div>
813 <br />
818 <tr>
821 </td>
822 </tr>
823 <tr>
826 </td>
827 <td>
828 Track offset in samples, relative to the beginning of the FLAC audio stream. It is the offset to the first index point of the track. (Note how this differs from CD-DA, where the track's offset in the TOC is that of the track's INDEX 01 even if there is an INDEX 00.) For CD-DA, the offset must be evenly divisible by 588 samples (588 samples = 44100 samples/sec * 1/75th of a sec).
829 </td>
830 </tr>
831 <tr>
834 </td>
835 <td>
836 Track number. A track number of 0 is not allowed to avoid conflicting with the CD-DA spec, which reserves this for the lead-in. For CD-DA the number must be 1-99, or 170 for the lead-out; for non-CD-DA, the track number must for 255 for the lead-out. It is not required but encouraged to start with track 1 and increase sequentially. Track numbers must be unique within a CUESHEET.
837 </td>
838 </tr>
839 <tr>
842 </td>
843 <td>
844 Track ISRC. This is a 12-digit alphanumeric code; see <a href="http://www.ifpi.org/isrc/isrc_handbook.html">here</a> and <a href="http://www.disctronics.co.uk/technology/cdaudio/cdaud_isrc.htm">here</a>. A value of 12 ASCII NUL characters may be used to denote absence of an ISRC.
845 </td>
846 </tr>
847 <tr>
850 </td>
851 <td>
852 The track type: 0 for audio, 1 for non-audio. This corresponds to the CD-DA Q-channel control bit 3.
853 </td>
854 </tr>
855 <tr>
858 </td>
859 <td>
860 The pre-emphasis flag: 0 for no pre-emphasis, 1 for pre-emphasis. This corresponds to the CD-DA Q-channel control bit 5; see <a href="http://www.chipchapin.com/CDMedia/cdda9.php3">here</a>.
861 </td>
862 </tr>
863 <tr>
866 </td>
867 <td>
868 Reserved. All bits must be set to zero.
869 </td>
870 </tr>
871 <tr>
874 </td>
875 <td>
876 The number of track index points. There must be at least one index in every track in a CUESHEET except for the lead-out track, which must have zero. For CD-DA, this number may be no more than 100.
877 </td>
878 </tr>
879 <tr>
882 </td>
883 <td>
884 For all tracks except the lead-out track, one or more track index points.
885 </td>
886 </tr>
887 </table>
888 </td></tr></table>
889 </div>
891 <br />
896 <tr>
899 </td>
900 </tr>
901 <tr>
904 </td>
905 <td>
906 Offset in samples, relative to the track offset, of the index point. For CD-DA, the offset must be evenly divisible by 588 samples (588 samples = 44100 samples/sec * 1/75th of a sec). Note that the offset is from the beginning of the track, not the beginning of the audio data.
907 </td>
908 </tr>
909 <tr>
912 </td>
913 <td>
914 The index point number. For CD-DA, an index number of 0 corresponds to the track pre-gap. The first index in a track must have a number of 0 or 1, and subsequently, index numbers must increase by 1. Index numbers must be unique within a track.
915 </td>
916 </tr>
917 <tr>
920 </td>
921 <td>
922 Reserved. All bits must be set to zero.
923 </td>
924 </tr>
925 </table>
926 </td></tr></table>
927 </div>
929 <br />
934 <tr>
937 </td>
938 </tr>
939 <tr>
942 </td>
943 <td>
944 The picture type according to the ID3v2 APIC frame:<br />
945 <ul>
967 </ul>
968 Others are reserved and should not be used. There may only be one each of picture type 1 and 2 in a file.
969 </td>
970 </tr>
971 <tr>
974 </td>
975 <td>
976 The length of the MIME type string in bytes.
977 </td>
978 </tr>
979 <tr>
982 </td>
983 <td>
984 The MIME type string, in printable ASCII characters 0x20-0x7e. The MIME type may also be <tt>--></tt> to signify that the data part is a URL of the picture instead of the picture data itself.
985 </td>
986 </tr>
987 <tr>
990 </td>
991 <td>
992 The length of the description string in bytes.
993 </td>
994 </tr>
995 <tr>
998 </td>
999 <td>
1000 The description of the picture, in UTF-8.
1001 </td>
1002 </tr>
1003 <tr>
1006 </td>
1007 <td>
1008 The width of the picture in pixels.
1009 </td>
1010 </tr>
1011 <tr>
1014 </td>
1015 <td>
1016 The height of the picture in pixels.
1017 </td>
1018 </tr>
1019 <tr>
1022 </td>
1023 <td>
1024 The color depth of the picture in bits-per-pixel.
1025 </td>
1026 </tr>
1027 <tr>
1030 </td>
1031 <td>
1032 For indexed-color pictures (e.g. GIF), the number of colors used, or <tt>0</tt> for non-indexed pictures.
1033 </td>
1034 </tr>
1035 <tr>
1038 </td>
1039 <td>
1040 The length of the picture data in bytes.
1041 </td>
1042 </tr>
1043 <tr>
1046 </td>
1047 <td>
1048 The binary picture data.
1049 </td>
1050 </tr>
1051 </table>
1052 </td></tr></table>
1053 </div>
1055 <br />
1060 <tr>
1063 </td>
1064 </tr>
1065 <tr>
1068 </td>
1069 <td>
1070
1071 </td>
1072 </tr>
1073 <tr>
1076 </td>
1077 <td>
1078 One SUBFRAME per channel.
1079 </td>
1080 </tr>
1081 <tr>
1084 </td>
1085 <td>
1086 Zero-padding to byte alignment.
1087 </td>
1088 </tr>
1089 <tr>
1092 </td>
1093 <td>
1094
1095 </td>
1096 </tr>
1097 </table>
1098 </td></tr></table>
1099 </div>
1101 <br />
1106 <tr>
1109 </td>
1110 </tr>
1111 <tr>
1114 </td>
1115 <td>
1117 </td>
1118 </tr>
1119 <tr>
1122 </td>
1123 <td>
1124 Reserved:<br />
1125 <ul>
1126 <li>
1128 </li>
1129 <li>
1131 </li>
1132 </ul>
1133 </td>
1134 </tr>
1135 <tr>
1138 </td>
1139 <td>
1140 Blocking strategy:<br />
1141 <ul>
1142 <li>
1144 </li>
1145 <li>
1147 </li>
1148 </ul>
1149 </td>
1150 </tr>
1151 <tr>
1154 </td>
1155 <td>
1156 Block size in inter-channel samples:<br />
1157 <ul>
1158 <li>
1160 </li>
1161 <li>
1163 </li>
1164 <li>
1166 </li>
1167 <li>
1169 </li>
1170 <li>
1172 </li>
1173 <li>
1175 </li>
1176 </ul>
1177 </td>
1178 </tr>
1179 <tr>
1182 </td>
1183 <td>
1184 Sample rate:<br />
1185 <ul>
1186 <li>
1188 </li>
1189 <li>
1191 </li>
1192 <li>
1194 </li>
1195 <li>
1197 </li>
1198 <li>
1200 </li>
1201 <li>
1203 </li>
1204 <li>
1206 </li>
1207 <li>
1209 </li>
1210 <li>
1212 </li>
1213 <li>
1215 </li>
1216 <li>
1218 </li>
1219 <li>
1221 </li>
1222 <li>
1224 </li>
1225 <li>
1227 </li>
1228 <li>
1230 </li>
1231 <li>
1233 </li>
1234 </ul>
1235 </td>
1236 </tr>
1237 <tr>
1240 </td>
1241 <td>
1242 Channel assignment
1243 <ul>
1244 <li>
1245 <tt>0000-0111</tt> : (number of independent channels)-1. Where defined, the channel order follows SMPTE/ITU-R recommendations. The assignments are as follows:
1246 <ul>
1255 </ul>
1256 </li>
1257 <li>
1258 <tt>1000</tt> : left/side stereo: channel 0 is the left channel, channel 1 is the side(difference) channel
1259 </li>
1260 <li>
1261 <tt>1001</tt> : right/side stereo: channel 0 is the side(difference) channel, channel 1 is the right channel
1262 </li>
1263 <li>
1264 <tt>1010</tt> : mid/side stereo: channel 0 is the mid(average) channel, channel 1 is the side(difference) channel
1265 </li>
1266 <li>
1268 </li>
1269 </ul>
1270 </td>
1271 </tr>
1272 <tr>
1275 </td>
1276 <td>
1277 Sample size in bits:<br />
1278 <ul>
1279 <li>
1281 </li>
1282 <li>
1284 </li>
1285 <li>
1287 </li>
1288 <li>
1290 </li>
1291 <li>
1293 </li>
1294 <li>
1296 </li>
1297 <li>
1299 </li>
1300 <li>
1302 </li>
1303 </ul>
1304 </td>
1305 </tr>
1306 <tr>
1309 </td>
1310 <td>
1311 Reserved:<br />
1312 <ul>
1313 <li>
1315 </li>
1316 <li>
1318 </li>
1319 </ul>
1320 </td>
1321 </tr>
1322 <tr>
1325 </td>
1326 <td>
1327 if(variable blocksize)<br />
1329 else<br />
1331 </td>
1332 </tr>
1333 <tr>
1336 </td>
1337 <td>
1340 </td>
1341 </tr>
1342 <tr>
1345 </td>
1346 <td>
1349 </td>
1350 </tr>
1351 <tr>
1354 </td>
1355 <td>
1356 CRC-8 (polynomial = x^8 + x^2 + x^1 + x^0, initialized with 0) of everything before the crc, including the sync code
1357 </td>
1358 </tr>
1359 <tr>
1360 <td>
1361 </td>
1364 <ul>
1365 <li>
1366 The "blocking strategy" bit must be the same throughout the entire stream.
1367 </li>
1368 <li>
1369 The "blocking strategy" bit determines how to calculate the sample number of the first sample in the frame. If the bit is <tt>0</tt> (fixed-blocksize), the frame header encodes the frame number as above, and the frame's starting sample number will be the frame number times the blocksize. If it is <tt>1</tt> (variable-blocksize), the frame header encodes the frame's starting sample number itself. (In the case of a fixed-blocksize stream, only the last block may be shorter than the stream blocksize; its starting sample number will be calculated as the frame number times the previous frame's blocksize, or zero if it is the first frame).
1370 </li>
1371 <li>
1372 The "UTF-8" coding used for the sample/frame number is the same variable length code used to store compressed UCS-2, extended to handle larger input.
1373 </li>
1374 </ul>
1375 </td>
1376 </tr>
1377 </table>
1378 </td></tr></table>
1379 </div>
1381 <br />
1386 <tr>
1389 </td>
1390 </tr>
1391 <tr>
1394 </td>
1395 <td>
1396 CRC-16 (polynomial = x^16 + x^15 + x^2 + x^0, initialized with 0) of everything before the crc, back to and including the frame header sync code
1397 </td>
1398 </tr>
1399 </table>
1400 </td></tr></table>
1401 </div>
1403 <br />
1408 <tr>
1411 </td>
1412 </tr>
1413 <tr>
1416 </td>
1417 <td>
1418
1419 </td>
1420 </tr>
1421 <tr>
1423 <a href="#subframe_constant"><i>SUBFRAME_CONSTANT</i></a><br />|| <a href="#subframe_fixed"><i>SUBFRAME_FIXED</i></a><br />|| <a href="#subframe_lpc"><i>SUBFRAME_LPC</i></a><br />|| <a href="#subframe_verbatim"><i>SUBFRAME_VERBATIM</i></a>
1424 </td>
1426 The SUBFRAME_HEADER specifies which one.
1427 </td>
1428 </tr>
1429 </table>
1430 </td></tr></table>
1431 </div>
1433 <br />
1438 <tr>
1441 </td>
1442 </tr>
1443 <tr>
1446 </td>
1447 <td>
1448 Zero bit padding, to prevent sync-fooling string of 1s
1449 </td>
1450 </tr>
1451 <tr>
1454 </td>
1455 <td>
1456 Subframe type:
1457 <ul>
1458 <li>
1460 </li>
1461 <li>
1463 </li>
1464 <li>
1466 </li>
1467 <li>
1469 </li>
1470 <li>
1471 <tt>001xxx</tt> : if(xxx <= 4) <a href="#subframe_fixed">SUBFRAME_FIXED</a>, xxx=order ; else reserved
1472 </li>
1473 <li>
1475 </li>
1476 <li>
1478 </li>
1479 </ul>
1480 </td>
1481 </tr>
1482 <tr>
1485 </td>
1486 <td>
1487 'Wasted bits-per-sample' flag:
1488 <ul>
1489 <li>
1491 </li>
1492 <li>
1493 <tt>1</tt> : k wasted bits-per-sample in source subblock, k-1 follows, unary coded; e.g. k=3 => 001 follows, k=7 => 0000001 follows.
1494 </li>
1495 </ul>
1496 </td>
1497 </tr>
1498 </table>
1499 </td></tr></table>
1500 </div>
1502 <br />
1507 <tr>
1510 </td>
1511 </tr>
1512 <tr>
1515 </td>
1516 <td>
1517 Unencoded constant value of the subblock, n = frame's bits-per-sample.
1518 </td>
1519 </tr>
1520 </table>
1521 </td></tr></table>
1522 </div>
1524 <br />
1529 <tr>
1532 </td>
1533 </tr>
1534 <tr>
1537 </td>
1538 <td>
1539 Unencoded warm-up samples (n = frame's bits-per-sample * predictor order).
1540 </td>
1541 </tr>
1542 <tr>
1545 </td>
1546 <td>
1547 Encoded residual
1548 </td>
1549 </tr>
1550 </table>
1551 </td></tr></table>
1552 </div>
1554 <br />
1559 <tr>
1562 </td>
1563 </tr>
1564 <tr>
1567 </td>
1568 <td>
1569 Unencoded warm-up samples (n = frame's bits-per-sample * lpc order).
1570 </td>
1571 </tr>
1572 <tr>
1575 </td>
1576 <td>
1578 </td>
1579 </tr>
1580 <tr>
1583 </td>
1584 <td>
1585 Quantized linear predictor coefficient shift needed in bits (NOTE: this number is signed two's-complement).
1586 </td>
1587 </tr>
1588 <tr>
1591 </td>
1592 <td>
1593 Unencoded predictor coefficients (n = qlp coeff precision * lpc order) (NOTE: the coefficients are signed two's-complement).
1594 </td>
1595 </tr>
1596 <tr>
1599 </td>
1600 <td>
1601 Encoded residual
1602 </td>
1603 </tr>
1604 </table>
1605 </td></tr></table>
1606 </div>
1608 <br />
1613 <tr>
1616 </td>
1617 </tr>
1618 <tr>
1621 </td>
1622 <td>
1623 Unencoded subblock; n = frame's bits-per-sample, i = frame's blocksize.
1624 </td>
1625 </tr>
1626 </table>
1627 </td></tr></table>
1628 </div>
1630 <br />
1635 <tr>
1638 </td>
1639 </tr>
1640 <tr>
1643 </td>
1644 <td>
1645 Residual coding method:<br />
1646 <ul>
1647 <li>
1648 <tt>00</tt> : partitioned Rice coding with 4-bit Rice parameter; RESIDUAL_CODING_METHOD_PARTITIONED_RICE follows
1649 </li>
1650 <li>
1651 <tt>01</tt> : partitioned Rice coding with 5-bit Rice parameter; RESIDUAL_CODING_METHOD_PARTITIONED_RICE2 follows
1652 </li>
1653 <li>
1655 </li>
1656 </ul>
1657 </td>
1658 </tr>
1659 <tr>
1663 </td>
1664 <td>
1665
1666 </td>
1667 </tr>
1668 </table>
1669 </td></tr></table>
1670 </div>
1672 <br />
1677 <tr>
1679 <a name="partitioned_rice"><font size="+1"><b>RESIDUAL_CODING_METHOD_PARTITIONED_RICE</b></font></a>
1680 </td>
1681 </tr>
1682 <tr>
1685 </td>
1686 <td>
1687 Partition order.
1688 </td>
1689 </tr>
1690 <tr>
1693 </td>
1694 <td>
1695 There will be 2^order partitions.
1696 </td>
1697 </tr>
1698 </table>
1699 </td></tr></table>
1700 </div>
1702 <br />
1707 <tr>
1710 </td>
1711 </tr>
1712 <tr>
1715 </td>
1716 <td>
1717 Encoding parameter:<br />
1718 <ul>
1719 <li>
1721 </li>
1722 <li>
1723 <tt>1111</tt> : Escape code, meaning the partition is in unencoded binary form using n bits per sample; n follows as a 5-bit number.
1724 </li>
1725 </ul>
1726 </td>
1727 </tr>
1728 <tr>
1731 </td>
1732 <td>
1733 Encoded residual. The number of samples (n) in the partition is determined as follows:<br />
1734 <ul>
1735 <li>
1736 if the partition order is zero, n = frame's blocksize - predictor order
1737 </li>
1738 <li>
1739 else if this is not the first partition of the subframe, n = (frame's blocksize / (2^partition order))
1740 </li>
1741 <li>
1742 else n = (frame's blocksize / (2^partition order)) - predictor order
1743 </li>
1744 </ul>
1745 </td>
1746 </tr>
1747 </table>
1748 </td></tr></table>
1749 </div>
1751 <br />
1756 <tr>
1758 <a name="partitioned_rice2"><font size="+1"><b>RESIDUAL_CODING_METHOD_PARTITIONED_RICE2</b></font></a>
1759 </td>
1760 </tr>
1761 <tr>
1764 </td>
1765 <td>
1766 Partition order.
1767 </td>
1768 </tr>
1769 <tr>
1772 </td>
1773 <td>
1774 There will be 2^order partitions.
1775 </td>
1776 </tr>
1777 </table>
1778 </td></tr></table>
1779 </div>
1781 <br />
1786 <tr>
1789 </td>
1790 </tr>
1791 <tr>
1794 </td>
1795 <td>
1796 Encoding parameter:<br />
1797 <ul>
1798 <li>
1800 </li>
1801 <li>
1802 <tt>11111</tt> : Escape code, meaning the partition is in unencoded binary form using n bits per sample; n follows as a 5-bit number.
1803 </li>
1804 </ul>
1805 </td>
1806 </tr>
1807 <tr>
1810 </td>
1811 <td>
1812 Encoded residual. The number of samples (n) in the partition is determined as follows:<br />
1813 <ul>
1814 <li>
1815 if the partition order is zero, n = frame's blocksize - predictor order
1816 </li>
1817 <li>
1818 else if this is not the first partition of the subframe, n = (frame's blocksize / (2^partition order))
1819 </li>
1820 <li>
1821 else n = (frame's blocksize / (2^partition order)) - predictor order
1822 </li>
1823 </ul>
1824 </td>
1825 </tr>
1826 </table>
1827 </td></tr></table>
1828 </div>
1832 <!-- @@@ oh so hacky -->
1833 <table>
1834 <tr>
1837 </td>
1839 <a href="http://sourceforge.net"><img src="http://sflogo.sourceforge.net/sflogo.php?group_id=13478&type=1" width="88" height="31" border="0" alt="SourceForge.net Logo" /></a>
1840 </td>
1842 <a href="http://www.eff.org/cafe/"><img src="images/cafebug.gif" alt="CAFE Logo" border="0" /></a><br />
1843 </td>
1845 <a href="http://validator.w3.org/check?uri=referer"><img src="http://www.w3.org/Icons/valid-xhtml10" alt="Valid XHTML 1.0!" height="31" width="88" border="0" hspace="0" /></a>
1846 </td>
1847 </tr>
1848 </table>
1849 </div>
1851 </body>
1852 </html>