This paper establishes a new unified method for fixed-length source coding problems of general sources. Specifically, we introduce an alternative definition of the smooth Rényi entropy of order zero, and show a unified approach to present the fixed-length coding rate in terms of this information quantity. Our definition of the smooth Rényi entropy has a clear operational meaning, and hence is easy to calculate for finite block lengths. Further, we represent various ε-source coding rate and the strong converse property for general sources in terms of the smooth Rényi entropy, and compare them with the results obtained by Han and Renner et al.

View full abstract

Low-density parity-check (LDPC) codes become very popular in channel coding, since they can achieve the performance close to maximum-likelihood (ML) decoding with linear complexity of the block length. Recently, Muramatsu et al. proposed a code using LDPC matrices for Slepian-Wolf source coding, and showed that their code can achieve any point in the achievable rate region of Slepian-Wolf source coding. However, since they employed ML decoding, their decoder needs to know the probability distribution of the source. Hence, it is an open problem whether there exists a universal code using LDPC matrices, where universal code means that the error probability of the code vanishes as the block length tends to infinity for all sources whose achievable rate region contains the rate pair of encoders. In this paper, we show the existence of a universal Slepian-Wolf source code using LDPC matrices for stationary memoryless sources.

View full abstract

In 1997, the author considered the separate coding system for two correlated memoryless Gaussian sources and squared distortion measures and determined the rate distortion region in a case where one source plays a role of the partial side information at the decoder. The above source coding system can be extended to a certain class of source network with several decoders, where each decoder has at most one full or partial side information. This class of source network is called the one-helps-one system. In this paper we consider a source network belonging to this class for correlated memoryless Gaussian sources and squared distortion measures. This source network was posed and investigated by Körner and Marton and was called the zig-zag source network. They studied the zig-zag source network in the case of discrete memoryless multiple sources. In this paper we study the zig-zag source network in the case of correlated memoryless Gaussian sources and square distortion. We determine the rate distortion region in a case where sources have a certain correlation property.

View full abstract

The coding rate of a one-shot Tunstall code for stationary and memoryless sources is investigated in non-universal situations so that the probability distribution of the source is known to the encoder and the decoder. When studying the variable-to-fixed length code, the average coding rate has been defined as (i) the codeword length divided by the average block length. We define the average coding rate as (ii) the expectation of the pointwise coding rate, and prove that (ii) converges to the same value as (i).

View full abstract

Maximum likelihood (ML) decoding of linear block codes can be considered as an integer linear programming (ILP). Since it is an NP-hard problem in general, there are many researches about the algorithms to approximately solve the problem. One of the most popular algorithms is linear programming (LP) decoding proposed by Feldman et al. LP decoding is based on the LP relaxation, which is a method to approximately solve the ILP corresponding to the ML decoding problem. Advanced algorithms for solving ILP (approximately or exactly) include cutting-plane method and branch-and-bound method. As applications of these methods, adaptive LP decoding and branch-and-bound decoding have been proposed by Taghavi et al. and Yang et al., respectively. Another method for solving ILP is the branch-and-cut method, which is a hybrid of cutting-plane and branch-and-bound methods. The branch-and-cut method is widely used to solve ILP, however, it is unobvious that the method works well for the ML decoding problem. In this paper, we show that the branch-and-cut method is certainly effective for the ML decoding problem. Furthermore the branch-and-cut method consists of some technical components and the performance of the algorithm depends on the selection of these components. It is important to consider how to select the technical components in the branch-and-cut method. We see the differences caused by the selection of those technical components and consider which scheme is most effective for the ML decoding problem through numerical simulations.

View full abstract

For cyclic codes some well-known lower bounds and some decoding methods up to the half of the bounds are suggested. Particularly, the shift bound is a good lower bound of the minimum distance for cyclic codes, Reed-Muller codes and geometric Goppa codes. In this paper we consider cyclic codes defined by their defining set, and new simple derivation of the shift bound using the discrete Fourier transform with unknown elements and the Blahut theorem is shown. Moreover two examples of binary cyclic codes are given.

