The Experts below are selected from a list of 36366 Experts worldwide ranked by ideXlab platform

Narine S Yegiyan - One of the best experts on this subject based on the ideXlab platform.

  • conceptualizing visual detail Message Structure as a predictor of preferential processing
    Communication Methods and Measures, 2014
    Co-Authors: Narine S Yegiyan
    Abstract:

    The research reported here integrates traditions of cognitive information processing and visual communication research by offering a new conceptual definition of item centrality and a methodological tool for measuring it. Using developments in information processing research about effects of visual production features on attention and memory, this article advances the proposition that these features influence the perception of some objects as central or peripheral to the information presented in a specific visual scene. These structural features were combined here to develop and test a structural indicator of item centrality. The results show that such elements as size, proximity to other objects, brightness, motion, contrast, and position on screen account for a great deal of judgment-driven evaluations about objects’ centrality. Moreover, the central and peripheral details identified using the Structure-based measure replicated the same pattern of results produced in studies using a judgment-based defin...

Cristina Ling - One of the best experts on this subject based on the ideXlab platform.

  • interest groups the media and policy debate formation an analysis of Message Structure rhetoric and source cues
    Political Communication, 1998
    Co-Authors: Nayda Terkildsen, Frauke Schnell, Cristina Ling
    Abstract:

    We propose an interactive model of public policy debate formation that highlights the dependent yet competitive relationship between the media and pressure groups in structuring policy Messages and issue rhetoric. To test our model we examine the evolution of the abortion debate in the print media using measures of Message format and related contextual cues to determine the effectiveness of the media versus interest group players in generating favorable issue Messages and controlling policy rhetoric. We find that the media both report issue news and advocate unique policy Messages, and that inter- and intrainterest group competition in structuring issue information is cyclical and often related more to journalistic norms than to actual pressure group strength.

Fang Cai - One of the best experts on this subject based on the ideXlab platform.

  • low complexity reliability based Message passing decoder architectures for non binary ldpc codes
    IEEE Transactions on Very Large Scale Integration Systems, 2012
    Co-Authors: Xinmiao Zhang, Fang Cai, Shu Lin
    Abstract:

    Non-binary low-density parity-check (NB-LDPC) codes can achieve better error-correcting performance than their binary counterparts at the cost of higher decoding complexity when the codeword length is moderate. The recently developed iterative reliability-based majority-logic NB-LDPC decoding has better performance-complexity tradeoffs than previous algorithms. This paper first proposes enhancement schemes to the iterative hard reliability-based majority-logic decoding (IHRB-MLGD). Compared to the IHRB algorithm, our enhanced (E-)IHRB algorithm can achieve significant coding gain with small hardware overhead. Then low-complexity partial-parallel NB-LDPC decoder architectures are developed based on these two algorithms. Many existing NB-LDPC code construction methods lead to quasi-cyclic or cyclic codes. Both types of codes are considered in our design. Moreover, novel schemes are developed to keep a small proportion of Messages in order to reduce the memory requirement without causing noticeable performance loss. In addition, a shift-Message Structure is proposed by using memories concatenated with variable node units to enable efficient partial-parallel decoding for cyclic NB-LDPC codes. Compared to previous designs based on the Min-max decoding algorithm, our proposed decoders have at least tens of times lower complexity with moderate coding gain loss.

  • low complexity architectures for reliability based Message passing non binary ldpc decoding
    International Symposium on Circuits and Systems, 2011
    Co-Authors: Xinmiao Zhang, Fang Cai
    Abstract:

    When the code is not long, non-binary low-density parity-check (NB-LDPC) codes can achieve better error-correcting performance than binary LDPC codes at the cost of higher decoding complexity. The recently developed iterative reliability-based majority-logic NB-LDPC decoding can achieve better performance-complexity tradeoffs than previous algorithms. Many existing NB-LDPC code construction schemes lead to quasi-cyclic or cyclic codes. In this paper, efficient low-complexity NB-LDPC decoder architectures are developed for these two types of codes based on the newly proposed iterative hard reliability-based majority-logic decoding (IHRB-MLGD). Particularly, novel schemes are designed to keep a small proportion of Messages in order to reduce the memory requirement without causing noticeable performance loss. Moreover, a shift-Message Structure is proposed by using memories concatenated with variable node units to enable efficient partial-parallel decoding for cyclic NB-LDPC codes. Compared to previous decoders based on the Min-max algorithm, the proposed IHRB-MLGD decoder architectures can achieve tens of times higher efficiency for codes with similar length and rate with moderate coding gain loss.

