Academic literature on the topic 'Bit-complexity'

Abstract. One of the main objectives of the scientific enterprise is the development of well-performing yet parsimonious models for all natural phenomena and systems. In the 21st century, scientists usually represent their models, hypotheses, and experimental observations using digital computers. Measuring performance and parsimony of computer models is therefore a key theoretical and practical challenge for 21st century science. “Performance” here refers to a model's ability to reduce predictive uncertainty about an object of interest. “Parsimony” (or complexity) comprises two aspects: descriptive complexity – the size of the model itself which can be measured by the disk space it occupies – and computational complexity – the model's effort to provide output. Descriptive complexity is related to inference quality and generality; computational complexity is often a practical and economic concern for limited computing resources. In this context, this paper has two distinct but related goals. The first is to propose a practical method of measuring computational complexity by utility software “Strace”, which counts the total number of memory visits while running a model on a computer. The second goal is to propose the “bit by bit” method, which combines measuring computational complexity by “Strace” and measuring model performance by information loss relative to observations, both in bit. For demonstration, we apply the “bit by bit” method to watershed models representing a wide diversity of modelling strategies (artificial neural network, auto-regressive, process-based, and others). We demonstrate that computational complexity as measured by “Strace” is sensitive to all aspects of a model, such as the size of the model itself, the input data it reads, its numerical scheme, and time stepping. We further demonstrate that for each model, the bit counts for computational complexity exceed those for performance by several orders of magnitude and that the differences among the models for both computational complexity and performance can be explained by their setup and are in accordance with expectations. We conclude that measuring computational complexity by “Strace” is practical, and it is also general in the sense that it can be applied to any model that can be run on a digital computer. We further conclude that the “bit by bit” approach is general in the sense that it measures two key aspects of a model in the single unit of bit. We suggest that it can be enhanced by additionally measuring a model's descriptive complexity – also in bit.

Video playback on mobile consumer electronic (CE) devices is plagued by fluctuations in the network bandwidth and by limitations in processing and energy availability at the individual devices. Seen as a potential solution, the state-of-the-art adaptive streaming mechanisms address the first aspect, yet the efficient control of the decoding-complexity and the energy use when decoding the video remain unaddressed. The quality of experience (QoE) of the end-users’ experiences, however, depends on the capability to adapt the bit streams to both these constraints (i.e., network bandwidth and device’s energy availability). As a solution, this paper proposes an encoding framework that is capable of generating video bit streams with arbitrary bit rates and decoding-complexity levels using a decoding-complexity–rate–distortion model. The proposed algorithm allocates rate and decoding-complexity levels across frames and coding tree units (CTUs) and adaptively derives the CTU-level coding parameters to achieve their imposed targets with minimal distortion. The experimental results reveal that the proposed algorithm can achieve the target bit rate and the decoding-complexity with 0.4% and 1.78% average errors, respectively, for multiple bit rate and decoding-complexity levels. The proposed algorithm also demonstrates a stable frame-wise rate and decoding-complexity control capability when achieving a decoding-complexity reduction of 10.11 (%/dB). The resultant decoding-complexity reduction translates into an overall energy-consumption reduction of up to 10.52 (%/dB) for a 1 dB peak signal-to-noise ratio (PSNR) quality loss compared to the HM 16.0 encoded bit streams.

Bit-serial multiplication with a fixed coefficient is commonly used in integrated circuits, such as digital filters and FFTs. These multiplications can be implemented using basic components such as adders, subtractors and D flip-flops. Multiplication with the same coefficient can be implemented in many ways, using different structures. Other studies in this area have focused on how to minimize the number of adders/subtractors, and often assumed that the cost for D flip-flops is neglectable. That simplification has been proved to be far too great, and further not at all necessary. In digital devices low power consumption is always desirable. How to attain this in bit-serial multipliers is a complex problem.

The aim of this thesis was to find a strategy on how to implement bit-serial multipliers with as low cost as possible. An important step was achieved by deriving formulas that can be used to calculate the carry switch probability in the adders/subtractors. It has also been established that it is possible to design a power model that can be applied to all possible structures of bit- serial multipliers.

Reed-Solomon codes (RS codes) are an important method for achieving error-correction in communication and storage systems. However, it has proved difficult to find a soft-decision decoding method which has low complexity. Moreover, in some previous soft-decision decoding approaches, bit-level soft-decision information could not be employed fully. Even though RS codes have powerful error correction capability, this is a critical shortcoming. This thesis presents bit-level soft-decision decoding schemes for RS codes. The aim is to design a low complexity sequential decoding method based on bit-level soft- decision information approaching maximum likelihood performance. Firstly a trellis decoding scheme which gives easy implementation is introduced, since the soft-decision information can be used directly. In order to allow bit-level soft-decision, a binary equivalent code is introduced and Wolf's method is used to construct the binary-trellis from a systematic parity check matrix. Secondly, the Fano sequential decoding method is chosen, which is sub-optimal and adaptable to channel conditions. This method does not need a large amount of storage to perform an efficient trellis search. The Fano algorithm is then modified to improve the error correcting performance. Finally, further methods of complexity reduction are presented without loss of decoding performance, based on reliability-first search decoding using permutation groups for RS codes. Compared with the decoder without permutation, those schemes give a large complexity reduction and performance improvement approaching near maximum likelihood performance. In this thesis, three types of permutation, cyclic, squaring and hybrid permutation, are presented and the decoding methods using them are implemented.

In this thesis, a bit parallel architecture for a parallel finite field multiplier with low complexity in composite fields GF((2n)m) with k = n ·
m (k 32) is investigated. The architecture has lower complexity when the Karatsuba-Ofman algorithm is applied for certain k. Using particular primitive polynomials for composite fields improves the complexities. We demonstrated for the values m = 2, 4, 8 in details. This thesis is based on the paper &ldquo
A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields &rdquo
by Christof Paar. The whole purpose of this thesis is to understand and present a detailed description of the results of the paper of Paar.

