Jump to content
 







Main menu
   


Navigation  



Main page
Contents
Current events
Random article
About Wikipedia
Contact us
Donate
 




Contribute  



Help
Learn to edit
Community portal
Recent changes
Upload file
 








Search  

































Create account

Log in
 









Create account
 Log in
 




Pages for logged out editors learn more  



Contributions
Talk
 



















Contents

   



(Top)
 


1 Type I/Type II descriptions  
1 comment  




2 Difference between ARQ & HARQ  
2 comments  




3 Requested move  
5 comments  




4 Separate correction and detection codes?  
1 comment  













Talk:Hybrid automatic repeat request




Page contents not supported in other languages.  









Article
Talk
 

















Read
Edit
Add topic
View history
 








Tools
   


Actions  



Read
Edit
Add topic
View history
 




General  



What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Get shortened URL
Download QR code
 




Print/export  



Download as PDF
Printable version
 
















Appearance
   

 






From Wikipedia, the free encyclopedia
 


Type I/Type II descriptions

[edit]

As far as I can see the descriptions here have been pulled out of the author's backside, please refer to http://www.eurasip.org/Proceedings/Ext/IST05/papers/323.pdf for a proper description of these techniques.

John —Preceding unsigned comment added by 94.192.138.18 (talk) 16:47, 8 February 2010 (UTC)[reply]

Difference between ARQ & HARQ

[edit]

can anyone tell me what is the difference between ARQ & HARQ Thanks in advance —Preceding unsigned comment added by 203.199.255.131 (talkcontribs) 13:05, 2 May 2007 (UTC)[reply]

My understanding is that ARQ refers to the basic strategy of retransmitting data packets in the event of a decoding error at the receiver. Hybrid-ARQ necessarily implies the presence of forward error correction (FEC) in these data packets; thus, the rate decreases, but throughput should increase as a result of applying coding. Hybrid-ARQ allows for various FEC encoding and decoding strategies (such as Chase combining and incremental redundancy). Flashantenna 17:46, 12 September 2007 (UTC)[reply]

Requested move

[edit]

According to WP naming conventions, spelled out words should be preferred over abbreviations, unless the topic is known almost exclusively by its abbreviation and is widely known and used in that form. --Pgan002 11:06, 24 July 2007 (UTC)[reply]

This article has been renamed from Hybrid ARQtoHybrid automatic repeat-request as the result of a move request. While I am aware that the request was changed to omit the hyphen, consistency requires it for now. --Stemonitis 18:23, 30 July 2007 (UTC)[reply]

There is no need for a separate entry with hyphen (Hybrid automatic repeat-request) that just redirects to the main page without hyphen (Hybrid automatic repeat request). I suggest that the redirect with hyphen be deleted. Isheden (talk) 14:41, 7 July 2010 (UTC)[reply]

Separate correction and detection codes?

[edit]

The text implies that a separate code is used for the error correction and error detection. Is that really the case? A single code with a high Hamming distance can be used for both purposes simultaneously. LachlanA (talk) 08:32, 15 August 2011 (UTC)[reply]


Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Hybrid_automatic_repeat_request&oldid=1202859651"

Categories: 
Start-Class Computing articles
Low-importance Computing articles
Start-Class Computer networking articles
Mid-importance Computer networking articles
Start-Class Computer networking articles of Mid-importance
All Computer networking articles
All Computing articles
Start-Class Telecommunications articles
Mid-importance Telecommunications articles
 



This page was last edited on 3 February 2024, at 17:50 (UTC).

Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.



Privacy policy

About Wikipedia

Disclaimers

Contact Wikipedia

Code of Conduct

Developers

Statistics

Cookie statement

Mobile view



Wikimedia Foundation
Powered by MediaWiki