Carlos E. C. Souza

Carlos E. C. Souza

Auto-generated profile, based on publicly available information

Carlos E. C. Souza

Department of Electronics and Systems, Federal University of Pernambuco, Recife, Brazil

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
20 July 2020 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
CSCarlos E. C. Souza
Carlos E. C. Souza
DCDaniel P. B. Chaves
Daniel P. B. Chaves
CPCecilio Pimentel
Cecilio Pimentel
In this work we employ the discrete Arnold’s cat map over the integer ring Z3m to construct one-dimensional pseudo-chaotic sequences. We analyze their period properties using the properties of the Fibonacci sequence over Z3m and show that they have twice the period of the sequences generated by the logistic map over Z3m recently proposed. Moreover, we investigate the pseudo-chaotic properties of the proposed sequences in the context of pseudo-chaos. Finally, these sequences are employed to design a pseudo-random number generator and a statistical analysis with the NIST statistical test suite is performed.

10 January 2019 in IEEE Access
Verified
Journal Article
Open access
CSCarlos E. C. Souza
Carlos E. C. Souza
DCDaniel P. B. Chaves
Daniel P. B. Chaves
CPCecilio Pimentel
Cecilio Pimentel
In this paper, we propose a methodology to design chaos-based communication systems, which exploits the topological structure of 3-D chaotic attractors. The first step consists in defining a proper partition of a Poincaré section of the attractor and the subsequent encoding of the chaotic trajectories. Then, the evolution mechanism of the chaotic attractor, according to the dynamical restrictions imposed by the chaotic flow, is represented by a state diagram, where each state represents a region of the Poincaré section or a branch in the template of the chaotic attractor. The state transitions are associated with segments of chaotic trajectories that connect the corresponding regions of the Poincaré section. The chaotic signals are transmitted over both additive white Gaussian noise and Rayleigh flat fading channels, and a trellis structure derived from the state diagram is used at the decoder to estimate the transmitted information sequence. Finally, the bit error rate performance of the system is analyzed.

10 August 2022 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
CSCarlos E. C. Souza
Carlos E. C. Souza
DMDavi Moreno
Davi Moreno
DCDaniel P. B. Chaves
Daniel P. B. Chaves
CPCecilio Pimentel
Cecilio Pimentel
In this work, we propose a method to generate 1-D pseudo-chaotic sequences based on the discrete Arnold’s map defined over the integer ring $\mathbb {Z}_{2^{m}}$ . The period of the generated sequences is investigated using properties of the Fibonacci sequence over $\mathbb {Z}_{2^{m}}$ . The pseudo-chaotic sequences are employed to design a pseudorandom number generator (PRNG), and the statistical properties of this PRNG are analyzed by the NIST statistical test suite. We implement the proposed PRNG in a field-programmable gate array (FPGA) and investigate its hardware requirements. We show that for the same bit generation rate, the sequences defined over $\mathbb {Z}_{2^{m}}$ require fewer hardware units than recently proposed sequences defined over $\mathbb {Z}_{3^{m}}$ . The proposed PRNG has higher throughput and competitive hardware consumption when compared to other architectures in the literature.

17 November 2016 in EURASIP Journal on Advances in Signal Processing
Verified
Journal Article
Open access
PDF file
DCDaniel P.B. Chaves
Daniel P.B. Chaves
CSCarlos E.C. Souza
Carlos E.C. Souza
CPCecilio Pimentel
Cecilio Pimentel
We introduce in this paper a new chaotic map with dynamical properties controlled by two free parameters. The map definition is based on the hyperbolic tangent function, so it is called the tanh map. We demonstrate that the Lyapunov exponent of the tanh map is robust, remaining practically unaltered with the variation of its parameters. As the main application, we consider a chaotic communication system based on symbolic dynamics with advantages over current approaches that use piecewise linear maps. In this context, we propose a new measure, namely, the spread rate, to study the local structure of the chaotic dynamics of a one-dimensional chaotic map.

23 December 2021 in IEEE Access
Verified
Journal Article
Open access
RCRafael Campello
Rafael Campello
GCGabriel Carlini
Gabriel Carlini
CSCarlos E. C. Souza
Carlos E. C. Souza
CPCecilio Pimentel
Cecilio Pimentel
DCDaniel P. B. Chaves
Daniel P. B. Chaves
In this work, we propose adaptable decision regions in the successive interference cancellation (SIC) decoder for the three-user uplink/downlink non-orthogonal multiple access (NOMA) scheme by exploiting the knowledge of the channel gains. We present scenarios in which the modified SIC decoder outperforms the traditional one and is able to replicate the performance achieved by a deep learning-based decoder. We present analytical symbol error rate (SER) expressions for the three users, compare them to simulation results, and discuss possible consequences of our analysis, such as the optimal power allocation. We also employ heatmaps to analyze the joint influence on the SER of some system parameters, such as signal-to-noise ratio and channel gains.

12 November 2019 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
CSCarlos E. C. Souza
Carlos E. C. Souza
CPCecilio Pimentel
Cecilio Pimentel
DCDaniel P. B. Chaves
Daniel P. B. Chaves