Contract # NNX09AL75G
    NAICS Not Provided
    PSC U009 Education/training- General
    Set-Aside Not Reported
    Status Fully Executed
    POP 7/13/09 - 2/18/13 (3 years)
  • $79.9k Dollars Obligated
  • $79.9k Base & Exercised Options
  • $79.9k Base & All Options (Ceiling)
  • Not Reported Pricing Type
  • Fully Funded Funding Status
  • Not Competed Extent Competed

  • Description

    LOW-FLOOR LDPC CODES FOR RF AND OPTICAL COMMUNICATIONS PI ABSTRACT - RECENTLY, PSEUDOCODEWORDS OF TANNER GRAPHS OF LDPC HAVE BEEN USED TO EXPLAIN THE BEHAVIOR OF ITERATIVE DECODERS FOR THESE CODES. IN THIS PAPER, FINITE-LENGTH PSEUDOCODEWORD WEIGHT ENUMERATORS FOR PROTOGRAPH-BASED GENERALIZED-LDPC CODE ENSEMBLED ARE OBTAINED. THE ASYMPTOTIC RESULTS ARE DERIVED FROM THE FINITE-LENGTH RESULTS BY LETTING THE BLOCK LENGTH GO TO INFINITY. THE ASYMPTOTIC RESULTS ALLOW US TO DETERMINE WHETHER OR NOT THE TYPICAL MINIMUM PSUEDOCODEWORD WEIGHT GROWS LINEARLY WITH CODEWORD LENGTH. WE GIVE EXAMPLES WITH HAMMING COMPONENT CODES.

  • Agency

    National Aeronautics and Space Administration

  • Office

    Goddard Space Flight Center

  • Awarded Vendor

    University Of Arizona Tucson AZ

  • Contact(s)

    Not Provided

  • Project(s)

    Not Provided


Amount Date Reason For Modification
$-1.09 2/18/13 Funding Only Action

ABSTRACT - RECENTLY, PSEUDOCODEWORDS OF TANNER GRAPHS OF LDPC HAVE BEEN USED TO EXPLAIN THE BEHAVIOR OF ITERATIVE DECODERS FOR THESE CODES. IN THIS PAPER, FINITE-LENGTH PSEUDOCODEWORD WEIGHT ENUMERATORS FOR PHOTOGRAPH-BASED GENERALIZED-LDPC CODE ENSEMBLE ARE OBTAINED. THE ASYMPTOTIC RESULTS ARE DERIVED FROM THE FINITE-LENGTH RESULTS BY LETTING THE BLOCK LENGTH GO TO INFINITY. THE ASYMPTOTIC RESULTS ALLOW US TO DETERMINE WHETHER OR NOT THE TYPICAL MINIMUM PSUEDOCODEWORD WEIGHT GROWS LINEARLY WITH CODEWORD LENGTH. WE GIVE EXAMPLES WITH HAMMING COMPONENT CODES.

-- 2/27/11 Other Administrative Action

ABSTRACT - RECENTLY, PSEUDOCODEWORDS OF TANNER GRAPHS OF LDPC HAVE BEEN USED TO EXPLAIN THE BEHAVIOR OF ITERATIVE DECODERS FOR THESE CODES. IN THIS PAPER, FINITE-LENGTH PSEUDOCODEWORD WEIGHT ENUMERATORS FOR PHOTOGRAPH-BASED GENERALIZED-LDPC CODE ENSEMBLE ARE OBTAINED. THE ASYMPTOTIC RESULTS ARE DERIVED FROM THE FINITE-LENGTH RESULTS BY LETTING THE BLOCK LENGTH GO TO INFINITY. THE ASYMPTOTIC RESULTS ALLOW US TO DETERMINE WHETHER OR NOT THE TYPICAL MINIMUM PSUEDOCODEWORD WEIGHT GROWS LINEARLY WITH CODEWORD LENGTH. WE GIVE EXAMPLES WITH HAMMING COMPONENT CODES.

-- 5/27/10 Other Administrative Action

ABSTRACT - RECENTLY, PSEUDOCODEWORDS OF TANNER GRAPHS OF LDPC HAVE BEEN USED TO EXPLAIN THE BEHAVIOR OF ITERATIVE DECODERS FOR THESE CODES. IN THIS PAPER, FINITE-LENGTH PSEUDOCODEWORD WEIGHT ENUMERATORS FOR PHOTOGRAPH-BASED GENERALIZED-LDPC CODE ENSEMBLE ARE OBTAINED. THE ASYMPTOTIC RESULTS ARE DERIVED FROM THE FINITE-LENGTH RESULTS BY LETTING THE BLOCK LENGTH GO TO INFINITY. THE ASYMPTOTIC RESULTS ALLOW US TO DETERMINE WHETHER OR NOT THE TYPICAL MINIMUM PSUEDOCODEWORD WEIGHT GROWS LINEARLY WITH CODEWORD LENGTH. WE GIVE EXAMPLES WITH HAMMING COMPONENT CODES.

