This letter presents a method to enable the precoder design for intrablock MMSE equalization with previously proposed oblique projection framework. The joint design of the linear transceiver with optimum block delay detection is built. Simulation results validate the proposed approach and show the superior BER performance of the optimized transceiver.

We develop a mathematical framework for the extrinsic information transfer (EXIT) analysis to assess the convergence behavior of maximum a posteriori (MAP)-based joint iterative decoding of correlated sources, which are separately encoded and transmitted over noisy channels. Unlike the previous work, our approach focuses on the case side information about the correlation is not perfectly given at the joint decoder but is extracted from decoder output and updated in an iterative manner. The presented framework provides a convenient way to compare between schemes. We show that it allows us to easily and accurately predict joint decoding gain and turbo cliff position.

Todays cellular systems reach their limits for data rate due to the continuously increasing amount of subscribers using wireless service for business purposes or in leisure time (smartphone effect). Thus, recent research focuses on concepts for interference management for cellular OFDMA systems. This paper addresses various techniques related to this topic, while considering the concepts with lowest complexity and backhaul costs as promising candidates to be applied first. Starting from interference canceling receivers over multi-user MIMO using fixed precoding to multi-cell interference estimation, which improves the precision of link adaptation, we discuss closed-loop cooperative transmit beamforming using multiple base stations grouped into a wireless distributed network (WDN), which is denoted as coordinated multi-point joint transmission in the 3GPP LTE-Advanced standardization. It is obvious, the more sophisticated these techniques are, the higher the demands for feedback and backhaul become. Performance results are provided by employing multi-cell simulations according to recommendations from 3GPP. In addition, feasibility of coordinated multi-point joint transmission is demonstrated in a real-time prototype setup, i.e. in the Berlin LTE-Advance Testbed.

This paper proposes a new hybrid method for machine transliteration. Our method is based on combining a newly proposed two-step conditional random field (CRF) method and the well-known joint source channel model (JSCM). The contributions of this paper are as follows: (1) A two-step CRF model for machine transliteration is proposed. The first CRF segments a character string of an input word into chunks and the second one converts each chunk into a character in the target language. (2) A joint optimization method of the two-step CRF model and a fast decoding algorithm are also proposed. Our experiments show that the joint optimization of the two-step CRF model works as well as or even better than the JSCM, and the fast decoding algorithm significantly decreases the decoding time. (3) A rapid development method based on a weighted finite state transducer (WFST) framework for the JSCM is proposed. (4) The combination of the proposed two-step CRF model and JSCM outperforms the state-of-the-art result in terms of top-1 accuracy.

A novel approach for fast traffic classification for the high speed networks is proposed, which bases on the protocol behavior statistical features. The packet size and a new parameter named "Estimated Protocol Processing Time" are collected from the real data flows. Then a set of joint probability distributions is obtained to describe the protocol behaviors and classify the traffic. Comparing the parameters of an unknown flow with the pre-obtained joint distributions, we can judge which application protocol the unknown flow belongs to. Distinct from other methods based on traditional inter-arrival time, we use the "Estimated Protocol Processing Time" to reduce the location dependence and time dependence and obtain better results than traditional traffic classification method. Since there is no need for character string searching and parallel feature for hardware implementation with pipeline-mode data processing, the proposed approach can be easily deployed in the hardware for real-time classification in the high speed networks.

We propose a simple but effective image segmentation method not based on thresholding but on a merging strategy by evaluating joint probability of gray levels on co-occurrence matrix. The effectiveness of the proposed method is shown through a segmentation experiment.

In this letter, a low complexity multi-cell joint channel estimation (MJCE) scheme is proposed. With proper arrangement of the multi-cell midamble matrix and channel impulse response (CIR) vector, the MJCE operation is formulated to solve a block-Toeplitz linear system. The block-Levinson algorithm is adopted to solve this problem instead of the Cholesky algorithm. Our results show that the proposed MJCE scheme can be a practical choice with significantly lower complexity, compared with the previous schemes with the Cholesky algorithm.

