[go: up one dir, main page]

Darabkh, 2011 - Google Patents

Evaluation of channel adaptive access point systemwith Fano decoding

Darabkh, 2011

Document ID
16215013283254018199
Author
Darabkh K
Publication year
Publication venue
International Journal of Computer Mathematics

External Links

Snippet

The popularity of wireless networks is increasing due to their mobility, flexibility, and scalability. High error rate over wireless channels leads current transmission control protocol congestion algorithms to be maintained. Finding approaches at lower layers to overcome …
Continue reading at www.tandfonline.com (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations contains provisionally no documents
    • H04L12/18—Arrangements for providing special services to substations contains provisionally no documents for broadcast or conference, e.g. multicast
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30861—Retrieval from the Internet, e.g. browsers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/28—Network-specific arrangements or communication protocols supporting networked applications for the provision of proxy services, e.g. intermediate processing or storage in the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00—Network arrangements or protocols for real-time communications
    • H04L65/40—Services or applications
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
    • H03M13/41—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Application independent communication protocol aspects or techniques in packet data networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163—Interprocessor communication
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00—Baseband systems
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring

Similar Documents

Publication Publication Date Title
Kramer et al. Edge-cut bounds on network coding rates
US9369255B2 (en) Method and apparatus for reducing feedback and enhancing message dissemination efficiency in a multicast network
Darabkh Evaluation of channel adaptive access point systemwith Fano decoding
Fong et al. Optimal streaming erasure codes over the three-node relay network
Censor-Hillel et al. Making asynchronous distributed computations robust to noise
Bauer* et al. Total delay compensation in LAN control systems and implications for scheduling
Badia Analysis of age of information under SR ARQ
Taghouti et al. On the joint design of compressed sensing and network coding for wireless communications
US20100027563A1 (en) Evolution codes (opportunistic erasure coding) platform
Abdul-Nabi et al. Efficient network coding solutions for limiting the effect of packet loss
Pahlevani et al. An analytical model for perpetual network codes in packet erasure channels
Lin et al. Considering retransmission mechanism and latency for network reliability evaluation in a stochastic computer network
Thangavel et al. Low power sleepy keeper technique based VLSI architecture of Viterbi decoder in WLANs
Ningthoujam et al. A Hybrid Protocol for Stop and Wait ARQ in Markov Two States Model
Mohammadi et al. Perpetual network coding for delay sensitive applications
Pristupa et al. Performance of forward error correction in transport protocol at intrasegment level
Chandrasekaran et al. A systematic study of coding performance in a MIMO–STBC–OFDM link
He et al. Popularity‐Guided Cost Optimization for Live Streaming in Mobile Edge Computing
Ridgewell et al. Network-coded internet-friendly transport protocol
Akash et al. Viterbi Decoder with Configurable Constraint Length with Bit Error Correction for Satellite Communication
Alabady et al. Analysis of the Effect of Binary OR Operation Property in Linear Network Coding Transmission Performance
Yang et al. Joint iterative decoding for pragmatic irregular LDPC-coded multi-relay cooperations
Zhong Age of information for real-time network applications
Wu et al. Research on the Selection Method of Output Degree Distributions for LT Codes
Park et al. Multi‐block FEC for reprogramming wireless sensor networks