View full abstract

Let q and f(x) be an odd characteristic and an irreducible polynomial of degree m over F_q, respectively. Then, suppose that F(x) = x^mf(x+x^-1) becomes irreducible over F_q. This paper shows that the conjugate zeros of F(x) with respect to F_q form a normal basis in F_q^2m if and only if those of f(x) form a normal basis in F_q^m and the part of conjugates given as follows are linearly independent over F_q,

{γ - γ^-1, (γ - γ^-1)^q, … , (γ - γ^-1)^qm-1},

where γ is a zero of F(x) and thus a proper element in F_q^2m. In addition, from the viewpoint of q-polynomial, this paper proposes an efficient method for checking whether or not the conjugate zeros of F(x) satisfy the condition.

View full abstract

This paper describes a least complex, high speed decoding method named multi-stage threshold decoding (MTD-DR). Each stage of MTD-DR is formed by the traditional threshold decoder with a special shift register, called difference register (DR). After flipping each information bit, DR helps to shorten the Hamming and the Euclidian distance between a received word and the decoded codeword for hard and soft decoding, respectively. However, the MTD-DR with self-orthogonal convolutional codes (SOCCs), type 1 in this paper, makes an unavoidable error group, which depends on the tap connection patterns in the encoder, and limits the error performance. This paper introduces a class of SOCCs type 2 which can breakdown that error group, as a result, MTD-DR gives better error performance. For a shorter code (code length =4200), hard and soft decoding MTD-DR achieves 4.7dB and 6.5dB coding gain over the additive white Gaussian noise (AWGN) channel at the bit error rate (BER) 10^-5, respectively. In addition, hard and soft decoding MTD-DR for a longer code (code length =80000) give 5.3dB and 7.1dB coding gain under the same condition, respectively. The hard and the soft decoding MTD-DR experiences error flooring at high E_b/N₀ region. For improving overall error performance of MTD-DR, this paper proposes parity check codes concatenation with soft decoding MTD-DR as well.

View full abstract

The multi-edge type LDPC codes, introduced by Richardson and Urbanke, present the general class of structured LDPC codes. In this paper, we derive the average weight distributions of the multi-edge type LDPC code ensembles. Furthermore, we investigate the asymptotic exponential growth rate of the average weight distributions and investigate the connection to the stability condition of the density evolution.

View full abstract

For decoding non-binary low-density parity-check (LDPC) codes, logarithm-domain sum-product (Log-SP) algorithms were proposed for reducing quantization effects of SP algorithm in conjunction with FFT. Since FFT is not applicable in the logarithm domain, the computations required at check nodes in the Log-SP algorithms are computationally intensive. What is worth, check nodes usually have higher degree than variable nodes. As a result, most of the time for decoding is used for check node computations, which leads to a bottleneck effect. In this paper, we propose a Log-SP algorithm in the Fourier domain. With this algorithm, the role of variable nodes and check nodes are switched. The intensive computations are spread over lower-degree variable nodes, which can be efficiently calculated in parallel. Furthermore, we develop a fast calculation method for the estimated bits and syndromes in the Fourier domain.

View full abstract

A novel self-synchronizable decoding algorithm for transmissions with redundant information is proposed. We assume that desynchronization occurs because a continuous deletion of bits in the channel. The decoder bases its decision on a metric which involves the syndrome and the Hamming distance between certain codeword and its corresponding updated codeword after one iteration of sum-product decoding. The foundation of the previous assumption relies on what we called “CP-distance.” The larger the CP-distance of a code the better the synchronization characteristics. Moreover, our proposal is not restricted to cyclically permutable (CP) codes as previous proposals. Theoretical foundation and experimental results show good performance of our algorithm.

View full abstract

