Search

STiMi is a mobile multimedia broadcasting trade standard that was released by the Chinese State Administration of Radio Film and Television in 2006. This paper details the algorithm research and development work on the acquisition for STiMi. First, the STiMi physical layer is briefly reviewed. secondly, individual algorithms, including time slot detection, fractional frequency offset estimation, integer frequency offset estimation and fine timing synchronization are discussed with simulation results presented. An implemented STiMi receiver prototype is also introduced with a focus on the acquisition algorithms implementation. Finally, the whole acquisition procedure is summarized. Acquisition algorithms and structures presented in this paper are adopted for prototyping and perform well. [ABSTRACT FROM AUTHOR]

Noise can significantly impact the effectiveness of video processing algorithms. This paper proposes a fast white-noise variance estimation that is reliable even in images with large textured areas. This method finds intensity-homogeneous blocks first and then estimates the noise variance in these blocks, taking image structure into account This paper proposes a new measure to determine homogeneous blocks and a new structure analyzer for rejecting blocks with structure. This analyzer is based on high-pass operators and special masks for corners to stabilize the homogeneity estimation. For typical video quality (PSNR of 29-40 dB), the proposed method outperforms other methods significantly and the worst-case estimation error is 3 dB, which is suitable for real applications such as video broadcasts. The method performs well both in highly noisy and good-quality images. It also works well in images including few uniform blocks. [ABSTRACT FROM AUTHOR]

Single carrier frequency division multiple access (SC-FDMA) is one well-known scheme, which has recently become a preferred choice for uplink channels. Due to the usage of single carrier, the performance of SC-FDMA systems degrades in deep frequency selective fading channels. In this paper, we propose a structure of equalizer based on frequency domain decision feedback which could be used for multi-user SC-FDMA systems. Specific parameters of the equalizer are analyzed as well. This algorithm is applicable to various carrier allocations in multi-user systems such as localized allocation, distributed allocation, and frequency-hopping (FH) allocation. To reduce the complexity, it is not necessary to derive the inversion of matrix, which is required in the traditional decision feedback equalizer for single carrier frequency domain equalization (SC-FDE-DFE). It is shown by the simulation results that perfect performance could be achieved under all kinds of situations for multi-user systems. This structure can be used in the broadcasting uplink channels with SC-FDMA scheme. [ABSTRACT FROM AUTHOR]

LDPC codes are state-of-art error correcting codes, included in several standards for broadcast transmissions. Iterative soft-decision decoding algorithms for LDPC codes reach excellent error correction capability; their performance, however, is strongly affected by finite-precision issues in the representation of inner variables. Great attention has been paid, in recent literature, to the topic of quantization for LDPC decoders, but mostly focusing on binary modulations and analysing finite precision effects in a disaggregrated manner, i.e., considering separately each block of the receiver. Modern telecommunication standards, instead, often adopt high order modulation schemes, e.g. M-QAM, with the aim to achieve large spectral efficiency. This puts additional quantization problems, that have been poorly debated in previous literature. This paper discusses the choice of suitable quantization characteristics for both the decoder messages and the received samples in LDPC-coded systems using M-QAM schemes. The analysis involves also the demapper block, that provides initial likelihood values for the decoder, by relating its quantization strategy with that of the decoder. A new demapper version, based on approximate expressions, is also presented, that introduces a slight deviation from the ideal case but yields a low complexity hardware implementation. [ABSTRACT FROM AUTHOR]

It has been demonstrated that turbo codes substantially outperform other codes, e.g., convolutional codes, both in the non-fading additive white Gaussian noise (AWGN) channel as well as multiple-transmit and multiple-receive antenna fading channels. Moreover, it has also been reported that turbo codes perform very well in fast fading channels, but perform somewhat poorly on slow and block fading channels of which the broadband fixed wireless access (FWA) channel is an example. In this paper, we thoroughly compare the performance of turbo-coded and convolutional-coded broadband FWA systems both with and without antenna diversity under the condition of identical complexity for a variety of decoding algorithms. In particular, we derive mathematical expressions to characterize the complexity of turbo decoding based on state-of-the-art Log-MAP and Max-Log-MAP algorithms as well as convolutional decoding based on the Viterbi algorithm in terms of the number of equivalent addition operations. Simulation results show that turbo codes do not offer any performance advantage over convolutional codes in FWA systems without antenna diversity or FWA systems with limited antenna diversity. Indeed, turbo codes only outperform convolutional codes in FWA systems having significant antenna diversity. [ABSTRACT FROM AUTHOR]

In this paper, we present a novel protocol for disseminating data in broadcast environments such that view consistency, a useful correctness criterion for broadcast environments, is guaranteed. Our protocol is based on concurrency control information that is constructed by the server and is broadcasted at the beginning of each broadcast cycle. The concurrency control information mainly captures read-from relations among update transactions. A salient feature of the protocol is that the concurrency control information is small in size, but precise enough for reducing unnecessary abortion of mobile transactions. The small-sized concurrency control information implies low communication overhead on broadcasting system. In addition, the computation overheads imposed by the algorithm on the server and the clients are low. We also address the reliability issue of wireless communication and the incorporation of a prefetching mechanism into our protocol. Simulation results demonstrate the superiority of our protocol in comparison with existing methods. Furthermore, we have extended our protocol to deal with local view consistency which requires that all mobile transactions submitted by the same client observe the same serial order of update transactions. [ABSTRACT FROM AUTHOR]

Broadcasting has been widely used in mobile Ad hoc networks as a communication means to disseminate information to all reachable nodes. Because radio signals are likely to overlap with others in a geographical area, straightforward broadcasting by flooding becomes very costly and results in serious redundancy, contention and collision, to which we refer as the broadcast storm problem. In this paper we propose the Relative Degree Adaptive flooding Broadcast (RDAB) algorithm for Ad hoc networks to efficiently reduce the broadcast overhead in the network. Based on the current situation of the network and the degree of the nodes, RDAB calculates the relative degree of the nodes, decides which nodes need to re-transmit and which nodes only need to receive. The higher the neighbor node's relative degree, the more uncovered nodes it can cover, hence these nodes can be selected to re-transmit broadcasting packets in the networks. We analyze the reliability and the validity of the RDAB algorithm to prove that the RDAB algorithm is a valid flooding broadcast algorithm. Simulation results show that the RDAB strategy outperforms the Ordinary Flooding Broadcast Method (OBM) and the Multipoint Relaying (MPR) protocol for Ad hoc networks. [ABSTRACT FROM AUTHOR]