Search

The deployments of RFID system are seriously affected by collision caused by multiple tags responding simultaneously. To facilitate the resolution of collisions caused by densely distributed memoryless passive tags in successive cycles, based on the binary query tree protocol, this paper proposes a new Successive Scheme. In this scheme, the binary query tree constructed by the protocol will be reused. In the subsequent cycle, only the successful or idle binary query strings in the tree are adopted directly as the initial binary query strings, and these collision query strings in the tree are skipped. Due to the dynamic entrance and departure of tags, new nodes will be added to and abundant nodes will be removed from the tree. The performance of this Successive Scheme will be analyzed theoretically and examined with numeric simulations. Results indicate that in almost all cases, the Successive Scheme outperforms the commonly used binary query tree protocols in terms of system efficiency, message complexity, time, and time system efficiency. Especially when the tags stay stable, the system efficiency of the scheme is improved to 69.2%. Besides, simulation results also reveal that the scheme can deal efficiently with the case that the binary tag identifiers are in biased distribution. [ABSTRACT FROM AUTHOR]

Highlights: [•] Simplified ASM2 model applied for predicting performance of ABA2 system. [•] Simplified model-based MPC scheme designed to save aeration energy of ABA2 system. [•] Pilot scale system controlled well to meet water quality limit set for effluent. [•] MPC for ABA2 system saved about 19% aeration energy. [Copyright &y& Elsevier]

Ultra-wideband (UWB) signals with a large bandwidth has some advantages like multipath immunity, low transmission power, good resolution for ranging and detecting geo locations, as well as it can resist to narrow-band interference. These signals are used for transmission in short distance with high throughput. In this paper, we have analyzed different modulation schemes for performance comparison in terms of BER with UWB Gaussian second derivative monopulse and wavelet-based monopulse. The simulation results demonstrate that wavelet-based monopulse provides better performance in comparison to the other two monopulses. [ABSTRACT FROM AUTHOR]

Abstract: Explicit time stepping renders many high-resolution computational schemes to become less efficient when dealing with non-uniform grids typical of many aeroacoustic applications. Asynchronous time stepping, i.e., updating the solution in different cell sizes according to their local rates, is known to be a promising way to improve the efficiency of explicit time-stepping methods without compromise in accuracy. In the present paper, a new asynchronous time-stepping algorithm is developed for the Compact Accurately Boundary-Adjusting high-REsolution Technique (CABARET) Euler method. This allows to significantly speedup the original single-step CABARET method with non-uniform grids and improves its accuracy at the same time. Numerical examples are provided and issues associated with the method performance on various grid resolutions are discussed. [Copyright &y& Elsevier]

Highlights: [•] We proposed prioritized proactive spectrum handoff decision schemes. [•] Proposed schemes are modeled using a preemptive resume priority (PRP) M/G/1 queue. [•] Handoff delay is reduced by the proposed schemes. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we propose a Single Classifier-based Multiple Classification Scheme (SMCS) that uses only a single classifier to generate multiple classifications for a given test data point. The SMCS does not require the presence of multiple classifiers, and generates diversity through the creation of pseudo test samples. The pseudo test sample generation mechanism allows the SMCS to adapt to dynamic environments without multiple classifier training. Moreover, because of the presence of multiple classifications, classification combination schemes, such as majority voting, can be applied, and so the mechanism may improve the recognition rate in a manner similar to that of Multiple Classifier Systems (MCS). The experimental results confirm the validity of the proposed SMCS as applicable to many classification systems. Even without parameter selection, the average performance of the SMCS is still comparable to that of Bagging or Boosting. Moreover, the SMCS and the traditional MCS scheme are not mutually exclusive, and the SMCS can be applied along with traditional MCS, such as Bagging and Boosting. [Copyright &y& Elsevier]