In this paper, we consider the behavior of an autoregressive (AR) detector for partial-response (PR) signaling against offtrack interference (OTI) environment in perpendicular magnetic recording. Based on the behavior, we derive the optimum branch metric to construct the detector by the Viterbi algorithm. We propose an optimum AR detector for OTI that considers an optimum branch metric calculation and an estimation of noise power due to OTI in order to calculate an accurate branch metric. To evaluate the reliability of soft-output likelihood values calculated by our proposed AR detector, we demonstrate a bit error rate performance (BER) of low-density parity-check (LDPC) codes under OTI existing channel by computer simulation. Our simulation results show the proposed AR detector can achieve a better LDPC-coded BER performance than the conventional AR detector. We also show the BER performance of our proposal can keep within 0.5dB of the case that perfect channel state information regarding OTI is used in the detector. In addition, we show that the partial-response maximum-likelihood (PRML) detector is robust against OTI even if OTI is not handled by the detector.

View full abstract

We investigate the secret key agreement from correlated Gaussian sources in which the legitimate parties can use the public communication with limited rate. For the class of protocols with the one-way public communication, we show a closed form expression of the optimal trade-off between the rate of key generation and the rate of the public communication. Our results clarify an essential difference between the key agreement from discrete sources and that from continuous sources.

View full abstract

In this paper, we propose two new chosen-ciphertext (CCA) secure schemes from the computational Diffie-Hellman (CDH) and bilinear computational Diffie-Hellman (BCDH) assumptions. Our first scheme from the CDH assumption is constructed by extending Cash-Kiltz-Shoup scheme. This scheme yields the same ciphertext as that of Hanaoka-Kurosawa scheme (and thus Cramer-Shoup scheme) with cheaper computational cost for encryption. However, key size is still the same as that of Hanaoka-Kurosawa scheme. Our second scheme from the BCDH assumption is constructed by extending Boyen-Mei-Waters scheme. Though this scheme requires a stronger underlying assumption than the CDH assumption, it yields significantly shorter key size for both public and secret keys. Furthermore, ciphertext length of our second scheme is the same as that of the original Boyen-Mei-Waters scheme.

View full abstract

In this paper, we introduce the intermediate hashed Diffie-Hellman (IHDH) assumption which is weaker than the hashed DH (HDH) assumption (and thus the decisional DH assumption), and is stronger than the computational DH assumption. We then present two public key encryption schemes with short ciphertexts which are both chosen-ciphertext secure under this assumption. The short-message scheme has smaller size of ciphertexts than Kurosawa-Desmedt (KD) scheme, and the long-message scheme is a KD-size scheme (with arbitrary plaintext length) which is based on a weaker assumption than the HDH assumption.

View full abstract

To reduce the damage of key exposures, forward-secure group signature schemes have been first proposed by Song. In the forward-secure schemes, a secret key of a group member is updated by a one-way function every interval and the previous secret key is erased. Thus, even if a secret key is exposed, the signatures produced by the secret keys of previous intervals remain secure. Since the previous forward-secure group signature schemes are based on the strong RSA assumption, the signatures are longer than pairing-based group signatures. In addition, the complexity of the key update or signing/verification is O(T), where T is the total number of intervals. In this paper, a forward-secure group signature scheme from pairings is proposed. The complexity of our key update and signing/verification is O(log T).

View full abstract

We study the use of the additive white Gaussian noise channel to achieve a cryptographic primitive that is important in secure multiparty computation. A protocol for unconditionally secure oblivious transfer is presented. We show that channel input alphabets with a certain algebraic structure and their partitions are useful in achieving the requirements on the primitive. Signal design for a protocol with high information rate is discussed.

View full abstract

Silva et al. proposed a universal secure network coding scheme based on MRD codes, which can be applied to any underlying network code. This paper considers a stronger eavesdropping model where the eavesdroppers possess the ability to re-select the tapping links during the transmission. We give a proof for the impossibility of attaining universal security against such adversaries using Silva et al.'s code for all choices of code parameters, even with a restricted number of tapped links. We also consider the cases with restricted tapping duration and derive some conditions for this code to be secure.

View full abstract

