The even-shift orthogonal sequence whose out-of-phase aperiodic autocorrelation function takes zero at any even shifts is generalized to multi-dimension called even-shift orthogonal array (E-array), and the logic function of E-array of power-of-two length is clarified. It is shown that E-array can be constructed by complementary arrays, which mean pairs of arrays that the sum of each aperiodic autocorrelation function at the same phase shifts takes zero at any shift except zero shift, as well as the one-dimensional case. It is also shown that the number of mates of E-array with which the cross correlation function between E-arrays takes zero at any even shifts is equal to the dimension. Furthermore it is investigated that E-array possesses good aperiodic autocorrelation that the rate of zero correlation values to array length approaches one as the dimension becomes large.

In this letter, a timing-offset estimation scheme is proposed for cooperative networks. The estimation scheme consists of coarse timing-offset estimation and fine timing-offset estimation. The presented scheme relies on periodic training data and linear mean square estimation for efficient estimation. The simulation results indicate that the performance of the proposed approach is better than or comparable to that of the conventional methods with lower computational complexity in the fine estimation.

In this paper, impulse noise removal for digital images is handled. It is well-known that switching-type processing is effective for the impulse noise removal. In the process, noise-corrupted pixels are first detected, and then, filtering is applied to the detected pixels. This switching process prevents distorting original signals. A noise detector is of course important in the process, a filter for pixel value restoration is also important to obtain excellent results. The authors have proposed a local similarity-based filter (LSF). It utilizes local similarity in a digital image and its capability against restoration of orderly regions has shown in the previous paper. In this paper, first, further experiments are carried out and properties of the LSF are revealed. Although LSF is inferior to an existing filter when disorderly regions are processed and evaluated by the peak signal-to-noise ratio, its outputs are subjectively adequate even in the case. If noise positions are correctly detected, capability of the LSF is guaranteed. On the other hand, some errors may occur in actual noise detection. In that case, LSF sometimes fails to restoration. After properties are examined, we propose two effective extensions to the LSF. First one is for computational cost reduction and another is for color image processing. The original LSF is very time consuming, and in this paper, computational cost reduction is realized introducing a search area. Second proposal is the vector LSF (VLSF) for color images. Although color images can be processed using a filter, which is for monochrome images, to each color component, it sometimes causes color drift. Hence vector processing has been investigated so far. However, existing vector filters do not excel in preservation of orderly pattern although color drift is suppressed. Our proposed VLSF is superior both in orderly pattern preservation and color drift suppression. Effectiveness of the proposed extensions to LSF is verified through experiments.

In this paper, we propose an automatic parameter adjustment method for audio equalizers using an interactive genetic algorithm (IGA). It is very difficult for ordinary users who are not familiar with audio devices to appropriately adjust the parameters of audio equalizers. We therefore propose a system that can automatically adjust the parameters of audio equalizers on the basis of user's evaluation of the reproduced sound. The proposed system utilizes an IGA to adjust the gains and Q values of the peaking filters included in audio equalizers. Listening test results demonstrate that the proposed system can appropriately adjust the parameters on the basis of the user's evaluation.

This paper proposes a new channel allocation algorithm for satellite communication systems. The algorithm is based on a spectrum division transmission technique as well as a spectrum compression transmission technique that we have developed in separate pieces of work. Using these techniques, the algorithm optimizes the spectrum bandwidth and a MODCOD (modulation and FEC error coding rate) scheme to balance the usable amount of satellite transponder bandwidth and satellite transmission power. Moreover, it determines the center frequency and bandwidth of each divided subspectra depending on the unused bandwidth of the satellite transponder bandwidth. As a result, the proposed algorithm enables flexible and effective usage of satellite resources (bandwidth and power) in channel allocations and thus enhances satellite communication (SATCOM) system capacity.

On rocket-borne GPS receivers, the high dynamics make the use of PLL is impractical and a FLL is used. This in turn leads to a string of errors on the demodulated navigation message. The present paper proposes two decoding algorithms for GPS navigation messages suited for strings of errors. The first philosophy uses parity check syndromes to correct demodulation errors. The second philosophy uses Log Correlation Ratio (LCR) comparison along with parity check syndromes to correct for the most probable error pattern. GPS data availability can be significantly improved by using the latter.

