Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,095
Loading for parallel binary channels
- IEEE Trans. Commun
"... Abstract—We develop optimal probability loading for parallel binary channels, subject to a constraint on the total probability of sending ones. The distinctions from the waterfilling power loading for parallel Gaussian channels, particularly the latter’s “dropping ” of poor-quality channels, are hig ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract—We develop optimal probability loading for parallel binary channels, subject to a constraint on the total probability of sending ones. The distinctions from the waterfilling power loading for parallel Gaussian channels, particularly the latter’s “dropping ” of poor-quality channels
Algebraic Information Theory For Binary Channels
"... We study the algebraic structure of the monoid of binary channels and show that it is dually isomorphic to the interval domain over the unit interval with the operation from [3]. We show that the capacity of a binary channel is Scott continuous as a map on the interval domain and that its restrictio ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
We study the algebraic structure of the monoid of binary channels and show that it is dually isomorphic to the interval domain over the unit interval with the operation from [3]. We show that the capacity of a binary channel is Scott continuous as a map on the interval domain and that its
Iterative decoding of binary block and convolutional codes
- IEEE TRANS. INFORM. THEORY
, 1996
"... Iterative decoding of two-dimensional systematic convolutional codes has been termed “turbo” (de)coding. Using log-likelihood algebra, we show that any decoder can he used which accepts soft inputs-including a priori values-and delivers soft outputs that can he split into three terms: the soft chann ..."
Abstract
-
Cited by 610 (43 self)
- Add to MetaCart
channel and a priori inputs, and the extrinsic value. The extrinsic value is used as an a priori value for the next iteration. Decoding algorithms in the log-likelihood domain are given not only for convolutional codes hut also for any linear binary systematic block code. The iteration is controlled by a
Information Processing by a Noisy Binary Channel
"... We study the information processing properties of a binary channel receiving data from a gaussian source. A systematic comparison with linear processing is done. A remarkable property of the binary sytem is that, as the ratio ff between the number of output and input units increases, binary processi ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
We study the information processing properties of a binary channel receiving data from a gaussian source. A systematic comparison with linear processing is done. A remarkable property of the binary sytem is that, as the ratio ff between the number of output and input units increases, binary
Good Error-Correcting Codes based on Very Sparse Matrices
, 1999
"... We study two families of error-correcting codes defined in terms of very sparse matrices. "MN" (MacKay--Neal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties. The ..."
Abstract
-
Cited by 750 (23 self)
- Add to MetaCart
. The decoding of both codes can be tackled with a practical sum-product algorithm. We prove that these codes are "very good," in that sequences of codes exist which, when optimally decoded, achieve information rates up to the Shannon limit. This result holds not only for the binary-symmetric channel
The Capacity of Low-Density Parity-Check Codes Under Message-Passing Decoding
, 2001
"... In this paper, we present a general method for determining the capacity of low-density parity-check (LDPC) codes under message-passing decoding when used over any binary-input memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly chos ..."
Abstract
-
Cited by 574 (9 self)
- Add to MetaCart
In this paper, we present a general method for determining the capacity of low-density parity-check (LDPC) codes under message-passing decoding when used over any binary-input memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly
MACAW: A Media Access Protocol for Wireless LAN's
"... In recent years, a wide variety of mobile computing devices has emerged, including portables, palmtops, and personal digital assistants. Providing adequate network connectivity for these devices will require a new generation of wireless LAN technology. In this paper we study media access protocols f ..."
Abstract
-
Cited by 839 (11 self)
- Add to MetaCart
for a single channel wireless LAN being developed at Xerox Corporation's Palo Alto Research Center. We start with the MACA media access protocol rst proposed by Karn [9] and later refined by Biba [3] which uses an RTS-CTS-DATA packet exchange and binary exponential backo. Using packet
Performance Analysis of the IEEE 802.11 Distributed Coordination Function
, 2000
"... Recently, the IEEE has standardized the 802.11 protocol for Wireless Local Area Networks. The primary medium access control (MAC) technique of 802.11 is called distributed coordination function (DCF). DCF is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme with binary slott ..."
Abstract
-
Cited by 1869 (1 self)
- Add to MetaCart
Recently, the IEEE has standardized the 802.11 protocol for Wireless Local Area Networks. The primary medium access control (MAC) technique of 802.11 is called distributed coordination function (DCF). DCF is a carrier sense multiple access with collision avoidance (CSMA/CA) scheme with binary
Constrained Coding for Binary Channels with High Intersymbol Interference
- IEEE TRANS. INFORM. THEORY
, 1999
"... Partial-response (PR) signalling is used to model communications channels with intersymbol interference (ISI) such as the magnetic recording channel and the copper wire channel for digital subscriber lines. Coding for improving noise immunity in higher-order partial response channels, such as the &q ..."
Abstract
-
Cited by 16 (8 self)
- Add to MetaCart
Partial-response (PR) signalling is used to model communications channels with intersymbol interference (ISI) such as the magnetic recording channel and the copper wire channel for digital subscriber lines. Coding for improving noise immunity in higher-order partial response channels
THE ENTROPY RATE OF A BINARY CHANNEL WITH SLOWLY SWITCHING INPUT
, 2006
"... Abstract. In this note an asymptotic lower bound is derived for the entropy rate of the output of binary channel, whose input is a slowly switching Markov chain. The proof relies on certain concentration properties of conditional distribution (filtering) process. 1. ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. In this note an asymptotic lower bound is derived for the entropy rate of the output of binary channel, whose input is a slowly switching Markov chain. The proof relies on certain concentration properties of conditional distribution (filtering) process. 1.
Results 1 - 10
of
3,095