This paper proposes a ternary subset difference method (SD method) that is resistant to coalition attacks. In order to realize a secure ternary SD method, we design a new cover-finding algorithm, label assignment algorithm and encryption algorithm. These algorithms are required to revoke one or two subtrees simultaneously while maintaining resistance against coalition attacks. We realize this two-way revocation mechanism by creatively using labels and hashed labels. Then, we evaluate the efficiency and security of the ternary SD method. We show that the number of labels on each client device can be reduced by about 20.4 percent. The simulation results show that the proposed scheme reduces the average header length by up to 15.0 percent in case where the total number of devices is 65, 536. On the other hand, the computational cost imposed on a client device stays within O(log n). Finally, we prove that the ternary SD method is secure against coalition attacks.

View full abstract

Based on the characteristics of the thresholds of two detection schemes employing locally optimum test statistics, a sequential detection design procedure is proposed and analyzed. The proposed sequential test, called the sequential locally optimum test (SLOT), inherently provides finite stopping time (terminates with probability one within the finite horizon), and thereby avoids undesirable forced termination. The performance of the SLOT is compared with that of the fixed sample-size test, sequential probability ratio test (SPRT), truncated SPRT, and 2-SPRT. It is observed that the SLOT requires smaller average sample numbers than other schemes at most values of the normalized signal amplitude while maintaining the error performance close to the SPRT.

View full abstract

In this paper, a new framework to characterize the tradeoff between diversity and multiplexing gains of Multi Input Multi Output (MIMO) wireless systems at finite Signal to Noise Ratios (SNRs) is presented. By suitable definitions of non-asymptotic diversity and multiplexing gains, we extract a useful tool to investigate the performance of space-time schemes at finite SNRs. Exact results on the diversity-multiplexing tradeoff (DMT) are derived for Multi Input Single Output (MISO), Single Input Multi Output (SIMO), and 2 × 2 MIMO channels. We show that our outcomes coincide with the Zheng and Tse's results at high SNRs. When the new definitions of non-asymptotic diversity and multiplexing gains are used, the resulted DMT converges to its asymptotic value at realistic SNRs. Furthermore, using these definitions enables the diversity gain to represent the outage probability with reasonable accuracy.

View full abstract

Variable block size motion estimation developed by the latest video coding standard H.264/AVC is the efficient approach to reduce the temporal redundancies. The intensive computational complexity coming from the variable block size technique makes the hardwired accelerator essential, for real-time applications. Propagate partial sums of absolute differences (Propagate Partial SAD) and SAD Tree hardwired engines outperform other counterparts, especially considering the impact of supporting variable block size technique. In this paper, the authors apply the architecture-level and the circuit-level approaches to improve the maximum operating frequency and reduce the hardware overhead of Propagate Partial SAD and SAD Tree, while other metrics, in terms of latency, memory bandwidth and hardware utilization, of the original architectures are maintained. Experiments demonstrate that by using the proposed approaches, at 110.8MHz operating frequency, compared with the original architectures, 14.7% and 18.0% gate count can be saved for Propagate Partial SAD and SAD Tree, respectively. With TSMC 0.18µm 1P6M CMOS technology, the proposed Propagate Partial SAD architecture achieves 231.6MHz operating frequency at a cost of 84.1k gates. Correspondingly, the maximum work frequency of the optimized SAD Tree architecture is improved to 204.8MHz, which is almost two times of the original one, while its hardware overhead is merely 88.5k-gate.

View full abstract

This letter treats lossy source coding of binary sources with short linear block codes. It is numerically shown that very simple basis-reprocessing approach yields good rate-distortion performance with manageable computational complexity for small block lengths. The result for code lengths up to 100 outperforms the message-passing based encoding for low-density codes which are several times longer.

View full abstract

We propose that the model in experimental design be expressed in terms of an orthonormal system. Then, we can easily estimate the effects using Fourier transforms. We also provide the theorems with respect to the sum of squares needed in analysis of variance. Using these theorems, it is clear that we can execute the analysis of variance in this model.

View full abstract