A novel 400-Gb/s (100-Gb/s4) physical-layer architecture for the next-generation Ethernet – using 100-Gb/s serial (optical single-wavelength) transmission – is proposed. As for the next-generation 400-Gb/s Ethernet, additional requirements from the market, such as power reduction and further miniaturization in addition to attaining even higher transmission speed, must be satisfied. To satisfy these requirements, a 100-Gb/s4 Ethernet physical-layer architecture is proposed. This architecture uses a 100-Gb/s serial (optical single-wavelength) transmission Ethernet and low-power technologies for a multi-lane transmission Ethernet. These technologies are implemented on a 100-Gb/s serial (optical single wavelength) transmission Ethernet using field-programmable gate arrays (FPGAs). Experimental evaluation of this implementation demonstrates the feasibility of low-power 400-Gb/s Ethernet.

MIMO-OFDM combining OFDM and MIMO techniques achieves high spectral efficiency and is able to increase throughput. MIMO-OFDM systems can be classified into either “open loop” or “closed loop” depending on whether the CSI is fed back from the Rx to the Tx. As a closed loop scheme, SVD-MIMO is the optimal single user MIMO-OFDM transmission scheme while it requires knowledge of the CSI at both the Tx and Rx. In practical systems, Tx weight is fed back from the Rx to the Tx by limited bits and with feedback delay, which causes mismatch between the weight and the real channel especially if the channel exhibits time variation. Hence, the transmission performance of the SVD-MIMO scheme degrades. Therefore, the performance comparison between open loop and closed loop schemes against channel variation is very important for practical deployment of MIMO-OFDM systems. For that purpose, a unified performance calculation method for the open loop and the closed loop MIMO-OFDM schemes with finite and delayed feedback is developed in this paper. The method is effective for analysis of both STBC for the open loop and SVD-MIMO using codebook for the closed loop with per stream layer AMC. Also, to combat frequency selective fading in practical wireless channels, an interleaver is employed in this paper. In numerical analyses, it is found that simulation results agree well with the derived theoretical performance results. Secondly, from these results, the cross-over point of the throughput performance of two schemes in terms of UE velocity and SNR is found.

We propose an interference avoidance architecture using uneven spreading as a media access mechanism for optical code division multiple access (OCDMA). While an equal-intensity pulse sequence encoded with the spreading sequence assigned to each node is transmitted for a “1” bit in conventional OCDMA with on-off keying (OOK), the proposed architecture creates an uneven-intensity pulse sequence where one of the pulses has higher intensity than the others. The high-intensity pulse allows source nodes to use increased sensing threshold for channel sensing, which leads to an increase in the number of chip offsets available for collision-free transmission. Our receiver with a hard limiter (HL) allows destination nodes to receive the transmission without false positives. Interference avoidance performance is examined by deriving the collision probability and comparing it with the conventional interference avoidance with equal-intensity spreading. Our numerical results show that our architecture has lower collision probability, shorter time required for channel sensing, higher throughput, higher bit rate, and supports more nodes than the conventional one for a fixed collision probability.

This paper precisely characterizes secret sharing schemes based on arbitrary linear codes by using the relative dimension/length profile (RDLP) and the relative generalized Hamming weight (RGHW). We first describe the equivocation Δm of the secret vector =[s1,...,sl] given m shares in terms of the RDLP of linear codes. We also characterize two thresholds t1 and t2 in the secret sharing schemes by the RGHW of linear codes. One shows that any set of at most t1 shares leaks no information about , and the other shows that any set of at least t2 shares uniquely determines . It is clarified that both characterizations for t1 and t2 are better than Chen et al.'s ones derived by the regular minimum Hamming weight. Moreover, this paper characterizes the strong security in secret sharing schemes based on linear codes, by generalizing the definition of strongly-secure threshold ramp schemes. We define a secret sharing scheme achieving the α-strong security as the one such that the mutual information between any r elements of (s1,...,sl) and any α-r+1 shares is always zero. Then, it is clarified that secret sharing schemes based on linear codes can always achieve the α-strong security where the value α is precisely characterized by the RGHW.

