The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Space-based Automatic Identification System (AIS) uses Gaussian minimum shift keying modulation (GMSK) as the modulation scheme. Thus, Viterbi Algorithm (VA) is commonly implemented considering the tradeoff between performance and complexity. For the further improvement of the performance of Viterbi decoding, we propose a Soft-Output Viterbi Algorithm for AIS receiver (SOVA-AIS) in this paper. The...
The rapid growth of video in wireless networks is a crucial issue to be addressed by content providers. Nowadays, an emerging and promising trend is the development of solutions aimed at maximizing the quality of experience (QoE) of end users. However, the prediction of the QoE perceived by users in different conditions remains a major challenge. In this paper, we propose a two-layer hierarchical...
In this paper, we analyze the impact of network coding (NC) configuration on the performance of ad hoc networks with the consideration of two significant factors, namely, the throughput loss and the decoding loss, which are jointly treated as the overhead of NC. In particular, physical-layer NC and random linear NC are adopted in static and mobile ad hoc networks (MANETs), respectively. Furthermore,...
A fundamental problem in wireless networks is to develop an effective communication protocols that achieve high throughput by using user's diversity. In broadcast system. Thus, users with better channel performance has to wait others to receive all information, and results in a waste of the wireless resources. To cope with this problem, we propose a novel fountain code called Unequal Fountain code...
In this paper, we propose a Differential Overlap Decoding(DOD) algorithm to solve the hidden-terminal problems in OFDM based WLAN systems. DOD exploits the retransmission and random-jitter features of WLAN to decode the collided packets as a whole. DOD provides with new methods and views to jointly separate and decode collided packets in OFDM based system. In DOD, we formulate IFFT/FFT, channel influence...
A new channel estimation approach based on expectation maximization (EM) algorithm is proposed for the interleave-division multiple access systems (IDMA). The combination channel estimation is used in the proposed algorithm. The pilot sequences are used to estimate the channel information at the first iteration. The pilot and the soft estimates from the decoders are combined to refine the channel...
In this paper, we proposed a multi-view images coding method based on multiterminal source coding (MSC). Due to separate encoding in MSC, our coding scheme can achieve good random access performance and the spatial redundancy can be exploited even if the encoders can not communicate with each other. Because of joint decoding, the compression performance of our scheme is promising, far better than...
In this paper, we provide a blind adaptive channel estimation method for decoding of orthogonal space-time block codes (OSTBC), which is built on the minimizing of an unconstrained cost function. The global minima of the cost function are analyzed. Both LMS and RLS algorithm realizations are given. Our method can adaptively track the time varying channel and decode transferred symbols without pilot...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.