Recently, Mooij et al. proposed new sufficient conditions for convergence of the sum-product algorithm, and it was also shown that if the factor graph is a tree, Mooij's sufficient condition for convergence is always activated. In this letter, we show that the converse of the above statement is also true under some assumption, and that the assumption holds for the sum-product decoding. These newly obtained fact implies that Mooij's sufficient condition for convergence of the sum-product decoding is activated if and only if the factor graph of the a posteriori probability of the transmitted codeword is a tree.

View full abstract

In this letter, an NB RCP LDPC (Non-Binary Rate-Compatible-Punctured Low Density Parity Check) code has been designed over the extended Galois Field. The designed code enables us to change the code rate easily by properly puncturing the appropriate symbols from the LDPC mother code. The designed NB RCP LDPC code has been applied to the Type II HARQ (Hybrid Automatic Repeat reQuest) scheme using OFDM (Orthogonal Frequency Division Multiplexing) modulation. The throughput characteristics of the proposed HARQ scheme are evaluated through computation simulation.

View full abstract

An augmented PAKE (Password-Authenticated Key Exchange) protocol is said to be secure against server-compromise impersonation attacks if an attacker who obtained password verification data from a server cannot impersonate a client without performing off-line dictionary attacks on the password verification data. There are two augmented PAKE protocols where the first one [12] was proposed in the IEEE Communications Letters and the second one [15] was submitted to the IEEE P1363.2 standard working group [9]. In this paper, we show that these two augmented PAKE protocols [12],[15] (claimed to be secure) are actually insecure against server-compromise impersonation attacks. More specifically, we present generic server-compromise impersonation attacks on these augmented PAKE protocols [12],[15].

View full abstract

In this letter, we propose a novel motion detection method in order to accurately perform the detection of moving objects in the automatic video surveillance system. Based on the proposed Background Generation Mechanism, the presence of either moving object or background information is firstly checked in order to supply the selective updating of the high-quality adaptive background model, which facilitates the further motion detection using the Laplacian distribution model. The overall results of the detection accuracy will be demonstrated that our proposed method attains a substantially higher degree of efficacy, outperforming the state-of-the-art method by average Similarity accuracy rates of up to 56.64%, 27.78%, 50.04%, 43.33%, and 44.09%, respectively.

View full abstract

The Millimeter-wave Mobile Camera (MiMoCam) developed by NHK STRL uses millimeter-wave band (42GHz/55GHz) to transmit Hi-Vision TV picture with high quality and low latency. Multiple-input multiple-output (MIMO) technology which uses a number of antennas at both the transmitter and receiver can be adapted to use to transmit higher quality Hi-Vision TV picture. The camera was intended to be used in a studio environment where there is a high degree of multi-path, however there are also many requests for the MiMoCam to be used outdoor. This will present a different channel statistics where the camera will be operating in a near line-of-sight (LOS) environment without much reflected waves. We have conducted an outdoor transmission test and measured the outdoors transmission performance of the proposed MIMO system to clarify the possibility of using the MiMoCam in outdoor environment. This paper introduces the features of the MiMoCam system and the MIMO transmission technique used in the MiMoCam and presents the findings of this outdoor test. It was also confirmed that channel correlation of the MIMO propagation channels were suppressed by using orthogonally polarized waves and bit error rate (BER) characteristics with respect to the average receiving carrier-to-noise ratio (CNR) was improved. Finally, we could find the feasibility of the MiMoCam outdoor operation from these results.

View full abstract

Signals received at the interrogator of an RFID system always suffer from various kinds of channel deformation factors, such as the path loss of the wireless channel, insufficient channel bandwidth resulted from the multipath propagation, and the carrier frequency offset between tags and interrogators. In this paper we proposed a novel Viterbi-based algorithm for joint detection of data sequence and compensation of distorted signal waveform. With the assumption that the transmission clock is exactly synchronized at the reader, the proposed algorithm takes advantage of the structured data-encoded waveform to represent the modulation scheme of the RFID system as a trellis diagram and then the Viterbi algorithm is applicable to perform data sequence estimation. Furthermore, to compensate the distorted symbol waveform, the proposed Jiggle-Viterbi algorithm generates two substates, each corresponding to a variant structure waveform with adjustable temporal support, so that the symbol waveform deformation can be compensated and therefore yield a significant better performance in terms of bit error rate. Computer simulations shows that even in the presence of a moderate carrier frequency offset, the proposed approach can work out with an acceptable accuracy on data sequence detection.