This dissertation studies two different aspects of two-player interaction in the model of quantum communication and quantum computation.First, we study two cryptographic primitives, that are used as basic blocks to construct sophisticated cryptographic protocols between two players, e.g. identification protocols. The first primitive is ''quantum bit commitment''. This primitive cannot be done in an unconditionally secure way. However, security can be obtained by restraining the power of the two players. We study this primitive when the two players can only create quantum Gaussian states and perform Gaussian operations. These operations are a subset of what is allowed by quantum physics, and plays a central role in quantum optics. Hence, it is an accurate model of communication through optical fibers. We show that unfortunately this restriction does not allow secure bit commitment. The proof of this result is based on the notion of ''intrinsic purification'' that we introduce to circumvent the use of Uhlman's theorem when the quantum states are Gaussian. We then examine a weaker primitive, ''quantum weak coin flipping'', in the standard model of quantum computation. Mochon has showed that there exists such a protocol with arbitrarily small bias. We give a clear and meaningful interpretation of his proof. That allows us to present a drastically shorter and simplified proof.The second part of the dissertation deals with different methods of proving lower bounds on the quantum query complexity. This is a very important model in quantum complexity in which numerous results have been proved. In this model, an algorithm has restricted access to the input: it can only query individual bits. We consider a generalization of the standard model, where an algorithm does not compute a classical function, but generates a quantum state. This generalization allows us to compare the strength of the different methods used to prove lower bounds in this model. We first prove that the ''multiplicative adversary method'' is stronger than the ''additive adversary method''. We then show a reduction from the ''polynomial method'' to the multiplicative adversary method. Hence, we prove that the multiplicative adversary method is the strongest one. Adversary methods are usually difficult to use since they involve the computation of norms of matrices with very large size. We show how studying the symmetries of a problem can largely simplify these computations. Last, using these principles we prove the tight lower bound of the INDEX-ERASURE problem. This a quantum state generation problem that has links with the famous GRAPH-ISOMORPHISM problem.

Nous abordons dans cette thèse le problème du calcul de la topologie de courbes algébriques planes. Nous présentons un algorithme qui, grâce à l’application d’outils algébriques comme les bases de Gröbner et les représentations rationnelles univariées, ne nécessite pas de traitement particulier de cas dégénérés. Nous avons implanté cet algorithme et démontré son efficacité par un ensemble de comparaisons avec les logiciels similaires. Nous présentons également une analyse de complexité sensible a la sortie de cet algorithme. Nous discutons ensuite des outils nécessaires pour l’implantation d’algorithmes de géométrie non-linéaire dans CGAL, la bibliothèque de référence de la communauté de géométrie algorithmique. Nous présentons un noyau univarié pour CGAL, un ensemble de fonctions nécessaires pour le traitement d’objets courbes définis par des polynômes univariés. Nous avons validé notre approche en la comparant avec les implantations similaires
We tackle in this thesis the problem of computing the topology of plane algebraic curves. We present an algorithm that avoids special treatment of degenerate cases, based on algebraic tools such as Gröbner bases and rational univariate representations. We implemented this algorithm and showed its performance by comparing to simi- lar existing programs. We also present an output-sensitive complexity analysis of this algorithm. We then discuss the tools that are necessary for the implementation of non- linear geometric algorithms in CGAL, the reference library in the computational geom- etry community. We present an univariate algebraic kernel for CGAL, a set of functions aimed to handle curved objects defined by univariate polynomials. We validated our approach by comparing it to other similar implementations

Cette thèse étudie deux aspects d'interaction entre deux joueurs dans le modèle du calcul et de la communication quantique.Premièrement, elle étudie deux primitives cryptographiques quantiques, des briques de base pour construire des protocoles cryptographiques complexes entre deux joueurs, comme par exemple un protocole d'identification. La première primitive est la ``mise en gage quantique". Cette primitive ne peut pas être réalisée de manière inconditionnellement sûre, mais il possible d'avoir une sécurité lorsque les deux parties sont soumis à certaines contraintes additionnelles. Nous étudions cette primitive dans le cas où les deux joueurs sont limités à l'utilisation d'états et d'opération gaussiennes, un sous-ensemble de la physique quantique central en optique, donc parfaitement adapté pour la communication via fibres optiques. Nous montrons que cette restriction ne permet malheureusement pas la réalisation de la mise en gage sûre. Pour parvenir à ce résultat, nous introduisons la notion de purification intrinsèque, qui permet de contourner l'utilisation du théorème de Uhlman, en particulier dans le cas gaussien. Nous examinons ensuite une primitive cryptographique plus faible, le ``tirage faible à pile ou face'', dans le modèle standard du calcul quantique. Carlos Mochon a donné une preuve d'existence d'un tel protocole avec un biais arbitrairement petit. Nous donnons une interprétation claire de sa preuve, ce qui nous permet de la simplifier et de la raccourcir grandement.La seconde partie de cette thèse concerne l'étude de méthodes pour prouver des bornes inférieures dans le modèle de la complexité en requête. Il s'agit d'un modèle de complexité central en calcul quantique dans lequel de nombreux résultats majeurs ont été obtenus. Dans ce modèle, un algorithme ne peut accéder à l'entrée uniquement en effectuant des requêtes sur chacun des bits de l'entrée. Nous considérons une extension de ce modèle dans lequel un algorithme ne calcule pas une fonction, mais doit générer un état quantique. Cette généralisation nous permet de comparer les différentes méthodes pour prouver des bornes inférieures dans ce modèle. Nous montrons d'abord que la méthode par adversaire ``multiplicative" est plus forte que la méthode ``additive". Nous montrons ensuite une réduction de la méthode polynomiale à la méthode multiplicative, ce qui permet de conclure à la supériorité de la méthode par adversaire multiplicative sur toutes les autres méthodes. Les méthodes par adversaires sont en revanche souvent difficiles à utiliser car elles nécessite le calcul de normes de matrices de très grandes tailles. Nous montrons comment l'étude des symétries d'un problème simplifie grandement ces calculs. Enfin, nous appliquons ces formules pour prouver la borne inférieure optimale du problème INDEX-ERASURE un problème de génération d'état quantique lié au célèbre problème GRAPH-ISOMORPHISM
This dissertation studies two different aspects of two-player interaction in the model of quantum communication and quantum computation.First, we study two cryptographic primitives, that are used as basic blocks to construct sophisticated cryptographic protocols between two players, e.g. identification protocols. The first primitive is ``quantum bit commitment''. This primitive cannot be done in an unconditionally secure way. However, security can be obtained by restraining the power of the two players. We study this primitive when the two players can only create quantum Gaussian states and perform Gaussian operations. These operations are a subset of what is allowed by quantum physics, and plays a central role in quantum optics. Hence, it is an accurate model of communication through optical fibers. We show that unfortunately this restriction does not allow secure bit commitment. The proof of this result is based on the notion of ``intrinsic purification'' that we introduce to circumvent the use of Uhlman's theorem when the quantum states are Gaussian. We then examine a weaker primitive, ``quantum weak coin flipping'', in the standard model of quantum computation. Mochon has showed that there exists such a protocol with arbitrarily small bias. We give a clear and meaningful interpretation of his proof. That allows us to present a drastically shorter and simplified proof.The second part of the dissertation deals with different methods of proving lower bounds on the quantum query complexity. This is a very important model in quantum complexity in which numerous results have been proved. In this model, an algorithm has restricted access to the input: it can only query individual bits. We consider a generalization of the standard model, where an algorithm does not compute a classical function, but generates a quantum state. This generalization allows us to compare the strength of the different methods used to prove lower bounds in this model. We first prove that the ``multiplicative adversary method'' is stronger than the ``additive adversary method''. We then show a reduction from the ``polynomial method'' to the multiplicative adversary method. Hence, we prove that the multiplicative adversary method is the strongest one. Adversary methods are usually difficult to use since they involve the computation of norms of matrices with very large size. We show how studying the symmetries of a problem can largely simplify these computations. Last, using these principles we prove the tight lower bound of the INDEX-ERASURE problem. This a quantum state generation problem that has links with the famous GRAPH-ISOMORPHISM problem

