Nonlinear MIMO for Industrial Internet of Things in Cyber–Physical Systems
Bibliographic record
Abstract
Massive multiple-input multiple-output (MIMO) wireless communication technology with the characteristics of hyperconnectivity is an ideal channel to connect the industrial Internet of Things (IIoT) and the cyber-physical system. It provides stable and reliable connectivity from the data center to distributed user terminals and the IIoT. However, traditional massive MIMO suffers from high power consumption and fabrication cost. The design of energy-efficient massive MIMO technology is essential for larger scale industrial deployments. In this article, we design three types of nonlinear RF chain structures, which not only reduce the power consumption of massive MIMO systems but also save fabrication costs. Information theoretic analysis demonstrates the power efficiency performance of our nonlinear system design. Our nonlinear MIMO system designs can increase the power efficiency by up to 2.3 times compared with the traditional MIMO system. We have demonstrated that our systems can achieve the same uplink rate as traditional MIMO by increasing the number of receiving antennas but with less overall power consumption. We also proposed an algorithm to overcome the problem of low computational efficiency due to high-dimensional integration when calculating the uplink achievable rate of nonlinear MIMO. Moreover, we reveal that when the skew-normal distribution is used as signaling, the nonlinear MIMO systems can achieve better performance than the Gaussian distribution.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".