$61k 12/17/09 Funding Only Action

UNIVERSITY OF ARIZONA LOW-FLOOR LDPC CODES FOR RF AND OPTICAL COMMUNICATIONS PI ABSTRACT - RECENTLY, PSEUDOCODEWORDS OF TANNER GRAPHS OF LDPC HAVE BEEN USED TO EXPLAIN THE BEHAVIOR OF ITERATIVE DECODERS FOR THESE CODES. IN THIS PAPER, FINITE-LENGTH PSEUDOCODEWORD WEIGHT ENUMERATORS FOR PHOTOGRAPH-BASED GENERALIZED-LDPC CODE ENSEMBLE ARE OBTAINED. THE ASYMPTOTIC RESULTS ARE DERIVED FROM THE FINITE-LENGTH RESULTS BY LETTING THE BLOCK LENGTH GO TO INFINITY. THE ASYMPTOTIC RESULTS ALLOW US TO DETERMINE WHETHER OR NOT THE TYPICAL MINIMUM PSUEDOCODEWORD WEIGHT GROWS LINEARLY WITH CODEWORD LENGTH. WE GIVE EXAMPLES WITH HAMMING COMPONENT CODES.

$19k 8/6/09 Funding Only Action

UNIVERSITY OF ARIZONA LOW-FLOOR LDPC CODES FOR RF AND OPTICAL COMMUNICATIONS PI ABSTRACT - RECENTLY, PSEUDOCODEWORDS OF TANNER GRAPHS OF LDPC HAVE BEEN USED TO EXPLAIN THE BEHAVIOR OF ITERATIVE DECODERS FOR THESE CODES. IN THIS PAPER, FINITE-LENGTH PSEUDOCODEWORD WEIGHT ENUMERATORS FOR PHOTOGRAPH-BASED GENERALIZED-LDPC CODE ENSEMBLE ARE OBTAINED. THE ASYMPTOTIC RESULTS ARE DERIVED FROM THE FINITE-LENGTH RESULTS BY LETTING THE BLOCK LENGTH GO TO INFINITY. THE ASYMPTOTIC RESULTS ALLOW US TO DETERMINE WHETHER OR NOT THE TYPICAL MINIMUM PSUEDOCODEWORD WEIGHT GROWS LINEARLY WITH CODEWORD LENGTH. WE GIVE EXAMPLES WITH HAMMING COMPONENT CODES.

$-80k 8/3/09 Funding Only Action

UNIVERSITY OF ARIZONA LOW-FLOOR LDPC CODES FOR RF AND OPTICAL COMMUNICATIONS PI ABSTRACT - RECENTLY, PSEUDOCODEWORDS OF TANNER GRAPHS OF LDPC HAVE BEEN USED TO EXPLAIN THE BEHAVIOR OF ITERATIVE DECODERS FOR THESE CODES. IN THIS PAPER, FINITE-LENGTH PSEUDOCODEWORD WEIGHT ENUMERATORS FOR PHOTOGRAPH-BASED GENERALIZED-LDPC CODE ENSEMBLE ARE OBTAINED. THE ASYMPTOTIC RESULTS ARE DERIVED FROM THE FINITE-LENGTH RESULTS BY LETTING THE BLOCK LENGTH GO TO INFINITY. THE ASYMPTOTIC RESULTS ALLOW US TO DETERMINE WHETHER OR NOT THE TYPICAL MINIMUM PSUEDOCODEWORD WEIGHT GROWS LINEARLY WITH CODEWORD LENGTH. WE GIVE EXAMPLES WITH HAMMING COMPONENT CODES.

$80k 7/13/09 Not Listed

LOW-FLOOR LDPC CODES FOR RF AND OPTICAL COMMUNICATIONS PI ABSTRACT - RECENTLY, PSEUDOCODEWORDS OF TANNER GRAPHS OF LDPC HAVE BEEN USED TO EXPLAIN THE BEHAVIOR OF ITERATIVE DECODERS FOR THESE CODES. IN THIS PAPER, FINITE-LENGTH PSEUDOCODEWORD WEIGHT ENUMERATORS FOR PROTOGRAPH-BASED GENERALIZED-LDPC CODE ENSEMBLED ARE OBTAINED. THE ASYMPTOTIC RESULTS ARE DERIVED FROM THE FINITE-LENGTH RESULTS BY LETTING THE BLOCK LENGTH GO TO INFINITY. THE ASYMPTOTIC RESULTS ALLOW US TO DETERMINE WHETHER OR NOT THE TYPICAL MINIMUM PSUEDOCODEWORD WEIGHT GROWS LINEARLY WITH CODEWORD LENGTH. WE GIVE EXAMPLES WITH HAMMING COMPONENT CODES.