Роговенко, А. І. Методи та інформаційна технологія прискореного обчислення великих даних для систем розподіленої обробки інформації : дис. ... канд. техн. наук : 05.13.06 / А. І. Роговенко. - Чернігів, 2021. - 178 с.
Дисертація присвячена дослідженню актуальних проблем підвищення ефективності цифрових обчислювальних засобів алгоритмів кодування/декодування завадостійких кодів шляхом зменшення складності реалізації за умови високої швидкості й великого об’єму вхідного потоку даних, із використанням особливостей і властивостей апаратної платформи сучасної мікропроцесорної техніки. У першому розділі дисертаційної роботи проаналізовано сучасний стан і перспективи прискорення обчислень у сучасних системах розподіленої обробки інформації. Особлива потреба в прискорювачах виникає у криптографічних системах та системах завадостійкого кодування, де суттєву частину всіх обчислювальних перетворень над великими даними становлять операції в полях Галуа. Проведений аналіз задачі прискорення обчислень у системах розподіленої обробки інформації виявив необхідність зменшення обчислювальної складності реалізації базових операцій, які використовуються в технологіях вирішення задачі виявлення та виправлення помилок у системах розподіленої обробки інформації, зокрема в сучасних системах радіозв’язку. Проаналізовано коди, що використовуються для коригування помилок у сучасних системах радіозв’язку, та визначені основні напрямки прискорення процесу кодування/декодування при використанні алгебраїчних кодів. На основі аналізу було визначено, що процес кодування/декодування базується на апараті арифметики скінчених полів. Таким чином, спрощення та прискорення виконання операції в полях Галуа має привести до зменшення обчислювальної складності реалізації процедур кодування/декодування завадостійких кодів. Проведений аналіз основних методів обчислень операцій у полях Галуа, виявив, що більш пріоритетною є задача спрощення та прискорення виконання операцій додавання, як складових операцій множення, піднесення до степеня та інших. На основі аналізу існуючих методів обчислень операцій у полях Галуа було зроблено висновок, що сучасні широко представлені реалізації блоків обчислення операцій у скінчених полях мають обмеження та недоліки, які призводять до зменшення використовуваності алгебраїчних кодів у вирішеннях задачі виявлення та виправлення помилок. Отже, необхідно розробити методи підвищення продуктивності спеціалізованих обчислювальних засобів із урахуванням особливостей і властивостей апаратної платформи сучасної мікропроцесорної техніки, складності реалізації та швидкодія яких задовольняла б існуючі вимоги та була прогнозованою залежно від розрядності (розміру) оброблюваних послідовностей. У другому розділі роботи проводиться удосконалення методу прискорення та зменшення апаратних витрат на реалізацію блоків виконання операцій за модулем, розробка структурних рішень та модифікація алгоритмів виконання операцій за модулем. Розроблено та запропоновано метод зменшення апаратних витрат суматора за модулем на основі одновимірного каскаду конструктивних модулів з однорідною структурою. Цей метод базується на введенні у схему ланцюгів наскрізного переносу. Ефект від впровадження цього удосконалення полягає у зменшенні обчислювальної ємнісної складності, що забезпечує зменшення апаратних витрат у середньому на 10 % порівняно з наявним базовим методом. Розроблено та запропоновано удосконалений метод зменшення обчислювальної ємнісної складності реалізації моделі суматора за модулем на основі одновимірного каскаду конструктивних модулів, який, на відміну від раніше запропонованого, використовує конструктивні модулі нерегулярного типу. Встановлено, що модифікацію методу можна застосовувати для зменшення обчислювальної складності в разі некритичності вимог до регулярності структури обчислювача. Використання модифікованого методу дозволяє зменшити обчислювальну ємнісну складність, що забезпечує зменшення апаратних витрат у середньому на 50 % порівняно з наявним базовим методом. Розроблено та запропоновано метод збільшення швидкодії суматора за модулем на основі одновимірного каскаду конструктивних модулів, який, на відміну від відомих, використовує ланцюги групового переносу, що дозволяє підвищити швидкість виконання операцій у 8 разів порівняно з реалізацією базовим методом. Запропоновано модифікацію алгоритму множення та піднесення до степеня за змінним модулем, з урахуванням особливостей застосування моделей суматорів на основі одновимірних каскадів конструктивних модулів, в якому зменшене значення нижньої оцінка часової складності. У третьому розділі запропоновано модель обчислювальних структур завадостійких кодів для виконання операцій за змінним простим модулем над числами великої розрядності, виконано її реалізацію та дослідження. Модель була створена з орієнтацією на адаптацію до елементів операційного обчислювального середовища для забезпечення можливості конструювання необхідних комбінацій виконавчих пристроїв для виконання однотипних арифметичних інструкцій за модулем над числами великої розрядності. Також у цьому розділі виконана адаптація алгоритму обчислення операції множення та піднесення до степеня за модулем з урахуванням особливостей її побудови раніше запропонованим методом одновимірного каскаду. Запропонована структура моделі та алгоритм роботи спрощеного завантаження багаторозрядних операндів до блоків виконання операції за модулем. При реалізації моделі використовувався структурний опис з використанням бібліотеки стандартних ресурсів Xilinx мовою опису апаратури VHDL. Запропонований алгоритм роботи блоку спрощеного завантаження операндів. Цей блок являє собою блок керування без логіки вибору операції, оскільки для дослідження одного конкретного обчислювача вона не потрібна, але може справляти додатковий вплив на характеристики. Розроблена модель обчислювальних структур завадостійких кодів для виконання операцій за змінним простим модулем, як і більшість подібних до неї, рідко використовуються як окрема одиниця та зазвичай являють собою частину складнішої синхронної системи. Таким чином, проведені експерименти вирішили задачу визначення максимальної тактової частоти, на якій може працювати розроблена модель без помилок у обчисленнях вихідної функції. Четвертий розділ присвячений розробці інформаційної технології прискореного обчислення великих даних для систем розподіленої обробки інформації. Інформаційна технологія базується на розроблених раніше удосконалених методах зменшення апаратних витрат та прискорення обчислення великих даних. Інформаційна технологія ґрунтується на розроблених раніше, удосконалених методах зменшення апаратних витрат та прискорення обчислення великих даних. Додатково, для доповнення технології було розроблено: проєкт обчислювальної системи на основі софтпроцесора, проєкт співпроцесора з драйверами до обчислювальної системи, набір програмних функцій мовою С, які реалізують програмне виконання базових операцій, та засоби тестування для моделі обчислювальних структур. Для автоматизації процесу створення та тестування моделей був реалізований набір скриптів та бібліотека моделей мовою VHDL, яка містить моделі обчислювальних структур. Також було розроблено архітектуру та систему команд функціональної моделі співпроцесора, орієнтованого на виконання операцій у скінченних полях.
The dissertation is devoted to research of actual problems of increase of efficiency of digital computing means of algorithms of coding / decoding of noise - tolerant codes by reduction of complexity of realization at the condition of high speed and big volume of an input data stream, using features and properties of a hardware platform of modern microprocessor technics. In the first section of the dissertation the current state and prospects of acceleration of calculations in modern systems of distributed information processing are analyzed. A special need for accelerators arises in cryptographic systems and noise-tolerant coding systems, where a significant part of all computational transformations over big data are operations in Galois fields. The analysis of the problem of computing acceleration in distributed information processing systems revealed the need to reduce the computational complexity of the basic operations used in technologies to solve the problem of detecting and correcting errors in distributed information processing systems, in particular in modern radio systems. The codes used to correct errors in modern radio communication systems are analyzed, and the main directions of accelerating the encoding / decoding process when using algebraic codes are identified. Based on the analysis, it was determined that the encoding / decoding process is based on the finite field arithmetic apparatus. Thus, simplifying and speeding up the operation in Galois fields should reduce the computational complexity of implementing encoding / decoding procedures for noise-tolerant codes. An analysis of the main methods of calculating operations in Galois fields, found that the priority is to simplify and accelerate the execution of addition operations, as components of multiplication, multiplication and others. Based on the analysis of existing methods of computing operations in Galois fields, it was concluded that modern widely implemented implementations of computing units in finite fields have limitations and shortcomings that lead to reduced use of algebraic codes in solving problems of error detection and correction. performance of specialized computing facilities, taking into account the features and properties of the hardware platform of modern microprocessor technology, the complexity of implementation and speed of which would meet existing requirements and be predicted depending on the bit size of the processed sequences. In the second section of the work is the development of improving the method of acceleration and reduction of hardware costs for the implementation of units of operations on the module, development of structural solutions and modification of algorithms for operations on the module. A method for reducing the hardware costs of the adder per module based on a one-dimensional cascade of structural modules with a homogeneous structure is developed and proposed. This method is based on the introduction into the circuit of through transmission circuits. The effect of implementing this improvement is to reduce the computational complexity, which reduces hardware costs by an average of 10% compared to the existing basic method. An improved method for reducing the computational capacity of the modulator adder model implementation based on a one-dimensional cascade of structural modules is developed and proposed, which, in contrast to the previously proposed, uses structural modules of irregular type. It is established that the modification of the method can be used to reduce the computational complexity in the case of non-critical requirements for the regularity of the computer structure. The use of a modified method reduces the computational complexity, which reduces hardware costs by an average of 50% compared to the existing basic method. A method of increasing the speed of the adder modulo based on a onedimensional cascade of structural modules is developed and proposed, which, unlike the known ones, uses group transfer chains, which allows to increase the speed of operations 8 times compared to the basic method. A modification of the algorithm of multiplication and exponentiation by a variable module is proposed, taking into account the peculiarities of the application of adder models based on one-dimensional cascades of structural modules, in which the value of the lower estimate of time complexity is reduced. The third section proposes a model of computational structures of noise-tolerant codes for performing operations on a variable simple module over high-digit numbers, its implementation and research. The model was created with a focus on adaptation to the elements of the operational computing environment to provide the ability to design the necessary combinations of actuators to perform the same type of arithmetic instructions modulo over high-digit numbers. Also in the section the adaptation of the algorithm for calculating the operation of multiplication and exponentiation modulo taking into account the peculiarities of its construction by the previously proposed method of one-dimensional cascade. The structure of the model and the algorithm of work of the simplified loading of multi-bit operands to blocks of performance of operation on the module are offered. The model was implemented using a structural description using the Xilinx standard resource library in the VHDL hardware description language. The algorithm of operation of the block of the simplified loading of operands is offered. This unit is a control unit without the logic of the choice of operation, as for the study of one particular computer, it is not required, but can have an additional impact on performance. Keep in mind that the contribution of the FSL interface and the simplified load scheme to the values of resources and delays may not have characteristics with a high coefficient of determination, as their implementation uses a behavioral description. The model of computational structures of noise-tolerant codes for performing operations on a variable simple module, like most similar ones, is rarely used as a separate unit, and is usually part of a more complex synchronous system. Thus, the experiments solved the problem of determining the maximum clock frequency at which the developed model can work without errors in the calculations of the original function. The fourth section is devoted to the development of information technology for accelerated computation of large data for distributed information processing systems. Information technology is based on previously developed advanced methods to reduce hardware costs and speed up the calculation of big data. Information technology is based on previously developed, improved methods to reduce hardware costs and speed up the calculation of big data. In addition, to complement the technology, a computer processor-based computer system project, a coprocessor project with computer system drivers, a set of C-program functions that implement software execution of basic operations, and testing tools for the computer structure model were developed. To automate the process of creating and testing models, a set of scripts and a library of models in VHDL, which contains models of computational structures, was implemented. The architecture and command system of the functional model of the coprocessor, focused on performing operations in finite fields, were also developed.

