Luca G. Tallini's research while affiliated with Università degli Studi di Teramo and other places

Publications (63)

Article
Finding the best compromise between exploration and exploitation phases of a search algorithm is a hard task. The Gravitational Search Algorithm (GSA) is an evolutionary algorithm based on the Newton’s universal law of gravitation. Many studies show that GSA suffers from slow exploitation which generates premature convergence. This paper proposes a...
Article
In order to solve real-life problems, several metaheuristic optimization algorithms have been developed. The Moth-Flame Optimization (MFO) algorithm is a search algorithm based on a mechanism called transverse orientation. In this mechanism, the moths tend to maintain a fixed angle with respect to the moon. MFO suffers from the degeneration of the...
Article
Shannon in his 1956 seminal paper introduced the concept of the zero error capacity, C <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> , of a noisy channel. This is defined as the least upper bound of rates, at which, it is possible to transmit information with zero probability of error. At pre...
Article
The choice of the best optimization algorithm is a hard issue, and it sometime depends on specific problem. The Gravitational Search Algorithm (GSA) is a search algorithm based on the law of gravity, which states that each particle attracts every other particle with a force called gravitational force. Some revised versions of GSA have been proposed...
Article
Full-text available
A new efficient design of second-order spectral-null (2-OSN) codes is presented. The new codes are obtained by applying the technique used to design parallel decoding balanced (i.e., 1-OSN) codes to the random walk method introduced by some of the authors for designing 2-OSN codes. This gives new non-recursive efficient code designs, which are less...
Article
Drum Boilers are an important component of many modern industrial facilities. Generally, the simulation of tailormade Drum Boilers starts up at each steady-state condition inside each operation region. The problem of such systems is the control of parameters, as level and pressure, around a reference value. The design of control algorithms can be a...
Conference Paper
The general theory on partially asymmetric (t, t+)-EC/(d-, d+)-ED m-ary codes for the L1 distance is developed. In this metric, such codes are capable of correcting t- or less negative errors, detecting d or less negative errors, correcting t+ or less positive errors, and simultaneously detecting d+ or less positive errors. Based on the elementary...
Conference Paper
Full-text available
A new efficient coding scheme is given for second-order spectral-null (2-OSN) codes. The new method applies the Knuth's optimal parallel decoding scheme for balanced (i.e., 1-OSN) codes to the random walk method introduced by Tallini and Bose to design 2-OSN codes. If k ∈ IN is the length of a 1-OSN code then the new 2-OSN coding scheme has length...
Conference Paper
This paper gives some new theory and design of codes capable of correcting/detecting errors measured under the Lee distance defined over m-ary words, m ∈ IN. Based on the elementary symmetric functions (instead of the power sums), a key equation is derived which can be used to design new symmetric (or, asymmetric) error control algorithms for some...
Conference Paper
Based on the elementary symmetric functions, this paper gives a new wide class of Goppa like codes capable of correcting/detecting errors measured under the (symmetric) L1 distance defined over the m-ary words, 2 ≤ m ≤ +∞. All these codes can be efficiently decoded by algebraic means with the Extended Euclidean Algorithm (EEA). In particular it is...
Article
Full-text available
In an unordered code, no code word is contained in any other code word. Unordered codes are all unidirectional error detecting (AUED) codes. In the binary case, it is well known that among all systematic codes with k information bits, Berger codes are optimal unordered codes with r=[log2(k+1)] ≅ log2k check bits. This paper gives some new theory on...
Conference Paper
This paper gives some theory and design of efficient codes capable of controlling (i. e., correcting/detecting/correcting erasure) errors measured under the L<sub>1</sub> distance defined over m-ary words, 2 ≤ m ≤ +∞. We give the combinatorial characterizations of such codes, some general code designs and the efficient decoding algorithms. Then, we...
Conference Paper
This paper shows that the first order Reed-Muller codes punctured in one component fall into a class of t-asymmetric error correcting (t-AEC) codes with very fast decoding. Hence, these linear Reed-Muller codes give a nice example of t-AEC codes which are very simple to both encode and decode. Decoding of these codes is much simpler than the usual...
Conference Paper
The error types in some VLSI systems and some communication media is of asymmetrie in nature. In this paper, for selective-repeat ARQ protocol over m(≥2)-ary asymmetrie channel, some analysis of the throughput when using All Asymmetric Error Detecting (AAED) codes are given. For these codes, the number of retransmissions needed to receive all codew...
Conference Paper
This paper gives the theory and design of efficient codes capable of correcting errors caused by the insertion and deletion of a repeated symbol in the information sequence. Two efficient methods are described. For any fixed t+, t- ∈ IN, one method gives a fixed length scheme to encode k information bits into a systematic code of length n = k + r,...
Conference Paper
An m-ary block code, m = 2, 3, 4, ..., of length n ∈ IN is called balanced if, and only if, every codeword is balanced; that is, the real sum of the codeword components, or weight, is equal to ⌊(m - 1)n/2⌋. This paper presents a tight generalization of Knuth's complementation method with parallel (hence, fast) decoding scheme. Let (wn)m indicate th...
Article
Let p be the 1 to 0 bit error probability and h(p)=-p log2 p-(1-p) log2 (1-p). The capacity of the Z-channel is given by CZ=log2 (1+(1-p)pp(1-p)/). For small p, it is shown that CZ≈1-(1/2)h(p) (vs., CBS(p)=1-h(p) for the binary symmetric channel). Coding schemes are also given that almost achieve the Z-channel capacity.
Conference Paper
Full-text available
In an unordered code no codeword is contained in any other codeword. Unordered codes are all unidirectional error detecting (AUED) codes. In the binary case, it is well known that among all systematic codes with k information bits, Berger codes are optimal unordered codes with r = ¿log<sub>2</sub>(k+1)¿ check bits. This paper gives some new theor...
Article
In this note, we give a correction to the Proof of Theorem 2 in L. G. Tallini, S. Al-Bassam, and B. Bose, "Feedback Codes Achieving the Capacity of the Z-Channel," IEEE Transactions on Information Theory, vol. 54, pp. 1357-1362, March 2008.
Conference Paper
A general key equation based on elementary symmetric functions is developed for decoding some binary error control codes. Here, the syndrome is obtained by computing the elementary symmetric functions (instead of the power-sums) of the received word. A new class of codes is introduced in this paper which can correct up to t<sub>0</sub> 0 rarr 1 err...
Article
Given the 1 to 0 bit error probability, pisin[0, 1], the capacity of the Z-channel is given by C<sub>z</sub>=log<sub>2</sub>(1+p<sup>p/(1-p)</sup>-p<sup>1/(1-p)</sup>). Some new error free feedback coding schemes that achieve the Z-channel capacity are presented.
Article
Some new classes of systematic t-unidirectional error-detecting codes over Z<sub>m</sub> are designed. It is shown that the constructed codes can detect two errors using two check digits. Furthermore, the constructed codes can detect up to m<sup>r-2</sup> + r-2 errors using r ges 3 check bits. A bound on the maximum number of detectable errors usin...
Article
Forward error control (FEC) and automatic-repeat request (ARQ) is two main techniques used for reliable data transmission in computer and communication systems. In this paper, some simple, low cost error control techniques for ARQ protocols used with binary unidirectional channels are described. The proposed schemes can correct up to [t/2] unidirec...
Article
In the automatic repeat request (ARQ) protocol, the sender keeps retransmitting a code word until it receives a positive acknowledgment from the receiver sent through the feedback channel. This correspondence proposes plain and diversity combining hybrid ARQ protocol communication schemes suitable for the m(ges2)-ary asymmetric channel using t-asym...
Article
A symbol permutation invariant balanced (SPI-balanced) code over the alphabet /spl Zopf//sub m/ = {0, 1, ..., m - 1} is a block code over /spl Zopf//sub m/ such that each alphabet symbol occurs as many times as any other symbol in every codeword. For this reason, every permutation among the symbols of the alphabet changes an SPI-balanced code into...
Article
Let Φ<sub>m</sub>⊆ C be the set of all mth roots of unity, m∈ IN. A balanced code over Φ<sub>m</sub> is a block code over the alphabet Φ<sub>m</sub> such that each code word is balanced; that is, the complex sum of its components (or weight) is equal to 0. Let B<sub>m</sub>(n) be the set of all balanced words of length n over Φ<sub>m</sub>. In this...
Conference Paper
In the ARQ (Automatic Retransmission Request) protocol, the sender keeps retransmitting a codeword until it receives a positive acknowledgment from the receiver sent through the feedback channel. This paper proposes Plain and Diversity Combining ARQ Hybrid protocol communication schemes suitable for the m(≥ 2)-ary asymmetric channel using t-Asymmet...
Article
In the usual binary symmetric channel, both 1/spl rarr/0 and 0/spl rarr/1 types of errors can occur. In the binary asymmetric channel, only 1/spl rarr/0 type of errors can occur, whereas, in the unidirectional channel, both 1/spl rarr/0 and 0/spl rarr/1 types of errors can occur, but, unlike the binary symmetric channel, for any particular transmit...
Conference Paper
A symbol permutation invariant balanced (SPI-balanced) code over the alphabet ZZm = {0, 1,....,m - 1} is a block code over ZZ m such that each alphabet symbol occurs as many times as any other symbol in every codeword. For this reason every permutation among the symbols of the alphabet changes a SPI-balanced code into a SPI-balanced code. This mean...
Article
A balanced code over the set Φ m ⊆ℂ of all m-th roots of unity, m∈ℕ, is a block code such that each code word is balanced, that is, the complex sum of its components (or weight) is equal to 0. This paper demonstrates some general properties, for m prime and for m=4. Further, this paper contains some efficient coding algorithms for m=3 and completel...
Article
Let be the set of all words of length N over the m-polar alphabet Φ m ={−(m−1),−(m−3),…,+(m−3),+(m−1)}, having a q-th order spectral-null at zero frequency. Any subset of is a spectral-null code of length N and order q. This paper gives an equivalent formulation of in terms of codes over the m-ary alphabet ℤ m ={0, 1,…, m−1}, derives a recursive ex...
Article
In asynchronous systems, the sender encodes a data word with a code word from an unordered code and transmits the code word on the parallel bus lines. In this paper, a transmission time analysis for the above parallel asynchronous communication scheme is presented. It is proven that the average transmission time for a code word is a strictly increa...
Conference Paper
This paper completely solves the coding problem for balanced codes over Φ<sub>m</sub>, when m = 4. In fact, it reduces the problem of designing efficient coding schemes for balanced codes over Φ<sub>4</sub> to the design of efficient balanced codes over Φ4 = {-1,+1}. In particular, the paper proposes efficient constructions for balanced codes over...
Conference Paper
In a constant weight w code of length n, each code word has w 1s and n-w 0s. If the ratio w/n is low, the code is referred to as a low constant weight (LCW) code. In this paper, some simple designs of LCW codes are presented. Further, the speed performance of these codes is derived and then it is shown that these codes have much better performance...
Article
Let S (N,q) be the set of all words of length N over the bipolar alphabet (-1,+1), having a qth order spectral-null at zero frequency. Any subset of S (N,q) is a spectral-null code of length N and order q. This correspondence gives an equivalent formulation of S(N,q) in terms of codes over the binary alphabet (0,1), shows that S(N,2) is equivalent...
Article
A balanced code with k information bits and r check bits is a binary code of length n=k+r and cardinality 2<sup>k</sup> such that the number of 1s in each code word is equal to [n/2]. This paper describes the design of efficient balanced codes with parallel encoding and parallel decoding. In this case, since area and delay of such circuits are crit...
Article
An m-ary balanced code with r check digits and k information digits is a code over the alphabet Zm = {0,1, …, m−1} of length n = k+r and cardinality mk such that each codeword is balanced; that is, the real sum of its components (or weight) is equal to [(m − 1)n/2]. This paper contains new efficient methods to design m-ary balanced codes which impr...
Conference Paper
In asynchronous buses, the sender encodes a data word with a code word from an unordered code and transmits it on the parallel bus lines. In this paper some transmission time analysis for the above parallel asynchronous communication scheme are presented. It is proved that the average transmission time for a code word is a strictly increasing funct...
Conference Paper
In asynchronous buses, the sender encodes a data word with a code word from an unordered code and transmits it on the parallel bus lines. In this paper, some transmission time analyses for the above parallel asynchronous communication scheme are presented. It is proved that the average transmission time for a code word is a strictly increasing func...
Conference Paper
Let S(N,q,m) be the set of all words of length N over the m-ary alphabet Φ<sub>m</sub>={-(m-1),-(m-3),…,+(m-3),…,+(m-1)} having a q-th order spectral-null at zero frequency. Any subset of S(N,q,m) is a m-ary q-th order spectral-null code. This paper presents a new efficient method to encode k information m-ary digits into a m-ary second-order spect...
Article
A constant weight, w, code with k information bits and r check bits is a binary code of length n=k+r and cardinality 2<sup>k</sup> such that the number of 1s in each code word is equal to w. When w=[n/2], the code is called balanced. This paper describes the design of balanced and constant weight codes with parallel encoding and parallel decoding....
Article
Recently, Matsuzawa and Fujiwara (1988) proposed a novel scheme to mask line faults of bus line circuits (such as address buses) due to short circuit defects between adjacent lines. In this paper, first we propose the fundamental theory and then present some efficient designs of these codes. Some lower and upper bounds for the optimal codes are als...
Article
A constant weight, w, code with k information bits and r check bits is a binary code of length n=k+r and cardinality 2^k such that the number of 1's in each code word is equal to w. When w=\iia n/2 \iic the code is called balanced. This paper describes the design of constant weight codes with parallel encoding and parallel decoding. Infinite famili...
Article
Matsuzawa and Fujiwara (1988) have proposed a novel scheme to mask line faults of bus line circuits (such as address buses) due to short circuit defects between adjacent lines. We propose the fundamental theory and then present some efficient designs of these codes. Some lower and upper bounds for the optimal codes are also given
Article
A balanced code with r check bits and k information bits is a binary code of length k+r and cardinality 2<sup>k</sup> such that each codeword is balanced; that is, it has [(k+r)/2] 1's and [(k+r)/2] 0's. This paper contains new methods to construct efficient balanced codes. To design a balanced code, an information word with a low number of 1's or...
Conference Paper
Error-correcting codes are used in a variety of areas from computers to communications. Ideally, one simply looks at a received message which may contain errors, and decodes it into the error-free message. Unfortunately, this decoding process can be quite complicated and might not exploit the maximum error correction capabilities of the code. While...
Conference Paper
Let S(N,q) be the set of all words of length N over the bipolar alphabet {-1,+1}, having a q-th order spectral-null at zero frequency. Any subset of S(N,q) is a spectral-null code of length N and order q. We give an equivalent formulation of S(N,q) in terms of codes over the binary alphabet {0,1}. We show that S(N,2) is equivalent to a well known c...
Conference Paper
In a balanced code each codeword contains equal number of 1's and 0's. In this paper, methods for the construction of balanced codes, which use parallel encoding/decoding are described. The codes use fewer check bits and less hardware complexity than the existing codes
Article
Sunto: In questo lavoro dopo una presentazione sintetica dei con-cetti fondamentali della Teoria dell'Informazione di Shannon, si trova un espressione esplicita per la capacitt a del canale asimmet-rico e delle buone limitazioni per la capacitt a del canale unidi-rezionale di lunghezza n. Abstract: In this paper, we give a sinthetic presentation of...