View full abstract

Through fractional sampling (FS) it is possible to separate multipath components and achieve path diversity. However, if no path component whose delay corresponds to the sampling point, FS cannot obtain diversity gain. In this paper, a novel scheme to improve the performance with FS over a sparse multipath channel is proposed. The proposed scheme uses multiple transmit antennas and sends multiple signals with fractional delays. The performance improvement with the proposed scheme is confirmed through computer simulation. It is shown that the proposed scheme increases the capacity of a MIMO-OFDM system by a factor of 1.5 to 2 and improves the BER performance on the sparse multipath channels.

View full abstract

Fractional sampling (FS) and Doppler diversity equalization in OFDM receivers can achieve two types of diversity (path diversity and frequency diversity) simultaneously on time-varying multipath channels. However FS with a higher sampling rate requires the large amount of complexity in demodulation. In this paper, a novel sampling point selection (SPS) scheme with MMSE equalization in FS-OFDM receivers is proposed. On fast time-varying multipath channels, the proposed scheme selects the appropriate samples from the fractionally sampled signals. Through the computer simulation, it is demonstrated that with the proposed scheme, both path diversity gain and Doppler diversity gain can increase as compared to a conventional non-SPS scheme.

View full abstract

As described in this paper, construction and blind estimation methods of phase sequences are proposed for subcarrier-phase control based peak-to-average power ratio (PAPR) reduction in low-density parity-check (LDPC)-coded orthogonal frequency division multiplexing (OFDM) systems. On the transmitter side, phase sequence patterns are constructed based on a given parity-check matrix. The PAPR of the OFDM signal is reduced by multiplying the constructed phase sequence selected from the same number of candidates as the number of weighting factor (WF) combinations in a partial transmit sequence (PTS) method. On the receiver side, the phase sequence is estimated blindly using the decoding function, i.e., the most likely phase sequence among a limited number of possible phase sequence candidates is inferred by comparing the sum-product calculation results of each candidate. Computer simulation results show that PAPR of QPSK-OFDM and 16QAM-OFDM signals can be reduced respectively by about 3.7dB and 4.0dB without marked degradation of the block error rate (BLER) performance as compared to perfect estimation in an attenuated 12-path Rayleigh fading condition.

View full abstract

This paper addresses the issue of Unconditional or Stochastic Maximum likelihood (SML) estimation of directions-of-arrival (DOA) finding using sensors with arbitrary array configuration. The conventional SML estimation is formulated without an important condition that the covariance matrix of signal components must be non-negative definite. An likelihood function can not be evaluated exactly for all possible sets of directions. First, this paper reveals that the conventional SML has three problems due to the lack of the condition. 1) Solutions in the noise-free case are not unique. 2) Global solution in the noisy case becomes ambiguous occasionally. 3) There exist situations that any local solution does not satisfy the condition of the non-negative definiteness. We propose an exact formulation of the SML estimation of DOA to evaluate an likelihood function exactly for any possible set of directions. The proposed formulation can be utilized without any theoretical difficulty. The three problems of the conventional SML are solved by the proposed exact SML estimation. Furthermore we show a local search technique in the conventional SML has a good chance to find an optimal or suboptimal DOA although the suboptimal solutions violate the condition of the non-negative definiteness. Finally some simulation results are shown to demonstrate good estimation properties of the exact SML estimation.

View full abstract

