The Three Node Wireless Network: Achievable Rates and Cooperation Strategies

We consider a wireless network composed of three nodes and limited by the half-duplex and total power constraints. This formulation encompasses many of the special cases studied in the literature and allows for capturing the common features shared by them. Here, we focus on three special cases, namely 1) Relay Channel, 2) Multicast Channel, and 3) Conference Channel. These special cases are judicially chosen to reflect varying degrees of complexity while highlighting the common ground shared by the different variants of the three node wireless network. For the relay channel, we propose a new cooperation scheme that exploits the wireless feedback gain. This scheme combines the benefits of decode-and-forward and compress-and-forward strategies and avoids the idealistic feedback assumption adopted in earlier works. Our analysis of the achievable rate of this scheme reveals the diminishing feedback gain at both the low and high signal-to-noise ratio regimes. Inspired by the proposed feedback strategy, we identify a greedy cooperation framework applicable to both the multicast and conference channels. Our performance analysis reveals several nice properties of the proposed greedy approach and the central role of cooperative source-channel coding in exploiting the receiver side information in the wireless network setting. Our proofs for the cooperative multicast with side-information rely on novel nested and independent binning encoders along with a list decoder.Comment: 52 page

The Optimization Path of Practical Teaching System for Film and Television Media Majors in the Context of New Liberal Arts

Under the macro vision of new liberal arts, the teaching of film and media majors is ushering in unprecedented challenges and broad opportunities. This paper focuses on exploring the optimization strategy of the practice teaching system of film and media majors, aiming to precisely meet the demand for talents in the new era, and to cultivate application-oriented innovative talents with profound humanistic sentiment, excellent practical ability and innovative spirit. In order to achieve this goal, this paper elaborately designs a multi-dimensional optimization path, covering such key areas as the deep integration of interdisciplinary subjects, the comprehensive innovation of the curriculum system, the creation of high-level teachers, the strengthening and upgrading of practical teaching, the in-depth promotion of the integration mechanism of industry-university-research and the effective incorporation of curriculum ideology and politics, etc., and puts forward a series of specific and feasible optimization measures, with a view to providing strong support and guidance for the future development of the film, television and media professional education. A series of specific and feasible optimization measures are proposed in order to provide strong support and guidance for the future development of film and media education

Special Issue – Mathematical Imaging

The multidisciplinary subject of Imaging Science concerning the generation, collection, duplication, analysis, modification, restoration, enhancement, comparison, feature extraction, and visualisation of images is developing in a rapid speed. It is increasingly used in more and more application areas, especially in cutting edge technologies. Mathematical Imaging firmly establishes mathematics as a rigorous basis for imaging science, complementing the image processing methodologies, in the discrete setting, of computer science and information science

Sub-graph based joint sparse graph for sparse code multiple access systems

Sparse code multiple access (SCMA) is a promising air interface candidate technique for next generation mobile networks, especially for massive machine type communications (mMTC). In this paper, we design a LDPC coded SCMA detector by combining the sparse graphs of LDPC and SCMA into one joint sparse graph (JSG). In our proposed scheme, SCMA sparse graph (SSG) defined by small size indicator matrix is utilized to construct the JSG, which is termed as sub-graph based joint sparse graph of SCMA (SG-JSG-SCMA). In this paper, we first study the binary-LDPC (B-LDPC) coded SGJSG- SCMA system. To combine the SCMA variable node (SVN) and LDPC variable node (LVN) into one joint variable node (JVN), a non-binary LDPC (NB-LDPC) coded SG-JSG-SCMA is also proposed. Furthermore, to reduce the complexity of NBLDPC coded SG-JSG-SCMA, a joint trellis representation (JTR) is introduced to represent the search space of NB-LDPC coded SG-JSG-SCMA. Based on JTR, a low complexity joint trellis based detection and decoding (JTDD) algorithm is proposed to reduce the computational complexity of NB-LDPC coded SGJSG- SCMA system. According to the simulation results, SG-JSGSCMA brings significant performance improvement compare to the conventional receiver using the disjoint approach, and it can also outperform a Turbo-structured receiver with comparable complexity. Moreover, the joint approach also has advantages in terms of processing latency compare to the Turbo approaches