We propose a simplified model of real-time joint source-channel coding, which can be used to adaptively determine the quality-optimal code rate of forward error correction (FEC) coding. The objective is to obtain the maximum video quality in the receiver, while taking time-varying packet loss into consideration. To this end, we propose a simplified model of the threshold set of the residual video packet loss rate (RVPLR). The RVPLR is the rate of residual loss of video packets after channel decoding. The threshold set is defined as a set of discrete RVPLRs in which the FEC code rate must be changed in order to maintain minimum distortion during increases or decreases of channel packet loss. Because the closed form of the proposed model is very simple and has one scene-dependent model parameter, a video sender can be easily implemented with the model. To train the scene-dependent model parameters in real-time, we propose a test-run method. This method accelerates the test-run while remaining sufficiently accurate for training the scene-dependent model parameters. By using the proposed model and test-run, the video sender can always find the optimal code rate on the fly whenever there is a change in the packet loss status in the channel. An experiment shows that the proposed model and test-run can efficiently determine the near-optimal code rate in joint source-channel coding.

Wireless sensor networks are subject to node and link failures for a variety of reasons. This paper proposes a k-disjoint-path routing algorithm that varies the number of disjoint paths (k) in order to meet a target-delivery ratio of critical events and to reduce energy consumption. The proposed algorithm sends packets to the base station through a single path without the occurrence of critical events, however, it sends packets to the base station through k disjoint paths (k>1) under the occurrence of critical events, where k is computed from a well-defined fault model. The proposed algorithm detects the occurrence of critical events by monitoring collected data patterns. The simulation results reveal that the proposed algorithm is more resilient to random node failure and patterned failure than other routing algorithms, and it also decreases energy consumption much more than the multi-path and path-repair algorithms.

The joint source-channel coding problem is considered. The joint source-channel coding theorem reveals the existence of a code for the pair of the source and the channel under the condition that the error probability is smaller than or equal to ε asymptotically. The separation theorem guarantees that we can achieve the optimal coding performance by using the two-stage coding. In the case that ε = 0, Han showed the joint source-channel coding theorem and the separation theorem for general sources and channels. Furthermore the ε-coding theorem (0 ≤ ε <1) in the similar setting was studied. However, the separation theorem was not revealed since it is difficult in general. So we consider the separation theorem in this setting.

In this paper network coding based relay for multi-access channel is studied. In the system, two nodes send messages to a common access point (AP). A relay assists the two nodes by forwarding a network coded version of the messages. The AP performs joint channel and network decoding to recover the two original messages from three received signals. Two schemes, soft network coding (SoftNC) and turbo network coding (TurboNC), both focusing on bitwise exclusive or (XOR) based network coding, are proposed to salvage messages from erroneous signals. SoftNC is simple and backward compatible with existing protocol stack of wireless networks, and reduces packet errors by maximal ratio combining (MRC). TurboNC improves channel efficiency by letting the relay node transmit only parity check bits of the interleaved XORed message, where reliability is retained by iterative decoding. Simulation results show that compared with the network-layer path diversity scheme, both SoftNC and TurboNC greatly improve the reliability, and TurboNC also achieves a much higher throughput. The proposed schemes are suitable for improving the performance of wireless local area networks (WLAN).

In this paper, we propose a novel frequency-hopping scheme in order to improve the BER (Bit Error Rate) performance of the Partial Block MC-CDMA (PB/MC-CDMA) system. The joint carrier distribution and frequency hopping (JDFH) scheme achieves the optimal frequency diversity gain while avoiding interference. By contrast, the conventional FH scheme only avoids interference, and the frequency interleaving scheme achieves only frequency diversity. The JDFH scheme thus performs better than conventional schemes, such as carrier FH, block FH, or frequency interleaving. Through computer simulations, we confirmed the superior performance of the PB/MC-CDMA system when using the JDFH scheme.

We propose an iterative channel decoding scheme for two or more multiple correlated sources. The correlated sources are separately turbo encoded without knowledge of the correlation and transmitted over noisy channels. The proposed decoder exploits the correlation of the multiple sources in an iterative soft decision decoding manner for joint detection of each of the transmitted data. Simulation results show that achieved performance for the more than two sources is also close to the Shannon and Slepian-Wolf limit and large additional SNR gain is obtained in comparison with the case of two sources. We also verify through simulation that no significant penalty results from the estimation of the source correlation in the decoding process and the code with a low error floor achieves good performance for a large number of the correlated sources.

We propose a Multiple Zones-based (M-Zone) routing protocol to discover node-disjoint multiplath routing efficiently and effectively in large-scale MANETs. Compared with single path routing, multipath routing can improve robustness, load balancing and throughput of a network. However, it is very difficult to achieve node-disjoint multipath routing in large-scale MANETs. To ensure finding node-disjoint multiple paths, the M-Zone protocol divides the region between a source and a destination into multiple zones based on geographical location and each path is mapped to a distinct zone. Performance analysis shows that M-Zone has good stability, and the control complexity and storage complexity of M-Zone are lower than those of the well-known AODVM protocol. Simulation studies show that the average end-to-end delay of M-Zone is lower than that of AODVM and the routing overhead of M-Zone is less than that of AODVM.

