[1] E. Arikan, “Channel polarization: A method for constructing capacity achieving codes for symmetric binaryinput memoryless channels,” IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051–3073, Jul. 2009.

[2] R. Mori and T. Tanaka, “Performance of polar codes with the construction using density evolution,” IEEE Commun. Lett., vol. 13, no. 7, pp. 519– 521, Jul. 2009.

[3] S. B. Korada, E. Sasoglu, and R. Urbanke, “Polar codes: Characterization of exponent, bounds, constructions,” IEEE Trans. Inf. Theory, vol. 56, no. 12, pp. 6253–6264, Dec. 2010.

[4] I. Tal and A. Vardy, “List decoding of polar codes,” in Proc. IEEE ISIT ,2011, pp. 1–5.

[5] K. Chen, K. Niu, and J. Lin, “Improved successive cancellation decoding of polar codes,” IEEE Trans. Commun., vol. 61, no. 8, pp. 3100–3107, Aug. 2013

[6] G. Sarkis and W. J. Gross, “Polar codes for data storage applications,” in Proc. ICNC, 2013, pp. 840–844.

[7] G. Sarkis, P. Giard, A. Vardy, C. Thibeault, and W. J. Gross, “Fast polar decoders: Algorithm and implementation,” IEEE J. Sel. Areas Commun., vol. 32, no. 5, pp. 946–957, May 2014.

[8] G. Berhault, C. Leroux, C. Jego, and D. Dallet, “Partial sums generation architecture for successive cancellation decoding of polar codes,” in Proc. IEEE Workshop SiPS, Oct. 2013, pp. 407–412.

[9] B. Yuan and K. K. Parhi, “Low-latency successivecancellation polar decoder architectures using 2-bit decoding,” IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 61, no. 4, pp. 1241–1254, Apr. 2014.

[10] C. Leroux, A. J. Raymond, G. Sarkis, and W. J. Gross, “A semi-parallel successive-cancellation decoder for polar codes,” IEEE Trans. Signal Process. vol. 61, no. 2, pp. 289– 299, Jan. 2013.

[11] A. J. Raymond and W. J. Gross, “Scalable successivecancellation hard- ware decoder for polar codes,” in Proc. IEEE GlobalSIP, Dec. 2013, pp. 1282–1285.

[12] U. U. Fayyaz and J. R. Barry, “Low-complexity softoutput decoding of polar codes,” IEEE J. Sel. Areas Commun., vol. 32, no. 5, pp. 958–966, May 2014.

[13] B. Yuan and K. K. Parhi, “Low-latency successivecancellation list decoders for polar codes with multibit decision,” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., DOI: 10.1109/TVLSI.2014.2359793, to b published.

[14] C. Zhang and K. K. Parhi, “Latency analysis and architecture design of simplified SC polar decoders,” IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 61, no. 2, pp. 115– 119, Feb. 2014.

[15] K. K. Parhi, VLSI Digital Signal Processing Systems: Design and Implementation. Hoboken, NJ, USA: Wiley, 1999. [16] K. K. Parhi, “Calculation of minimum number of registers in arbitrary life time chart,” IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process., vol. 41, no. 6, pp. 434–436, Jun. 1995.

[17] C. Wang and K. K. Parhi, “High-level DSP synthesis using concurrent transformations, scheduling, allocation,” IEEE Trans. Comput.Aided Design Integr. Circuits Syst., vol. 14, no. 3, pp. 274–295 Mar. 1995.

[18] M. Ayinala, M. J. Brown, and K. K. Parhi, “Pipelined parallel FFT architectures via folding transformation,” IEEE Trans. Very Large Scale Integr.(VLSI) Syst., vol. 20, no. 6, pp. 1068–1081, Jun. 2012.

[19] C. Y. Wang, “MARS: A high-level synthesis tool for digital signal processing architecture design,” M.S. thesis, Dept. Elect. Eng., University of Minnesota, Minneapolis, MN, USA, 1992.