ArticlePDF Available

Low-complexity Near-optimal Detection of Dc^2-Balanced Codes

Wiley
Electronics Letters
Authors:
  • Turing Machines Inc

Abstract and Figures

Two constructions of a low-complexity near-optimal detection method of dc2-balanced codes are presented. The methods presented are improvements on Slepian's algorithm for optimal detection of permutation codes.
Content may be subject to copyright.
Low-complexity near-optimal detection of
dc
2
-balanced codes
K.A.S. Immink
Two constructions of a low-complexity near-optimal detection method
of dc
2
-balanced codes are presented. The methods presented are
improvements on Slepians algorithm for optimal detection of permu-
tation codes.
Introduction: dc-Balanced codes have been widely applied in trans-
mission and storage systems to counter, for example, the effects of
low-frequency cut-off [1] and low-frequency disturbances arising from
ngerprints on optical discs, such as compact disc and so on. [2].
dc
2
-Balanced or second-order spectral zero codes exhibit the property
that both the power spectrum and its second derivative are zero at
zero frequency, resulting in signicant suppression of spectral com-
ponents at low frequencies [3]. Implementation examples of higher-
order spectral codes have been presented by Roth et al. [4], Skachek
et al. [5], and Yang [6]. The efcient detection of such codes has not
been investigated.
Slepian [7] presented a simple method for maximum-likelihood
detection of dc-balanced codewords when they are corrupted with addi-
tive Gaussian noise. Such a simple, but optimal, detection method is not
available for dc
2
-balanced codes. We will present two simple sub-
optimal, but close-to-optimal, detection methods for dc
2
-balanced
codes. We start with a description of the relevant prior art, followed
by a presentation of a close-to-optimal detection scheme.
Prior art: We consider a codebook, S, of chosen binary codewords x=
(x
1
,x
2
,,x
n
) over the binary alphabet Q={0,1}, where n, the length
of x, is a positive integer. We dene the unbalance terms,
w
1
(x) and
w
2
(x), of the codeword xby
w
1(x)=
n
i=1
xin
2(1)
and
w
2(x)=
n
i=1
ixin(n+1)
4(2)
In [3], constrained codes were presented, where the codebook Sis
chosen such that each codeword xSsatises two conditions, namely
w
1(x)=0 (3)
and
w
2(x)=0 (4)
A codebook that satises condition (3) is called a balanced code, while a
code that satises both conditions (3) and (4) is called a dc2balanced
code. dc
2
-Balanced codes have desirable practical features. First, the
minimum Hamming distance of Sis four [3]. Secondly, both the
power spectrum and its second derivative are zero at zero frequency,
which is a prerequisite for some channels.
Let the number of codewords of length nthat satisfy (3) and (4) be
denoted by N
dc
2
(n). It has been found [3] that N
dc
2
(n)=0 if
nmod 4=0. Prodinger [8] computed the number of dc
2
-balanced
codewords, N
dc
2
(n), for asymptotically large vales of n, namely
Ndc2(n)4
3
p
2n
n2,nmod 4=0 (5)
The redundancy of dc
2
-balanced codes, denoted by r
dc
2
(n), is approxi-
mated by
rdc2(n)=nlog2Ndc2(n)2log2n1.141,n1 (6)
Detection: We assume that the sent codeword, xS, is received as the
n-vector r=x+ν,ri[R, where the sent word is corrupted by additive
Gaussian noise ν=(ν
1
,,ν
n
), ni[Rwith distribution N(0, σ
2
), where
s
2[Rdenotes the variance of the additive noise. The well-known
(squared) Euclidean distance between the received signal vector rand
the codeword ˆ
xis dened by
d
(r,ˆ
x)=
n
i=1
(riˆ
xi)2(7)
A minimum Euclidean distance detector outputs the codeword
xo=arg min
ˆ
x[S
d
(r,ˆ
x) (8)
The above exhaustive search for the nearestcodeword at minimum dis-
tance to the received vector is expensive, especially for large codeword
sets since |S| grows exponentially with increasing n. Slepian [7] showed
that maximum-likelihood detection of a permutation code can be per-
formed in a simple way without exhaustively computing (7) for all code-
words in S. Clearly, a balanced code is a permutation code, where, as
each codeword that satises (3), is a permutation of a given binary
word having n/2 1s and 0s. We dene the sorted values r
(1)
,,
r
(n)
to be a permutation of the received symbols r
1
,,r
n
such that
r
(1)
r
(2)
··· r
(n)
. Following Slepians algorithm [7], the receiver
sets the n/2 least-valued symbols, r
(1)
r
(n/2)
,to0and the other
symbols, r
(n/2+1)
r
(n)
,to1. Slepians algorithm is attractive since
the complexity of sorting nsymbols grows with nlog n, which is far
less complex than the evaluation of (8).
Adc
2
-balanced code is not a permutation code so that Slepians
optimal method cannot be applied. Below we work out two sub-optimal
methods, which are based upon Slepians method.
10.0 10.5 11.0 11.5 12.0 12.5 13.0 13.5 14.0
10−5
10−4
10−3
10−1
10−1
100
WER
SNR, dB
a
c
b
Fig. 1 WER, computed and simulated, as function of SNR = 1/σ(dB) for n =
20. Curves (a) and (b) show the results, where the sub-optimal detector,
Strategies A and B, are used, while curve (c) shows the result for the
optimal detector using (8)
Sub-optimal detection of dc
2
-balanced codes: We sort the received
symbols from their least to greatest values, and in a rst guess,in
analogy with Slepians[7] algorithm, the receiver sets the n/2 least
symbols to 0, and the other n/2 symbols to 1. Let the rst guess
dc-balanced word so obtained be denoted by ˆ
x=(ˆx1,...,ˆxn).
Clearly,
w
1(ˆ
x)=0. If
w
2(ˆ
x)=0, the word is accepted, and forwarded
to the user. If, however,
w
2(ˆ
x)=0, the receiver may choose between
various strategies. We have worked out two strategies.
Strategy A: The simplest strategy is the swapping of 1and 0symbols
of ˆ
xthat were received with least reliability, that is swapping r
(n/2)
and
r
(n/2+1)
and their associated symbol values.
Strategy B: Let d=
w
2(ˆ
x).0. Then, for 1 indif ˆ
xi=0 and
ˆ
xi+d=1, we swap the symbols ˆ
xiand ˆ
xi+d. The word obtained after
the swap satises (4). If there are multiple swaps that satisfy (4), we
weigh the swaps with their relative reliability of the received samples,
and accept the most reliable swap. If d< 0, we may write down a
similar algorithm, which is not presented here for reasons of space.
The strategy requires at most ncomparisons.
Simulations: We performed various computer simulations for assessing
the performance of the sub-optimal detector strategies described above.
Fig. 1shows some typical results, where, for n= 20, the word error rate
(WER) is plotted versus the signal-to-noise ratio = 1/σ, for the optimal
and sub-optimal detectors. We note that Strategy A, attractive as it is
very simple to implement, is far from optimal with a loss of around
2 dB. Strategy B performs close to optimality with a loss of 0.2 dB in
the range investigated.
Conclusions: We have presented two sub-optimal detectors for
dc
2
-balanced codes. The new detectors are based on Slepians optimal
detection method of permutation codes such as dc-balanced codes.
We assessed the error performance of the new detectors using computer
simulations.
© The Institution of Engineering and Technology 2016
Submitted: 11 November 2015
doi: 10.1049/el.2015.3933
K.A.S. Immink (Turing Machines Inc, Willemskade 15b-d, 3016 DK
Rotterdam, The Netherlands)
E-mail: immink@turing-machines.com
References
1 Cattermole, K.W.: Principles of digital line coding,Int. J. Electron.,
1983, 55, pp. 333
2 Immink, K.A.S.: A survey of codes for optical disk recording,IEEE
J. Sel. Areas Commun., 2001, 19, (4), pp. 756764
3 Immink, K.A.S., and Beenker, G.F.M.: Binary transmission codes with
higher order spectral zeros at zero frequency,IEEE Trans. Inf. Theory,
1987, IT-33, (3), pp. 452454
4 Roth, R.M., Siegel, P.H., and Vardy, A.: Higher-order spectral-null
codes: constructions and bounds,IEEE Trans. Inf. Theory, 1994,
IT-40, pp. 18261840
5 Skachek, V., Etzion, T., and Roth, R.M.: Efcient encoding algorithm
for third-order spectral-null codes,IEEE Trans. Inf. Theory, 1998,
IT-44, pp. 846851
6 Yang, C.N.: Design of efcient second-order spectral-null codes,IEEE
Trans. Inf. Theory, 2005, IT-51, (4), pp. 15801584
7 Slepian, D.: Permutation modulation,Proc. IEEE, 1965, 53,
pp. 228236
8 Prodinger, H.: On the number of partitions of {1, ,n} into two sets of
equal cardinalities and equal sums,Can. Math. Bull., 1982, 25, (2),
pp. 238241
... The number of dc 2 -balanced codewords [7], [10], N dc 2 (n), for asymptotically large n, n mod 4 = 0, can be found by substituting s = n 2 = µ s and p = n(n + 1) 4 = µ p , into (19). Then we obtain ...
Article
We consider the transmission and storage of data that use coded binary symbols over a channel, where a Pearsondistance-based detector is used for achieving resilience against additive noise, unknown channel gain, and varying offset. We study Minimum Pearson Distance (MPD) detection in conjunction with a set, S, of codewords satisfying a center-of-mass constraint. We investigate the properties of the codewords in S, compute the size of S, and derive its redundancy for asymptotically large values of the codeword length n. The redundancy of S is approximately 3/2 log2 n + α where α = log2 √π/24 =-1.467. for n odd and α =-0.467. for n even. We describe a simple encoding algorithm whose redundancy equals 2 log2 n + o(log n). We also compute the word error rate of the MPD detector when the channel is corrupted with additive Gaussian noise.
Article
Full-text available
Codes were designed for optical disk recording system and future options were explored. The designed code was a combination of dc-free and runlength limited (DCRLL) codes. The design increased minimum feature size for replication and sufficient rejection of low-frequency components enabling a simple noise free tracking. Error-burst correcting Reed-Solomon codes were suggested for the resolution of read error. The features of DCRLL and runlength limited (RLL) sequences was presented and practical codes were devised to satisfy the given channel constraints. The mechanism of RLL codes supressed the components of the genarated sequences. The construction and performance of alternative Eight to fourteen modulation (EFM)-like codes was studied.
Article
Full-text available
An efficient algorithm is presented for encoding unconstrained information sequences into a third-order spectral-null code of length n and redundancy 9log2 n+O(log log n). The encoding can be implemented using O(n) integer additions and O(nlog n) counter increments
Article
Let A ( n ) be the number of partitions of { 1 , … , n } into two sets A, B of cardinality n /2 such that . Then there is the asymptotic result
Article
The role of line coding is to convert source data to a digital form resistant to noise in combination with such other impairments as a specific medium may suffer (notably intersymbol interference, digit timing jitter and carrier phase error), while being reasonably economical in the use of bandwidth. This paper discusses the nature and role of various constraints on code words and word sequences, including those commonly used on metallic lines, optical fibres, carrier channels and radio links ; and gives some examples from each of these applications. It should serve both as a general review of the subject and as an introduction to the companion papers on specific topics.
Conference Paper
Let T(n,k) denote the set of all words of length n over the alphabet {+1, -1}, having a kth order spectral-null at zero frequency. A subset of T(n,k) is a spectral-null code of length n and order k. Upper and lower bounds on the cardinality of T(n,k) are derived. In particular we prove that (k - 1) log2 (n/k) less-than-or-equal-to n - log2 \T(n,k)\ less-than-or-equal-to O(2k log2 n) for infinitely many values of n. On the other hand, we show that T(n,k) is empty unless n is divisible by 2m, where m = left-perpendicularlog2 kright-perpendicular + 1. Furthermore, bounds on the minimum Hamming distance d of T(n,k) are provided, showing that 2k less-than-or-equal-to d less-than-or-equal-to k(k - 1) + 2 for infinitely many n. We also investigate the minimum number of sign changes in a word x is-an-element-of T(n,k) and provide an equivalent definition of T(n,k) in terms of the positions of these sign changes. An efficient algorithm for encoding arbitrary information sequences into a second-order spectral-null code of redundancy 3 log2 n + O(log log n) is presented. Furthermore, we prove that the first nonzero moment of any word in T(n,k) is divisible by k! and then show how to construct a word with a spectral null of order k whose first nonzero moment is any even multiple of k!. This leads to an encoding scheme for spectral-null codes of length n and any fixed order k, with rate approaching unity as n --> infinity.
Article
An efficient recursive method has been proposed for the encoding/decoding of second-order spectral-null codes, via concatenation by Tallini and Bose. However, this method requires the appending of one, two, or three extra bits to the information word, in order to make a balanced code, with the length being a multiple of 4; this introduces redundancy. Here, we introduce a new quasi-second-order spectral-null code with the length equiv 2 (mod 4) and extend the recursive method of Tallini and Bose, to achieve a higher code rate
Article
A method is presented for designing binary channel codes in such a way that both the power spectral density function and its low-order derivatives vanish at zero frequency. The performance of the new codes is compared with that of channel codes designed with a constraint on the unbalance Of the number of transmitted positive and negative pulses. Some remarks are made on the error-correcting capabilities of these codes.
Article
A class of codes and decoders is described for transmitting digital information by means of bandlimited signals in the presence of additive white Gaussiau noise. The system, called permutation modulation, has many desirable features. Each code word requires the same energy for transmission. The receiver, which is maximum likelihood, is algebraic in nature, relatively easy to instrument, and does not require local generation of the possible sent messages. The probability of incorrect decoding is the same for each sent message. Certain of the permutation modulation codes are more efficient (in a sense described precisely) than any other known digital modulation scheme. PCM, ppm, orthogonal and biorthogonal codes are included as special cases of permutation modulation.
Higher‐order spectral‐null codes: constructions and bounds
  • Roth R.M.