1,721,202 research outputs found

    Non-Coherent Cooperative Communications Dispensing with Channel Estimation Relying on Erasure Insertion Aided Reed-Solomon Coded SFH M-ary FSK Subjected to Partial-Band Interference and Rayleigh Fading

    No full text
    The rationale of our design is that although much of the literature of cooperative systems assumes perfect coherent detection, the assumption of having any channel estimates at the relays imposes an unreasonable burden on the relay station. Hence, non-coherently detected Reed-Solomon (ReS) coded Slow Frequency Hopping (SFH) assisted M -ary Frequency Shift Keying (FSK) is proposed for cooperative wireless networks, subjected to both partial-band interference and Rayleigh fading. Erasure insertion (EI) assisted ReS decoding based on the joint maximum output-ratio threshold test (MO-RTT) is investigated in order to evaluate the attainable system performance. Compared to the conventional error-correction-only decoder, the EI scheme may achieve an Eb/N0 gain of approximately 3dB at the Codeword Error Probability, Pw , of 10-4 , when employing the ReS (31, 20) code combined with 32-FSK modulation. Additionally, we evaluated the system’s performance, when either equal gain combining (EGC) or selection combining (SC) techniques are employed at the destination’s receiver. The results demonstrated that in the presence of one and two assisting relays, the EGC scheme achieves gains of 1.5 dB and 1.0 dB at the Pw of 10-6 , respectively, compared to the SC arrangement. Furthermore, we demonstrated that for the same coding rate and packet size, the ReS (31, 20) code using EI decoding is capable of outperforming convolutional coding, when 32-FSK modulation is considered, whilst LDPC coding had an edge over the above two schemes

    Mobile Social Networking aided content dissemination in heterogeneous networks

    Full text link
    Since more and more mobile applications are based on the proliferation of social information, the study of Mobile Social Net-works (MSNs) combines social sciences and wireless communications. Operating wireless networks more efficiently by exploiting social relationships between MSN users is an appealing but challenging option for network operators. An MSN-aided content dissemination technique is presented as a potential ex-tension of conventional cellular wireless net-works in order to satisfy growing data traffic. By allowing the MSN users to create a self-organized ad hoc network for spontaneously disseminating contents, the network operator may be able to reduce the operational costs and simultaneously achieve an improved network performance. In this paper, we first summarize the basic features of the MSN architecture, followed by a survey of the factors which may affect MSN-aided content dissemination. Using a case study, we demonstrate that one can save resources of the Base Station (BS) while substantially lowering content dissemination delay. Finally, other potential applications of MSN-aided content dissemination are introduced, and a range of future challenges are summarized

    Capacity and Error Performance of Reduced-Rank Transmitter Multiuser Preprocessing Based on Minimum Power Distortionless Response

    No full text
    In this contribution we first derive a transmitter multiuser preprocessing (TMP) scheme for a general multiuser multiple-input-multiple-output (MIMO) system based on the minimum power distortionless response (MPDR) criterion, which minimizes the power in the context of a given downlink mobile terminal (MT) under the distortionless condition. This optimization problem results in a solution, which has the same form as the minimum mean-square error (MMSE) multiuser detection (MUD). Hence, we then extend the well-known rank-reduction techniques in MMSE-MUD to the MPDR-TMP in order to mitigate the possible implementation problems of the MPDRTMP. In our study three classes of rank-reduction algorithms are considered, which are derived, respectively, based on the eigen-analysis methods of principal components (PC) and crossspectral metrics (CSMs) as well as on the Taylor polynomial approximation (TPA) approach, which does not depend on the eigen-analysis. In this contribution both the capacity and error performance of a downlink space-division multiple-access (SDMA) system is investigated, when either the full-rank or reduced-rank MPDR-TMP is invoked. From our study and simulation results, it can be shown that the MPDR-TMP scheme is highly efficient for achieving the capacity and for suppressing the multiuser interference (MUI). The reduced-rank techniques can be employed by the MPDR-TMP, so as to reduce its implementation complexity while achieving the near full-rank performance of the full-rank MPDR-TMP

    Time-Hopping Multicarrier Code-Division Multiple-Access

    No full text
    A time-hopping multicarrier code-division multiple-access (TH/MC-CDMA) scheme is proposed and investigated. In the proposed TH/MC-CDMA each information symbol is transmitted by a number of time-domain pulses with each time-domain pulse modulating a subcarrier. The transmitted information at the receiver is extracted from one of the, say MM, possible time-slot positions, i.e., assuming that MM-ary pulse position modulation is employed. Specifically, in this contribution we concentrate on the scenarios such as system design, power spectral density (PSD) and single-user based signal detection. The error performance of the TH/MC-CDMA system is investigated, when each subcarrier signal experiences flat Nakagami-mm fading in addition to additive white Gaussian noise (AWGN). According to our analysis and results, it can be shown that the TH/MC-CDMA signal is capable of providing a near ideal PSD, which is flat over the system bandwidth available, while decreases rapidly beyond that bandwidth. Explicitly, signals having this type of PSD is beneficial to both broadband and ultra-wide bandwidth (UWB) communications. Furthermore, our results show that, when optimum user address codes are employed, the single-user detector considered is near-far resistant, provided that the number of users supported by the system is lower than the number of subcarriers used for conveying an information symbol

    Joint Iterative Decoding of Trellis-Based VQ and TCM

    No full text
    A joint video and channel coded system employing an iteratively decoded serial concatenation of a Vector Quantization (VQ) based video codec and a Trellis-Coded Modulation (TCM) scheme is proposed. The video codec imposes VQ-induced code constraints, which may be completely described by a trellis structure, which is employed as the basis for optimal minimum mean-squared-error VQ-encoding and -decoding. In the latter case, the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm is employed to facilitate the iterative exchange of soft information between the VQ and TCM decoder. An error-free video reconstruction quality is supported using 16-level Quadrature Amplitude Modulation (16QAM) based TCM for transmission over Rayleigh-fading channels at a Signal-to-Noise Ratio (SNR) per bit of 5.25 dB. This value is within 1.29 dB of the Rayleigh channel’s capacity at our system’s effective bandwidth-efficiency of 2 bits/s/Hz. Owing to its ability to exploit the VQ-induced code constraints during iterative decoding, the joint video and channel coding approach is found to consistently outperform the Shannonian source and channel separation philosophy. This is achieved at the cost of a 1.6 times higher computational complexity. Finally, the convergence of the iterative decoder is investigated with the aid of a novel so-called EXtrinsic Information Transfer (EXIT) chart

    Reduced-rank adaptive least bit-error-rate detection in hybrid direct-sequence time-hopping ultrawide bandwidth systems

    No full text
    Design of high-efficiency low-complexity detection schemes for ultrawide bandwidth (UWB) systems is highly challenging. This contribution proposes a reduced-rank adaptive multiuser detection (MUD) scheme operated in least bit-errorrate (LBER) principles for the hybrid direct-sequence timehopping UWB (DS-TH UWB) systems. The principal component analysis (PCA)-assisted rank-reduction technique is employed to obtain a detection subspace, where the reduced-rank adaptive LBER-MUD is carried out. The reduced-rank adaptive LBERMUD is free from channel estimation and does not require the knowledge about the number of resolvable multipaths as well as the knowledge about the multipaths’ strength. In this contribution, the BER performance of the hybrid DS-TH UWB systems using the proposed detection scheme is investigated, when assuming communications over UWB channels modeled by the Saleh-Valenzuela (S-V) channel model. Our studies and performance results show that, given a reasonable rank of the detection subspace, the reduced-rank adaptive LBER-MUD is capable of efficiently mitigating the multiuser interference (MUI) and inter-symbol interference (ISI), and achieving the diversity gain promised by the UWB systems

    Going Beyond Counting First Authors in Author Co-citation Analysis

    Full text link
    The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed

    Blind Joint Soft-Detection Assisted Slow Frequency-Hopping Multicarrier DS-CDMA

    Full text link
    A novel multiple-access scheme based on slow frequency-hopping multicarrier direct-sequence, code-division multiple access (SFH/MC DS-CDMA) is proposed and investigated, which can be rendered compatible with the existing second-generation narrow-band CDMA and third-generation wide-band CDMA systems. Blind joint soft-detection of the SFH/MC DS-CDMA signals is investigated, assuming that the receiver has no knowledge of the associated frequency-hopping (FH) patterns invoked. The system’s performance is evaluated over the range of Nakagami multipath fading channels. The results show that blind joint soft-detection achieves the required bit-error rate performance, while blindly acquiring the FH patterns employed. This is advantageous during the commencement of communications or during soft handover. Index Terms—Blind detection, code-division multiple access, constant-weight codes, frequency-hopping, orthogonal frequency-division multiplexing
    corecore