Learn More
Cooperative relay communication in a fading channel environment under the orthogonal amplify-and-forward (OAF), nonorthogonal and orthogonal selection decode-and-forward (NSDF and OSDF) protocols is considered here. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time (ST) code(More)
We examine the extent to which Gaussian relay networks can be approximated by deterministic networks, and present two results, one negative and one positive. The gap between the capacities of a Gaussian relay network and a corresponding linear deterministic network can be unbounded. The key reasons are that the linear deterministic model fails to capture(More)
This paper presents the first concerted look at low correlation sequence families over quadrature amplitude modulation (QAM) constellations of size and their potential applicability as spreading sequences in a code-division multiple-access (CDMA) setting. Five constructions are presented, and it is shown how such sequence families have the ability to(More)
— This paper considers protocols for fading, wireless relay networks that aim to achieve cooperative diversity through the use of distributed space-time codes. All point-to-point communication is modeled as taking place over quasi-static, Rayleigh-fading channels with each node in the network operating in half-duplex mode. Channel-state information is(More)
CRM is a kind of implemented model for managing a company's interactions with their customers. CRM involves the customer classification to understand the behavior of the customer. There is a vital role of the data mining techniques for the classification. This paper presents the concept of one of the data mining technique ART for the customer classification(More)
Scaling of ecological data can present a challenge firstly because of the large amount of information contained in an ecological data set, and secondly because of the problem of fitting data to models that we want to use to capture structure. We present a measure of similarity between data collected at several scales using the same set of attributes. The(More)
This paper presents a theoretical study of the partitioning problem for a co-design environment for speeding up compute intensive applications. The environment has a uniprocessor host with a reconfigurable target platform comprising of FPGAs and a library of functions pre-synthesized for hardware or software implementation. The partitioning problem is thus(More)