Xinmiao Zhang - One of the best experts on this subject based on the ideXlab platform.

  • low complexity reliability based Message passing decoder architectures for non binary ldpc codes
    IEEE Transactions on Very Large Scale Integration Systems, 2012
    Co-Authors: Xinmiao Zhang, Fang Cai, Shu Lin
    Abstract:

    Non-binary low-density parity-check (NB-LDPC) codes can achieve better error-correcting performance than their binary counterparts at the cost of higher decoding complexity when the codeword length is moderate. The recently developed iterative reliability-based majority-logic NB-LDPC decoding has better performance-complexity tradeoffs than previous algorithms. This paper first proposes enhancement schemes to the iterative hard reliability-based majority-logic decoding (IHRB-MLGD). Compared to the IHRB algorithm, our enhanced (E-)IHRB algorithm can achieve significant coding gain with small hardware overhead. Then low-complexity partial-parallel NB-LDPC decoder architectures are developed based on these two algorithms. Many existing NB-LDPC code construction methods lead to quasi-cyclic or cyclic codes. Both types of codes are considered in our design. Moreover, novel schemes are developed to keep a small proportion of Messages in order to reduce the memory requirement without causing noticeable performance loss. In addition, a shift-Message Structure is proposed by using memories concatenated with variable node units to enable efficient partial-parallel decoding for cyclic NB-LDPC codes. Compared to previous designs based on the Min-max decoding algorithm, our proposed decoders have at least tens of times lower complexity with moderate coding gain loss.

  • low complexity architectures for reliability based Message passing non binary ldpc decoding
    International Symposium on Circuits and Systems, 2011
    Co-Authors: Xinmiao Zhang, Fang Cai
    Abstract:

    When the code is not long, non-binary low-density parity-check (NB-LDPC) codes can achieve better error-correcting performance than binary LDPC codes at the cost of higher decoding complexity. The recently developed iterative reliability-based majority-logic NB-LDPC decoding can achieve better performance-complexity tradeoffs than previous algorithms. Many existing NB-LDPC code construction schemes lead to quasi-cyclic or cyclic codes. In this paper, efficient low-complexity NB-LDPC decoder architectures are developed for these two types of codes based on the newly proposed iterative hard reliability-based majority-logic decoding (IHRB-MLGD). Particularly, novel schemes are designed to keep a small proportion of Messages in order to reduce the memory requirement without causing noticeable performance loss. Moreover, a shift-Message Structure is proposed by using memories concatenated with variable node units to enable efficient partial-parallel decoding for cyclic NB-LDPC codes. Compared to previous decoders based on the Min-max algorithm, the proposed IHRB-MLGD decoder architectures can achieve tens of times higher efficiency for codes with similar length and rate with moderate coding gain loss.

Nayda Terkildsen - One of the best experts on this subject based on the ideXlab platform.

  • interest groups the media and policy debate formation an analysis of Message Structure rhetoric and source cues
    Political Communication, 1998
    Co-Authors: Nayda Terkildsen, Frauke Schnell, Cristina Ling
    Abstract:

    We propose an interactive model of public policy debate formation that highlights the dependent yet competitive relationship between the media and pressure groups in structuring policy Messages and issue rhetoric. To test our model we examine the evolution of the abortion debate in the print media using measures of Message format and related contextual cues to determine the effectiveness of the media versus interest group players in generating favorable issue Messages and controlling policy rhetoric. We find that the media both report issue news and advocate unique policy Messages, and that inter- and intrainterest group competition in structuring issue information is cyclical and often related more to journalistic norms than to actual pressure group strength.