1,721,186 research outputs found
Ningyō Sashichi and Hanshichi: Differing Views on Ancient Edo
Full text linkTorimonochō have enjoyed immense popularity in Japan since their inception: through highs and lows, these stories have managed to survive for a hundred years with little to no interruption, even during the bleak days of the Pacific War. Even now, when this literary genre has fallen under the radar, and many among the younger generations are unfamiliar with it, it still enjoys a moderate degree of success in its niche market, and it is an important part of the Japanese literary landscape. Despite the depth of the roots torimonochō have in Japan, scholarly attention towards the genre has not been forthcoming: literary criticism in Japanese is not plentiful, and tends to concentrate on a single series, Hanshichi torimonochō, to the near exclusion of others, and the situation is further exacerbated by the extreme scarcity of translations. The present work aims to bridge this gap, however partially, not just by introducing torimonochō to a Western audience, but by presenting some of its lesser-known aspects, and arguing for a re-evaluation of the genre itself. Torimonochō are often presented, and present in the public mind, as an unambiguous unit, something of a monolithic block with little in the way of change: detective stories set in a nostalgia-fuelled Edo period – a ‘golden age’, or the ‘good old times’ – with very rigid, well-defined characteristics more or less impervious to modifications. On a closer look, however, within the compact and apparently strict definition of ‘torimonochō’, one finds a much more fragmentary reality, an amalgamation of different elements which do not even necessarily mesh well with each other. Torimonochō are not a single block, then, but a construction made of many smaller ‘bricks’, quite varied and rarely homogeneous. A hybrid mass without substantial unity, in other words, a commixture the characteristics of which change depending on the author’s vision – and even the reader’s vision. This hybridity manifests itself in three different stages, or layers: (a) the origins of the torimonochō, how they came about and reached their present form; (b) its representational content, how they depict the fantasy world the protagonists inhabit and what this depiction tells us about the real world the authors lived in; and (c) their surrounding context, how the external circumstances around the times of their publication variously affected not just single works, but genre definitions themselves. These three forms of hybridity will be the main subject of the present thesis, the four chapters of which will explore each of these individual sides with the intention of demonstrating that torimonochō is a fundamentally inhomogeneous literary genre. Given the plethora of works, the scope of the paper is limited to the so-called ‘Five Great Torimonochō’: Umon torimonochō, Zenigata Heiji torimono hikae, Wakasama zamurai torimono techō, Hanshichi torimonochō, and Ningyō Sashichi torimonochō, with a special focus on the latter two. The Hanshichi series is of capital importance, not just because it gave birth to the genre itself, but also for its curious ‘heretical’ status among its epigones. The Sashichi series, on the other hand, introduces many variations which set it starkly apart from the traditional concept of torimonochō, endowing it with an importance which has not always been acknowledged by critics
IRSA-based Unsourced Random Access over Gaussian Channel
No full textGrant-free massive access schemes based on irregular repetition slotted ALOHA (IRSA) are investigated as an option for unsourced random access over the Gaussian multiple access channel. The goal is to carry out a performance analysis over a noisy channel, seeking for achievable limits on packet loss probability and energy efficiency. A novel performance analysis framework is developed for IRSA-based random access in asymptotic conditions in presence of both collisions and slot decoding errors. It includes density-evolution equations, asymptotic limits for minimum packet loss probability and average load threshold, and a converse bound for threshold values. The analysis is exploited as a tool to evaluate performance limits in terms of achievable Eb/N0 and tradeoff between energy and spectrum efficiency. Numerical results show that IRSA-based schemes have a convergence boundary limit within few dB from the random coding bound for a large enough number of active transmitters
Torimonochō to jidai misuterī no heikōsen: "Abunā oji" "Dī hanji" "Fandōrin" shirīzu o chūshin ni
No full textEfficient and exact evaluation of the weight spectral shape and typical minimum distance of protograph LDPC codes
No full textIn this letter, an analytical method for evaluating the weight spectral shape of a nonbinary protograph low-density parity-check code ensemble is provided. This method, which requires simultaneous solution of a system of equations, is more efficient to implement than the existing methods that require the numerical solution of a high-dimensional maximization problem. It is also shown that by adding a single equation to the proposed system, it is possible to directly solve for the typical minimum distance of the ensemble. This makes the proposed method particularly useful for the ensemble design scenario where a constraint is placed on the typical minimum distance. The proposed method is verified through the evaluation of the weight spectral shape of some example protograph ensembles
Access Point Cooperation Strategies for Coded Random Access in Cell-Free Massive MIMO
Full text linkIn this article, grant-free uplink communication from a large number of machine-type devices in cell-free massive MIMO networks is explored. A novel approach that leverages coded random access (CRA), on the device side, with combining of signals received at properly selected access points (APs) and cooperative successive interference cancelation (SIC), on the network side, is presented. Initially, an analytical framework based on stochastic geometry is developed to investigate performance of AP cooperation through signal combining under diverse AP cluster compositions. The potential gain from AP signal combining is then assessed by evaluating a genie-aided scheme, guiding the network in cluster selection for each active device. Subsequently, two practical AP selection algorithms that operate in grant-free conditions (i.e., do not require prior information regarding the active users) are proposed. Numerical results show how AP cooperation through signal combining and distributed interference cancelation can bring tangible benefits even without prior information about active users, under different signal-to-noise ratio regimes, closing in some cases the gap to the genie-aided approach. Additionally, the results prove that AP cooperation can be used to reduce the devices' energy consumption and the number of APs that have to be deployed by the service providers to achieve specific performance levels
Enumeration and Identification of Active Users for Grant-Free NOMA Using Deep Neural Networks
Full text linkIn next-generation mobile radio systems, multiple access schemes will support a massive number of uncoordinated devices exhibiting sporadic traffic, transmitting short packets to a base station. Grant-free non-orthogonal multiple access (NOMA) has been introduced to provide services to a large number of devices and to reduce the communication overhead in massive machine-type communication (mMTC) scenarios. In grant-free communication, there is no coordination between the device and base station (BS) before the data transmission; therefore, the challenging task of active users detection (AUD) must be conducted at the BS. For NOMA with sparse spreading, we propose a deep neural network (DNN)-based approach for AUD called active users enumeration and identification (AUEI). It consists of two phases: firstly, a DNN is used to estimate the number of active users; then in the second phase, another DNN identifies them. To speed up the training process of the DNNs, we propose a multi-stage transfer learning technique. Our numerical results show a remarkable performance improvement of AUEI in comparison to previously proposed approaches
Spectral Shape of Non-Binary LDPC Code Ensembles with Separated Variable Nodes
No full textThe non-binary weight distribution and its spectral
shape is developed for a partially-structured ensemble of low-density parity-check codes over finite fields. The ensemble is characterized by all degree-2 variable nodes and some of the degree-3 variable nodes being separated. It is shown that, under node separation, the typical minimum distance is strictly positive and significantly higher than the one of the corresponding unstructured ensemble
- …
