A unified framework for performance evaluation over generalized fading channels

In this paper, we present a unified framework to analyze the performance of the average bit error probability (BEP) and the outage probability over generalized fading channels. Specifically, we assume that the probability density function (PDF) of the instantaneous signal-to-noise ratio \(\zeta \) is given by the product of: power function, exponential function, and the modified Bessel function of the first kind, i.e., \(f_{\zeta }(\zeta )=\zeta ^{\lambda -1}exp\left( -a\zeta ^{\beta }\right) I_{v}\left( b\zeta ^{\beta }\right) \). Based on this PDF, we obtain a novel closed-form expression for the average BEP over such channels perturbed by an additive white generalized Gaussian noise (AWGGN). Note that other well-known noise types can be deduced from the AWGGN as special cases such as Gaussian noise, Laplacian noise, and impulsive noise. Furthermore, we obtain a novel closed-form expression for the outage probability. As an example of such channels, and without loss of generality, we analyze the performance of the average BEP and the outage probability over the \(\eta \)–\(\mu \) fading channels. Analytical results accompanied with Monte-Carlo simulations are provided to validate our analysis.     

An Accurate Performance Analysis for Regenerative Multi-hop Relaying in Wireless Networks Over Composite Multipath/Shadowed Fading

This paper presents and evaluates the performance of wireless networks that utilize the decode-and-forward relay. This multi-hop relaying scheme communicates over Extended Generalized-\({\mathcal {K}}\) (\(\hbox {EG}{\mathcal {K}}\)) composite fading channels to create performance evaluation. To this effect, new exact and easy to compute formulas for several performance metrics are derived. More specifically, new and exact-form mathematical formulas are derived for the cumulative distribution function, the generalized moments of the overall end-to-end signal-to-noise ratio, the outage probability (\({\hbox {P}}_{\text{out}}\)), the ergodic capacity (\({\mathcal {C}}_{\text{Ergodic}}\)), the moment generating function, and the average error probability (\({\hbox {Pr(e)}}\)) for different modulation schemes. Moreover, we carried out a series of computer simulation experiments in order to testify the accuracy of the derived framework. Finally, we discussed the impact of different parameters including fading/shadowing parameters, transmitted power and the number of hops on the derived expressions.     

$$\ell _{1/2,1}$$ group sparse regularization for compressive sensing

Recently, the design of group sparse regularization has drawn much attention in group sparse signal recovery problem. Two of the most popular group sparsity-inducing regularization models are \(\ell _{1,2}\) and \(\ell _{1,\infty }\) regularization. Nevertheless, they do not promote the intra-group sparsity. For example, Huang and Zhang (Ann Stat 38:1978–2004, 2010) claimed that the \(\ell _{1,2}\) regularization is superior to the \(\ell _1\) regularization only for strongly group sparse signals. This means the sparsity of intra-group is useless for \(\ell _{1,2}\) regularization. Our experiments show that recovering signals with intra-group sparse needs more measurements than those without, by the \(\ell _{1,\infty }\) regularization. In this paper, we propose a novel group sparsity-inducing regularization defined as a mixture of the \(\ell _{1/2}\) norm and the \(\ell _{1}\) norm, referred to as \(\ell _{1/2,1}\) regularization, which can overcome these shortcomings of \(\ell _{1,2}\) and \(\ell _{1,\infty }\) regularization. We define a new null space property for \(\ell _{1/2,1}\) regularization and apply it to establish a recoverability theory for both intra-group and inter-group sparse signals. In addition, we introduce an iteratively reweighted algorithm to solve this model and analyze its convergence. Comprehensive experiments on simulated data show that the proposed \(\ell _{1/2,1}\) regularization is superior to \(\ell _{1,2}\) and \(\ell _{1,\infty }\) regularization.     

IGCC for PAPR Reduction in OFDM Systems Over the Nonlinearity of SSPA and Wireless Fading Channels