Citations

... The fuzzy logic concepts have been combined with GSA to optimally design IIR (Infinite Impulsive Response) filter. The fuzzy GSA provided better robustness and stability as compared to standard GSA and DE (Pelusi et al., 2018). ...
... Due to the calculation strategy of parameter Kbest making the distance between other agents and the best agents too short, Mirjalili and Lewis [36] save the best solution in each iteration and use them to improve the exploitation of GSA. Pelusi et al. [37] introduce two hyperbolic functions to dynamically calculate the parameters Kbest and in GSA, which shows a distinct improvement in the convergence performance. Shehadeh [38] integrates the superiority of the exploitation ability in sperm swarm optimization (SSO) into GSA while keeping the exploration capability. ...
... The results showed that the proposed approach outperforms current state-of-the-art meta-heuristic algorithms using performance metrics. In Pelusi et al. [56] the authors invented a new PB algorithm called the improved MFO algorithm (IMFO). The proposed IMFO has three phases mimicking exploration, hybrid exploration/exploitation, and exploitation. ...
... So there is a difference in the models, and that is why in our model the capacity increases with feedback. Additionally our model is different from the classical automatic repeat request (ARQ) [1], [7], [17] [21,Chapter 22] [26], [29], [31], [32]. In an ARQ system an error detecting code is used, and if the receiver detects some errors then it requests the sender to retransmit the same data. ...
... where ∈ [0 , 1] ⊆ IR + and c a,b : → IN are random variables for all a, b∈ ZZ m ⊆ IR with a = b [12] . In [11,[20][21][22] , some more theoretical concepts of L 1 distance EC codes are presented. In this paper, we focus on the case of c a,b = 0 in the last equation (i. ...
... The purpose of algorithm analysis is to select suitable algorithms and improve algorithms. This article chooses the Big O method to calculate its time complexity (Gupta, Deep, Heidari, Moayedi, & Wang, 2020;Pelusi, et al., 2018b) , and compares AGWO and GWO. ...
... , a ⊕ r, where ⊕ stands for the addition modulo q. These channels are called wraparound channels with magnitude r ( [4]). If r = q − 1, the graph is a complete bipartite graph, and we are in the q-ary case considered in [3]. ...
... Some of the latest solutions for solving optimization problems targeting the metaheuristic-based optimal parameter tuning of fuzzy controllers include various algorithms for type-2 fuzzy controllers [26], genetic algorithms [27]- [29], Simulated Annealing (SA) [30], PSO [31], [32], Ant Colony Optimization [33]- [35], GSA [36], CSS [37], GWO [38]- [40], ABC [41], Ant Lion Optimizer [42], Harmony Search Optimization [43], Whale Optimization Algorithm (WOA) [44], [45], DE and ABC with dynamic parameter adaptation [46], [47], fuzzy hierarchical operator in GWO [48], Galactic Swarm Optimization [49], [50], Firefly Algorithm [50], and GWO-PSO [19], [51]. The main shortcoming of these approaches is the dependence of results on parameter settings of metaheuristic algorithms; moreover, some of the optimally tuned fuzzy controllers are not validated in realistic experimental setups. ...
... The fuzzy-evolution-based genetic algorithms (GAs) has been implemented effectively for many optimization tasks arising in broad domain of applied science and technologies. Few significant applications of paramount interest are optimization of fuzzy integrators for multi model biometry [40], optimization of parameter for Meyer wavelet for the solution of fractional order pantograph Lane-Emden model [41], surrogate-assisted optimized in fuzzy rule-based systems [42], Morlet wavelet networks for higher order nonlinear differential model [43], optimization of cocomo parameters for fuzzy model [44], neuro-evolution supported with sequential quadratic programming for 2 nd order Lane-Emden pantograph delay differential models [45], hybrid adaptive fuzzy-neuro and genetic algorithm for optimization of model for copper prices [46], evolutionary and swarm intelligence algorithm for optimization [47], optimization of SITR fractal system for tuning of Gudermannian networks parameters [48], optimized task scheduling for robotics [49], optimized neuro-evolution computing for nonlinear 3rd order multi-singular systems represented with Emden-Fowler equation [50], modified gravitational search algorithms by exploiting the evolutionary-fuzzy systems [51], solution of singular pantograph differential systems model with Morlet wavelet neural network systems optimized with fuzzy-evolutionary genetic algorithms [52], optimized antilock braking systems using fuzzy controller [53], nonlinear multi-singular Emden-Fowler systems [54], evolutionary optimized equitable fuzzy sorting systems [55], mathematical model of dust density dynamics represented with nonlinear Vander Pol Mathieu's systems [56], efficient computing for direction of arrival estimation for underwater scenarios [57], computational heuristics via Gudermannian kernel based networks for Lane-Emden systems [58], neuro-evolutionary heuristics for nonlinear prediction differential equations [59], fractional Meyer neuro-evolutionary computing [60], heuristic approach combine with finite difference scheme for nonlinear unipolar eletrohydrodynamic pump flow systems [61], power [62], controls [63], electronic circuits [64], communication [65], system identification [66], bioinformatics [67,68] and fluid dynamics [69,70]. These are motivation factor for authors to investigate in fuzzy-evolution based computing paradigm for system identification of Hammerstein structures. ...
... The same problem can be solved by different algorithms, and the quality of an algorithm will affect the efficiency of the algorithm and even the program (Tallini, et al., 2016). The purpose of algorithm analysis is to select suitable algorithms and improve algorithms. ...