By Topic

Asymptotic capacity of two-dimensional channels with checkerboard constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Nagy, Z. ; Dept. of Electr. & Comput. Eng., Univ. of California, La Jolla, CA, USA ; Zeger, K.

A checkerboard constraint is a bounded measurable set S⊂R2, containing the origin. A binary labeling of the Z2 lattice satisfies the checkerboard constraint S if whenever t∈Z2 is labeled 1, all of the other Z2-lattice points in the translate t+S are labeled 0. Two-dimensional channels that only allow labelings of Z2 satisfying checkerboard constraints are studied. Let A(S) be the area of S, and let A(S)→∞ mean that S retains its shape but is inflated in size in the form αS, as α→∞. It is shown that for any open checkerboard constraint S, there exist positive reals K1 and K2 such that as A(S)→∞, the channel capacity CS decays to zero at least as fast as (K1log2A(S))/A(S) and at most as fast as (K2log2A(S))/A(S). It is also shown that if S is an open convex and symmetric checkerboard constraint, then as A(S)→∞, the capacity decays exactly at the rate 4δ(S)(log2A(S))/A(S), where δ(S) is the packing density of the set S. An implication is that the capacity of such checkerboard constrained channels is asymptotically determined only by the areas of the constraint and the smallest (possibly degenerate) hexagon that can be circumscribed about the constraint. In particular, this establishes that channels with square, diamond, or hexagonal checkerboard constraints all asymptotically have the same capacity, since δ(S)=1 for such constraints.

Published in:

Information Theory, IEEE Transactions on  (Volume:49 ,  Issue: 9 )