نتایج جستجو برای: key pre
تعداد نتایج: 847114 فیلتر نتایج به سال:
The bit error rate (BER) performance of an M branch maximal-ratio combiner (MRC) for the detection of signals in a correlated Nakagami-fading channel is analyzed. Coherent and incoherent detection of frequency shift-keying (FSK) and phase-shift keying (PSK) signals are considered. It is assumed that the fading parameters in each diversity branch are identical. The effect of correlation is studi...
A phase-shift keying (PSK) demodulator is demonstrated for the target application of low power and high data rate inductive links. The demodulator based on the single-bit sampling demodulation scheme is capable of operating in binary, quadrature, 8-, and 16-PSK mode. The prototype chip realized in 0.18mm CMOS process can demodulate up to 1.25 MSymbol/s at 5-MHz carrier frequency. It occupies 24...
Aktract-Construction of efficient block-encoded M-ary phase shift keying (M-PSK) schemes is investigated in this paper. An algebraic approach is adopted in which the basic modulation signals are associated with the elements of a finite group. Using some of the properties of group partition chains, the algebraic properties of linear codes are investigated. From this analysis, a class of codes ca...
We analyze the performance of direct-sequence spread spectrum multiple access (DS/SSMA) systems, which use trellis coding with asymmetric phase shift keying (PSK) modulation. By designing the signal constellation to be asymmetric, we obtain a performance gain for the DS/SSMA system over the systems using the traditional symmetric signal constellation. Bit error probability analysis of the propo...
The availability of multiple transmit antennas allows for two-dimensional channel codes that exploit the spatial transmit diversity. These codes were referred to as space–time codes by Tarokh et al. Most prior works on space–time code design have considered quasi-static fading channels. In this paper, we extend our earlier work on algebraic space–time coding to block-fading channels. First, we ...
In this correspondence, in extension of Piret’s bound for codes over phase-shift keying (PSK) signal sets, we investigate the application of the Gilbert–Varshamov (GV) bound to a variety of distance-uniform (DU) signal sets in Euclidean space. It is shown that four-dimensional signal sets matched to binary tetrahedral, binary octahedral, and binary icosahedral groups lead to better bounds compa...
Space–time (ST) constellations that are linear over the field of complex numbers are considered. Relevant design criteria for these constellations are summarized and some fundamental limits to their achievable performances are established. The fundamental tradeoff between rate and diversity is investigated under different constraints on the peak power, receiver complexity, and rate scaling with...
Securing e-health applications in the context of Internet of Things (IoT) is challenging. Indeed, resources scarcity in such environment hinders the implementation of existing standard based protocols. Among these protocols, MIKEY (Multimedia Internet KEYing) aims at establishing security credentials between two communicating entities. However, the existing MIKEY modes fail to meet IoT specific...
In recent years, amendments to IEEE standards for wireless networks added support for authentication algorithms based on the Extensible Authentication Protocol (EAP). Available solutions generally use digital certificates or pre-shared keys but the management of the resulting implementations is complex or unlikely to be scalable. In this paper we present EAP-SRP-256, an authentication method pr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید