Talk:G.711

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

This is the talk page for discussing improvements to the G.711 article.
This is not a forum for general discussion of the article's subject.

Put new text under old text. Click here to start a new topic.
New to Wikipedia? Welcome! Learn to edit; get help.

Article policies

Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL

Telecommunications Mid‑importance

	Telecommunication portal This article is within the scope of WikiProject Telecommunications, a collaborative effort to improve the coverage of Telecommunications on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.TelecommunicationsWikipedia:WikiProject TelecommunicationsTemplate:WikiProject TelecommunicationsTelecommunications
Mid	This article has been rated as Mid-importance on the project's importance scale.

Computing: Networking / Software Low‑importance

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
Low	This article has been rated as Low-importance on the project's importance scale.
	This article is supported by Networking task force (assessed as Low-importance).
	This article is supported by WikiProject Software (assessed as Low-importance).

Technology

This article is within the scope of WikiProject Technology, a collaborative effort to improve the coverage of technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.TechnologyWikipedia:WikiProject TechnologyTemplate:WikiProject TechnologyTechnology

Talk

I don't understand that compressed s0000000wxyza... uncompressed s000wxyz part at all. Maybe someone can explain it? Thanks, --Abdull 18:23, 4 Apr 2005 (UTC)

I have added a couple of examples which I hope make it clearer. Alf Boggis (talk) 08:46, 24 October 2005 (UTC)[reply]

G711 also samples at 24KHz???

I am looking at a streaming product on www.barix.com and the manual for their "Instreamer" says that it can stream G711 at 8 AND 24KHz however there is no mention that this codec is capable of doing that in this article?? Could someone who is technical explain and possibly edit the article with this extra information. —Preceding unsigned comment added by 165.228.113.73 (talk) 03:19, 7 March 2008 (UTC)[reply]

On 23rd October 2005, user 212.56.108.219 added the following to the article:

From memory ( The detail could well be wrong ) A law compresses Linear value 4096 to 127 XOR 0x55 Linear value 0 to 0 XOR 0x55 Linear value -4096 to -128 XOR 0x55
u - law compresses Linear value 8197 to 0x01 Linear value 0 to 0x7F Linear value -0 to 0x80 Linear value -8197 to 0xFF
The 'zero' for A - law is 0 XOR 0x55. The 'zero' for u - law is + 127

I think it would be good to include this, but I don't have time to check at the moment so I have put it here for the record. Alf Boggis (talk) 08:39, 24 October 2005 (UTC)[reply]

Silent A-law

Hi,

I have been looking into the G.711/G.726 recommendations, and it seem to me that a silent soundstream (PCM data of value zero) should result in the A-law encoded codewords of 0xD5, not 0x55.

Regards, Jacob

The text tell there is a 0.125ms algorithmic delay.

 This is not true : if the decoding is done in hardware the Bytes are decoded on the fly

There is no algorithmic delay, Laurent.

0x55 is negative 0, 0xd5 is positive 0. You may pick one to be the real zero, but I don't think G.711 specifies which. Carewolf (talk) 09:01, 1 December 2009 (UTC)[reply]

Total cock-up of sign bit

The sign bit simply doesn't work this way in signed PCM. The examples are only valid for s = 0. For s = 1 there are 1s following which are removed, not zeroes.

Laurent is right - there is zero algorithmic delay.

And there is also no widely-accepted convention on bit numbering. IBM number 128 as bit 0 and 1 as bit 7. This is *why* the ITU define a convention. —Preceding unsigned comment added by 213.123.226.227 (talk) 23:09, 17 June 2009 (UTC)[reply]

It is worse than that but gets difficult to explain in the text. G.711 uses sign=1 as positive and sign=0 as negative unlike normal 2-compliment numbers. So a ordinary negative number is converted like this: if v<0 then s=0; v=1-v else s=0x80; v=v; Carewolf (talk) 09:05, 1 December 2009 (UTC)[reply]

A-law simplicity

The article states that A-law is easier to compute than μ-Law. There is nothing in the main A-law or μ-Law articles to support that statement. Shouldn't this be moved to the A-law article? Same goes for the algorithm for computing each codec that Alf Boggis talks about above. Dinjiin (talk) —Preceding undated comment added 20:47, 5 August 2011 (UTC).[reply]

A-law is easier to compute than mu-law. The difference is not big anymore compared to so many other encodings. One of the problems is that mu-law does not encode a full binary spectrum, (it encodes more than 13bit but not fully 14bit), that makes it more expensive to encode to and from since all other encodings encode a binary spectrum. For instance to convert from 16bit to 13bit (for a-law) is shifting 3bit, but to convert to (-8160-8159) mu-law is to shift 2bit and then subtract a shift by 8 bit and add a shift by 12bit, if I remember correctly. Carewolf (talk) 15:06, 16 August 2011 (UTC)[reply]

External links modified

Hello fellow Wikipedians,

I have just modified one external link on G.711. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

Added archive https://web.archive.org/web/20060720180425/http://www.codeproject.com/csharp/g711audio.asp to http://www.codeproject.com/csharp/g711audio.asp

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 5 June 2024).

If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 08:20, 9 October 2017 (UTC)[reply]