从“编码/解码”理论看新闻工作应更符合新闻传播规律

在马克思的政治经济学理论中,社会资本要经历生产、流通、使用以及再生产四个阶段。斯图亚特·霍尔基于这个理论,以电视为例,提出了其著名的"编码/解码"理论,[1]旨在以符号为基础,反驳传统传播学中信息传播的"发送者-信息-接受者"的线性模式,说明信息传播话语结构的复杂性。其理论,包括三种假想地位,"主导-霸权地位"、"协商"地位、"对抗"地位,这些理论能帮助我们更好认识到新闻工作应更加符合新闻传播规律的重要性。

品牌跨文化传播中的国家形象分析——基于斯图亚特·霍尔“编码/解码”理论

在国际品牌的跨文化传播中,充分了解进入国的文化、符号系统,以期减少文化冲突又不失品牌特色,是国际品牌塑造的重要环节。文章结合斯图亚特·霍尔“编码/解码”理论,分析在跨文化传播中,国际品牌在实现资本增值的同时如何塑造品牌母国的国家形象;此外,品牌母国的国家形象,包含政治、经济、文化等多方面共同作用,又是如何影响国际品牌的传播。

优兔平台上中国品牌跨文化传播路径研究——基于斯图亚特·霍尔“编码/解码”理论

在经济全球化的竞争浪潮里,中国企业早已开始国际化的历程,中国已经拥有一批世界级的企业及享誉世界的全球化产品,但缺乏在世界上拥有较大影响力及号召力的中国品牌。随着互联网的发展,社交媒体已经成为各国品牌进行国际传播的主要阵地。互联网消弭了传统的地域界限,在互联网平台进行的品牌传播其实质就是跨文化传播,因此在研究社交平台上中国品牌的国际传播现象时,跨文化传播是不可忽略的情境因素。文章以在优兔平台上进行国际传播且具备一定影响力的中国品牌为研究对象,以斯图亚特·霍尔“编码/解码”理论为理论背景,通过内容分析法对中国品牌在优兔平台上进行传播的内容及消费者对内容的解码方式进行分析,并对中国品牌在优兔平台上的跨文化传播路径及影响因素进行分析,为中国品牌在优兔平台上的跨文化传播提供理论和实践支撑。研究表明,低语境的传播方式、具有共通解释项的同质性跨文化符码,是中国品牌在优兔平台上进行传播编码的关键因素。理解跨文化传播情境,充分运用跨文化编码符号体系,加强与他文化的互动交流,避免文化误读,有效实现消费者的积极解码是中国品牌在优兔平台上可行的传播路径。

基于“编码/解码”理论探析经典综艺IP的“出圈”原因——以《花儿与少年·丝路季》为例

近年来,旅行真人秀节目开始进入人们视野,并取得了良好的播出效果。其中,作为较早的旅行真人秀节目《花儿与少年》已经播出六季。与往季节目不同的是,《花儿与少年·丝路季》除了邀请明星嘉宾参与外,还以“一带一路”项目为背景,围绕“一带一路”重点合作项目和中国企业,带领观众认识中国智慧、中国方案、中国力量为沿线国家带来的改变,同时致敬默默无闻的“丝路使者”。文章以“编码/解码”理论为研究工具,从节目定位、主体设定、场景设置三方面对该节目的“出圈”原因进行分析,由此得出时代背景、文化传播、人际沟通、国际视野等因素在其中发挥着关键性的作用,这对于其他综艺节目有一定的参考意义。

从“编码/解码”理论看《生死疲劳》的文化负载词翻译

本文通过对莫言作品《生死疲劳》英译本和日译本的分析,认为“编码/解码”理论对中国文化负载词外译策略有着较好的解释力。两种译本所采用的对文化负载词的翻译方式虽然差别较大,却也体现出某些共性。首先,英译本和日译本都注重维持传输负载和信道接受能力之间的平衡;其次,都体现出编码者对于读者解码方向的引导和操控。两位译者均准确把握住了各自国家读者的文本解码特征,选取了适当的文化负载词翻译策略。

对中国东北电视方言类节目的文艺学解读

中国的电视娱乐节目只有立足于中国及中国的某地方文化,充分研究中国人的审美趣味和接受心理,才能立于不败之地。诚如西方电视美学家赫拉斯.纽肯默所言,成功的电视配方被广为模仿,并能够存在下来的配方一定是广有观众的。这种成功的配方若想移植成功,不能简单地模仿,一定要和我们国家及地区的人文、社会、传播环境相适应,即做到本土化的改造。

General and robust voxel feature learning with Transformer for 3D object detection