Given the multilevel internal SSD parallelism at the different four levels: channel-level, chip-level, die-level, and plane-level, how to exploit these levels of parallelism will directly and significantly impact the performance and endurance of SSDs, which is in turn primarily determined by three internal factors, namely, advanced commands, allocation schemes, and the priority order of exploiting the four levels of parallelism. In this paper, we analyze these internal factors to characterize their impacts, interplay, and parallelism for the purpose of performance and endurance enhancement of SSDs through an in-depth experimental study. We come to the following key conclusions: 1) Different advanced commands provided by Flash manufacturers exploit different levels of parallelism inside SSDs, where they can either improve or degrade the SSD performance and endurance depending on how they are used; 2) Different physical-page allocation schemes employ different advanced commands and exploit different levels of parallelism inside SSDs, giving rise to different performance and endurance impacts; 3) The priority order of using the four levels of parallelism has the most significant performance and endurance impact among the three internal factors. The optimal priority order of using the four levels of parallelism in SSDs is found to be: 1) the channel-level parallelism; 2) the die-level parallelism; 3) the plane-level parallelism; and 4) the chip-level parallelism. [ABSTRACT FROM PUBLISHER]

This paper studies relay selection schemes for two-way amplify-and-forward (AF) relay networks. For a network with two users that exchange information via multiple AF relays, we first consider a single-relay selection (SRS) scheme based on the maximization of the worse signal-to-noise ratio (SNR) of the two end users. The cumulative distribution function (CDF) of the worse SNR of the two users and its approximations are obtained, based on which the block error rate (BLER), the diversity order, the outage probability, and the sum-rate of the two-way network are derived. Then, with the help of a relay ordering, a multiple-relay selection (MRS) scheme is developed. The training overhead and feedback requirement for the implementation of the relay selection schemes are discussed. Numerical and simulation results are provided to corroborate the analytical results. [ABSTRACT FROM AUTHOR]

Several schemes for computing the sum of squares for fixed point numbers are designed, synthesized, and evaluated in this study. The schemes use radix-2 folding, radix-4 folding, and radix-4 dual recoding approaches for squaring. The schemes have been modeled in hardware description language, simulated, and synthesized using Cadence SOC81 in 45 nm and 90 nm libraries and with Mentor Graphics Leonardo Spectrum for 180 nm. We show delay and area for 16-, 24-, and 32-bit operands. After hard-wire and software optimizations, it is seen that schemes with radix-4 give better results, especially in area. [ABSTRACT FROM AUTHOR]