This paper proposes a cross layer wireless VoIP service which integrates an Adaptive QoS Playout (AQP) algorithm, E-model, Stream Control Transmission Protocol (SCTP), IEEE 802.21 Media Independent Handover (MIH) middleware and two user motion detection services. The proposed AQP algorithm integrates the effect of playout control and lost packet retransmission based on the E-model. Besides, by using the partial reliable transmission service from SCTP and the handoff notification from MIH services in a cross layer manner, AQP can reduce the lateness loss rate and improve speech quality under high frame error rates. In the simulations, the performance of AQP is compared with a fixed playout algorithm and four adaptive playout strategies. The simulation results show that the lateness loss rate of AQP is 2% lower than that of existing playout algorithms and the R-factor is 16% higher than the compared algorithms when a network has 50ms wired propagation delay and 2.5% frame error rate.

View full abstract

In this paper, we propose a new 3D sound rendering method for multiple sound sources with limited computational resources. The method is based on fuzzy clustering, which achieves dual benefits of two general methods based on amplitude-panning and hard clustering. In embedded systems where the number of reproducible sound sources is restricted, the general methods suffer from localization errors and/or serious quality degradation, whereas the proposed method settles the problems by executing clustering-process and amplitude-panning simultaneously. Computational cost evaluation based on DSP implementation and subjective listening test have been performed to demonstrate the applicability for embedded systems and the effectiveness of the proposed method.

View full abstract

In this paper, we propose a two-step error concealment algorithm based on an error resilient three-dimensional discrete wavelet transform (3-D DWT) video coding scheme. The proposed scheme consists of an error-resilient encoder duplicating the lowest sub-band bit-streams for dispersive grouped frames and an error concealment decoder. The error concealment method of this decoder is decomposed of two steps, the first step is replacement of erroneous coefficients in the lowest sub-band by the duplicated coefficients, and the second step is interpolation of the missing wavelet coefficients by minimum mean square error (MMSE) estimation. The proposed scheme can achieve robust transmission over unreliable channels. Experimental results provide performance comparisons in terms of peak signal-to-noise ratio (PSNR) and demonstrate increased performances compared to state-of-the-art error concealment schemes.

View full abstract

A new type of digital filter for removing impulsive noise in color images is proposed using interactive evolutionary computing. This filter is realized as a rule-based system containing switching median filters. This filter detects impulsive noise in color images with rules and applies switching median filters only at the noisy pixel. Interactive evolutionary computing (IEC) is adopted to optimize the filter parameters, considering the subjective assessment by human vision. In order to detect impulsive noise precisely, complicated rules with multiple parameters are required. Here, the relationship between color components and the degree of peculiarity of the pixel value are utilized in the rules. Usually, optimization of such a complicated rule-based system is difficult, but IEC enables such optimization easily. Moreover, human taste and subjective sense are highly considered in the filter performance. Computer simulations are shown for noisy images to verify its high performance.

View full abstract

In this letter, we apply recently proposed compressive projection principal component analysis (CPPCA) for MIMO channel feedback. A novel scheme with compressed feedback and efficient reconstruction is presented. Simulation results based on 3GPP spatial channel model (SCM) demonstrate the scheme is beneficial for large-scale MIMO systems.

View full abstract

In this paper we propose an unsupervised method of optimizing structuring elements (SEs) used for impulse noise reduction in texture images through the opening operation which is one of the morphological operations. In this method, a genetic algorithm (GA), which can effectively search wide search spaces, is applied and the size of the shape of the SE is included in the design variables. Through experiments, it is shown that our new approach generally outperforms the conventional method.

View full abstract

Broadband wireless technology that enables a variety of gigabit-per-second class data services is a requirement in future wireless communication systems. Broadband wireless channels become extremely frequency-selective and cause severe inter-symbol interference (ISI). Furthermore, the average received signal power changes in a random manner because of the shadowing and distance-dependant path losses resulted from the movement of a mobile terminal (MT). Accordingly, the transmission performance severely degrades. To overcome the performance degradation, two most promising approaches are the frequency-domain equalization (FDE) and distributed antenna network (DAN). The former takes advantage of channel frequency-selectivity to obtain the frequency-diversity gain. In DAN, a group of distributed antennas serve each user to mitigate the negative impact of shadowing and path losses. This article will introduce the recent advances in FDE and DAN for the broadband single-carrier (SC) transmissions.