The self-attention networks and Transformer have dominated machine translation and natural language processing fields,and shown great potential in image vision tasks such as image classification and object detection.Inspired by the great progress of Transformer,we propose a novel general and robust voxel feature encoder for 3D object detection based on the traditional Transformer.We first investigate the permutation invariance of sequence data of the self-attention and apply it to point cloud processing.Then we construct a voxel feature layer based on the self-attention to adaptively learn local and robust context of a voxel according to the spatial relationship and context information exchanging between all points within the voxel.Lastly,we construct a general voxel feature learning framework with the voxel feature layer as the core for 3D object detection.The voxel feature with Transformer(VFT)can be plugged into any other voxel-based 3D object detection framework easily,and serves as the backbone for voxel feature extractor.Experiments results on the KITTI dataset demonstrate that our method achieves the state-of-the-art performance on 3D object detection.

CHANNEL ESTIMATION FOR ITERATIVE DECODING OVER FADING CHANNELS

A method of coherent detection and channel estimation for punctured convolutional coded binary Quadrature Amplitude Modulation (QAM) signals transmitted over a frequency-flat Rayleigh fading channels used for a digital radio broadcasting transmission is presented. Some known symbols are inserted in the encoded data stream to enhance the channel estimation process.The pilot symbols are used to replace the existing parity symbols so no bandwidth expansion is required. An iterative algorithm that uses decoding information as well as the information contained in the known symbols is used to improve the channel parameter estimate. The scheme complexity grows exponentially with the channel estimation filter length. The performance of the system is compared for a normalized fading rate with both perfect coherent detection (corresponding to a perfect knowledge of the fading process and noise variance) and differential detection of Differential Amplitude Phase Shift Keying (DAPSK). The tradeoff between simplicity of implementation and bit-error-rate performance of different techniques is also compared.

Frame-bitrate-change based steganography for voice-over-IP

Steganography based on bits-modification of speech frames is a kind of commonly used method, which targets at RTP payloads and offers covert communications over voice-over-IP(Vo IP). However, direct modification on frames is often independent of the inherent speech features, which may lead to great degradation of speech quality. A novel frame-bitrate-change based steganography is proposed in this work, which discovers a novel covert channel for Vo IP and introduces less distortion. This method exploits the feature of multi-rate speech codecs that the practical bitrate of speech frame is identified only by speech decoder at receiving end. Based on this characteristic, two steganography strategies called bitrate downgrading(BD) and bitrate switching(BS)are provided. The first strategy substitutes high bit-rate speech frames with lower ones to embed secret message, which introduces very low distortion in practice, and much less than other bits-modification based methods with the same embedding capacity. The second one encodes secret message bits into different types of speech frames, which is an alternative choice for supplement. The two strategies are implemented and tested on our covert communication system Steg Vo IP. The experiment results show that our proposed method is effective and fulfills the real-time requirement of Vo IP communication.

Optical encryption with cascaded fractional wavelet transforms

On the basis of fractional wavelet transform, we propose a new method called cascaded fractional wavelet transform to encrypt images. It has the virtues of fractional Fourier transform and wavelet transform. Fractional orders, standard focal lengths and scaling factors are its keys. Multistage fractional Fourier transforms can add the keys easily and strengthen information se-curity. This method can also realize partial encryption just as wavelet transform and fractional wavelet transform. Optical reali-zation of encryption and decryption is proposed. Computer simulations confirmed its possibility.

A Decode-and-Forward Scheme for LDPC Coded Three-Way Relay Fading Channels

In this paper a low-density pairwise check(LDPC) coded three-way relay system is considered, where three user nodes desire to exchange messages with the help of one relay node. Since physical-layer network coding is applied, two time slots are sufficient for one round information exchange. In this paper, we present a decode-and-forward(DF) scheme based on joint LDPC decoding for three-way relay channels, where relay decoder partially decodes the network code rather than fully decodes all the user messages. Simulation results show that the new DF scheme considerably outperforms other common schemes in three-way relay fading channels.

In-Network Puncturing for Delay-Efficient Rate Control of Distributed Video Coding in Wireless Video Sensor Networks

Wyner-Ziv Video Coding （WZVC） is considered as a promising video coding scheme for Wireless Video Sensor Networks （WVSNs） due to its high compression efficiency and error resilience functionalities, as well as its low encoding complex- ity. To achieve a good Rate-Distortion （R-D） per- formance, the current WZVC paradi^prls usually a- dopt an end-to-end rate control scheme in which the decoder repeatedly requests the additional deco- ding data from the encoder for decoding Wyner-Ziv frames. Therefore, the waiting time of the additional decoding data is especially long in multihop WVSNs. In this paper, we propose a novel pro- gressive in-network rate control scheme for WZVC. The proposed in-network puncturing-based rate control scheme transfers the partial channel codes puncturing task from the encoder to the relay nodes. Then, the decoder can request the addition- al decoding data from the relay nodes instead of the encoder, and the total waiting time for deco- ding Wyner-Ziv frames is reduced consequently. Simulation results validate the proposed rate con- trol scheme.

FAST ALGORITHM FOR REED-SOLOMON CODE AND THE HARDWARE IMPLEMENTATION