High peak-to-average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems seriously impacts power efficiency in radio frequency section due to the nonlinearity of high-power amplifiers. In this article, an improved gamma correction companding (IGCC) is proposed for PAPR reduction and investigated under multipath fading channels. It is shown that the proposed IGCC provides a significant PAPR reduction while improving power spectral levels and error performances when compared with the previous gamma correction companding. IGCC outperforms existing companding methods when a nonlinear solid-state power amplifier (SSPA) is considered. Additionally, with the introduction of \(\alpha , \beta , \gamma \), and \(\varDelta \) parameters, the improved companding can offer more flexibility in the PAPR reduction and therefore achieves a better trade-off among the PAPR gain, bit error rate (BER), and power spectral density (PSD) performance. Moreover, IGCC improves the BER and PSD performances by minimizing the nonlinear companding distortion. Further, IGCC improves signal-to-noise ratio (SNR) degradation (\(\varDelta _{\mathrm{SNR}}\)) and total degradation performances by 12.2 and 12.8 dB, respectively, considering an SSPA with input power back-off of 3.0 dB. Computer simulation reveals that the performances of IGCC are independent of the modulation schemes and works with arbitrary number of subcarriers (N), while it does not increase computational complexity when compared with the existing companding schemes used for PAPR reduction in OFDM systems.     

On the Ergodic Capacity of Distributed MIMO Antenna Systems

We consider distributed multiple-input–multiple-output (MIMO) antenna systems, along with their certain generalizations. We show that distributed MIMO configuration can be mapped to a semicorrelated (one side correlated) Wishart model. For a given set of large-scale fading parameters, associated with the path loss and shadow fading, we derive exact and closed-form results for the marginal density of eigenvalues of \(\mathbf{H}^\dag \mathbf{H}\) (or \(\mathbf{H} \mathbf{H} ^\dag\)), where \(\mathbf{H}\) is the channel matrix. We also obtain exact and closed-form expressions for the ergodic channel capacity with the aid of Meijer G-function. The ergodic capacity of semicorrelated Rayleigh fading channel follows as a special case. All analytical results are validated by comparison with Monte-Carlo simulations.     

Design and Performance Study of Dynamic Fractors in Any of the Four Quadrants

A fractor is a simple fractional-order system. Its transfer function is \(1/Fs^{\alpha }\); the coefficient, F, is called the fractance, and \(\alpha \) is called the exponent of the fractor. This paper presents how a fractor can be realized, using RC ladder circuit, meeting the predefined specifications on both F and \(\alpha \). Besides, commonly reported fractors have \(\alpha \) between 0 and 1. So, their constant phase angles (CPA) are always restricted between \(0^{\circ }\) and \(-90^{\circ }\). This work has employed GIC topology to realize fractors from any of the four quadrants, which means fractors with \(\alpha \) between \(-\)2 and +2. Hence, one can achieve any desired CPA between \(+180^{\circ }\) and \(-180^{\circ }\). The paper also exhibits how these GIC parameters can be used to tune the fractance of emulated fractors in real time, thus realizing dynamic fractors. In this work, a number of fractors are developed as per proposed technique, their impedance characteristics are studied, and fractance values are tuned experimentally.     

A novel optimized neutrosophic <Emphasis Type="Italic">k</Emphasis>-means using genetic algorithm for skin lesion detection in dermoscopy images

This paper implemented a new skin lesion detection method based on the genetic algorithm (GA) for optimizing the neutrosophic set (NS) operation to reduce the indeterminacy on the dermoscopy images. Then, k-means clustering is applied to segment the skin lesion regions. Therefore, the proposed method is called optimized neutrosophic k-means (ONKM). On the training images set, an initial value of \(\alpha \) in the \(\alpha \)-mean operation of the NS is used with the GA to determine the optimized \(\alpha \) value. The Jaccard index is used as the fitness function during the optimization process. The GA found the optimal \(\alpha \) in the \(\alpha \)-mean operation as \(\alpha _{\mathrm{optimal}} =0.0014\) in the NS, which achieved the best performance using five fold cross-validation. Afterward, the dermoscopy images are transformed into the neutrosophic domain via three memberships, namely true, indeterminate, and false, using \(\alpha _{\mathrm{optimal}}\). The proposed ONKM method is carried out to segment the dermoscopy images. Different random subsets of 50 images from the ISIC 2016 challenge dataset are used from the training dataset during the fivefold cross-validation to train the proposed system and determine \(\alpha _{\mathrm{optimal}}\). Several evaluation metrics, namely the Dice coefficient, specificity, sensitivity, and accuracy, are measured for performance evaluation of the test images using the proposed ONKM method with \(\alpha _{\mathrm{optimal}} =0.0014\) compared to the k-means, and the \(\gamma \)–k-means methods. The results depicted the dominance of the ONKM method with \(99.29\pm 1.61\%\) average accuracy compared with k-means and \(\gamma \)–k-means methods.     

New Efficient Algorithms for Multiplication Over Fields of Characteristic Three

In this paper, we first present an enhancement of the well-known Karatsuba 2-way and 3-way algorithms for characteristic three fields, denoted by \(\mathbb {F}_{3^{n}}\) where n≥1. We then derive a 3-way polynomial multiplication algorithm with five 1/3 sized multiplications that use interpolation in \(\mathbb {F}_{9}\). Following the computation of the arithmetic and delay complexity of the proposed algorithm, we provide the results of our hardware implementation of polynomial multiplications over \(\mathbb {F}_{3}\) and \(\mathbb {F}_{9}\). The final proposal is a new 3-way polynomial multiplication algorithm over \(\mathbb {F}_{3}\) that uses three polynomial multiplications of 1/3 of the original size over \(\mathbb {F}_{3}\) and one polynomial multiplication of 1/3 of the original size over \(\mathbb {F}_{9}\). We show that this algorithm represents about 15% reduction of the complexity over previous algorithms for the polynomial multiplications whose sizes are of practical interest.     

Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression

In typical applications of homomorphic encryption, the first step consists for Alice of encrypting some plaintext m under Bob’s public key \(\mathsf {pk}\) and of sending the ciphertext \(c = \mathsf {HE}_{\mathsf {pk}}(m)\) to some third-party evaluator Charlie. This paper specifically considers that first step, i.e., the problem of transmitting c as efficiently as possible from Alice to Charlie. As others suggested before, a form of compression is achieved using hybrid encryption. Given a symmetric encryption scheme \(\mathsf {E}\), Alice picks a random key k and sends a much smaller ciphertext \(c' = (\mathsf {HE}_{\mathsf {pk}}(k), \mathsf {E}_k(m))\) that Charlie decompresses homomorphically into the original c using a decryption circuit \(\mathcal {C}_{{\mathsf {E}^{-1}}}\). In this paper, we revisit that paradigm in light of its concrete implementation constraints, in particular \(\mathsf {E}\) is chosen to be an additive IV-based stream cipher. We investigate the performances offered in this context by Trivium, which belongs to the eSTREAM portfolio, and we also propose a variant with 128-bit security: Kreyvium. We show that Trivium, whose security has been firmly established for over a decade, and the new variant Kreyvium has excellent performance. We also describe a second construction, based on exponentiation in binary fields, which is impractical but sets the lowest depth record to \(8\) for \(128\)-bit security.     

Two-channel perfect reconstruction (PR) quadrature mirror filter (QMF) bank design using logarithmic window function and spline function

In this work, two-channel perfect reconstruction quadrature mirror filter (QMF) bank has been proposed based on the prototype filter using windowing method. A novel window function based on logarithmic function along with the spline function is utilized for the design of prototype filter. The proposed window has a variable parameter ‘\(\alpha \)’, which varies the peak side lobe level and rate of fall-off side lobe level which in turn affects the peak reconstruction error (PRE) and amplitude distortion (\(e_{am}\)) of the QMF bank . The transition width of the prototype is controlled by the spline function using the parameter ‘\(\mu \)’. The perfect reconstruction condition is satisfied by setting the cutoff frequency (\(\omega _{c}\)) of the prototype low-pass filter at ‘\(\pi /2\)’. The performance of the proposed design method has been evaluated in terms of mean square error in the pass band, mean square error in the stop band, first side lobe attenuation (\(A_{1}\)), peak reconstruction error (PRE) and amplitude error (\(e_{am}\)) for different values of ‘\(\alpha \)’ and ‘\(\mu \)’. The results are provided and compared with the existing methods.     

From Private Simultaneous Messages to Zero-Information Arthur–Merlin Protocols and Back

Göös et al. (ITCS, 2015) have recently introduced the notion of Zero-Information Arthur–Merlin Protocols (\(\mathsf {ZAM}\)). In this model, which can be viewed as a private version of the standard Arthur–Merlin communication complexity game, Alice and Bob are holding a pair of inputs x and y, respectively, and Merlin, the prover, attempts to convince them that some public function f evaluates to 1 on (x, y). In addition to standard completeness and soundness, Göös et al., require a “zero-knowledge” property which asserts that on each yes-input, the distribution of Merlin’s proof leaks no information about the inputs (x, y) to an external observer. In this paper, we relate this new notion to the well-studied model of Private Simultaneous Messages (\(\mathsf {PSM}\)) that was originally suggested by Feige et al. (STOC, 1994). Roughly speaking, we show that the randomness complexity of \(\mathsf {ZAM}\) corresponds to the communication complexity of \(\mathsf {PSM}\) and that the communication complexity of \(\mathsf {ZAM}\) corresponds to the randomness complexity of \(\mathsf {PSM}\). This relation works in both directions where different variants of \(\mathsf {PSM}\) are being used. As a secondary contribution, we reveal new connections between different variants of \(\mathsf {PSM} \) protocols which we believe to be of independent interest. Our results give rise to better \(\mathsf {ZAM}\) protocols based on existing \(\mathsf {PSM}\) protocols, and to better protocols for conditional disclosure of secrets (a variant of \(\mathsf {PSM}\)) from existing \(\mathsf {ZAM} \)s.     

Methods of spectral identification of hydroacoustic signals

It is considered methods of spectral identification of hydroacoustic signals based on comparison of \(\bar x_\alpha \) (f) dependences on spectrum frequency f of quantiles \(\bar x_\alpha \) (f) of hydroacoustic signals Fourier (Hartley) spectrum. The identification results are robust to abnormal interferences in channels of hydroacousic signals spreading, registration and reproduction.     

The $$\mathbb {}$$-curve Construction for Endomorphism-Accelerated Elliptic Curves

We give a detailed account of the use of \(\mathbb {Q}\)-curve reductions to construct elliptic curves over \(\mathbb {F}_{p^2}\) with efficiently computable endomorphisms, which can be used to accelerate elliptic curve-based cryptosystems in the same way as Gallant–Lambert–Vanstone (GLV) and Galbraith–Lin–Scott (GLS) endomorphisms. Like GLS (which is a degenerate case of our construction), we offer the advantage over GLV of selecting from a much wider range of curves and thus finding secure group orders when \(p\) is fixed for efficient implementation. Unlike GLS, we also offer the possibility of constructing twist-secure curves. We construct several one-parameter families of elliptic curves over \(\mathbb {F}_{p^2}\) equipped with efficient endomorphisms for every \(p > 3\), and exhibit examples of twist-secure curves over \(\mathbb {F}_{p^2}\) for the efficient Mersenne prime \(p = 2^{127}-1\).     

A 3.1–10.6 GHz UWB LNA Based on Self Cascode Technique for Improved Bandwidth and High Gain

In this work, we present a self cascode based ultra-wide band (UWB) low noise amplifier (LNA) with improved bandwidth and gain for 3.1–10.6 GHz wireless applications. The self cascode (SC) or split-length compensation technique is employed to improve the bandwidth and gain of the proposed LNA. The improvement in the bandwidth of SC based structure is around 1.22 GHz as compared to simple one. The significant enhancement in the characteristics of the introduced circuit is found without extra passive components. The SC based CS–CG structure in the proposed LNA uses the same DC current for operating first stage transistors. In the designed UWB LNA, a common source (CS) stage is used in the second stage to enhance the overall gain in the high frequency regime. With a standard 90 nm CMOS technology, the presented UWB LNA results in a gain \(\hbox {S}_{21}\) of \(20.10 \pm 1.65\,\hbox {dB}\) across the 3.1–10.6 GHz frequency range, and dissipating 11.52 mW power from a 1 V supply voltage. However, input reflection, \(\hbox {S}_{11}\), lies below \(-\,10\) dB from 4.9–9.1 GHz frequency. Moreover, the output reflection (\(\hbox {S}_{22}\)) and reverse isolation (\(\hbox {S}_{12}\)), is below \(-\,10\) and \(-\,48\) dB, respectively for the ultra-wide band region. Apart from this, the minimum noise figure (\(\hbox {NF}_{min}\)) value of the proposed UWB LNA exists in the range of 2.1–3 dB for 3.1–10.6 GHz frequency range with a a small variation of \(\pm \,0.45\,\hbox {dB}\) in its \(\hbox {NF}_{min}\) characteristics. Linearity of the designed LNA is analysed in terms of third order input intercept point (IIP3) whose value is \(-\,4.22\) dBm, when a two tone signal is applied at 6 GHz with a spacing of 10 MHz. The other important benefits of the proposed circuit are its group-delay variation and gain variation of \(\pm \,115\,\hbox {ps}\) and \(\pm \,1.65\,\hbox {dB}\), respectively.     

Quantization parameter cascading for video coding: leveraging a new temporal distortion propagation model

In video coder, inter-frame prediction causes distortion propagation among temporally adjacent frames. This distortion dependency is a crucial factor for rate control optimization. Quantization parameter cascading (QPC) is an efficient technique to achieve dependent rate distortion optimization (RDO). This paper proposes a general framework for temporal dependency analysis by leveraging a distortion propagation model, which is derived by employing window-based preanalysis on original frames. Then, a quantization parameter offset \(\delta \) model is proposed for achieving fine-granularity quantization control, according to the amount of distortion propagation measured by the relative propagation cost \(\rho \). This paper applies competitive decision in exploring \(\delta \)–\(\rho \) model as accurate as possible and then proposes an improved \(\delta \)–\(\rho \) model tailored for dependent RDO. The simulation results verify that the temporal QPC algorithm with the proposed model achieves up to 1.1–1.4 dB PSNR improvement, with smaller temporal distortion fluctuation contributed by efficient bit allocation.     

Statistical characteristics of an ensemble of ultrawideband communications channels under the conditions of multipath signal propagation in rooms

The estimates of data rates in the ultrawideband direct chaotic scheme of data transmission in rooms, which can be achieved at a specified level of error probability under the conditions of multipath signal propagation in wireless communications networks, are presented. The estimates have been obtained via direct numerical simulation of energy reception of chaotic signals at the output of communications channels. The channel impulse responses were formed according to the statistical model developed by the IEEE 802.15 working group for indoor applications. In the approximation of a dominant reverberation interference (multipath propagation), the portion of channels making it possible to transmit data with rates from 10 to 50 Mb/s and the practically important error probability (P _b ～ 10^?5?10^?4) is determined for the chaotic signal bandwidths Δf = 500 and 2000 MHz. It have been first revealed that, in the given ensemble of channels, the small portion of channels (5–20%) with high levels of error probability P _b substantially affects the dependence of the error probability averaged over the given type of channels (\(\bar P_b \) (R)) on the transmission rate. It has been demonstrated that quantity \(\bar P_b \) (R) is the practically important characteristic of noise immunity for the significant portion (～80–95%) of channels of the given type.     

Ultra-Fast Current Mode Sense Amplifier for Small $$I_{\mathrm{CELL}}$$ SRAM in FinFET with Improved Offset Tolerance

In this paper, a novel, high-performance and robust sense amplifier (SA) design is presented for small \(I_\mathrm{CELLl}\) SRAM, using fin-shaped field effect transistors (FinFET) in 22-nm technology. The technique offers data-line-isolated current sensing approach. Compared with the conventional CSA (CCSA) and hybrid SA (HSA), the proposed current feed-SA (CF-SA) demonstrates 2.15\(\times \) and 3.02\(\times \) higher differential current, respectively, for \({V}_{\mathrm{DD}}\) of 0.6 V. Our results indicate that even at the worst corner, CF-SA can provide 2.23\(\times \) and 1.7\(\times \) higher data-line differential voltage compared with CCSA and HSA, respectively. Further, 66.89 and 31.47 % reductions in the cell access time are achieved compared to the CCSA and HSA, respectively, under similar \(I_\mathrm{CELLl}\) and bit-line and data-line capacitance. Statistical simulations have proved that the CF-SA provides high read yield with 32.39 and 22.24 % less \(\upsigma _{\mathrm{Delay}}\). It also offers a much better read effectiveness and robustness against the data-line capacitance as well as \({V}_{\mathrm{DD}}\) variation. Furthermore, the CF-SA is able to tolerate a large offset of the input devices, up to 80 mV at \({V}_{\mathrm{DD}}=0.6\hbox {V}\).     

Minmax-concave total variation denoising

Total variation (TV) denoising is a commonly used method for recovering 1-D signal or 2-D image from additive white Gaussian noise observation. In this paper, we define the Moreau enhanced function of \(L_1\) norm as \({\varPhi }_\alpha (x)\) and introduce the minmax-concave TV (MCTV) in the form of \({\varPhi }_\alpha (Dx)\), where D is the finite difference operator. We present that MCTV approaches \(\Vert Dx\Vert _0\) if the non-convexity parameter \(\alpha \) is chosen properly and apply it to denoising problem. MCTV can strongly induce the signal sparsity in gradient domain, and moreover, its form allows us to develop corresponding fast optimization algorithms. We also prove that although this regularization term is non-convex, the cost function can maintain convexity by specifying \(\alpha \) in a proper range. Experimental results demonstrate the effectiveness of MCTV for both 1-D signal and 2-D image denoising.     

Error performance of optically preamplified hybrid BPSK-PPM systems with transmitter and receiver imperfections

In this paper, we investigate the impact of the transmitter finite extinction ratio and the receiver carrier recovery phase offset on the error performance of two optically preamplified hybrid M-ary pulse position modulation (PPM) systems with coherent detection. The first system, referred to as PB-mPPM, combines polarization division multiplexing (PDM) with binary phase-shift keying and M-ary PPM, and the other system, referred to as PQ-mPPM, combines PDM with quadrature phase-shift keying and M-ary PPM. We provide new expressions for the probability of bit error for PB-mPPM and PQ-mPPM under finite extinction ratios and phase offset. The extinction ratio study indicates that the coherent systems PB-mPPM and PQ-mPPM outperform the direct-detection ones. It also shows that at \(P_b=10^{-9}\) PB-mPPM has a slight advantage over PQ-mPPM. For example, for a symbol size \(M=16\) and extinction ratio \(r=30\) dB, PB-mPPM requires 0.6 dB less SNR per bit than PQ-mPPM to achieve \(P_b=10^{-9}\). This investigation demonstrates that PB-mPPM is less complex and less sensitive to the variations of the offset angle \(\theta \) than PQ-mPPM. For instance, for \(M=16\), \(r=30\) dB, and \(\theta =10^{\circ }\) PB-mPPM requires 1.6 dB less than PQ-mPPM to achieve \(P_b=10^{-9}\). However, PB-mPPM enhanced robustness to phase offset comes at the expense of a reduced bandwidth efficiency when compared to PQ-mPPM. For example, for \(M=2\) its bandwidth efficiency is 60 % that of PQ-mPPM and \(\approx 86\,\%\) for \(M=1024\). For these reasons, PB-mPPM can be considered a reasonable design trade-off for M-ary PPM systems.