In contemporary communications, Golay, periodic and Z- complementary sequence sets play a very important role, since such sequence sets possess impulse-like or zero correlation zone (ZCZ) autocorrelation. On the other hand, the advantages of the signals over the quadrature amplitude modulation (QAM) constellation are more and more prominent. Hence, the design of such sequence sets over the QAM constellation has turned into one of the all-important issues in communications. Therefore, the construction methods of such sequence sets over the 16-QAM constellation are investigated, in this letter, and our goals are arrived at by the known quaternary Golay, periodic and Z- complementary sequence sets. Finally, many examples illuminate the validity of the proposed methods.

In this letter, we derive a lower bound on the diversity multiplexing tradeoff (DMT) in multiple-input multiple-output (MIMO) nonorthogonal amplify-and-forward (NAF) cooperative channels with resolution-constrained channel state feedback. It is shown that power control based on the feedback improves the DMT performance significantly in contrast to the no-feedback case. For instance, the maximum diversity increase is exponential in K with K-level feedback.

A reverse mode liquid crystal (LC) display has been investigated. A driving voltage strongly depends on a morphology which changes by reactive mesogens, photo initiators and LCs. It becomes higher when the domain size of the liquid crystal and the particle of the polymer reactive mesogen are smaller.

In this paper, training symbol designs for estimation of frequency selective channels and compensation of in-phase (I) and quadrature (Q) imbalances on orthogonal frequency division multiplexing (OFDM) transmitters and receivers are studied. We utilize cross entropy (CE) optimization techniques together with convex optimization to design training sequences having low channel estimate mean squared error (MSE) and minimum effects of I/Q mismatch, while lowering the peak power of the training signals. The proposed design provides better channel estimate MSE and bit error rate (BER) performances and is applicable to OFDM systems with and without null subcarriers. The efficacies of the proposed designs are corroborated by analysis and simulation results.

This paper proposes a downlink multi-user transmission scheme for the amplify-and-forward(AF)-based multi-relay cellular network, in which Tomlinson-Harashima precoding(TH precoding) and interference alignment(IA) are jointly applied. The whole process of transmission is divided into two phases: TH precoding is first performed at base-station(BS) to support the multiplexing of data streams transmitted to both mobile-stations(MS) and relay-stations(RS), and then IA is performed at both BS and RSs to achieve the interference-free communication. During the whole process, neither data exchange nor strict synchronization is required among BS and RSs thus reducing the cooperative complexity as well as improving the system performance. Theoretical analysis is provided with respect to the channel capacity of different types of users, resulting the upper-bounds of channel capacity. Our analysis and simulation results show that the joint applications of TH precoding and IA outperforms other schemes in the presented multi-relay cellular network.

Let PA(n, d) be a permutation array (PA) of order n and the minimum distance d. We propose a new construction of the permutation array PA(pm, pm-1k) for a given prime number p, a positive integer k < p and a positive integer m. The resulted array has (|PA(p,k)|p(m-1)(p-k))m rows. Compared to the other constructions, the new construction gives a permutation array of far bigger size with a large minimum distance, for example, when k ≥ 2p/3. Moreover the proposed construction provides an algorithm to find the i-th row of PA (pm, pm-1k) for a given index i very simply.

In this study, we propose a cooperative sensing with distributed pre-detection for gathering sensing information on shared primary system. We have proposed a system that gathers multiple sensing information by using the orthogonal narrowband signal; the system is called the orthogonal frequency-based sensing information gathering (OF-SIG) method. By using this method, sensing information from multiple secondary nodes can be gathered from the surrounding secondary nodes simultaneously by using the orthogonal narrowband signals. The advantage of this method is that the interference from each node is small because a narrowband tone signal is transmitted from each node. Therefore, if appropriate power and transmission control are applied at the surrounding nodes, the sensing information can be gathered in the same spectrum as the primary system. To avoid interference with the primary receiver, we propose a cooperative sensing with distributed pre-detection for gathering sensing information in each node by limiting sensing node power. In the proposed method, the number of sensing information transmitting nodes depends on the pre-detection ability of the individual sensing at each node. Then the secondary node can increase the transmit power by improving the sensing detection ability, and the secondary node can gather the sensing information from the surrounding secondary nodes which are located more far by redesign the transmit power of the secondary nodes. Here, we design the secondary transmit power based on OF-SIG while considering the aggregated interference from multiple sensing nodes and individual sensing ability. Finally we confirm the performance of the cooperative sensing of the proposed method through computer simulation.

Limited Random Sequence (LRS) is quite important for Analog-to-Information Converter (AIC) because it determines the random sampling scheme and the resultant performance. LRS is established with the elements of “0” and “1”. The “1” appears randomly in the segment of the sequence, so that the production of the original signal and LRS can be considered as the approximation of the random sampling of the original signal. The random sampling result can perfectly recover the signal with Compressive Sensing (CS) algorithm. In this paper, a high order LRS is proposed for the AIC design in Distributed Compressive Sensing (DCS), which has the following three typical features: 1) The high order LRS has the elements of integer which can indicate the index number of the sensor in DCS. 2) High order LRS can adapt to the sparsity variation of the original signal detected by each sensor. 3) Employing the AIC with high order LRS, the DCS algorithm can recover the signal with very low sampling rate, usually above 2 orders less than the traditional distributed sensors. In the paper, the scheme and the construction algorithm of high order LRS are proposed. The performance is evaluated with the application studies of the distributed sensor network and the camera picture correspondingly.

When the Akebono (EXOS-D) satellite passed through the plasmasphere, a series of lightning whistlers was observed by its analog wideband receiver (WBA). Recently, we developed an intelligent algorithm to detect lightning whistlers from WBA data. In this study, we analyzed two typical events representing the clear dispersion characteristics of lightning whistlers along the trajectory of Akebono. The event on March 20, 1991 was observed at latitudes ranging from 47.83 (47,83N) to -11.09 (11.09S) and altitudes between ∼2232 and ∼7537 km. The other event on July 12, 1989 was observed at latitudes from 34.94 (34.94N) and -41.89 (41.89S) and altitudes ∼1420–∼7911 km. These events show systematic trends; hence, we can easily determine whether the wave packets of lightning whistlers originated from lightning strikes in the northern or the southern hemispheres. Finally, we approximated the path lengths of these lightning whistlers from the source to the observation points along the Akebono trajectory. In the calculations, we assumed the dipole model as a geomagnetic field and two types of simple electron density profiles in which the electron density is inversely proportional to the cube of the geocentric distance. By scrutinizing the dipole model we propose some models of dispersion characteristic that proportional to the electron density. It was demonstrated that the dispersion D theoretically agrees with observed dispersion trend. While our current estimation is simple, it shows that the difference between our estimation and observation data is mainly due to the electron density profile. Furthermore, the dispersion analysis of lightning whistlers is a useful technique for reconstructing the electron density profile in the Earth's plasmasphere.

This paper proposes a low-complexity concatenated (LCC) soft-in soft-out (SISO) detector for spreading OFDM systems. The LCC SISO detector uses the turbo principle to compute the extrinsic information of the optimal maximum a priori probability (MAP) SISO detector with extremely low complexity. To develop the LCC SISO detector, we first partition the spreading matrix into some concatenated sparse matrices separated by interleavers. Then, we use the turbo principle to concatenate some SISO detectors, which are separated by de-interleavers or interleavers. Each SISO detector computes the soft information for each sparse matrix. By exchanging the soft information between the SISO detectors, we find the extrinsic information of the MAP SISO detector with extremely low complexity. Simulation results show that using the LCC SISO detector produces a near-optimal performance for both uncoded and coded spreading OFDM systems. In addition, by using the LCC SISO detector, the spreading OFDM system significantly improves the BER of the conventional OFDM system.