View full abstract

Binary maximal-length sequences (or m-sequences) are sequences of period 2^m-1 generated by a linear recursion of degree m. Decimating an m-sequence {s_t} by an integer d relatively prime to 2^m-1 leads to another m-sequence {s_dt} of the same period. The crosscorrelation of m-sequences has many applications in communication systems and has been an important and well studied problem during more than 40 years. This paper presents an updated survey on the crosscorrelation between binary m-sequences with at most five-valued crosscorrelation and shows some of the many recent connections of this problem to several areas of mathematics such as exponential sums and Dickson polynomials.

View full abstract

Recently there has been a surge of interest in construction of low correlation zone sequences. The purpose of this paper is to survey the known results in the area and to present an interleaved construction of binary low correlation zone sequences. The interleaved construction unifies many constructions currently available in the literature. These sequences are useful in quasi-synchronous code-division multiple access (QS-CDMA) communication systems.

View full abstract

In order to evaluate the goodness of frequency hopping sequence design, the periodic Hamming correlation function is used as an important measure. Usually, the length of correlation window is shorter than the period of the chosen frequency hopping sequence, so the study of the partial Hamming correlation of frequency hopping sequence is particularly important. In this paper, the maximum partial Hamming correlation lower bounds of frequency hopping sequences with low hit zone, with respect to the size of the frequency slot set, the length of correlation window, the family size, the low hit zone, the maximum partial Hamming autocorrelation and the maximum partial Hamming crosscorrelation are established. It is shown that the new bounds include the known Lempel-Greenberger bound, Peng-Fan bounds, Eun-Jin-Hong-Song bound and Peng-Fan-Lee bounds as special cases.

View full abstract

Variable-weight optical orthogonal code (OOC) was introduced by G-C Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirement. In this paper, a construction for optimal (v, {3, 4}, 1, {s/(s+1), 1/(s+1)})-OOCs is given. For s = 2, it is proved that for each prime v ≡ 1 (mod 24), there exists a (v, {3, 4}, 1, {2/3, 1/3})-OOC. A recursive construction for cyclic difference family is also presented. By using these constructions, a number of new infinite classes of optimal (v, {3, 4}, 1, Q)-OOCs for Q = {1/2, 1/2} and {2/3, 1/3} are constructed.

View full abstract

In quasi-synchronous frequency-hopping multiple access (QS-FHMA) systems, no-hit-zone frequency-hopping sequence (NHZ-FHS) sets are commonly employed to minimize multiple access interference. Several new constructions for optimal NHZ-FHS sets are presented in this paper, which are based on interleaving techniques. Two types of NHZ-FHS sets of length 2N for any integer N ≥ 3 are constructed, whose NHZ sizes are some even integers. An optimal NHZ-FHS set of length 2N with odd NHZ size for any integer N ≥ 6 is also presented. And then, optimal NHZ-FHS sets of length kN are given by generalizing one of the proposed constructions for NHZ-FHS sets of length 2N, where k and N are any positive integers such that 2 ≤ k < N. All the FHSs in the new NHZ-FHS sets are non-repeating FHSs which are optimal with respect to the Lempel-Greenberger bound. Our constructions give new parameters which are flexible in the selection of NHZ size and set size.

View full abstract

For an odd prime p, two new families of p-ary sequences of period pⁿ - 1 are constructed for odd n = 2l + 1 = (2m + 1)e and even n = 2l = 2me, respectively. It is shown that, for a given integer ρ with 1 ≤ ρ ≤ m, the proposed sequence families both have maximum correlation magnitude $1+p^{\\frac{n+2(\\ ho-1)e+2}{2}}$, family size (pⁿ - 1)p^(ρ-1)n + 1, and maximum linear span $\\frac{n(n+3)}{2}$.

View full abstract