A channel code is constructed using sparse matrices for stationary memoryless channels that do not necessarily have a symmetric property like a binary symmetric channel. It is also shown that the constructed code has the following remarkable properties. 1. Joint source-channel coding: Combining channel code with lossy source code, which is also constructed by sparse matrices, a simpler joint source-channel code can be constructed than that constructed by the ordinary block code. 2. Universal coding: The constructed channel code has a universal property under a specified condition.

In this Letter, a robust system identification method is proposed for the generalized sidelobe canceller using dual microphones. The conventional transfer-function generalized sidelobe canceller employs the non-stationarity characteristics of the speech signal to estimate the relative transfer function and thus is difficult to apply when the noise is also non-stationary. Under the assumption of W-disjoint orthogonality between the speech and the non-stationary noise, the proposed algorithm finds the speech-dominant time-frequency bins of the input signal by inspecting the system output and the inter-microphone time delay. Only these bins are used to estimate the relative transfer function, so reliable estimates can be obtained under non-stationary noise conditions. The experimental results show that the proposed algorithm significantly improves the performance of the transfer-function generalized sidelobe canceller, while only sustaining a modest estimation error in adverse non-stationary noise environments.

A simple and novel residual acoustic echo cancellation method that employs binary masking is proposed to enhance the speech quality of hands-free communication in an automobile environment. In general, the W-disjoint orthogonality assumption is used for blind source separation using multi-microphones. However, in this Letter, it is utilized to mask the residual echo component in the time-frequency domain using a single microphone. The experimental results confirm the effectiveness of the proposed method in terms of the echo return loss enhancement and speech enhancement.

When the joint source-channel (JSC) decoder is used for source coding over noisy channels, the JSC decoder may invent errors even though the received data is not corrupted by the channel noise, if the JSC decoder assumes the channel was noisy. A novel encoder algorithm has been recently proposed to improve the performance of the communications system under this situation. In this letter, we propose another algorithm based on conditional entropy-constrained vector quantizer to further improve the encoder. The algorithm proposed in this letter significantly improves the performance of the communications system when the hypothesized channel bit error rate is high.

In this paper, a multi-cell joint channel estimation (JCE) method is proposed for the TD-SCDMA downlink. In the proposed multi-cell JCE approach, the received midambles from adjacent cells are jointly processed, rather than being treated as interference as in single cell channel estimation. By jointly processing all the received midambles, the user can simultaneously estimate the channel impulse responses (CIRs) for both its home cell and adjacent cells. If the received signal from adjacent cells has a delay, multi-cell JCE is still operable with slight adjustment in the midamble matrix, and the performance loss is also minor. The performance of multi-cell JCE is analyzed and evaluated by simulations. The results demonstrate that the proposed multi-cell JCE method can significantly improve the channel estimation accuracy. When the signal from each cell has similar power level, the mean square error (MSE) of the estimated CIRs for all cells is lower than 0.01. With more accurate CIRs from multi-cell JCE, multi-cell JD also yields better performance compared with the single cell channel estimation methods.

In static wireless ad hoc networks such as wireless mesh networks and wireless sensor networks, multipath routing techniques are very useful for improving end-to-end delay, throughput, and load balancing, as compared to single-path routing techniques. When determining multiple paths, however, multipath routing protocols should address the well-known route coupling problem that results from a geographic proximity of adjacent routes and that hampers performance gain. Although a lot of multipath routing protocols have been proposed, most of them focused on obtaining node or link-disjoint multipaths. In order to address the route coupling problem, some multipath routing protocols utilizing zone-disjointness property were proposed. However, they suffer from an overhead of control traffic or require additional equipment such as directional antenna. This paper therefore proposes a novel multipath routing protocol, based on geographical information with low overhead, called 3-directional zone-disjoint multipath routing protocol (3DMRP). 3DMRP searches up to three zone-disjoint paths by using two techniques: 1) greedy forwarding, and 2) RREP-overhearing. One primary and two secondary paths are obtained via greedy forwarding in order to reduce control overhead, and these secondary paths are found by avoiding the RREP overhearing zone created during the primary path acquisition. In particular, two versions of 3DMRP are introduced in order to avoid the RREQ-overhearing zone. Through ns-2 simulations, 3DMRP is evaluated to verify that it achieves performance improvements in terms of throughput and control overhead.