In these days there are plenty of signature schemes such as the (t, n) threshold proxy signature scheme (Kumar and Verma 2010). Thenetwork is a shared medium so that the weakness security attacks such as eavesdropping, replay attack, and modification attack. Thus, we have to establish a common key for encrypting/decrypting our communications over an insecure network. In this scheme, a (t, n) threshold proxy signature scheme based on RSA, any t or more proxy signers can cooperatively generate a proxy signature while t - 1 or fewer of them cannot do it. The threshold proxy signature scheme uses the RSA cryptosystem to generate the private and the public key of the signers (Rivest et al., 1978). Comparison is done on the basis of time complexity, space complexity, and communication overhead. We compare the performance of four schemes (Hwang et al. (2003), Kuo and Chen (2005), Yong-Jun et al. (2007), and Li et al. (2007), with the performance of a scheme that has been proposed earlier by the authors of this paper. In the proposed scheme, both the combiner and the secret share holder can verify the correctness of the information that they are receiving from each other. Therefore, the enhanced threshold proxy signature scheme is secure and efficient against notorious conspiracy attacks. [ABSTRACT FROM AUTHOR]

Abstract: Prototype generation techniques have arisen as very competitive methods for enhancing the nearest neighbor classifier through data reduction. Within the prototype generation methodology, the methods of adjusting the prototypes'' positioning have shown an outstanding performance. Evolutionary algorithms have been used to optimize the positioning of the prototypes with promising results. However, these results can be improved even more if other data reduction techniques, such as prototype selection and feature weighting, are considered. In this paper, we propose a hybrid evolutionary scheme for data reduction, incorporating a new feature weighting scheme within two different prototype generation methodologies. Specifically, we will focus on a self-adaptive differential evolution algorithm in order to optimize feature weights and the placement of the prototypes. The results are contrasted with nonparametric statistical tests, showing that our proposal outperforms previously proposed methods, thus showing itself to be a suitable tool in the task of enhancing the performance of the nearest neighbor classifier. [Copyright &y& Elsevier]

Synchronization of the carrier frequency offset (CFO) is a critical task in orthogonal frequency division multiplexing systems. Imperfect estimation of the CFO causes inter-carrier interference (ICI) that severely degrades the performance of the communications system. Although this is a well studied subject at the algorithmic level, more research is needed when considering imple-mentations in real hardware. Translation of an algorithmic specification to a hardware language is a time consuming task for the designer. This task is more difficult when the target technology offers limited resources, as in the case of field programmable gate arrays (FPGAs). Some rapid prototyping tools, as System Generator from Xilinx or Synplify DSP from Synopsys Synplicity, are available for the designer to facilitate this task. However, their performance has not been evaluated in the literature. Therefore, the goal of this paper is to present an illustrating example of an implementation methodology using these tools and to evaluate their performance when considering a real design. In particular, several FPGA implementations of a frequency syn-chronization scheme for the 802.16d (fixed WiMAX) standard using these rapid prototyping tools are studied and evaluated. The results from the different solutions are analyzed and compared to draw conclusions about their advantages and drawbacks. [ABSTRACT FROM AUTHOR]

Abstract: We propose a heuristic priority based wavelength assignment (HPWA) scheme to minimize the blocking probability. In this scheme, the connection requests having same s–d pair are groomed first and then these groomed connection requests are served for routing and wavelength assignment according to their priority order. The priority order of each groomed connection request is estimated based on both the types of path (direct link physical path or in-direct link physical path) first and then their traffic volume. The performance analysis of our proposed scheme is made in terms of blocking probability and compared the same with similar heuristic non-priority based wavelength assignment (HNPWA) scheme. Simulation study shows that the blocking probability of HPWA scheme is less than that of NPRWA. It is also seen that the performance of the proposed scheme is better in comparison to HNPWA, when the number of connection requests increases in the network. [Copyright &y& Elsevier]

Abstract: Designing incentive schemes for Peer-to-Peer (P2P) multimedia sharing applications, where the participating peers find it in their self-interest to contribute resources rather than to “free-ride”, is challenging due to the unique features exhibited by such networks: large populations of anonymous peers interacting infrequently, asymmetric interests of peers, network errors, multiple concurrent transactions, low-cost implementation requirements, etc. In this paper, to address these challenges, we design and rigorously analyze a new family of incentive protocols that utilizes social norms. In the proposed protocols, each peer maintains a reputation reflecting its past behaviors in the P2P system (i.e. whether the peers have followed or not the social strategy prescribed by the social norm), and the social norm rewards and punishes peers depending on their reputations. We first define the concept of a sustainable social norm, under which no peer has an incentive to deviate from the social strategy prescribed by the protocol. We then formulate the problem of designing optimal social norms, which selects the social norm that maximizes the network performance among all sustainable social norms. In particular, we prove that, given the P2P network and peers'' characteristics, social norms can be designed such that it becomes in the self-interest of peers to contribute their contents to the network rather than to free-ride. We also investigate the impact of various punishment schemes on the social welfare as well as how should the optimal social norms be designed if altruistic and malicious peers are active in the network. Our results show that optimal social norms are capable of deterring free-riding behaviors and providing significant improvements in the sharing efficiency of multimedia P2P networks. [Copyright &y& Elsevier]

Abstract: Early detection of ventricular fibrillation (VF) is crucial for the success of the defibrillation therapy in automatic devices. A high number of detectors have been proposed based on temporal, spectral, and time–frequency parameters extracted from the surface electrocardiogram (ECG), showing always a limited performance. The combination ECG parameters on different domain (time, frequency, and time–frequency) using machine learning algorithms has been used to improve detection efficiency. However, the potential utilization of a wide number of parameters benefiting machine learning schemes has raised the need of efficient feature selection (FS) procedures. In this study, we propose a novel FS algorithm based on support vector machines (SVM) classifiers and bootstrap resampling (BR) techniques. We define a backward FS procedure that relies on evaluating changes in SVM performance when removing features from the input space. This evaluation is achieved according to a nonparametric statistic based on BR. After simulation studies, we benchmark the performance of our FS algorithm in AHA and MIT-BIH ECG databases. Our results show that the proposed FS algorithm outperforms the recursive feature elimination method in synthetic examples, and that the VF detector performance improves with the reduced feature set. [Copyright &y& Elsevier]

Inner and outer bounds are derived on the optimal performance of fixed-length block codes on discrete memoryless channels with feedback and errors-and-erasures decoding. First, an inner bound is derived using a two-phase encoding scheme with communication and control phases together with the optimal decoding rule for the given encoding scheme, among decoding rules that can be represented in terms of pairwise comparisons between the messages. Then, an outer bound is derived using a generalization of the straight-line bound to errors-and-erasures decoders and the optimal error-exponent tradeoff of a feedback encoder with two messages. In addition, upper and lower bounds are derived, for the optimal erasure exponent of error-free block codes in terms of the rate. Finally, a proof is provided for the fact that the optimal tradeoff between error exponents of a two-message code does not improve with feedback on discrete memoryless channels (DMCs). [ABSTRACT FROM PUBLISHER]

In this study, the authors investigate the hybrid decode-amplify-forward (HDAF) relaying protocol for the multiple parallel relays over independent and non-identical distribution flat Rayleigh fading channels using maximum ratio combining at the destination. They derive closed-form tight bounds for the outage probability and bit error rate (BER) of the HDAF relaying protocol. They also show that the outage probability performance of this protocol outperforms decode-forward (DF) protocol, and is very close to amplify-forward (AF) scheme. On the other hand, the BER of the HDAF scheme is superior to AF protocol, and is close to BER of DF scheme. From practical point of view, when taking into account outage and BER performance of a system together, the HDAF protocol performs better than AF and DF schemes by combining the merits of both. Also, the authors investigate power allocation among the relay nodes to minimise the system outage probability and BER under total and individual power constraints. Numerical results are provided to show the correctness of our analytical expressions. [ABSTRACT FROM AUTHOR]

The authors propose an optimal resource allocation (RA) scheme for wireless multi-destination relay systems with orthogonal frequency division multiplexing (OFDM) modulation. The authors work is different in that they consider a practical downlink OFDM-based relay network, where a relay is used to help the source (base station) communicate with multiple out-of-range destinations (users), rather than a single destination (user) as assumed in most previous work. The proposed optimal RA scheme consists of subchannel allocation (SA), subchannel pairing and joint source-relay power allocation (PA). In particular, it is shown that both SA and joint source-relay PA play a dominant role in the three steps of RA. It is also demonstrated that the shorter the distance between the source and the relay, the more impact of multiuser diversity on the system capacity. By employing SA and joint source-relay PA only, a near-optimal performance can be achieved. This work can be extended to the multi-hop, multi-relay and multi-destination uplink/downlink OFDM system. [ABSTRACT FROM AUTHOR]

Multi-channel multi-interface (MCMI) medium access can provide high-throughput services for wireless ad hoc networks. However, the multi-channel hidden terminal problem and the rendezvous problem must be addressed. This study aims to design a low-cost integrated solution to address the two problems, so as to fully exploit the available wireless interfaces and channels to enhance the network performance, especially the network aggregated throughput. The authors propose a new MCMI synchronisation-based media access control (SMAC) protocol with the operation of two interfaces. Unlike other studies, the authors propose a novel interface classification using a synchronisation interface (SynIF) and a normal interface (NorIF). A synchronisation mechanism and a new channel coordination procedure are operated on SynIF, and data packets can be transmitted on SynIF and NorIF concurrently. All control messages occur only in a variable-length channel coordination window (CCW) on a common control channel. The maximum length of CCW and network throughput are analysed mathematically and the performance of the protocol is validated in ns-2 simulator through comparisons with few other MCMI-MAC protocols. In IEEE 802.11-based multi-interface ad hoc networks, when using MCMI-SMAC, the results show that the network aggregated throughput is enhanced significantly and the protocol overhead is very low. [ABSTRACT FROM AUTHOR]

We present a scheme for perfect cloning or orthogonal complementing an unknown arbitrary three-qubit state with assistance. This cloning scheme is divided into two stages. In the first stage, the initial state can be teleported from a sender to a receiver probabilistically via three partially entangled states. In the second stage, the exact copying and orthogonal complementing of the three-qubit state can be created with unity fidelity in a probabilistic manner with the state preparer performing an appropriate tri-particle projective measurement. It is shown that for some special ensembles of the three-qubit state our assisted cloning scheme can be achieved exactly and deterministically. [ABSTRACT FROM AUTHOR]

Abstract: This paper proposes a novel robust video watermarking scheme based on local affine invariant features in the compressed domain. This scheme is resilient to geometric distortions and quite suitable for DCT-encoded compressed video data because it performs directly in the block DCTs domain. In order to synchronize the watermark, we use local invariant feature points obtained through the Harris-Affine detector which is invariant to affine distortions. To decode the frames from DCT domain to the spatial domain as fast as possible, a fast inter-transformation between block DCTs and sub-block DCTs is employed and down-sampling frames in the spatial domain are obtained by replacing each sub-blocks DCT of 2×2 pixels with half of the corresponding DC coefficient. The above-mentioned strategy can significantly save computational cost in comparison with the conventional method which accomplishes the same task via inverse DCT (IDCT). The watermark detection is performed in spatial domain along with the decoded video playing. So it is not sensitive to the video format conversion. Experimental results demonstrate that the proposed scheme is transparent and robust to signal-processing attacks, geometric distortions including rotation, scaling, aspect ratio changes, linear geometric transforms, cropping and combinations of several attacks, frame dropping, and frame rate conversion. [Copyright &y& Elsevier]

The aim of this paper is, in accordance with efficient web search service operation objectives, to propose enhancements to the sophistication of the functionality that can be offered by search engine services. A meta-search third-party result ranking mechanism is proposed, which is capable of adapting over the continuous changes that occur on the web, providing in parallel personalized information acquisition considering the user's navigation behaviour. Transparency is achieved for both personalization and web evolution adaptation mechanisms, requiring virtually none effort from the user's part. In essence, the proposed meta search engine rates, re-organises and combines the results acquired from search services for a specific user information resource request in accordance with a weighted combination of a performance related factor (tightly related to the ranking of the web result as given by the search engine service) and a reliability related factor (corresponding to the user satisfaction stemming from the specific web result that he/she browses), while the performance of each search engine with respect to adequately adapting to the web evolution is taken into account. For the evaluation of the web results reliability, a collaborative reputation mechanism is utilized, which helps estimating their quality and predicting their future usability, taking into account their past performance in consistently satisfying user expectations. A set of results indicative of the efficiency of our proposed scheme is provided. The Internet search services used were Google, MSN and Yahoo! [ABSTRACT FROM AUTHOR]

By examining the diversity-multiplexing tradeoff (DMT) of an amplify-and-forward (AF) multi-antenna multi-relay network, a procedure to select the optimal number of relays and relay candidates is established. Subsequently, a distributed BLAST transmission scheme in conjunction with successive nulling and cancellation at destination is proposed to achieve the optimal DMT. Illustrative results indicate that the proposed method can significantly enhance the outage probability performance, and for a selected number of relays in use, the performance enhancement can be further improved by increasing the number of available relays in the AF network. Copyright © 2010 John Wiley & Sons, Ltd. A distributed BLAST transmission scheme in conjunction with successive nulling and cancellation at destination is proposed to achieve the optimal DMT. Illustrative results indicate that the proposed method can significantly enhance the outage probability performance, and for a selected number of relays in use, the performance enhancement can be further improved by increasing the number of available relays in the amplify-and-forward (AF) network. Copyright © 2010 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Abstract: Dynamic balancing of computation and communication load is vital for the execution stability and performance of distributed, parallel simulations deployed on the shared, unreliable resources of large-scale environments. High Level Architecture (HLA) based simulations can experience a decrease in performance due to imbalances that are produced initially and/or during run time. These imbalances are generated by the dynamic load changes of distributed simulations or by unknown, non-managed background processes resulting from the non-dedication of shared resources. Due to the dynamic execution characteristics of elements that compose distributed applications, the computational load and interaction dependencies of each simulation entity change during run time. These dynamic changes lead to an irregular load and communication distribution, which increases overhead of resources and latencies. A static partitioning of load is limited to deterministic applications and is incapable of predicting the dynamic changes caused by distributed applications or by external background processes. Therefore, a scheme for balancing the communication and computational load during the execution of distributed simulations is devised in a scalable hierarchical architecture. The proposed balancing system employs local and cluster monitoring mechanisms in order to observe the distributed load changes and identify imbalances, repartitioning policies to determine a distribution of load and minimize imbalances. A migration technique is also employed by this proposed balancing system to perform reliable and low-latency load transfers. Such a system successfully improves the use of shared resources and increases distributed simulations’ performance by minimizing communication latencies and partitioning the load evenly. Experiments and comparative analyses were conducted in order to identify the gains that the proposed balancing scheme provides to large-scale distributed simulations. [ABSTRACT FROM AUTHOR]

Based on superposition of signals in the time domain, we propose a new low-complexity scheme for the reduction of the peak-to-average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems. The proposed scheme first generates signal candidates by combining an OFDM signal and its cyclically delayed versions with different delays and phases, and then selects the candidate signal with minimum PAPR. It is shown that the complexity of the proposed scheme is significantly lower than that of the selective mapping (SLM) at the cost of some degradation in the bit error rate (BER) performance and, at similar PAPR and coded BER performance, is lower than that of the low-complexity SLM proposed recently. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, time-spreading wavelength-hopping optical CDMA system using 2-D run-length limited code is investigated. The run-length limited code we use here is predicated upon spatial coding scheme, which can improve system performance significantly. In our proposed system, we employ carrier-hopping prime code and its shifted version as signature sequences. Based on the zero auto-correlation sidelobes property of signature sequence, we propose a two-state trellis coding architecture, which utilizes 2-D parallel detection scheme. The proposed scheme is compact and simple that can be applied to more complicated trellis to further enhance system performance. Multiple access interference is the main deterioration factor in optical CDMA system that affects system performance adversely. Aside from the multiple access interference, some of the adverse impacts of system performance are also taken into consideration, which include thermal noise, shot noise, relative intensity noise, and beat noise. [ABSTRACT FROM AUTHOR]

Delay-tolerant networks (DTNs) provide a promising solution to support wide-ranging applications in the regions where end-to-end network connectivity is not available. In -DTNs, the intermediate nodes on a communication path are expected to store, carry, and forward the in-transit messages (or bundles) in an opportunistic way, which is called opportunistic data forwarding. Such a forwarding niethod depends on the hypothesis that each individual node is ready to forward packets for others. This assumption, however, might easily be violated due to the existence of selfish or even malicious nodes, which may be unwilling to waste their precious wireless resources to serve as bundle relays. To address this problem, we propose a secure multilayer credit-based incentive scheme to stimulate bundle forwarding cooperation among DTN nodes. The proposed scheme can be implemented in a fully distributed manner to thwart various attacks without relying on any tamperproof hardware. In addition, we introduce several efficiency optimization techniques to improve the overall efficiency by exploiting the unique characteristics of DTNs. Extensive simulations demonstrate the efficacy and efficiency of the proposed scheme. [ABSTRACT FROM AUTHOR]

We study the information brokerage schemes in wireless sensor networks, which allow consumers to obtain data from producers by replicating and retrieving data in a certain set of sensors, and propose a novel information brokerage scheme, termed RDRIB. Unlike existing information brokerage schemes, RDRIB guarantees successful data retrieval without using any boundary detection algorithm and the geographic location information acquired by the global positioning system (GPS). In RDRIB, the double-ruling technique is used to replicate and retrieve the data within a constructed virtual boundary, and simulations show that RDRIB has good performance in terms of the replication memory overhead, the replication message overhead, the retrieval message overhead, the retrieval latency, and the construction message overhead. [ABSTRACT FROM PUBLISHER]

This paper introduces a video coding scheme called Realistic Multi-view Scalable Video Coding (RMSVC), which is designed for the future ubiquitous environment. Unlike most video coding schemes that support only 2D or 3D displays, the proposed RMSVC coding scheme can support realistic services, such as 3D television, stereoscopic display, variablesized 2D displays, etc., and can efficiently deliver realistic video data in the ubiquitous environment that mixes various terminals and networks. In this paper, the proposed RMSVC scheme is designed and implemented by integrating the structures of Multi-view Video Coding (MVC) and Scalable Video Coding (SVC) schemes, and then shows in a simulation the possibility of realizing RMSVC. In addition, this paper proposes a layered prediction structure for the proposed RMSVC scheme. The simulation results show that the proposed structure remarkably improves the performance of random access while maintaining very similar coding efficiency. [ABSTRACT FROM PUBLISHER]

In this paper, we study the performance of non-cooperative multiple access systems with noisy separated channels, where correlated sources communicate to an access point (AP) through block-faded links. In the considered scenario, perfect channel state information (CSI) is assumed at the receiver while no CSI is available at the transmitters. We first consider uncoded transmissions from the sources to the AP, which exploits the source correlation to carry out joint channel detection (JCD). In this scenario, we propose an analytical approach to evaluate the achievable performance in terms of average bit error rate (BER). We then investigate the impact of coding, considering the same fixed coding scheme at each source. Then, we consider an extrinsic information transfer (EXIT) chart-based framework to optimize the design of concatenated and low-density parity-check (LDPC) codes for JCD schemes. [ABSTRACT FROM PUBLISHER]