Talk:Speex

message: Although not a formal part of the Ogg multimedia project... this doesn't seem to be true any more; Xiph lists Speex in their page about the Ogg project. TMC1221 04:55, Jan 29, 2004 (UTC)
Like FLAC, Speex can be put into an Ogg bit stream, but is usually NOT.  FLAC, Speex, and Ogg are all Xiph.org projects, but FLAC and Speex are not sub-projects of the Ogg project like Vorbis is.
(I am the author of Speex) No, Speex is almost *always* in an Ogg stream (when it's not used in VoIP). Speex is a Xiph.org project in the same way as Vorbis now and Vorbis is *not* a sub-project of the Ogg. Last thing, the content of this page is mainly taken from Speex manual and should be marked as such (i.e. give credit where credit is due).
:Thanks for pointing that out. I've marked the page as a copyright violation.
::It's not a copyright violation, but it is a licence violation.  I've added the credit and copyright information, in a similar form to that which we ask for (Wikipedia:Copyrights#Users.27_rights_and_obligations).  That look OK to you 130.. ? -- sannse (talk) 10:29, 1 Nov 2004 (UTC)
replies: text: FYI, a license violation is a copyright violation. "You're copying my work, do you have a license?" "Yes, I have the GNU FDL." "You aren't following the terms of the GNU FDL. Do you have another license?" "No." -> copyright violation. Graue 00:39, 20 May 2005 (UTC)
thread_title: Untitled comment

message: The quality scale says it goes from 0 to 10; but which is HIGHER quality. For instance, in some encoders, "0" is the highest quality, in others, "10" is the highest. What is it for Speex?
:According to, 0 is lowest (2.15 kbps) and 10 is highest (24.6 kbps). –Mysid 08:04, 21 November 2005 (UTC)
thread_title:  Quality Scale 

message: * I want to expand this article to describe the algorithm used in Speex (in more details than generic CELP). Is that the right place do to it? What are the guidelines as to how much details is appropriate? Jmvalin 13:25, 20 March 2006 (UTC)
thread_title:  Complete article 

message: Does anyone else claim that it is encumbered by patents?  If not, scratch the "claims to be". — Omegatron 00:08, 29 March 2006 (UTC)
replies: text: Going to court doesn't prove something is unencumbered by any patents.  All it can prove is that something is unencumbered by some specific patent.  There could be another patent lurking somewhere that the court case didn't address.Phr (talk) 06:23, 27 May 2006 (UTC)
replies: text: There is no real way AFAIK to 'prove' something isn't encumbered by patents. Claims to be is definitely the most accurate terminology since there has been no real search or anything AFAIK. Even Dirac doesn't claim it's definitely not encumbered by non-BBC patents, just that BBC has has extensive searches done Nil Einne 15:22, 11 January 2007 (UTC)
replies: text: Speex was specifically designed to avoid known patents in this field. For example, it avoids ACELP which is more computationally efficient. --Gmaxwell 04:28, 22 March 2007 (UTC)
thread_title:  "''claims to be'' unencumbered" 

message: I found this interesting comment from the author of speex: .  He discusses quality and comparisons with Ogg Vorbis.  That link might be useful as a reference. --Gronky (talk) 17:44, 20 April 2008 (UTC)
thread_title: Comment on quality

message: that would be a good addition to the article. --Rajah (talk) 03:22, 23 August 2008 (UTC)
thread_title: when was speex created?