Nowadays, the digital terrestrial television (DTT) market is characterized by the high capacity needed for high definition TV services. There is a need for an efficient use of the broadcast spectrum, which requires new technologies to guarantee increased capacities. Non-Uniform Constellations (NUC) arise as one of the most innovative techniques to approach those requirements. NUCs reduce the gap between uniform Gray-labelled Quadrature Amplitude Modulation (QAM) constellations and the theoretical unconstrained Shannon limit. With these constellations, symbols are optimized in both in-phase (I) and quadrature (Q) components by means of signal geometrical shaping, considering a certain signal-to-noise ratio (SNR) and channel model. There are two types of NUC, one-dimensional and two-dimensional NUCs (1D-NUC and 2D-NUC, respectively). 1D-NUCs maintain the squared shape from QAM, but relaxing the distribution between constellation symbols in a single component, with non-uniform distance between them. These constellations provide better SNR performance than QAM, without any demapping complexity increase. 2D-NUCs also relax the square shape constraint, allowing to optimize the symbol positions in both dimensions, thus achieving higher capacity gains and lower SNR requirements. However, the use of 2D-NUCs implies a higher demapping complexity, since a 2D-demapper is needed, i.e. I and Q components cannot be separated. In this dissertation, NUCs are analyzed from both transmit and receive point of views, using either single-input single-output (SISO) or multiple-input multiple-output (MIMO) antenna configurations. In SISO transmissions, 1D-NUCs and 2D-NUCs are optimized for a wide range of SNRs and different constellation orders. The optimization of rotated 2D-NUCs is also investigated. Even though the demapping complexity is not increased, the SNR gain of these constellations is not significant. The highest rotation gain is obtained for low-order constellations and high SNRs. However, with multi-RF techniques, the SNR gain is drastically increased, since I and Q components are transmitted in different RF channels. In this thesis, multi-RF gains of NUCs with and without rotation are provided for some representative scenarios. At the receiver, two different implementation bottlenecks are explored. First, the demapping complexity of all considered constellations is analyzed. Afterwards, two complexity reduction algorithms for 2D-NUCs are proposed. Both algorithms drastically reduce the number of distances to compute. Moreover, both are finally combined in a single demapper. Quantization of NUCs is also explored in this dissertation, since LLR values and I/Q components are modified when using these constellations, compared to traditional QAM constellations. A new algorithm that is based on the optimization of the quantizer levels for a particular constellation is proposed. The use of NUCs in multi-antenna communications is also investigated. It includes the optimization in one or two antennas, the use of power imbalance, the cross-polar discrimination (XPD) between receive antennas, or the use of different demappers. Assuming different values for the parameters evaluated, new Multi-Antenna Non-Uniform Constellations (MA-NUC) are obtained by means of a particularized re-optimization process, specific for MIMO. At the receiver, an extended demapping complexity analysis is performed, where it is shown that the use of 2D-NUCs in MIMO extremely increases the demapping complexity. As an alternative, an efficient solution for 2D-NUCs and MIMO systems based on Soft-Fixed Sphere Decoding (SFSD) is proposed. The main drawback is that SFSD demappers do not work with 2D-NUCs, since they perform a Successive Interference Cancellation (SIC) step that needs to be performed in separated I and Q components. The proposed method quantifies the closest symbol using Voronoi regions and allows SFSD demappers to work.
Hoy en día, el mercado de la televisión digital terrestre (TDT) está caracterizado por la alta capacidad requerida para transmitir servicios de televisión de alta definición y el espectro disponible. Es necesario por tanto un uso eficiente del espectro radioeléctrico, el cual requiere nuevas tecnologías para garantizar mayores capacidades. Las constelaciones no-uniformes (NUC) emergen como una de las técnicas más innovadoras para abordar tales requerimientos. Las NUC reducen el espacio existente entre las constelaciones uniformes QAM y el límite teórico de Shannon. Con estas constelaciones, los símbolos se optimizan en ambas componentes fase (I) y cuadratura (Q) mediante técnicas geométricas de modelado de la señal, considerando un nivel señal a ruido (SNR) concreto y un modelo de canal específico. Hay dos tipos de NUC, unidimensionales y bidimensionales (1D-NUC y 2D-NUC, respectivamente). Las 1D-NUC mantienen la forma cuadrada de las QAM, pero permiten cambiar la distribución entre los símbolos en una componente concreta, teniendo una distancia no uniforme entre ellos. Estas constelaciones proporcionan un mejor rendimiento SNR que QAM, sin ningún incremento en la complejidad en el demapper. Las 2D-NUC también permiten cambiar la forma cuadrada de la constelación, permitiendo optimizar los símbolos en ambas dimensiones y por tanto obteniendo mayores ganancias en capacidad y menores requerimientos en SNR. Sin embargo, el uso de 2D-NUCs implica una mayor complejidad en el receptor. En esta tesis se analizan las NUC desde el punto de vista tanto de transmisión como de recepción, utilizando bien configuraciones con una antena (SISO) o con múltiples antenas (MIMO). En transmisiones SISO, se han optimizado 1D-NUCs para un rango amplio de distintas SNR y varios órdenes de constelación. También se ha investigado la optimización de 2D-NUCs rotadas. Aunque la complejidad no aumenta, la ganancia SNR de estas constelaciones no es significativa. La mayor ganancia por rotación se obtiene para bajos órdenes de constelación y altas SNR. Sin embargo, utilizando técnicas multi-RF, la ganancia aumenta drásticamente puesto que las componentes I y Q se transmiten en distintos canales RF. En esta tesis, se han estudiado varias ganancias multi-RF representativas de las NUC, con o sin rotación. En el receptor, se han identificado dos cuellos de botella diferentes en la implementación. Primero, se ha analizado la complejidad en el receptor para todas las constelaciones consideradas y, posteriormente, se proponen dos algoritmos para reducir la complejidad con 2D-NUCs. Además, los dos pueden combinarse en un único demapper. También se ha explorado la cuantización de estas constelaciones, ya que tanto los valores LLR como las componentes I/Q se ven modificados, comparando con constelaciones QAM tradicionales. Además, se ha propuesto un algoritmo que se basa en la optimización para diferentes niveles de cuantización, para una NUC concreta. Igualmente, se ha investigado en detalle el uso de NUCs en MIMO. Se ha incluido la optimización en una sola o en dos antenas, el uso de un desbalance de potencia, factores de discriminación entre antenas receptoras (XPD), o el uso de distintos demappers. Asumiendo distintos valores, se han obtenido nuevas constelaciones multi-antena (MA-NUC) gracias a un nuevo proceso de re-optimización específico para MIMO. En el receptor, se ha extendido el análisis de complejidad en el demapper, la cual se incrementa enormemente con el uso de 2D-NUCs y sistemas MIMO. Como alternativa, se propone una solución basada en el algoritmo Soft-Fixed Sphere Decoding (SFSD). El principal problema es que estos demappers no funcionan con 2D-NUCs, puesto que necesitan de un paso adicional en el que las componentes I y Q necesitan separarse. El método propuesto cuantifica el símbolo más cercano utilizando las regiones de Voronoi, permitiendo el uso de este tipo de receptor.
Actualment, el mercat de la televisió digital terrestre (TDT) està caracteritzat per l'alta capacitat requerida per a transmetre servicis de televisió d'alta definició i l'espectre disponible. És necessari per tant un ús eficient de l'espectre radioelèctric, el qual requereix noves tecnologies per a garantir majors capacitats i millors servicis. Les constel·lacions no-uniformes (NUC) emergeixen com una de les tècniques més innovadores en els sistemes de televisió de següent generació per a abordar tals requeriments. Les NUC redueixen l'espai existent entre les constel·lacions uniformes QAM i el límit teòric de Shannon. Amb estes constel·lacions, els símbols s'optimitzen en ambdós components fase (I) i quadratura (Q) per mitjà de tècniques geomètriques de modelatge del senyal, considerant un nivell senyal a soroll (SNR) concret i un model de canal específic. Hi ha dos tipus de NUC, unidimensionals i bidimensionals (1D-NUC i 2D-NUC, respectivament). 1D-NUCs mantenen la forma quadrada de les QAM, però permet canviar la distribució entre els símbols en una component concreta, tenint una distància no uniforme entre ells. Estes constel·lacions proporcionen un millor rendiment SNR que QAM, sense cap increment en la complexitat al demapper. 2D-NUC també canvien la forma quadrada de la constel·lació, permetent optimitzar els símbols en ambdós dimensions i per tant obtenint majors guanys en capacitat i menors requeriments en SNR. No obstant això, l'ús de 2D-NUCs implica una major complexitat en el receptor, ja que es necessita un demapper 2D, on les components I i Q no poden ser separades. En esta tesi s'analitzen les NUC des del punt de vista tant de transmissió com de recepció, utilitzant bé configuracions amb una antena (SISO) o amb múltiples antenes (MIMO). En transmissions SISO, s'han optimitzat 1D-NUCs, per a un rang ampli de distintes SNR i diferents ordes de constel·lació. També s'ha investigat l'optimització de 2D-NUCs rotades. Encara que la complexitat no augmenta, el guany SNR d'estes constel·lacions no és significativa. El major guany per rotació s'obté per a baixos ordes de constel·lació i altes SNR. No obstant això, utilitzant tècniques multi-RF, el guany augmenta dràsticament ja que les components I i Q es transmeten en distints canals RF. En esta tesi, s'ha estudiat el guany multi-RF de les NUC, amb o sense rotació. En el receptor, s'han identificat dos colls de botella diferents en la implementació. Primer, s'ha analitzat la complexitat en el receptor per a totes les constel·lacions considerades i, posteriorment, es proposen dos algoritmes per a reduir la complexitat amb 2D-NUCs. Ambdós algoritmes redueixen dràsticament el nombre de distàncies. A més, els dos poden combinar-se en un únic demapper. També s'ha explorat la quantització d'estes constel·lacions, ja que tant els valors LLR com les components I/Q es veuen modificats, comparant amb constel·lacions QAM tradicionals. A més, s'ha proposat un algoritme que es basa en l'optimització per a diferents nivells de quantització, per a una NUC concreta. Igualment, s'ha investigat en detall l'ús de NUCs en MIMO. S'ha inclòs l'optimització en una sola o en dos antenes, l'ús d'un desbalanç de potència, factors de discriminació entre antenes receptores (XPD), o l'ús de distints demappers. Assumint distints valors, s'han obtingut noves constel·lacions multi-antena (MA-NUC) gràcies a un nou procés de re-optimització específic per a MIMO. En el receptor, s'ha modificat l'anàlisi de complexitat al demapper, la qual s'incrementa enormement amb l'ús de 2D-NUCs i sistemes MIMO. Com a alternativa, es proposa una solució basada en l'algoritme Soft-Fixed Sphere Decoding (SFSD) . El principal problema és que estos demappers no funcionen amb 2D-NUCs, ja que necessiten d'un pas addicional en què les components I i Q necessiten separar-se. El mètode proposat quantifica el símbol més pròxim utilitzan
Fuentes Muela, M. (2017). Non-Uniform Constellations for Next-Generation Digital Terrestrial Broadcast Systems [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/84743
TESIS

Nationalism: Past as Prologue began as a single volume being compiled by Ad Akande, a scholar from South Africa, who proposed it to me as co-author about two years ago. The original idea was to examine how the damaging roots of nationalism have been corroding political systems around the world, and creating dangerous obstacles for necessary international cooperation. Since I (Bruce E. Johansen) has written profusely about climate change (global warming, a.k.a. infrared forcing), I suggested a concerted effort in that direction. This is a worldwide existential threat that affects every living thing on Earth. It often compounds upon itself, so delays in reducing emissions of fossil fuels are shortening the amount of time remaining to eliminate the use of fossil fuels to preserve a livable planet. Nationalism often impedes solutions to this problem (among many others), as nations place their singular needs above the common good. Our initial proposal got around, and abstracts on many subjects arrived. Within a few weeks, we had enough good material for a 100,000-word book. The book then fattened to two moderate volumes and then to four two very hefty tomes. We tried several different titles as good submissions swelled. We also discovered that our best contributors were experts in their fields, which ranged the world. We settled on three stand-alone books:” 1/ nationalism and racial justice. Our first volume grew as the growth of Black Lives Matter following the brutal killing of George Floyd ignited protests over police brutality and other issues during 2020, following the police assassination of Floyd in Minneapolis. It is estimated that more people took part in protests of police brutality during the summer of 2020 than any other series of marches in United States history. This includes upheavals during the 1960s over racial issues and against the war in Southeast Asia (notably Vietnam). We choose a volume on racism because it is one of nationalism’s main motive forces. This volume provides a worldwide array of work on nationalism’s growth in various countries, usually by authors residing in them, or in the United States with ethnic ties to the nation being examined, often recent immigrants to the United States from them. Our roster of contributors comprises a small United Nations of insightful, well-written research and commentary from Indonesia, New Zealand, Australia, China, India, South Africa, France, Portugal, Estonia, Hungary, Russia, Poland, Kazakhstan, Georgia, and the United States. Volume 2 (this one) describes and analyzes nationalism, by country, around the world, except for the United States; and 3/material directly related to President Donald Trump, and the United States. The first volume is under consideration at the Texas A & M University Press. The other two are under contract to Nova Science Publishers (which includes social sciences). These three volumes may be used individually or as a set. Environmental material is taken up in appropriate places in each of the three books. * * * * * What became the United States of America has been strongly nationalist since the English of present-day Massachusetts and Jamestown first hit North America’s eastern shores. The country propelled itself across North America with the self-serving ideology of “manifest destiny” for four centuries before Donald Trump came along. Anyone who believes that a Trumpian affection for deportation of “illegals” is a new thing ought to take a look at immigration and deportation statistics in Adam Goodman’s The Deportation Machine: America’s Long History of Deporting Immigrants (Princeton University Press, 2020). Between 1920 and 2018, the United States deported 56.3 million people, compared with 51.7 million who were granted legal immigration status during the same dates. Nearly nine of ten deportees were Mexican (Nolan, 2020, 83). This kind of nationalism, has become an assassin of democracy as well as an impediment to solving global problems. Paul Krugman wrote in the New York Times (2019:A-25): that “In their 2018 book, How Democracies Die, the political scientists Steven Levitsky and Daniel Ziblatt documented how this process has played out in many countries, from Vladimir Putin’s Russia, to Recep Erdogan’s Turkey, to Viktor Orban’s Hungary. Add to these India’s Narendra Modi, China’s Xi Jinping, and the United States’ Donald Trump, among others. Bit by bit, the guardrails of democracy have been torn down, as institutions meant to serve the public became tools of ruling parties and self-serving ideologies, weaponized to punish and intimidate opposition parties’ opponents. On paper, these countries are still democracies; in practice, they have become one-party regimes….And it’s happening here [the United States] as we speak. If you are not worried about the future of American democracy, you aren’t paying attention” (Krugmam, 2019, A-25). We are reminded continuously that the late Carl Sagan, one of our most insightful scientific public intellectuals, had an interesting theory about highly developed civilizations. Given the number of stars and planets that must exist in the vast reaches of the universe, he said, there must be other highly developed and organized forms of life. Distance may keep us from making physical contact, but Sagan said that another reason we may never be on speaking terms with another intelligent race is (judging from our own example) could be their penchant for destroying themselves in relatively short order after reaching technological complexity. This book’s chapters, introduction, and conclusion examine the worldwide rise of partisan nationalism and the damage it has wrought on the worldwide pursuit of solutions for issues requiring worldwide scope, such scientific co-operation public health and others, mixing analysis of both. We use both historical description and analysis. This analysis concludes with a description of why we must avoid the isolating nature of nationalism that isolates people and encourages separation if we are to deal with issues of world-wide concern, and to maintain a sustainable, survivable Earth, placing the dominant political movement of our time against the Earth’s existential crises. Our contributors, all experts in their fields, each have assumed responsibility for a country, or two if they are related. This work entwines themes of worldwide concern with the political growth of nationalism because leaders with such a worldview are disinclined to co-operate internationally at a time when nations must find ways to solve common problems, such as the climate crisis. Inability to cooperate at this stage may doom everyone, eventually, to an overheated, stormy future plagued by droughts and deluges portending shortages of food and other essential commodities, meanwhile destroying large coastal urban areas because of rising sea levels. Future historians may look back at our time and wonder why as well as how our world succumbed to isolating nationalism at a time when time was so short for cooperative intervention which is crucial for survival of a sustainable earth. Pride in language and culture is salubrious to individuals’ sense of history and identity. Excess nationalism that prevents international co-operation on harmful worldwide maladies is quite another. As Pope Francis has pointed out: For all of our connectivity due to expansion of social media, ability to communicate can breed contempt as well as mutual trust. “For all our hyper-connectivity,” said Francis, “We witnessed a fragmentation that made it more difficult to resolve problems that affect us all” (Horowitz, 2020, A-12). The pope’s encyclical, titled “Brothers All,” also said: “The forces of myopic, extremist, resentful, and aggressive nationalism are on the rise.” The pope’s document also advocates support for migrants, as well as resistance to nationalist and tribal populism. Francis broadened his critique to the role of market capitalism, as well as nationalism has failed the peoples of the world when they need co-operation and solidarity in the face of the world-wide corona virus pandemic. Humankind needs to unite into “a new sense of the human family [Fratelli Tutti, “Brothers All”], that rejects war at all costs” (Pope, 2020, 6-A). Our journey takes us first to Russia, with the able eye and honed expertise of Richard D. Anderson, Jr. who teaches as UCLA and publishes on the subject of his chapter: “Putin, Russian identity, and Russia’s conduct at home and abroad.” Readers should find Dr. Anderson’s analysis fascinating because Vladimir Putin, the singular leader of Russian foreign and domestic policy these days (and perhaps for the rest of his life, given how malleable Russia’s Constitution has become) may be a short man physically, but has high ambitions. One of these involves restoring the old Russian (and Soviet) empire, which would involve re-subjugating a number of nations that broke off as the old order dissolved about 30 years ago. President (shall we say czar?) Putin also has international ambitions, notably by destabilizing the United States, where election meddling has become a specialty. The sight of Putin and U.S. president Donald Trump, two very rich men (Putin $70-$200 billion; Trump $2.5 billion), nuzzling in friendship would probably set Thomas Jefferson and Vladimir Lenin spinning in their graves. The road of history can take some unanticipated twists and turns. Consider Poland, from which we have an expert native analysis in chapter 2, Bartosz Hlebowicz, who is a Polish anthropologist and journalist. His piece is titled “Lawless and Unjust: How to Quickly Make Your Own Country a Puppet State Run by a Group of Hoodlums – the Hopeless Case of Poland (2015–2020).” When I visited Poland to teach and lecture twice between 2006 and 2008, most people seemed to be walking on air induced by freedom to conduct their own affairs to an unusual degree for a state usually squeezed between nationalists in Germany and Russia. What did the Poles then do in a couple of decades? Read Hlebowicz’ chapter and decide. It certainly isn’t soft-bellied liberalism. In Chapter 3, with Bruce E. Johansen, we visit China’s western provinces, the lands of Tibet as well as the Uighurs and other Muslims in the Xinjiang region, who would most assuredly resent being characterized as being possessed by the Chinese of the Han to the east. As a student of Native American history, I had never before thought of the Tibetans and Uighurs as Native peoples struggling against the Independence-minded peoples of a land that is called an adjunct of China on most of our maps. The random act of sitting next to a young woman on an Air India flight out of Hyderabad, bound for New Delhi taught me that the Tibetans had something to share with the Lakota, the Iroquois, and hundreds of other Native American states and nations in North America. Active resistance to Chinese rule lasted into the mid-nineteenth century, and continues today in a subversive manner, even in song, as I learned in 2018 when I acted as a foreign adjudicator on a Ph.D. dissertation by a Tibetan student at the University of Madras (in what is now in a city called Chennai), in southwestern India on resistance in song during Tibet’s recent history. Tibet is one of very few places on Earth where a young dissident can get shot to death for singing a song that troubles China’s Quest for Lebensraum. The situation in Xinjiang region, where close to a million Muslims have been interned in “reeducation” camps surrounded with brick walls and barbed wire. They sing, too. Come with us and hear the music. Back to Europe now, in Chapter 4, to Portugal and Spain, we find a break in the general pattern of nationalism. Portugal has been more progressive governmentally than most. Spain varies from a liberal majority to military coups, a pattern which has been exported to Latin America. A situation such as this can make use of the term “populism” problematic, because general usage in our time usually ties the word into a right-wing connotative straightjacket. “Populism” can be used to describe progressive (left-wing) insurgencies as well. José Pinto, who is native to Portugal and also researches and writes in Spanish as well as English, in “Populism in Portugal and Spain: a Real Neighbourhood?” provides insight into these historical paradoxes. Hungary shares some historical inclinations with Poland (above). Both emerged from Soviet dominance in an air of developing freedom and multicultural diversity after the Berlin Wall fell and the Soviet Union collapsed. Then, gradually at first, right wing-forces began to tighten up, stripping structures supporting popular freedom, from the courts, mass media, and other institutions. In Chapter 5, Bernard Tamas, in “From Youth Movement to Right-Liberal Wing Authoritarianism: The Rise of Fidesz and the Decline of Hungarian Democracy” puts the renewed growth of political and social repression into a context of worldwide nationalism. Tamas, an associate professor of political science at Valdosta State University, has been a postdoctoral fellow at Harvard University and a Fulbright scholar at the Central European University in Budapest, Hungary. His books include From Dissident to Party Politics: The Struggle for Democracy in Post-Communist Hungary (2007). Bear in mind that not everyone shares Orbán’s vision of what will make this nation great, again. On graffiti-covered walls in Budapest, Runes (traditional Hungarian script) has been found that read “Orbán is a motherfucker” (Mikanowski, 2019, 58). Also in Europe, in Chapter 6, Professor Ronan Le Coadic, of the University of Rennes, Rennes, France, in “Is There a Revival of French Nationalism?” Stating this title in the form of a question is quite appropriate because France’s nationalistic shift has built and ebbed several times during the last few decades. For a time after 2000, it came close to assuming the role of a substantial minority, only to ebb after that. In 2017, the candidate of the National Front reached the second round of the French presidential election. This was the second time this nationalist party reached the second round of the presidential election in the history of the Fifth Republic. In 2002, however, Jean-Marie Le Pen had only obtained 17.79% of the votes, while fifteen years later his daughter, Marine Le Pen, almost doubled her father's record, reaching 33.90% of the votes cast. Moreover, in the 2019 European elections, re-named Rassemblement National obtained the largest number of votes of all French political formations and can therefore boast of being "the leading party in France.” The brutality of oppressive nationalism may be expressed in personal relationships, such as child abuse. While Indonesia and Aotearoa [the Maoris’ name for New Zealand] hold very different ranks in the United Nations Human Development Programme assessments, where Indonesia is classified as a medium development country and Aotearoa New Zealand as a very high development country. In Chapter 7, “Domestic Violence Against Women in Indonesia and Aotearoa New Zealand: Making Sense of Differences and Similarities” co-authors, in Chapter 8, Mandy Morgan and Dr. Elli N. Hayati, from New Zealand and Indonesia respectively, found that despite their socio-economic differences, one in three women in each country experience physical or sexual intimate partner violence over their lifetime. In this chapter ther authors aim to deepen understandings of domestic violence through discussion of the socio-economic and demographic characteristics of theit countries to address domestic violence alongside studies of women’s attitudes to gender norms and experiences of intimate partner violence. One of the most surprising and upsetting scholarly journeys that a North American student may take involves Adolf Hitler’s comments on oppression of American Indians and Blacks as he imagined the construction of the Nazi state, a genesis of nationalism that is all but unknown in the United States of America, traced in this volume (Chapter 8) by co-editor Johansen. Beginning in Mein Kampf, during the 1920s, Hitler explicitly used the westward expansion of the United States across North America as a model and justification for Nazi conquest and anticipated colonization by Germans of what the Nazis called the “wild East” – the Slavic nations of Poland, the Baltic states, Ukraine, and Russia, most of which were under control of the Soviet Union. The Volga River (in Russia) was styled by Hitler as the Germans’ Mississippi, and covered wagons were readied for the German “manifest destiny” of imprisoning, eradicating, and replacing peoples the Nazis deemed inferior, all with direct references to events in North America during the previous century. At the same time, with no sense of contradiction, the Nazis partook of a long-standing German romanticism of Native Americans. One of Goebbels’ less propitious schemes was to confer honorary Aryan status on Native American tribes, in the hope that they would rise up against their oppressors. U.S. racial attitudes were “evidence [to the Nazis] that America was evolving in the right direction, despite its specious rhetoric about equality.” Ming Xie, originally from Beijing, in the People’s Republic of China, in Chapter 9, “News Coverage and Public Perceptions of the Social Credit System in China,” writes that The State Council of China in 2014 announced “that a nationwide social credit system would be established” in China. “Under this system, individuals, private companies, social organizations, and governmental agencies are assigned a score which will be calculated based on their trustworthiness and daily actions such as transaction history, professional conduct, obedience to law, corruption, tax evasion, and academic plagiarism.” The “nationalism” in this case is that of the state over the individual. China has 1.4 billion people; this system takes their measure for the purpose of state control. Once fully operational, control will be more subtle. People who are subject to it, through modern technology (most often smart phones) will prompt many people to self-censor. Orwell, modernized, might write: “Your smart phone is watching you.” Ming Xie holds two Ph.Ds, one in Public Administration from University of Nebraska at Omaha and another in Cultural Anthropology from the Chinese Academy of Social Sciences, Beijing, where she also worked for more than 10 years at a national think tank in the same institution. While there she summarized news from non-Chinese sources for senior members of the Chinese Communist Party. Ming is presently an assistant professor at the Department of Political Science and Criminal Justice, West Texas A&M University. In Chapter 10, analyzing native peoples and nationhood, Barbara Alice Mann, Professor of Honours at the University of Toledo, in “Divide, et Impera: The Self-Genocide Game” details ways in which European-American invaders deprive the conquered of their sense of nationhood as part of a subjugation system that amounts to genocide, rubbing out their languages and cultures -- and ultimately forcing the native peoples to assimilate on their own, for survival in a culture that is foreign to them. Mann is one of Native American Studies’ most acute critics of conquests’ contradictions, and an author who retrieves Native history with a powerful sense of voice and purpose, having authored roughly a dozen books and numerous book chapters, among many other works, who has traveled around the world lecturing and publishing on many subjects. Nalanda Roy and S. Mae Pedron in Chapter 11, “Understanding the Face of Humanity: The Rohingya Genocide.” describe one of the largest forced migrations in the history of the human race, the removal of 700,000 to 800,000 Muslims from Buddhist Myanmar to Bangladesh, which itself is already one of the most crowded and impoverished nations on Earth. With about 150 million people packed into an area the size of Nebraska and Iowa (population less than a tenth that of Bangladesh, a country that is losing land steadily to rising sea levels and erosion of the Ganges river delta. The Rohingyas’ refugee camp has been squeezed onto a gigantic, eroding, muddy slope that contains nearly no vegetation. However, Bangladesh is majority Muslim, so while the Rohingya may starve, they won’t be shot to death by marauding armies. Both authors of this exquisite (and excruciating) account teach at Georgia Southern University in Savannah, Georgia, Roy as an associate professor of International Studies and Asian politics, and Pedron as a graduate student; Roy originally hails from very eastern India, close to both Myanmar and Bangladesh, so he has special insight into the context of one of the most brutal genocides of our time, or any other. This is our case describing the problems that nationalism has and will pose for the sustainability of the Earth as our little blue-and-green orb becomes more crowded over time. The old ways, in which national arguments often end in devastating wars, are obsolete, given that the Earth and all the people, plants, and other animals that it sustains are faced with the existential threat of a climate crisis that within two centuries, more or less, will flood large parts of coastal cities, and endanger many species of plants and animals. To survive, we must listen to the Earth, and observe her travails, because they are increasingly our own.