This paper described a signal processor for the Reed-Solomon (R-S) code using micro-programming. For the purpose of fast encoding and decoding,a formula for detecting two errors is derived, and the Qian search method for the decoding process is improved. The number of searches is significantly reduced from 256 to 4. At the same time, the circuit is simplified and the speed is increased. For the convenience of programming, a micro-programming compiling package is developed. The package can be used for programming of different formats of R-S code signal processors of DAB, MD and DCC. The software and the hardware can be used for error correcting, error detecting and error compensation of different formats of R-S code.

Simple optical decryption based on a modified joint transform correlator technique

A new encryption/decryption system for optical information security is proposed in this paper. We used an iterative Fourier transform algorithm to optimize the encrypted hologram as well as the decryption key as phase-only elements. The optical decryption was implemented by superimposing the encrypted hologram and the decryyption key in a simple optical setup. Numerical simulation and optical experiment have confirmed the proposed technique as a simple and easy implementation for optical decryption, demonstrating potential applications in optical information security verification.

WIRELESS FLOPPY DISK DRIVE USING TURBO CODEC IN HOME AND OFFICE WIRELESS LAN

A wireless floppy disk drive is proposed for home and office wireless local area network. The proposed floppy drive uses turbo coding-decoding in the transceiver PHYsical layer (PHY) to improve system performance. The data transmission rate is about 11 Mbps. The covered distance is 30 meters in obstructed environment and 100 m in free space.

LOW-COMPLEXITY REDUNDANCY INSERTION IN MULTIPLE DESCRIPTION CODING

Multiple description coding has recently been proposed as a joint source and channel coding to solve the problem of robust image transmission over unreliable network, and it can offer a variety of tradeoff between signal redundancy and transmission robustness. In this letter, a novel pre- and post-processing method with flexible redundancy insertion for polyphase downsampling multiple de- scription coding is presented. The proposed method can be implemented as pre- and post-processing to all standards for image and video communications, with obvious advantages. Simulation results show that this approach can reduce the computational complexity while provide a flexible redundancy in- sertion to make the system robust for any packet loss situation over different networks.

A Concatenated ML Decoder for ST/SFBC-OFDM Systems in Double Selective Fading Channels

This paper presented a concatenated maximum-likelihood (ML) decoder for space-time/space-frequency block coded orthogonal frequency diversion multiplexing (ST/SFBC-OFDM) systems in double selective fading channels. The proposed decoder first detects space-time or space-frequency codeword elements separately. Then, according to the coarsely estimated codeword elements, the ML decoding is performed in a smaller constellation element set to searching final codeword. It is proved that the proposed decoder has optimal performances if and only if subchannels are constant during a codeword interval. The simulation results show that the performances of proposed decoder is close to that of the optimal ML decoder in severe Doppler and delay spread channels. However, the complexity of proposed decoder is much lower than that of the optimal ML decoder.

THE UNIFICATION OF DIFFERENTIAL ENCODING AND DECODING ALGORITHM FOR VARIOUS SIGNALS

Many monographs point out that differential encoding and decoding is necessary for ef- fectual information transmission against phase ambiguity while seldom discuss the reason why phase ambiguity will emerge inevitably.Available algorithms are specially designed for certain modulation scheme;these algorithms cannot satisfy the requirement of soft-defined radio,which perhaps demands a uniform algorithm for different modulations.This paper proposes a new opinion on phase ambiguity from the view of probability.This opinion believes that modulating symbol sequence can affect,at optimum sampling epoch,the modulated waveform as oscillating carrier has done,and so the stochastic sequence leads to phase ambiguity.Based on a general signal model,this paper also puts forward a novel universal algorithm,which is suitable for different signals,even some new ones,by configuring several parameters.

Design of bilayer lengthened LDPC codes over expanded graph for relay channels

This paper presents a low complexity optimized algorithm for design of bilayer lengthened LDPC(BL-LDPC) code for decode-and-forward relay system.The design is performed over the expanded graph of the BL-LDPC code,which consists of the original bilayer graph and the extra added relaygenerated parity check bits.To build up our proposed optimized algorithm,we present a modified Gaussian approximation algorithm for the expanded structure of the BL-LDPC code.Then using the proposed optimized algorithm,we find the optimum overall expanded graph of the BL-LDPC code.Simulation results show that the BL-LDPC codes obtained by our proposed optimized algorithm have excellent bit-error-rate performances and small gaps between the convergence thresholds and the theoretical limits when transmitted over the additive white Gaussian noise channels.

APPLICATION OF TURBO CODES IN HIGH-SPEED REAL-TIME CHANNEL

The time delay of Turbo codes due to its iterative decoding is the main bottleneck of its application in real-time channel. However, the time delay can be greatly shortened through the adoption of parallel decod-ing algorithm, dividing the received bits into several sub-blocks and processing in parallel. This letter mainly discusses the applicability of turbo codes in high-speed real-time channel through the study of a parallel turbo decoding algorithm based on 3GPP-proposed turbo encoder and interleaver in various channel. Simulation re-sult shows that, by choosing an appropriate sub-block length, the time delay can be obviously shortened with-out degrading the performance and increasing hardware complexity, and furthermore indicates the applicability of Turbo codes in high-speed real-time channel.